2026-07-23T20:06:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:14789 2024-03-06T10:54:39Z ddc:004 open_access

Efficient Anytime Computation and Execution of Decoupled Robustness Envelopes for Temporal Plans Cashmore, Michael Cimatti, Alessandro Magazzeni, Daniele Micheli, Andrea Zehtabi, Parisa Temporal Planning Robustness Envelopes 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Michael Cashmore and Alessandro Cimatti and Daniele Magazzeni and Andrea Micheli and Parisa Zehtabi 2021 Is Part Of LIPIcs, Volume 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.TIME.2021.13 urn:nbn:de:0030-drops-147895 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2021.13 eng https://creativecommons.org/licenses/by/4.0/legalcode