Real-Time Problem-Solving with Contract Algorithms
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Planning and Scheduling. Pages 1008-1014.
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 co ntract algorithms to create the best interruptible system with or without stochastic information about the deadline. These results extend the foundation of real-time problemsolving and provide useful guidance for embedding contract algorithms in applications.
@inproceedings{ijcai1999p144,
title = {Real-Time Problem-Solving with Contract Algorithms},
author = {Zilberstein, Shlomo and Charpillet, François and Chassaing, Philippe},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1008--1014},
year = {1999},
note = {Planning and Scheduling},
url = {https://ijcai.org/proceedings/1999/144},
}
TY - CPAPER TI - Real-Time Problem-Solving with Contract Algorithms AU - Zilberstein, Shlomo AU - Charpillet, François AU - Chassaing, Philippe T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1008 EP - 1014 UR - https://ijcai.org/proceedings/1999/144 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
