Research map / Learning theory and algorithms / Combinatorial and search optimization
Efficient Temporal Planning Using Metastates
Amanda Coles, Andrew Coles, J. Christopher Beck
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 |
|---|---|---|---|
| aggregate temporally different but classically equal states into metastates, expanded lazily | OPTIC · All 14 temporal domains | problems solved: 164 -> 189 | Improved |
| use metastates instead of Coles and Coles 2016 memoisation | OPTIC · 194 problems solved by at least one configuration | nodes expanded: fewer nodes in 73, more in 6 | Improved |
| use metastates | OPTIC · All 14 temporal domains | solve time: P > 0.99 | Improved |
| use metastates | OPTIC · Mutually solved problems | plan makespan: same in 154 of 161, longer in 7 | Mixed |
| use metastates in domains with many open-action states (Cafe, Driverlog Shift, TMS, Pipes Deadlines, UMTS) | OPTIC · Cafe, Driverlog Shift, TMS, Pipes Deadlines Compiled, UMTS TW Compiled | nodes expanded: 99%, 92%, 99%, 97%, 97% open-action states | Improved |
| use metastates in domains with few open-action states (Rovers, Turn and Open) | OPTIC · Rovers, Turn and Open | nodes expanded: 7%, 1% open-action states | No clear effect |
| use metastates in Match and P2P despite required concurrency | OPTIC · Match, P2P | performance | No clear effect |
| use metastates on trivial Openstacks benchmark set | OPTIC · Openstacks | performance | No clear effect |
| use metastates across domains | OPTIC · 14 domains | domains with improvement: 9 of 14 improved, 5 stable | Improved |
Closest papers by meaning
- Automatic Selection of Macro-Events for Heuristic-Search Temporal Planning (AAAI 2025 · similarity 0.86)
- Temporal Task and Motion Planning with Metric Time for Multiple Object Navigation (AAAI 2025 · similarity 0.85)
- Temporal Numeric Planning with Patterns (AAAI 2025 · similarity 0.85)
- Thought of Search: Planning with Language Models Through The Lens of Efficiency (NeurIPS 2024 · similarity 0.84)
- Abstract Action Scheduling for Optimal Temporal Planning via OMT (AAAI 2024 · similarity 0.84)
- Mosaic: Runtime-Efficient Multi-Agent Embodied Planning (ICML 2026 · similarity 0.84)
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.
