Temporal Planning with Mutual Exclusion Reasoning
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Challenge Papers. Pages 326-336.
Abstract
Many planning domains require a richer notion of time in which actions can overlap and have different durations. The key to fast performance in classical planners (e.g., Graphplan, IPP, and Black box) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents TGP, a new algorithm for temporal planning. TGP operates by incrementally expanding a compact planning graph representation that handles actions of differing duration . The key to TGP performance is tight mutual exclusion reasoning which is based on an expressive language for bounding mutexes and includes mutexes between actions and propositions. Our experiments demonstrate that mutual exclusion reasoning remains valuable in a rich temporal setting.
@inproceedings{ijcai1999p48,
title = {Temporal Planning with Mutual Exclusion Reasoning},
author = {Smith, David E. and Weld, Daniel S.},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {326--336},
year = {1999},
note = {Challenge Papers},
url = {https://ijcai.org/proceedings/1999/48},
}
TY - CPAPER TI - Temporal Planning with Mutual Exclusion Reasoning AU - Smith, David E. AU - Weld, Daniel S. T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 326 EP - 336 UR - https://ijcai.org/proceedings/1999/48 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
