Efficient anytime computation and execution of decoupled robustness envelopes for temporal plans

Cashmore, Michael and Cimatti, Alessandro and Magazzeni, Daniele and Micheli, Andrea and Zehtabi, Parisa (2020) Efficient anytime computation and execution of decoupled robustness envelopes for temporal plans. In: Integrated Execution (IntEx) / Goal Reasoning (GR), 2020-10-19 - 2020-10-30, Virtual.

[thumbnail of Cashmore-etal-ICAPS-2020-Efficient-anytime-computation-and-execution-of-decoupled-robustness-envelopes]
Preview
Text (Cashmore-etal-ICAPS-2020-Efficient-anytime-computation-and-execution-of-decoupled-robustness-envelopes)
Cashmore_etal_ICAPS_2020_Efficient_anytime_computation_and_execution_of_decoupled_robustness_envelopes.pdf
Accepted Author Manuscript

Download (704kB)| Preview

    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 replanning, but their exact computation is extremely 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.

    ORCID iDs

    Cashmore, Michael ORCID logoORCID: https://orcid.org/0000-0002-8334-4348, Cimatti, Alessandro, Magazzeni, Daniele, Micheli, Andrea and Zehtabi, Parisa;