Research map / Learning theory and algorithms / Combinatorial and search optimization
Top-Quality Planning: Finding Practically Useful Sets of Best Plans
Michael Katz, Shirin Sohrabi, Octavian Udrea
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 |
|---|---|---|---|
| forbid plans as multisets (FMPMA reformulation) so reorderings are implicitly covered, vs top-k planner with k=10^6 | top-quality planning · IPC STRIPS tasks, qm=1.00 | coverage: 282 -> 398 | Improved |
| same, quality bound 1.05x optimal | top-quality planning · IPC STRIPS tasks, qm=1.05 | coverage: 254 -> 353 | Improved |
| same, quality bound 1.10x optimal | top-quality planning · IPC STRIPS tasks, qm=1.10 | coverage: 199 -> 292 | Improved |
| same, quality bound 1.20x optimal | top-quality planning · IPC STRIPS tasks, qm=1.20 | coverage: 124 -> 209 | Improved |
| unordered top-quality vs top-k on mprime domain | top-quality planning · mprime, qm=1.00 | coverage: 19 -> 18 | Hurt |
| represent reorderings implicitly (single plan per multiset) rather than enumerating them | top-quality planning · solved tasks at qm=1.0 | solution size (number of plans): 115 of 165 off-diagonal tasks have a single optimal plan | Improved |
| reformulate task with FMPMA instead of top-k reformulation | planning task encoding · first reformulated task, qm=1.0 | number of facts | Improved |
| add complete DFS-based reordering generation (DFS-r) to the reformulation to build a top-k planner | top-quality planner · number of plans produced in time limit | number of plans | Mixed |
Closest papers by meaning
- Bounding Quality in Diverse Planning (AAAI 2022 · similarity 0.94)
- Reshaping Diverse Planning (AAAI 2020 · similarity 0.93)
- An Automatic Sound and Complete Abstraction Method for Generalized Planning with Baggable Types (AAAI 2025 · similarity 0.84)
- Planning Anything with Rigor: General-Purpose Zero-Shot Planning with LLM-based Formalized Programming (ICLR 2025 · similarity 0.83)
- Thought of Search: Planning with Language Models Through The Lens of Efficiency (NeurIPS 2024 · similarity 0.83)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · similarity 0.83)
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.
