Anytime algorithm
From Wikipedia, the free encyclopedia
An anytime algorithm is a class of real-time algorithm. Members of this class will always return an answer on demand, however the longer they have to compute, the better (e.g. more precise) an answer they will return. They are used in robotics and other planning application areas.
Tom Dean Stuart Russell
