ML Anthology

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

Pedro Henrique de Rodrigues Quemel e Assis Santana, Brian Charles Williams
AAAI 2012 pp. 2453-2454
doi:10.1609/AAAI.V26I1.8422 /aaai/2012/derodriguesquemeleassissantana2012aaai-bucket/

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

PDF AAAI Semantic Scholar

Cite

Text

de Rodrigues Quemel e Assis Santana and Williams. "A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8422

Markdown

[de Rodrigues Quemel e Assis Santana and Williams. "A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/derodriguesquemeleassissantana2012aaai-bucket/) doi:10.1609/AAAI.V26I1.8422

BibTeX

@inproceedings{derodriguesquemeleassissantana2012aaai-bucket,
  title     = {{A Bucket Elimination Approach for Determining Strong Controllability of Temporal Plans with Uncontrollable Choices}},
  author    = {de Rodrigues Quemel e Assis Santana, Pedro Henrique and Williams, Brian Charles},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2012},
  pages     = {2453-2454},
  doi       = {10.1609/AAAI.V26I1.8422},
  url       = {https://mlanthology.org/aaai/2012/derodriguesquemeleassissantana2012aaai-bucket/}
}