Research map / Learning theory and algorithms / Combinatorial and search optimization
Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions
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 the piecewise downward-convex priority ΦpwXD instead of WA* | Best-first bounded-suboptimal search · 15-Puzzle, w = 3.0 | average state expansions: 11,600 -> 4,978 | Helped |
| Use ΦpwXD instead of WA* | Best-first bounded-suboptimal search · Heavy 15-Puzzle, w = 3.0 | average state expansions: 57,778 -> 50,664 | Helped |
| Use ΦpwXD instead of WA* | Best-first bounded-suboptimal search · Heavy Pancake Puzzle, w = 3.0 | average state expansions: 22,732 -> 367 | Helped |
| Use ΦpwXD instead of WA* | Best-first bounded-suboptimal search · 15-Puzzle, w = 3.0 | average path cost: 77.99 -> 89.33 | Hurt |
| Use ΦpwXD instead of WA* | Best-first bounded-suboptimal search · Heavy 15-Puzzle, w = 3.0 | average path cost: 619.62 -> 685.66 | Hurt |
| Use ΦpwXD instead of WA* | Best-first bounded-suboptimal search · Heavy Pancake Puzzle, w = 3.0 | average path cost: 88.94 -> 95.74 | Hurt |
| Use ΦpwXD instead of WA* | FastDownward planning search · Data-network | IPC problems solved: 14 -> 16 | Helped |
| Use ΦpwXD instead of WA* | FastDownward planning search · Spider | IPC problems solved: 17 -> 18 | Helped |
| Use ΦpwXD instead of WA* | FastDownward planning search · Termes | IPC problems solved: 12 -> 13 | Helped |
| Use ΦpwXD instead of WA* | FastDownward planning search · Spider common problems | average expansions: 30,017 -> 37,827 | Hurt |
| Set additive-bound parameter K to h0 rather than 2γ (ablation) | ΦAB · DAO, γ = 256 | average state expansions: 481 -> 368 | Helped |
| Set additive-bound parameter K to h0 rather than 2γ (ablation) | ΦAB · Sliding tile puzzle, γ = 256 | average state expansions: 399 -> 204 | Helped |
Closest papers by meaning
- New Results in Bounded-Suboptimal Search (AAAI 2022 · similarity 0.90)
- Suboptimal Search with Dynamic Distribution of Suboptimality (AAAI 2025 · similarity 0.87)
- Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (AAAI 2026 · similarity 0.87)
- Anytime Recursive Best-First Search for Bounding Marginal MAP (AAAI 2019 · similarity 0.85)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.85)
- A Near Linear Query Lower Bound for Submodular Maximization (ICML 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.