Using Anytime Algorithms in Intelligent Systems

Shlomo Zilberstein. Using Anytime Algorithms in Intelligent Systems. AI Magazine, 17(3):73-83, 1996.

Abstract

Anytime algorithms give intelligent systems the capability to trade off deliberation time for quality of results. This capability is essential for successful operation in domains such as signal interpretation, real-time diagnosis and repair, and mobile robot control. What characterizes these domains is that it is not feasible (computationally) or desirable (economically) to compute the optimal answer. This paper surveys the main control problems that arise when a system is composed of several anytime algorithms. These problems relate to optimal management of uncertainty and precision. After a brief introduction to anytime computation, the paper outlines a wide range of existing solutions to the meta-level control problem and describes current work that is aimed at increasing the applicability of anytime computation.

Bibtex entry:

@article{Zaimag96,
  author	= {Shlomo Zilberstein},
  title		= {Using Anytime Algorithms in Intelligent Systems},
  journal	= {AI Magazine},
  volume	= {17},
  number	= {3},
  year		= {1996},
  pages		= {73-83},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/Zaimag96.html}
}

shlomo@cs.umass.edu