An Admissible HTN Planning Heuristic

An Admissible HTN Planning Heuristic. Bercher, P., Behnke, G., Höller, D., & Biundo, S. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), pages 480–488, 2017. IJCAI.

Paper

Slides

Poster doi bibtex 5 downloads

@InProceedings{Bercher2017AdmissibleHTNHeuristic,
  Title      = {An Admissible {HTN} Planning Heuristic},
  Author     = {Pascal Bercher and Gregor Behnke and Daniel H{\"o}ller and Susanne Biundo},
  Year       = {2017},
  Booktitle  = {Proceedings of the 26th International Joint Conference on Artificial Intelligence ({IJCAI} 2017)},
  Publisher  = {IJCAI},
  Pages      = {480--488},
  doi        = {10.24963/ijcai.2017/68},
  keywords   = {Hierarchical task network (HTN) planning is well-known for being an efficient planning approach. This is mainly due to the success of the HTN planning system SHOP2. However, its performance depends on hand-designed search control knowledge. At the time being, there are only very few domain-independent heuristics, which are designed for differing hierarchical planning formalisms. Here, we propose an admissible heuristic for standard HTN planning, which allows to find optimal solutions heuristically. It bases upon the so-called task decomposition graph (TDG), a data structure reflecting reachable parts of the task hierarchy. We show (both in theory and empirically) that rebuilding it during planning can improve heuristic accuracy thereby decreasing the explored search space. The evaluation further studies the heuristic both in terms of plan quality and coverage.},
  url_Paper  = {https://bercher.net/publications/2017/Bercher2017AdmissibleHTNHeuristic.pdf},
  url_Slides = {https://bercher.net/publications/2017/Bercher2017AdmissibleHTNHeuristicSlides.pdf},
  url_Poster = {https://bercher.net/publications/2017/Bercher2017AdmissibleHTNHeuristicPoster.pdf},
  keywords   = {conference}
}

Downloads: 5