TY - GEN
T1 - Bidirectional search that is guaranteed to meet in the middle
AU - Holte, Robert C.
AU - Felner, Ariel
AU - Sharon, Guni
AU - Sturtevant, Nathan R.
N1 - Publisher Copyright:
© Copyright 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2016/1/1
Y1 - 2016/1/1
N2 - We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to "meet in the middle", i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A∗, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.
AB - We present MM, the first bidirectional heuristic search algorithm whose forward and backward searches are guaranteed to "meet in the middle", i.e. never expand a node beyond the solution midpoint. We also present a novel framework for comparing MM, A∗, and brute-force search, and identify conditions favoring each algorithm. Finally, we present experimental results that support our theoretical analysis.
UR - http://www.scopus.com/inward/record.url?scp=84992057114&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84992057114
T3 - 30th AAAI Conference on Artificial Intelligence, AAAI 2016
SP - 3411
EP - 3417
BT - 30th AAAI Conference on Artificial Intelligence, AAAI 2016
PB - AAAI press
T2 - 30th AAAI Conference on Artificial Intelligence, AAAI 2016
Y2 - 12 February 2016 through 17 February 2016
ER -