Dynamic Control Of Plans With Temporal Uncertainty
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 494-501.
Abstract
Certain planning systems that deal with quantitative time constraints have used an underlying Simple Temporal Problem solver to ensure temporal consistency of plans. However, many applications involve processes of uncertain duration whose timing cannot be controlled by the execution agent. These cases require more complex notions of temporal feasibility. In previous work, various “controllability” properties such as Weak, Strong, and Dynamic Controllability have been defined. The most interesting and useful Controllability property, the Dynamic one, has ironically proved to be the most difficult to analyze. In this paper, we resolve the complexity issue for Dynamic Controllability. Unexpectedly, the problem turns out to be tractable. We also show how to efficiently execute networks whose status has been verified.
@inproceedings{ijcai2001p69,
title = {Dynamic Control Of Plans With Temporal Uncertainty},
author = {Morris, Paul H. and Muscettola, Nicola and Vidal, Thierry},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {494--501},
year = {2001},
url = {https://ijcai.org/proceedings/2001/69},
}
TY - CPAPER TI - Dynamic Control Of Plans With Temporal Uncertainty AU - Morris, Paul H. AU - Muscettola, Nicola AU - Vidal, Thierry T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 494 EP - 501 UR - https://ijcai.org/proceedings/2001/69 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: