508 citations · 562 across the 5 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.AI2019
Higher-Dimensional Potential Heuristics for Optimal Classical Planning
Florian Pommerening, Malte Helmert, Blai Bonet
Potential heuristics for state-space search are defined as weighted sums over simple state features. Atomic features consider the value of a single state variable in a factored sta…
cs.DS2019
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 expansions, where is the number of sta…
cs.AI2019★ 4 cited
Exponential-Binary State-Space Search
Nathan Sturtevant, Malte Helmert
Iterative deepening search is used in applications where the best cost bound for state-space search is unknown. The iterative deepening process is used to avoid overshooting the ap…