Research map / Learning theory and algorithms / Combinatorial and search optimization
New Results in Bounded-Suboptimal Search
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 |
|---|---|---|---|
| Alternate queues ordered by f, ˆf, and expected effort | Bounded-suboptimal search · IPC planning instances, w=1.5 | normalized coverage: 58.7 -> 62.5 | Helped |
| Alternate queues ordered by f, ˆf, and distance d | Bounded-suboptimal search · IPC planning instances, w=1.5 | normalized coverage: 58.7 -> 60.7 | Helped |
| Use expected-effort ordering without round-robin queue alternation (ablation) | DXES · IPC planning domains | coverage | Hurt |
| Add round-robin alternation across queues to expected-effort search (ablation) | DXES · IPC planning domains | coverage | Helped |
| Reevaluate and requeue nodes when their xe estimate changes by more than 5% (ablation) | CDXES · IPC planning domains | coverage | Helped |
| Alternate focal search with the potential-ordered queue (ablation) | Round-robin bounded-suboptimal search · Search benchmarks | CPU time | Hurt |
| Use a 95% probability threshold for focal-list inclusion (ablation) | EES · Search benchmarks | CPU time | No clear effect |
| Require focal nodes to satisfy the admissible bound and expand the best-distance node whenever focal is nonempty (ablation) | EES · Search benchmarks | CPU time | Mixed |
| Use two queues and expand from focal whenever nonempty (ablation) | EES (Rushed EES) · Planning and search benchmarks | performance | Hurt |
| Use a probabilistic expected-effort estimate to choose nodes, without round-robin scheduling (ablation) | Bounded-suboptimal search · IPC planning domains | coverage | Hurt |
| Alternate only between the focal queue and best-f or best-ˆf, rather than using all three queues (ablation) | Round-robin bounded-suboptimal search · Bounded-suboptimal search | performance | Hurt |
Closest papers by meaning
- Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (AAAI 2026 · similarity 0.93)
- Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions (AAAI 2021 · similarity 0.90)
- Suboptimal Search with Dynamic Distribution of Suboptimality (AAAI 2025 · similarity 0.89)
- Finding Options that Minimize Planning Time (ICML 2019 · similarity 0.88)
- A* Search and Bound-Sensitive Heuristics for Oversubscription Planning (AAAI 2022 · similarity 0.88)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.87)
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.