Monitoring and Control of Anytime Algorithms: A Dynamic Programming Approach

Eric A. Hansen and Shlomo Zilberstein. Monitoring and Control of Anytime Algorithms: A Dynamic Programming Approach. Artificial Intelligence, 126(1-2):139-157, 2001.

Abstract

Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in solving time-critical problems such as planning and scheduling, belief network evaluation, and information gathering. To exploit this tradeoff, a system must be able to decide when to stop deliberation and act on the currently available solution. This paper analyzes the characteristics of existing techniques for meta-level control of anytime algorithms and develops a new framework for monitoring and control. The new framework handles effectively the uncertainty associated with the algorithm's performance profile, the uncertainty associated with the domain of operation, and the cost of monitoring progress. The result is an efficient non-myopic solution to the meta-level control problem for anytime algorithms.

Bibtex entry:

@article{HZaij01a,
  author	= {Eric A. Hansen and Shlomo Zilberstein},
  title		= {Monitoring and Control of Anytime Algorithms: A Dynamic Programming Approach},
  journal	= {Artificial Intelligence},
  volume	= {126},
  number	= {1-2},
  year		= {2001},
  pages		= {139-157},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/HZaij01a.html}
}

shlomo@cs.umass.edu