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

Artificial Intelligence, pp. 232-266, 2017.

Cited by: 18|Bibtex|Views24|DOI:https://doi.org/10.1016/j.artint.2017.05.004
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|www.sciencedirect.com

Abstract:

Bidirectional search algorithms interleave two separate searches, a normal search forward from the start state, and a search backward from the goal. It is well known that adding a heuristic to unidirectional search dramatically reduces the search effort. By contrast, despite decades of research, bidirectional heuristic search has not yet ...More

Code:

Data:

Your rating :
0

 

Tags
Comments