\(BS^*:\) An admissible bidirectional staged heuristic search algorithm

DOI10.1016/0004-3702(89)90069-6zbMath0663.68106OpenAlexW1971267722MaRDI QIDQ1115210

James B. H. Kwa

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

zbMATH Keywords

heuristic searchearly termination

Mathematics Subject Classification ID

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

• Generalized best-first search strategies and the optimality of A*
• Bidirectional Heuristic Search Again
• An Improved Bidirectional Heuristic Search Algorithm
• Finding the Shortest Route between Two Points in a Network
• An Appraisal of Some Shortest-Path Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(BS^*:\) An admissible bidirectional staged heuristic search algorithm