HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Real-Time Problem-Solving with Contract Algorithms

Shlomo Zilberstein 1 François Charpillet 2 Philippe Chassaing
2 MAIA - Autonomous intelligent machine
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This paper addresses the problem of building an interruptible real-time system using contract algorithms. Contract algorithms offer a tradeoff 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:39:26 AM
Last modification on : Friday, February 26, 2021 - 3:28:05 PM


  • HAL Id : inria-00098864, version 1



Shlomo Zilberstein, François Charpillet, Philippe Chassaing. Real-Time Problem-Solving with Contract Algorithms. 16th International Joint Conference on Artificial Intelligence, 1999, Stockholm, Sweden, pp.1008-1013. ⟨inria-00098864⟩



Record views