Using Anytime Algorithms in Intelligent Systems

  • Zilberstein S
  • 106

    Readers

    Mendeley users who have this article in their library.
  • 333

    Citations

    Citations of this article.

Abstract

Anytime algorithms give intelligent systems the capability to trade 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 article 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, I outline a wide range of existing solutions to the metalevel control problem and describe current work that is aimed at increasing the applicability of anytime computation.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Shlomo Zilberstein

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free