TY - GEN
T1 - Using Lookaheads with Optimal Best-First Search
AU - Stern, Roni
AU - Kulberis, Tamar
AU - Felner, Ariel
AU - Holte, Robert
N1 - Publisher Copyright:
© 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2010/7/15
Y1 - 2010/7/15
N2 - We present an algorithm that exploits the complimentary benefits of best-first search (BFS) and depth-first search (DFS) by performing limited DFS lookaheads from the frontier of BFS. We show that this continuum requires significantly less memory than BFS. In addition, a time speedup is also achieved when choosing the lookahead depth correctly. We demonstrate this idea for breadth-first search and for A*. Additionally, we show that when using inconsistent heuristics, Bidirectional Pathmax (BPMX), can be implemented very easily on top of the lookahead phase. Experimental results on several domains demonstrate the benefits of all our ideas.
AB - We present an algorithm that exploits the complimentary benefits of best-first search (BFS) and depth-first search (DFS) by performing limited DFS lookaheads from the frontier of BFS. We show that this continuum requires significantly less memory than BFS. In addition, a time speedup is also achieved when choosing the lookahead depth correctly. We demonstrate this idea for breadth-first search and for A*. Additionally, we show that when using inconsistent heuristics, Bidirectional Pathmax (BPMX), can be implemented very easily on top of the lookahead phase. Experimental results on several domains demonstrate the benefits of all our ideas.
UR - http://www.scopus.com/inward/record.url?scp=84943300173&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84943300173
T3 - Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
SP - 185
EP - 190
BT - Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010
PB - AAAI press
T2 - 24th AAAI Conference on Artificial Intelligence, AAAI 2010
Y2 - 11 July 2010 through 15 July 2010
ER -