MM: a bidirectional search algorithm that is guaranteed to meet in the middle

DOI10.1016/j.artint.2017.05.004zbMath1419.68093OpenAlexW2747118187MaRDI QIDQ1677446

Guni Sharon, Ariel Felner, Jingwei Chen, Nathan R. Sturtevant, Robert C. Holte

Publication date: 21 November 2017

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2017.05.004

zbMATH Keywords

heuristic searchbidirectional search

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Heuristic search for one-to-many shortest path queries ⋮ Iterative Deepening Dynamically Improved Bounds Bidirectional Search ⋮ MM: a bidirectional search algorithm that is guaranteed to meet in the middle ⋮ Simple and efficient bi-objective search algorithms via fast dominance checks ⋮ Two new bidirectional search algorithms ⋮ Dynamically improved bounds bidirectional search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Inconsistent heuristics in theory and practice
• Note on ``A new bidirectional algorithm for shortest paths
• A new bidirectional search algorithm with shortened postprocessing
• A parallel shortest path algorithm
• \(BS^*:\) An admissible bidirectional staged heuristic search algorithm
• On the complexity of admissible search algorithms
• The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
• MM: a bidirectional search algorithm that is guaranteed to meet in the middle
• A bidirectional shortest-path algorithm with good average-case behavior
• \(\text{BIDA}^*\): An improved perimeter search algorithm
• Some Recent Results in Heuristic Search Theory
• Frontier search
• Bidirectional Heuristic Search Again
• An optimality theorem for a bi-directional heuristic search algorithm
• An Improved Bidirectional Heuristic Search Algorithm
• Optimally solving permutation sorting problems with efficient partial expansion bidirectional heuristic search
• Finding the Shortest Route between Two Points in a Network
• The Diameter of the Rubik's Cube Group Is Twenty

This page was built for publication: MM: a bidirectional search algorithm that is guaranteed to meet in the middle