Robustness envelopes for temporal plans
Cashmore, Michael and Cimatti, Alessandro and Magazzeni, Daniele and Micheli, Andrea and Zehtabi, Parisa; (2019) Robustness envelopes for temporal plans. In: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence. AAAI Press, USA. (https://doi.org/10.1609/aaai.v33i01.33017538)
Preview |
Text.
Filename: Cashmore_etal_AAAI2019_Robustness_envelopes_for_temporal_plans.pdf
Accepted Author Manuscript Download (2MB)| Preview |
Abstract
To achieve practical execution, planners must produce temporal plans with some degree of run-time adaptability. Such plans can be expressed as Simple Temporal Networks (STN), that constrain the timing of action activations, and implicitly represent the space of choices for the plan executor. A first problem is to verify that all the executor choices allowed by the STN plan will be successful, i.e. the plan is valid. An even more important problem is to assess the effect of discrepancies between the model used for planning and the execution environment. We propose an approach to compute the 'robustness envelope' (i.e., alternative action durations or resource consumption rates) of a given STN plan, for which the plan remains valid. Plans can have boolean and numeric variables as well as discrete and continuous change. We leverage Satisfiability Modulo Theories (SMT) to make the approach formal and practical.
ORCID iDs
Cashmore, Michael ORCID: https://orcid.org/0000-0002-8334-4348, Cimatti, Alessandro, Magazzeni, Daniele, Micheli, Andrea and Zehtabi, Parisa;-
-
Item type: Book Section ID code: 70194 Dates: DateEvent1 February 2019Published14 November 2018AcceptedSubjects: Science > Mathematics > Electronic computers. Computer science Department: Faculty of Science > Computer and Information Sciences Depositing user: Pure Administrator Date deposited: 21 Oct 2019 11:02 Last modified: 17 Nov 2024 01:30 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/70194