Best-First Width Search for Lifted Classical Planning
Keywords:Lifted Planning, Classical Planning, Width-based Search, Novelty, Grounding
AbstractLifted 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.
How to Cite
B. Corrêa, A., & Seipp, J. (2022). Best-First Width Search for Lifted Classical Planning. Proceedings of the International Conference on Automated Planning and Scheduling, 32(1), 11-15. Retrieved from https://ojs.aaai.org/index.php/ICAPS/article/view/19780