Real-Time Problem-Solving with Contract Algorithms
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 se-quence 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 embed-ding contract algorithms in applications. 1
Cite
Text
Zilberstein et al. "Real-Time Problem-Solving with Contract Algorithms." International Joint Conference on Artificial Intelligence, 1999.Markdown
[Zilberstein et al. "Real-Time Problem-Solving with Contract Algorithms." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/zilberstein1999ijcai-real/)BibTeX
@inproceedings{zilberstein1999ijcai-real,
title = {{Real-Time Problem-Solving with Contract Algorithms}},
author = {Zilberstein, Shlomo and Charpillet, François and Chassaing, Philippe},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1999},
pages = {1008-1015},
url = {https://mlanthology.org/ijcai/1999/zilberstein1999ijcai-real/}
}