Monitoring Anytime Algorithms

Eric A. Hansen and Shlomo Zilberstein. Monitoring Anytime Algorithms. In M. Pittarelli (Ed.), SIGART Bulletin Special Issue on Anytime Algorithms and Deliberation Scheduling, 7(2):28-33, 1996.

Abstract

Anytime algorithms offer a tradeoff between solution quality and computation time that has proved useful in applying artificial intelligence techniques to time-critical problems. To exploit this tradeoff, a system must be able to determine the best time to stop deliberation and act on the currently available solution. If there is uncertainty about how much solution quality will improve with computation time, or about how the problem state may change after the start of the algorithm, monitoring the algorithm's progress and/or the problem state can make possible a better stopping decision and so improve the utility of the system. This paper analyzes the issues involved in run-time monitoring of anytime algorithms. It reviews previous work and casts the problem in a new framework from which some improved monitoring strategies emerge.

Bibtex entry:

@article{HZsigart96,
  author	= {Eric A. Hansen and Shlomo Zilberstein},
  title		= {Monitoring Anytime Algorithms},
  journal	= {SIGART Bulletin Special Issue on Anytime Algorithms and 
		   Deliberation Scheduling},
  volume	= {7},
  number	= {2},
  year		= {1996},
  pages		= {28-33},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/HZsigart96.html}
}

shlomo@cs.umass.edu