Managing Temporal Uncertainty Through Waypoint Controllability
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Temporal Reasoning. Pages 1253-1257.
Abstract
Simple Temporal Networks have proved useful in applications that involve metric time. However, many applications involve events whose timing is not controlled by the execution agent. A number of properties relating to overall controllability in such cases have been introduced in [Vidal and Ghallab , 1996] and [Vidal and Fargier, 1997], including Weak and Strong Controllability. We derive some new results concerning these properti es. In particular, we prove the negation of Weak Controllability is NP-hard, confirming a conjecture in [Vidal and Fargier, 1997]. We also introduce a more general controllability property of which Weak and Strong Controllability are special cases. A propagation algorithm is provided for determining whether the property holds, and we identify tractable cases where the algorithm runs in polynomial time.
@inproceedings{ijcai1999p178,
title = {Managing Temporal Uncertainty Through Waypoint Controllability},
author = {Morris, Paul H. and Muscettola, Nicola},
booktitle = {Proceedings of the Sixteenth International Joint Conference on
Artificial Intelligence, {IJCAI-99}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Thomas Dean},
pages = {1253--1257},
year = {1999},
note = {Temporal Reasoning},
url = {https://ijcai.org/proceedings/1999/178},
}
TY - CPAPER TI - Managing Temporal Uncertainty Through Waypoint Controllability AU - Morris, Paul H. AU - Muscettola, Nicola T2 - Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI-99 PB - International Joint Conferences on Artificial Intelligence PY - 1999 SP - 1253 EP - 1257 UR - https://ijcai.org/proceedings/1999/178 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
