{"type":"ScholarlyArticle","title":"Managing Temporal Uncertainty Through Waypoint Controllability","authors":[{"name":"Paul H. Morris","slug":"paul-h-morris","given":"Paul H.","family":"Morris","affiliation":""},{"name":"Nicola Muscettola","slug":"nicola-muscettola","given":"Nicola","family":"Muscettola","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1999/178","pdf":"https://ijcai.org/proceedings/1999/0178.pdf","markdown":"https://ijcai.org/proceedings/1999/178.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/178","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Temporal Reasoning","track":"Temporal Reasoning","number":178,"pages":{"first":1253,"last":1257},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}