Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TIME.2021.13
URN: urn:nbn:de:0030-drops-147895
URL: https://drops.dagstuhl.de/opus/volltexte/2021/14789/
Cashmore, Michael ; Cimatti, Alessandro ; Magazzeni, Daniele ; Micheli, Andrea ; Zehtabi, Parisa
Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans
| pdf-format: |
|
Abstract
One of the major limitations for the employment of model-based planning and scheduling in practical applications is the need of costly re-planning when an incongruence between the observed reality and the formal model is encountered during execution. Robustness Envelopes characterize the set of possible contingencies that a plan is able to address without re-planning, but their exact computation is expensive; furthermore, general robustness envelopes are not amenable for efficient execution.In this paper, we present a novel, anytime algorithm to approximate Robustness Envelopes, making them scalable and executable. This is proven by an experimental analysis showing the efficiency of the algorithm, and by a concrete case study where the execution of robustness envelopes significantly reduces the number of re-plannings.
BibTeX - Entry
@InProceedings{cashmore_et_al:LIPIcs.TIME.2021.13,
author = {Cashmore, Michael and Cimatti, Alessandro and Magazzeni, Daniele and Micheli, Andrea and Zehtabi, Parisa},
title = {{Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans}},
booktitle = {28th International Symposium on Temporal Representation and Reasoning (TIME 2021)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-206-8},
ISSN = {1868-8969},
year = {2021},
volume = {206},
editor = {Combi, Carlo and Eder, Johann and Reynolds, Mark},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/14789},
URN = {urn:nbn:de:0030-drops-147895},
doi = {10.4230/LIPIcs.TIME.2021.13},
annote = {Keywords: Temporal Planning, Robustness Envelopes}
}
| Keywords: | Temporal Planning, Robustness Envelopes | |
| Seminar: | 28th International Symposium on Temporal Representation and Reasoning (TIME 2021) | |
| Issue date: | 2021 | |
| Date of publication: | 16.09.2021 |
