Real-Time Problem-Solving with Contract Algorithms

This paper addresses the problem of building an interruptible real-time system using contract algorithms. Contract algorithms offer a trade-off between computation time and quality of results, but their run-time must be determined when they are activated. Many AI techniques provide useful contract algorithms that are not interruptible. We show how to optimally sequence contract algorithms to create the best interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problem-solving and provide useful guidance for embedding contract algorithms in applications.

[1]  Eric Horvitz,et al.  Models of Continual Computation , 1997, AAAI/IAAI.

[2]  Devika Subramanian,et al.  Provably Bounded Optimal Agents , 1993, IJCAI.

[3]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[4]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[5]  Eric Horvitz,et al.  Reasoning under Varying and Uncertain Resource Constraints , 1988, AAAI.

[6]  Stuart J. Russell,et al.  Principles of Metareasoning , 1989, Artif. Intell..

[7]  Shlomo Zilberstein,et al.  Optimal Composition of Real-Time Systems , 1996, Artif. Intell..

[8]  François Charpillet,et al.  Real time scheduling with Neurosched , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[9]  Victor R. Lesser,et al.  Design-to-time real-time scheduling , 1993, IEEE Trans. Syst. Man Cybern..

[10]  Shlomo Zilberstein.  Optimizing Decision Quality with Contract Algorithms , 1995, IJCAI.

[11]  Shlomo Zilberstein,et al.  Monitoring the Progress of Anytime Problem-Solving , 1996, AAAI/IAAI, Vol. 2.

[12]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..