Best-First Width Search for Lifted Classical Planning

Corrêa, Augusto B. and Seipp, Jendrik. (2022) Best-First Width Search for Lifted Classical Planning. In: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 32. Palo Alto, California USA, pp. 11-15.

[img] PDF - Accepted Version

Official URL: https://edoc.unibas.ch/93389/

Downloads: Statistics Overview


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.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Blaas Corrêa, Augusto
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
Publisher:AAAI Press
Note:Publication type according to Uni Basel Research Database: Conference paper
Identification Number:
edoc DOI:
Last Modified:08 Feb 2023 16:20
Deposited On:08 Feb 2023 16:20

Repository Staff Only: item control page