On Guiding Search in HTN Planning with Classical Planning Heuristics

On Guiding Search in HTN Planning with Classical Planning Heuristics. Höller, D., Bercher, P., Behnke, G., & Biundo, S. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019), pages 6171–6175, 2019. IJCAI.

Paper doi abstract bibtex 2 downloads

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.

@InProceedings{Hoeller2019HeuristicEncoding,
   author    = {Daniel H{\"o}ller and Pascal Bercher and Gregor Behnke and Susanne Biundo},
   title     = {On Guiding Search in {HTN} Planning with Classical Planning Heuristics},
   pages     = {6171--6175},
   year      = {2019},
   publisher = {IJCAI},
   booktitle = {Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI 2019)},
   doi       = {10.24963/ijcai.2019/857},
   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.},
   url_Paper  = {https://bercher.net/publications/2019/Hoeller2019HeuristicEncoding.pdf},
  keywords    = {conference}
}

Downloads: 2