Quantifying Degrees of Controllability in Temporal Networks with Uncertainty

Controllability for Simple Temporal Networks with Uncertainty (STNUs) has thus far been limited to three levels: strong, dynamic, and weak. Because of this, there is currently no systematic way for an agent to assess just how far from being controllable an uncontrollable STNU is. We use a new geometric interpretation of STNUs to introduce the degrees of strong and dynamic controllability – continuous metrics that measure how far a network is from being controllable. We utilize these metrics to approximate the probabilities that an STNU can be dispatched successfully offline and online respectively. We introduce new methods for predicting the degrees of strong and dynamic controllability for uncontrollable networks. In addition, we show empirically that both metrics are good predictors of the actual dispatch success rate.

[1]  Cheng Fang,et al.  Resolving Uncontrollable Conditional Temporal Problems Using Continuous Relaxations , 2014, ICAPS.

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

[3]  James C. Boerkoel,et al.  Robustness in Probabilistic Temporal Planning , 2015, AAAI.

[4]  Cees Witteveen,et al.  Flexibility and decoupling in Simple Temporal Networks , 2014, Artif. Intell..

[5]  James C. Boerkoel,et al.  Robust Execution of Probabilistic Temporal Plans , 2017, AAAI.

[6]  Marco Roveri,et al.  An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty , 2015, Artif. Intell..

[7]  Cheng Fang,et al.  Resolving Over-Constrained Probabilistic Temporal Problems through Chance Constraint Relaxation , 2015, AAAI.

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

[9]  T. Motzkin,et al.  Maxima for Graphs and a New Proof of a Theorem of Turán , 1965, Canadian Journal of Mathematics.

[10]  Brian C. Williams,et al.  Faster Conflict Generation for Dynamic Controllability , 2017, IJCAI.

[11]  James C. Boerkoel,et al.  New Perspectives on Flexibility in Simple Temporal Planning , 2018, ICAPS.

[12]  Cheng Fang,et al.  Optimising Bounds in Simple Temporal Networks with Uncertainty under Dynamic Controllability Constraints , 2015, ICAPS.

[13]  Cheng Fang,et al.  PARIS: A Polynomial-Time, Risk-Sensitive Scheduling Algorithm for Probabilistic Simple Temporal Networks with Uncertainty , 2016, ICAPS.

[14]  Patrick Doherty,et al.  Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm , 2014, ICAART.

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

[16]  N. Yorke-Smith,et al.  Simple Temporal Problems with Preferences and Uncertainty , 2003 .

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

[18]  Nikolaos V. Sahinidis,et al.  A polyhedral branch-and-cut approach to global optimization , 2005, Math. Program..

[19]  Kristen Brent Venable.  alpha-Dynamic Controllability of Simple Temporal Problems with Preferences and Uncertainty , 2003, CP.

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

[21]  Ioannis Tsamardinos,et al.  A Probabilistic Approach to Robust Execution of Temporal Plans with Uncertainty , 2002, SETN.

[22]  Elizabeth D. Dolan,et al.  NEOS Server 4.0 Administrative Guide , 2001, ArXiv.

[23]  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.