Bidirectional Heuristic Search Again

DOI10.1145/322358.322360MaRDI QIDQ3962475zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dennis De Champeaux

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

zbMATH Keywords

bidirectional searchconsistencygeneralization of the unidirectional optimality theoremshortest path

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited in

(12)

• A new bidirectional search algorithm with shortened postprocessing
• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• Computing shortest paths in networks derived from recurrence relations
• Bidirectional heuristic search with limited resources
• Perimeter search in restricted memory
• 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
• Optimal path discovery problem with homogeneous knowledge
• Heuristic shortest path algorithms for transportation applications: state of the art
• Iterative Deepening Dynamically Improved Bounds Bidirectional Search
• Sublinear time shortest path in expander graphs

This page was built for publication: Bidirectional Heuristic Search Again

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962475)