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.
Type de document :
Communication dans un congrès
16th International Joint Conference on Artificial Intelligence, 1999, Stockholm, Sweden, 2, pp.1008-1013, 1999
Liste complète des métadonnées

https://hal.inria.fr/inria-00098864
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:39:26
Dernière modification le : jeudi 11 janvier 2018 - 06:19:51

Identifiants

  • HAL Id : inria-00098864, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

295