Dynamically improved bounds bidirectional search
From MaRDI portal
Publication:2238652
DOI10.1016/J.ARTINT.2020.103405OpenAlexW3101568564MaRDI QIDQ2238652FDOQ2238652
E. C. Sewell, Sheldon H. Jacobson
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2020.103405
Recommendations
Cites Work
- Generalized best-first search strategies and the optimality of A*
- Pancake flipping is hard
- Title not available (Why is that?)
- Depth-first iterative-deepening: An optimal admissible tree search
- Title not available (Why is that?)
- Title not available (Why is that?)
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new bidirectional search algorithm with shortened postprocessing
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search
- Bidirectional heuristic search with limited resources
- Two new bidirectional search algorithms
- \(\text{BIDA}^*\): An improved perimeter search algorithm
This page was built for publication: Dynamically improved bounds bidirectional search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238652)
