Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty

In temporal planning, many different temporal network formalisms are used to model real world situations. Each of these formalisms has different features which affect how easy it is to determine whether the underlying network of temporal constraints is consistent. While many of the simpler models have been well-studied from a computational complexity perspective, the algorithms developed for advanced models which combine features have very loose complexity bounds. In this paper, we provide tight completeness bounds for strong, weak, and dynamic controllability checking of temporal networks that have conditions, disjunctions, and temporal uncertainty. Our work exposes some of the subtle differences between these different structures and, remarkably, establishes a guarantee that all of these problems are computable in PSPACE.

[1]  Manolis Koubarakis,et al.  Backtracking algorithms for disjunctions of temporal constraints , 1998, Artif. Intell..

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

[3]  Luca Viganò,et al.  Conditional simple temporal networks with uncertainty and decisions , 2019, Theor. Comput. Sci..

[4]  Thierry Vidal,et al.  CTP: A New Constraint-Based Formalism for Conditional, Temporal Planning , 2003, Constraints.

[5]  Nicola Muscettola,et al.  Managing Temporal Uncertainty Through Waypoint Controllability , 1999, IJCAI.

[6]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[7]  K. Subramani,et al.  On a decision procedure for quantified linear programs , 2007, Annals of Mathematics and Artificial Intelligence.

[8]  Mark Abramson,et al.  Executing Reactive, Model-based Programs through Graph-based Temporal Planning , 2001, IJCAI.

[9]  Luke Hunsberger,et al.  Incorporating Decision Nodes into Conditional Simple Temporal Networks , 2017, TIME.

[10]  Neil Yorke-Smith,et al.  Disjunctive Temporal Planning with Uncertainty , 2005, IJCAI.

[11]  Marco Roveri,et al.  Dynamic Controllability of Disjunctive Temporal Networks: Validation and Synthesis of Executable Strategies , 2016, AAAI.

[12]  N. Yorke-Smith,et al.  Weak and Dynamic Controllability of Temporal Problems with Disjunctions and Uncertainty , 2010 .

[13]  Erez Karpas,et al.  Robust Execution of Plans for Human-Robot Teams , 2015, ICAPS.

[14]  Romeo Rizzi,et al.  Dynamic Controllability of Conditional Simple Temporal Networks Is PSPACE-complete , 2016, 2016 23rd International Symposium on Temporal Representation and Reasoning (TIME).

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

[16]  Thierry Vidal,et al.  Handling contingency in temporal constraint networks: from consistency to controllabilities , 1999, J. Exp. Theor. Artif. Intell..

[17]  Cheng Fang,et al.  Chance-Constrained Probabilistic Simple Temporal Problems , 2014, AAAI.

[18]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[19]  Peng Yu,et al.  Continuously Relaxing Over-Constrained Conditional Temporal Problems through Generalized Conflict Learning and Resolution , 2013, IJCAI.

[20]  Marco Roveri,et al.  Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation , 2014, 2014 21st International Symposium on Temporal Representation and Reasoning.

[21]  K. Subramani,et al.  On quantified linear implications , 2014, Annals of Mathematics and Artificial Intelligence.

[22]  Léon Planken,et al.  Temporal Reasoning Problems and Algorithms for Solving Them: literature survey , 2008 .

[23]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[24]  Luke Hunsberger,et al.  The Dynamic Controllability of Conditional STNs with Uncertainty , 2012, ArXiv.

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

[26]  Neil Yorke-Smith,et al.  Strong Controllability of Disjunctive Temporal Problems with Uncertainty , 2007, CP.

[27]  Nicola Muscettola,et al.  Temporal Dynamic Controllability Revisited , 2005, AAAI.