\(BS^*:\) An admissible bidirectional staged heuristic search algorithm
From MaRDI portal
Publication:1115210
DOI10.1016/0004-3702(89)90069-6zbMath0663.68106OpenAlexW1971267722MaRDI QIDQ1115210
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90069-6
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
Perimeter search in restricted memory ⋮ Intelligent transportation systems -- Enabling technologies ⋮ Iterative Deepening Dynamically Improved Bounds Bidirectional Search ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Dynamically improved bounds bidirectional search ⋮ Shortest-path queries in static networks ⋮ A new bidirectional search algorithm with shortened postprocessing
Cites Work
This page was built for publication: \(BS^*:\) An admissible bidirectional staged heuristic search algorithm