Dynamic Controllability Made Simple

Simple Temporal Networks with Uncertainty (STNUs) are a well-studied model for representing temporal constraints, where some intervals (contingent links) have an unknown but bounded duration, discovered only during execution. An STNU is dynamically controllable (DC) if there exists a strategy to execute its time-points satisfying all the constraints, regardless of the actual duration of contingent links revealed during execution. In this work we present a new system of constraint propagation rules for STNUs, which is sound-and-complete for DC checking. Our system comprises just three rules which, differently from the ones proposed in all previous works, only generate unconditioned constraints. In particular, after applying our sound rules, the network remains an STNU in all respects. Moreover, our completeness proof is short and non-algorithmic, based on the explicit construction of a valid execution strategy. This is a substantial simplification of the theory which underlies all the polynomial-time algorithms for DC-checking. Our analysis also shows: (1) the existence of late execution strategies for STNUs, (2) the equivalence of several variants of the notion of DC, (3) the existence of a fast algorithm for realtime execution of STNUs, which runs in O(KN) total time in a network with K ≥ 1 contingent links and N ≥ K time points, considerably improving the previous O(N3)-time bound. 1998 ACM Subject Classification I.2.4 Knowledge Representation Formalisms and Methods, I.2.8 Problem Solving, Control Methods, and Search

[1]  Patrick Doherty,et al.  Incremental Dynamic Controllability Revisited , 2013, ICAPS.

[2]  Francesca Rossi,et al.  Temporal Constraint Reasoning With Preferences , 2001, IJCAI.

[3]  Brian Charles Williams,et al.  Drake: An Efficient Executive for Temporal Plans with Choice , 2011, J. Artif. Intell. Res..

[4]  Patrick Doherty,et al.  Incremental Dynamic Controllability in Cubic Worst-Case Time , 2014, 2014 21st International Symposium on Temporal Representation and Reasoning.

[5]  Robert T. Effinger,et al.  Dynamic Controllability of Temporally-flexible Reactive Programs , 2009, ICAPS.

[6]  Paul Morris,et al.  A Structural Characterization of Temporal Dynamic Controllability , 2006, CP.

[7]  Nicola Muscettola,et al.  Dynamic Control Of Plans With Temporal Uncertainty , 2001, IJCAI.

[8]  Luke Hunsberger,et al.  An Algorithm for Checking the Dynamic Controllability of a Conditional Simple Temporal Network with Uncertainty , 2013, ICAART.

[9]  Paul Morris,et al.  Dynamic Controllability and Dispatchability Relationships , 2014, CPAIOR.

[10]  Patrick Doherty,et al.  EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm , 2014, ICAPS.

[11]  Neil Yorke-Smith,et al.  Uncertainty in Soft Temporal Constraint Problems:A General Framework and Controllability Algorithms forThe Fuzzy Case , 2006, J. Artif. Intell. Res..

[12]  Paul Robertson,et al.  A Fast Incremental Algorithm for Maintaining Dispatchability of Partially Controllable Plans , 2007, ICAPS.

[13]  Luke Hunsberger,et al.  Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies , 2009, 2009 16th International Symposium on Temporal Representation and Reasoning.

[14]  Luke Hunsberger Efficient execution of dynamically controllable simple temporal networks with uncertainty , 2015, Acta Informatica.