Corpus ID: 174801438

Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees

@article{Orseau2019ZoomingCL,
  title={Zooming Cautiously: Linear-Memory Heuristic Search With Node Expansion Guarantees},
  author={Laurent Orseau and Levi H. S. Lelis and Tor Lattimore},
  journal={ArXiv},
  year={2019},
  volume={abs/1906.03242}
}
We introduce and analyze two parameter-free linear-memory tree search algorithms. Under mild assumptions we prove our algorithms are guaranteed to perform only a logarithmic factor more node expansions than A* when the search space is a tree. Previously, the best guarantee for a linear-memory algorithm under similar assumptions was achieved by IDA*, which in the worst case expands quadratically more nodes than in its last iteration. Empirical results support the theory and demonstrate the… Expand
1 Citations
Iterative Budgeted Exponential Search
  • 6
  • PDF

References

SHOWING 1-10 OF 34 REFERENCES
Enhanced Iterative-Deepening Search
  • 160
  • PDF
Iterative-Deepening Search with On-Line Tree Size Prediction
  • 15
  • PDF
Solving Large Problems with Heuristic Search: General-Purpose Parallel External-Memory Search
  • 5
Recursive Best-First Search with Bounded Overhead
  • 8
  • PDF
Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds
  • 72
  • Highly Influential
A Heuristic Search Algorithm with Modifiable Estimate
  • L. Méro
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1984
  • 106
Depth-First Iterative-Deepening: An Optimal Admissible Tree Search
  • R. Korf
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1985
  • 1,634
  • PDF
Iterative Budgeted Exponential Search
  • 6
  • PDF
Comparison and Evaluation of a Class of IDA* Algorithms
  • 14
...
1
2
3
4
...