Jump to content

Anytime algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jaibe (talk | contribs) at 23:09, 20 January 2007 (got slightly more time). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.