Bidirectional Heuristic Search Again
From MaRDI portal
Publication:3962475
DOI10.1145/322358.322360zbMath0497.68034OpenAlexW2083355299WikidataQ29040716 ScholiaQ29040716MaRDI QIDQ3962475
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322358.322360
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Perimeter search in restricted memory ⋮ \(BS^*:\) An admissible bidirectional staged heuristic search algorithm ⋮ Iterative Deepening Dynamically Improved Bounds Bidirectional Search ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Computing shortest paths in networks derived from recurrence relations ⋮ Two new bidirectional search algorithms ⋮ Bidirectional heuristic search with limited resources ⋮ Heuristic shortest path algorithms for transportation applications: state of the art ⋮ Optimal path discovery problem with homogeneous knowledge ⋮ A new bidirectional search algorithm with shortened postprocessing ⋮ \(\text{BIDA}^*\): An improved perimeter search algorithm
This page was built for publication: Bidirectional Heuristic Search Again
