Frontier search

  • Authors:

  • Richard E. Korf;Weixiong Zhang;Ignacio Thayer;Heath Hohwald

  • Affiliations:

  • University of California, Los Angeles, California;Washington University, St. Louis, Missouri;University of California, Los Angeles, California;University of California, Los Angeles, California

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The critical resource that limits the application of best-first search is memory. We present a new class of best-first search algorithms that reduce the space complexity. The key idea is to store only the Open list of generated nodes, but not the Closed list of expanded nodes. The solution path can be recovered by a divide-and-conquer technique, either as a bidirectional or unidirectional search. For many problems, frontier search dramatically reduces the memory required by best-first search. We apply frontier search to breadth-first search of sliding-tile puzzles and the 4-peg Towers of Hanoi problem, Dijkstra's algorithm on a grid with random edge costs, and the A* algorithm on the Fifteen Puzzle, the four-peg Towers of Hanoi Problem, and optimal sequence alignment in computational biology.