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

CoRR, 2019.

Cited by: 1|Views57
EI

Abstract:

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 achi...More

Code:

Data:

Full Text
Bibtex
Your rating :
0

 

Tags
Comments