What is an anytime algorithm?
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.
Please log in or register to report this question.