TY - CHAP
T1 - Efficient anytime computation and execution of decoupled robustness envelopes for temporal plans
AU - Cashmore, Michael
AU - Cimatti, Alessandro
AU - Magazzeni, Daniele
AU - Micheli, Andrea
AU - Zehtabi, Parisa
N1 - Funding Information:
Acknowledgements The open access publication of this article was supported by the Alpen-Adria-Universität Klagenfurt, Austria.
Publisher Copyright:
© Michael Cashmore, Alessandro Cimatti, Daniele Magazzeni, Andrea Micheli, and Parisa Zehtabi; licensed under Creative Commons License CC-BY 4.0 28th International Symposium on Temporal Representation and Reasoning (TIME 2021).
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2021/9/1
Y1 - 2021/9/1
N2 - 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.
AB - 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.
KW - Robustness envelopes
KW - Temporal planning
UR - http://www.scopus.com/inward/record.url?scp=85115314975&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.TIME.2021.13
DO - 10.4230/LIPIcs.TIME.2021.13
M3 - Conference paper
AN - SCOPUS:85115314975
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 28th International Symposium on Temporal Representation and Reasoning, TIME 2021
A2 - Combi, Carlo
A2 - Eder, Johann
A2 - Reynolds, Mark
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 28th International Symposium on Temporal Representation and Reasoning, TIME 2021
Y2 - 27 September 2021 through 29 September 2021
ER -