Research map / Learning theory and algorithms / Combinatorial and search optimization
Finding Options that Minimize Planning Time
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| Use A-MIMO's bounded-suboptimal option set instead of the optimal option set | Value iteration with options · Four-room and 9 × 9 grid domains | VI iterations | Hurt |
| Use betweenness options instead of arbitrary heuristic options | Value iteration with options · Four-room domain | VI iterations | Helped |
| Select betweenness options instead of eigenoptions | Value iteration with options · Four-room domain | VI iterations | Mixed |
| Use greedy option addition for the fixed-budget MIMO problem | MIMO · MDPs | VI iterations | Hurt |
| Add point options selected by A-MOMI | Value iteration · MDPs satisfying the algorithm assumptions | VI iterations | Helped |
Closest papers by meaning
- Discovering Options That Minimize Average Planning Time (AAAI 2025 · similarity 0.91)
- New Results in Bounded-Suboptimal Search (AAAI 2022 · similarity 0.88)
- On the Completeness of Best-First Search Variants That Use Random Exploration (AAAI 2016 · similarity 0.87)
- Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning (AAAI 2024 · similarity 0.85)
- An Automatic Sound and Complete Abstraction Method for Generalized Planning with Baggable Types (AAAI 2025 · similarity 0.84)
- PDBs Go Numeric: Pattern-Database Heuristics for Simple Numeric Planning (AAAI 2025 · 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.