Real-Time Problem-Solving with Contract Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Real-Time Problem-Solving with Contract Algorithms

Philippe Chassaing


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.


Other [cs.OH]
No file

Dates and versions

inria-00098864 , version 1 (26-09-2006)


  • 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⟩
124 View
0 Download


Gmail Facebook Twitter LinkedIn More