Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is an anytime algorithm?

  • A.One whose running time cannot be predicted in advance
  • B.One that can be interrupted and still return a usable answer
  • C.One that runs in constant time regardless of input size
  • D.One that may be started at any point in the agent's operation

Answer: B

An anytime algorithm produces an approximate answer quickly and refines it, so an agent under time pressure can take whatever quality is available when the deadline arrives. Iterative deepening search and iterative refinement planners are examples. Constant running time, arbitrary start points and unpredictability are different properties. Making the quality of an answer a function of the time spent, rather than requiring completion, is exactly what a real time agent needs.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.