Data Entry: Please note that the research database will be replaced by UNIverse by the end of October 2023. Please enter your data into the system https://universe-intern.unibas.ch. Thanks
Proceedings of the 36th AAAI Conference on Artificial Intelligence
Place of Conference
Online/Virtual
Publisher
AAAI Press
Place of Publication
Palo Alto, California USA
Pages
9716-9723
ISSN/ISBN
2159-5399 ; 2374-3468 ; 978-1-57735-876-3
Abstract
Heuristics for lifted planning are not yet as informed as the best heuristics for ground planning. Recent work introduced the idea of using Datalog programs to compute the additive heuristic over lifted tasks. Based on this work, we show how to compute the more informed FF heuristic in a lifted manner. We extend the Datalog program with executable annotations that can also be used to define other delete-relaxation heuristics. In our experiments, we show that a planner using the lifted FF implementation produces state-of-the-art results for lifted planners. It also reduces the gap to state-of-the-art ground planners in domains where grounding is feasible.
Series title
Proceedings of the AAAI Conference on Artificial Intelligence
