Robustness Envelopes for Temporal Plans
| Autor: | Alessandro Cimatti, Andrea Micheli, Michael Cashmore, Daniele Magazzeni, Parisa Zehtabi |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
QA75
Mathematical optimization Computer science media_common.quotation_subject 0102 computer and information sciences General Medicine Executor 01 natural sciences Adaptability 010201 computation theory & mathematics Robustness (computer science) Satisfiability modulo theories Leverage (statistics) media_common |
| Zdroj: | AAAI Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence Scopus-Elsevier Magazzeni, D, Cashmore, M, Cimatti, A, Micheli, A & Zehtabi, P 2019, Robustness Envelopes for Temporal Plans . in Proceedings of AAAI Conference on Artificial Intelligence (AAAI 2019) . https://doi.org/10.1609/aaai.v33i01.33017538 |
| ISSN: | 2374-3468 2159-5399 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|