4 citations · 5 across the 13 of their papers we have counts for
1 paper · 1 filter
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 Ω(2n) expansions, where n is the number of sta…