Research map / Learning theory and algorithms / Combinatorial and search optimization
Robustness Envelopes for Temporal Plans
Michael Cashmore, Alessandro Cimatti, Daniele Magazzeni, Andrea Micheli, Parisa Zehtabi
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| increase plan length (problem size) in AUV domain | Robustness envelope synthesis · AUV domain | synthesis time (sec): 9.8 -> 60 | Hurt |
| increase plan length in Generator domain | Robustness envelope synthesis · Generator domain | synthesis time (sec): 0.31 -> Time Out | Hurt |
| increase plan length in Solar Rover domain | Robustness envelope synthesis · Solar Rover domain | synthesis time (sec): 0.75 -> 3.45 | Hurt |
| increase number of parameters in AUV problem 5 | Robustness envelope synthesis · AUV problem 5 | synthesis time (sec): 51.15 -> 107.17 | Hurt |
| increase number of parameters in Generator problem 3 | Robustness envelope synthesis · Generator problem 3 | synthesis time (sec): 542.3 -> 1130.43 | Hurt |
| increase number of parameters beyond Gen #3 in Generator problem 1 | Robustness envelope synthesis · Generator problem 1 | synthesis time (sec): 11.14 -> TO | Hurt |
| increase number of parameters in Rover problem 1 | Robustness envelope synthesis · Rover problem 1 | synthesis time (sec): 1.59 -> 8.0 | Mixed |
| increase number of parameters from 1 to 4 in Rover problem 5 | Robustness envelope synthesis · Rover problem 5 | synthesis time (sec): 5.28 -> 67.6 | Mixed |
| increase number of parameters from 1 to 4 in Rover problem 6 | Robustness envelope synthesis · Rover problem 6 | synthesis time (sec): 8.47 -> 29.55 | Mixed |
| decoupling parameters phase added to envelope synthesis | Robustness envelope synthesis · all domains | synthesis time (sec) | No clear effect |
Closest papers by meaning
- Temporal Numeric Planning with Patterns (AAAI 2025 · similarity 0.84)
- On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence (AAAI 2024 · similarity 0.83)
- Abstract Action Scheduling for Optimal Temporal Planning via OMT (AAAI 2024 · similarity 0.83)
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.83)
- Learning Planning Domains from Non-redundant Fully-Observed Traces: Theoretical Foundations and Complexity Analysis (AAAI 2024 · similarity 0.82)
- Bidirectional Temporal Plan Graph: Enabling Switchable Passing Orders for More Efficient Multi-Agent Path Finding Plan Execution (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
