Real-time problem-solving with contract algorithms

Authors:
Shlomo Zilberstein;Francois Charpillet;Philippe Chassaing
Affiliations:
Computer Science Department, University of Massachusetts, Amherst, MA;INRIA, LORIA, Vandoeuvre-les-Nancy;Institut Elie Cartan, INRIA, Vandoeuvre-les-Nancy
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Year:
1999

Citing 7
Cited 0

Principles of metareasoning

Artificial Intelligence - Special issue on knowledge representation
Searching in the plane

Information and Computation
Optimal composition of real-time systems

Artificial Intelligence
Real Time Scheduling with Neurosched

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence
Optimizing decision quality with contract algorithms

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Monitoring the progress of anytime problem-solving

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Models of continual computation

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.