Talk Sessions:

Poster Sessions:

June 21, Booth 23

June 22, Booth 16

Best-First Width Search for Lifted Classical Planning

Augusto B. CorrĂȘa and Jendrik Seipp

Abstract: Lifted planners are useful to solve tasks that are too hard to ground. Still, computing informative lifted heuristics is difficult: directly adapting ground heuristics to the lifted setting is often too expensive, and extracting heuristics from the lifted representation can be uninformative. A natural alternative for lifted planners is to use width-based search. These algorithms are among the strongest for ground planning, even the variants that do not access the action model. In this work, we adapt best-first width search to the lifted setting and show that this yields state-of-the-art performance for hard-to-ground planning tasks.

*This password protected talk video will only be available after it was presented at the conference.