The FF Heuristic for Lifted Classical Planning
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.
Cite
Text
Corrêa et al. "The FF Heuristic for Lifted Classical Planning." AAAI Conference on Artificial Intelligence, 2022. doi:10.1609/AAAI.V36I9.21206Markdown
[Corrêa et al. "The FF Heuristic for Lifted Classical Planning." AAAI Conference on Artificial Intelligence, 2022.](https://mlanthology.org/aaai/2022/correa2022aaai-ff/) doi:10.1609/AAAI.V36I9.21206BibTeX
@inproceedings{correa2022aaai-ff,
title = {{The FF Heuristic for Lifted Classical Planning}},
author = {Corrêa, Augusto B. and Pommerening, Florian and Helmert, Malte and Francès, Guillem},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2022},
pages = {9716-9723},
doi = {10.1609/AAAI.V36I9.21206},
url = {https://mlanthology.org/aaai/2022/correa2022aaai-ff/}
}