ML Anthology

Managing Temporal Uncertainty Through Waypoint Controllability

Paul H. Morris, Nicola Muscettola
IJCAI 1999 pp. 1253-1258
/ijcai/1999/morris1999ijcai-managing/

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 properties. 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. 1

PDF Semantic Scholar

Cite

Text

Morris and Muscettola. "Managing Temporal Uncertainty Through Waypoint Controllability." International Joint Conference on Artificial Intelligence, 1999.

Markdown

[Morris and Muscettola. "Managing Temporal Uncertainty Through Waypoint Controllability." International Joint Conference on Artificial Intelligence, 1999.](https://mlanthology.org/ijcai/1999/morris1999ijcai-managing/)

BibTeX

@inproceedings{morris1999ijcai-managing,
  title     = {{Managing Temporal Uncertainty Through Waypoint Controllability}},
  author    = {Morris, Paul H. and Muscettola, Nicola},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1999},
  pages     = {1253-1258},
  url       = {https://mlanthology.org/ijcai/1999/morris1999ijcai-managing/}
}