On Guiding Search in HTN Planning with Classical Planning Heuristics
Abstract
Planning is the task of finding a sequence of actions that achieves the goal(s) of an agent. It is solved based on a model describing the environment and how to change it. There are several approaches to solve planning tasks, two of the most popular are classical planning and hierarchical planning. Solvers are often based on heuristic search, but especially regarding domain-independent heuristics, techniques in classical planning are more sophisticated. However, due to the different problem classes, it is difficult to use them in hierarchical planning. In this paper we describe how to use arbitrary classical heuristics in hierarchical planning and show that the resulting system outperforms the state of the art in hierarchical planning.
Cite
Text
Höller et al. "On Guiding Search in HTN Planning with Classical Planning Heuristics." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/857Markdown
[Höller et al. "On Guiding Search in HTN Planning with Classical Planning Heuristics." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/holler2019ijcai-guiding/) doi:10.24963/IJCAI.2019/857BibTeX
@inproceedings{holler2019ijcai-guiding,
title = {{On Guiding Search in HTN Planning with Classical Planning Heuristics}},
author = {Höller, Daniel and Bercher, Pascal and Behnke, Gregor and Biundo, Susanne},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2019},
pages = {6171-6175},
doi = {10.24963/IJCAI.2019/857},
url = {https://mlanthology.org/ijcai/2019/holler2019ijcai-guiding/}
}