Iterative Budgeted Exponential Search

Malte Helmert, Tor Lattimore, Levi H. S. Lelis +2

We tackle two long-standing problems related to re-expansions in heuristic search algorithms. For graph search, A* can require $\Omega (2^n)$ expansions, where $n$ is the number of sta…