Using lookaheads with optimal best-first search

摘要: We present an algorithm that exploits the complimentary benefits of best-first search (BFS) and depth-first (DFS) by performing limited DFS lookaheads from frontier BFS. show this continuum requires significantly less memory than In addition, a time speedup is also achieved when choosing lookahead depth correctly. demonstrate idea for breadth-first A*. Additionally, we using inconsistent heuristics, Bidirectional Pathmax (BPMX), can be implemented very easily on top phase. Experimental results several domains all our ideas.