Dynamically improved bounds bidirectional search
From MaRDI portal
(Redirected from Publication:2238652)
Recommendations
Cites work
- scientific article; zbMATH DE number 1149449 (Why is no real title available?)
- scientific article; zbMATH DE number 3415384 (Why is no real title available?)
- A general theory of additive state space abstractions
- Depth-first iterative-deepening: An optimal admissible tree search
- Generalized best-first search strategies and the optimality of A*
- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
Cited in
(10)- MM: a bidirectional search algorithm that is guaranteed to meet in the middle
- scientific article; zbMATH DE number 1149449 (Why is no real title available?)
- A new bidirectional search algorithm with shortened postprocessing
- scientific article; zbMATH DE number 2079778 (Why is no real title available?)
- Iterative Deepening Dynamically Improved Bounds Bidirectional Search
- Bidirectional heuristic search with limited resources
- An exact bidirectional A^ approach for solving resource-constrained shortest path problems
- Two new bidirectional search algorithms
- Bridging theory and practice in bidirectional heuristic search with front-to-end consistent heuristics
- \(\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)
