AAAI Publications, Twenty-Sixth AAAI Conference on Artificial Intelligence

Font Size: 
A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices
Pedro Henrique Rodrigues Quemel e Assis Santana, Brian Charles Williams

Last modified: 2012-07-14


This work presents a new algorithm based on the Bucket Elimination framework that efficiently determines strong controllability of temporal plans formulated as Labeled Simple Temporal Networks with Uncertainty (LSTNU) with controllable and uncontrollable plan branches (choices).


Constraint satisfaction; uncontrollable choices; conditional plans; bucket elimination

Full Text: PDF