AAAI

Association for the Advancement of Artificial Intelligence

Home / Proceedings / Proceedings of the AAAI Conference on Artificial Intelligence, 26 / No. 1: Twenty-Sixth AAAI Conference on Artificial Intelligence

A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices

Download PDF

Abstract:

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).

Authors

Pedro Rodrigues Quemel e Assis Santana

Massachusetts Institute of Technology


Brian Williams

Massachusetts Institute of Technology


DOI:

10.1609/aaai.v26i1.8422