A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices
Pedro Rodrigues Quemel e Assis Santana, Brian Williams · Proceedings of the AAAI Conference on Artificial Intelligence · 2021
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).