Delete-Relaxation Heuristics for Lifted Classical Planning

Corrêa, Augusto B. and Francès, Guillem and Pommerening, Florian and Helmert, Malte. (2021) Delete-Relaxation Heuristics for Lifted Classical Planning. In: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 31. pp. 94-102.

[img] PDF - Accepted Version

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

Downloads: Statistics Overview


Recent research in classical planning has shown the importance of search techniques that operate directly on the lifted representation of the problem, particularly in domains where the ground representation is prohibitively large. In this paper, we show how to compute the additive and maximum heuristics from the lifted representation of a problem. We do this by adapting well-known reachability analysis techniques based on a Datalog formulation of the delete relaxation of the problem. Our adaptation allows us to obtain not only the desired heuristic value, but also other useful heuristic information such as helpful actions. Our empirical evaluation shows that our lifted version of the additive heuristic is competitive with its ground counterpart on most of the standard international competition benchmarks, and significantly outperforms other state-of-the-art lifted heuristic methods in the literature.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Blaas Corrêa, Augusto and Francès Medina, Guillem and Pommerening, Florian and Helmert, Malte
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
edoc DOI:
Last Modified:30 Aug 2021 08:12
Deposited On:25 Aug 2021 15:27

Repository Staff Only: item control page