@inproceedings{32a78d4a6fb54f809b7a04bfe842eb27,
title = "Using lookaheads with optimal best-first search",
abstract = "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.",
author = "Roni Stern and Tamar Kulberis and Ariel Felner and Robert Holte",
year = "2010",
month = jan,
day = "1",
language = "English",
isbn = "9781577354642",
series = "Proceedings of the National Conference on Artificial Intelligence",
publisher = "AI Access Foundation",
pages = "185--190",
booktitle = "AAAI-10 / IAAI-10 - Proceedings of the 24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference",
address = "United States",
note = "24th AAAI Conference on Artificial Intelligence and the 22nd Innovative Applications of Artificial Intelligence Conference, AAAI-10 / IAAI-10 ; Conference date: 11-07-2010 Through 15-07-2010",
}