From PCP to HTN Planning Through CFGs. Höller, D., Lin, S., Erol, K., & Bercher, P. In Proceedings of 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020), pages 24–25, 2021.
From PCP to HTN Planning Through CFGs [pdf]Paper  abstract   bibtex   9 downloads  
The International Planning Competition in 2020 was the first one for a long time to host tracks on HTN planning. The used benchmark set included a domain describing the undecidable Post Correspondence Problem (PCP). In this paper we describe the two-step process applied to generate HTN problems based on PCP instances. It translates the PCP into a grammar intersection problem of two context-free languages, which is then encoded into an HTN problem.

Downloads: 9