Strong Controllability of Disjunctive Temporal Problems with Uncertainty

The Disjunctive Temporal Problem with Uncertainty (DTPU) is an extension of the Disjunctive Temporal Problem (DTP) that accounts for events not under the control of the executing agent. We investigate the semantics of DTPU constraints, refining the existing notion that they are simply disjunctions of STPU constraints. We then develop the first sound and complete algorithm to determine whether Strong Controllability holds for a DTPU. We analyze the complexity of our algorithm with respect to the number of constraints in different classes, showing that, for several common subclasses of DTPUs, determining Strong Controllability has the same complexity as solving DTPs.

• Type: Conference
• Year: 2007
• Where: CP
• Authors: Bart Peintner, Kristen Brent Venable, Neil Yorke-Smith
• Keywords: CP 2007, Disjunctive Temporal Problem, DTPU Constraints, Programming Languages, Strong Controllability