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).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have