Publication Details

Strong Controllability of Disjunctive Temporal Problems with Uncertainty

by Peintner, B. and Venable, K. B. and Yorke-Smith, N.

in Proceedings of the Thirteenth International Conference on Principles and Practices of Constraint Programming (CP'07) pp. 856-863,

Abstract

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.

Electronic Copies

Adobe PDF

BibTeX

EndNote

Associated Projects

Cognitive Assistant that Learns and Organizes As part of DARPA’s Personalized Assistant that Learns (PAL) program, SRI and team members are working on developing a next-generation "Cognitive Agent that Learns and Organizes" (CALO).

AIC Personnel

	Name	Title	E-mail
	Peintner, Bart	Sr. Computer Scientist
	Yorke-Smith, Neil	Computer Scientist