Dynamic Control Of Plans With Temporal Uncertainty

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.

• Type: Conference
• Year: 2001
• Where: IJCAI
• Authors: Paul H. Morris, Nicola Muscettola, Thierry Vidal
• Keywords: Dynamic Controllability, IJCAI 2001, IJCAI 2007, Quantitative Time Constraints, Simple Temporal Problem