Research map / Learning theory and algorithms / Combinatorial and search optimization
Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics
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.
Closest papers by meaning
- New Results in Bounded-Suboptimal Search (AAAI 2022 · similarity 0.93)
- A Unifying View on Individual Bounds and Heuristic Inaccuracies in Bidirectional Search (AAAI 2020 · similarity 0.92)
- Anchor Search: A Unified Framework for Suboptimal Bidirectional Search (AAAI 2025 · similarity 0.92)
- Bidirectional Search That Is Guaranteed to Meet in the Middle (AAAI 2016 · similarity 0.88)
- Suboptimal Search with Dynamic Distribution of Suboptimality (AAAI 2025 · similarity 0.87)
- Consistent Submodular Maximization (ICML 2024 · 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.