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

Authors

  • Pedro Rodrigues Quemel e Assis Santana Massachusetts Institute of Technology
  • Brian Williams Massachusetts Institute of Technology

DOI:

https://doi.org/10.1609/aaai.v26i1.8422

Keywords:

Constraint satisfaction, uncontrollable choices, conditional plans, bucket elimination

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

Downloads

Published

2021-09-20

How to Cite

Rodrigues Quemel e Assis Santana, P., & Williams, B. (2021). A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices. Proceedings of the AAAI Conference on Artificial Intelligence, 26(1), 2453-2454. https://doi.org/10.1609/aaai.v26i1.8422

Issue

Vol. 26 No. 1 (2012): Twenty-Sixth AAAI Conference on Artificial Intelligence

Section

Student Abstract Track