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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010 |
| Publisher | AAAI press |
| Pages | 185-190 |
| Number of pages | 6 |
| ISBN (Electronic) | 9781577354642 |
| State | Published - 15 Jul 2010 |
| Externally published | Yes |
| Event | 24th AAAI Conference on Artificial Intelligence, AAAI 2010 - Atlanta, United States Duration: 11 Jul 2010 → 15 Jul 2010 |
Publication series
| Name | Proceedings of the 24th AAAI Conference on Artificial Intelligence, AAAI 2010 |
|---|
Conference
| Conference | 24th AAAI Conference on Artificial Intelligence, AAAI 2010 |
|---|---|
| Country/Territory | United States |
| City | Atlanta |
| Period | 11/07/10 → 15/07/10 |
Bibliographical note
Publisher Copyright:© 2010, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
Acknowledgments This research was supported by the Israeli Science Foundation grant no. 305/09 and by the iCORE and NSERC grants. References
| Funders | Funder number |
|---|---|
| Natural Sciences and Engineering Research Council of Canada | |
| Israel Science Foundation | 305/09 |