Dynamically improved bounds bidirectional search

DOI10.1016/J.ARTINT.2020.103405MaRDI QIDQ2238652zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

bidirectional searchheuristic search

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• scientific article; zbMATH DE number 1149449
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• scientific article; zbMATH DE number 2079778
• Two new bidirectional search algorithms

Cites work

• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• 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*
• scientific article; zbMATH DE number 1149449 (Why is no real title available?)
• scientific article; zbMATH DE number 3415384 (Why is no real title available?)
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle

Cited in

(11)

• A new bidirectional search algorithm with shortened postprocessing
• Bidirectional heuristic search with limited resources
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Two new bidirectional search algorithms
• An exact bidirectional A^ approach for solving resource-constrained shortest path problems
• Symmetric connection problems and their solution by bidirectional search
• scientific article; zbMATH DE number 1149449 (Why is no real title available?)
• scientific article; zbMATH DE number 2079778 (Why is no real title available?)
• Iterative Deepening Dynamically Improved Bounds Bidirectional Search
• Bridging theory and practice in bidirectional heuristic search with front-to-end consistent heuristics

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)