Research map / Learning theory and algorithms / Combinatorial and search optimization
A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional 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 |
|---|---|---|---|
| add KK heuristic-inaccuracy bounds to NBB (DBS (a)) | NBB · Towers of Hanoi 12 (10+2) | necessarily-expanded nodes: 230k -> 118k | Helped |
| add b bound on top of KK bounds (DBBS (a) vs DBS (a)) | DBS (a) · Towers of Hanoi 12 (10+2) | necessarily-expanded nodes: 118k -> 66k | Helped |
| add b bound on top of KK bounds (DBBS (p) vs DBS (p)) | DBS (p) · 15 Puzzle | necessarily-expanded nodes: 8011k -> 3059k | Helped |
| use Pohl cardinality criterion (p) instead of alternating (a) with the new bounds | DBS · 15 Puzzle | necessarily-expanded nodes: 10736k -> 8011k | Helped |
| add KK bounds to NBB | NBB · 14-Pancake GAP-2 | necessarily-expanded nodes: 111k -> 54k | Helped |
| use BAE* instead of DBBS (a) | DBBS (a) · 14-Pancake GAP-6 | necessarily-expanded nodes: 711k -> 1775k | Hurt |
| use KK bounds with alternating expansion | NBB · Grid Mazes | necessarily-expanded nodes: 83993 -> 78563 | Helped |
| add inaccuracy bounds to NBB | NBB · DAO maps | necessarily-expanded nodes | No clear effect |
| add inaccuracy bounds (more bucket dimensions plus fixpoint) | NBB/DBS · Mazes and DAO nodes per second | necessarily-expanded nodes | Hurt |
Closest papers by meaning
- Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (AAAI 2026 · similarity 0.92)
- Bidirectional Search That Is Guaranteed to Meet in the Middle (AAAI 2016 · similarity 0.91)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.91)
- Enriching Non-Parametric Bidirectional Search Algorithms (AAAI 2019 · similarity 0.89)
- Resource Constrained Pathfinding with Enhanced Bidirectional A* Search (AAAI 2025 · similarity 0.84)
- Rectangle Search: An Anytime Beam Search (AAAI 2024 · 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.