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.
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.
@inproceedings{Hoeller2021PCP,
title = {From PCP to HTN Planning Through CFGs},
author = {Daniel H\"oller and Songtuan Lin and Kutluhan Erol and Pascal Bercher},
booktitle = {Proceedings of 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},
year = {2021},
pages = {24--25},
abstract = {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.},
url_Paper = {https://bercher.net/publications/2021/Hoeller2021PCP.pdf},
keywords = {various}
}
Downloads: 9
{"_id":"cvAwAX2oBxuy7S4Rk","bibbaseid":"hller-lin-erol-bercher-frompcptohtnplanningthroughcfgs-2021","author_short":["Höller, D.","Lin, S.","Erol, K.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"From PCP to HTN Planning Through CFGs","author":[{"firstnames":["Daniel"],"propositions":[],"lastnames":["Höller"],"suffixes":[]},{"firstnames":["Songtuan"],"propositions":[],"lastnames":["Lin"],"suffixes":[]},{"firstnames":["Kutluhan"],"propositions":[],"lastnames":["Erol"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"booktitle":"Proceedings of 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020)","year":"2021","pages":"24–25","abstract":"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.","url_paper":"https://bercher.net/publications/2021/Hoeller2021PCP.pdf","keywords":"various","bibtex":"@inproceedings{Hoeller2021PCP,\n title = {From PCP to HTN Planning Through CFGs},\n author = {Daniel H\\\"oller and Songtuan Lin and Kutluhan Erol and Pascal Bercher},\n booktitle = {Proceedings of 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {24--25},\n abstract = {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.},\n url_Paper = {https://bercher.net/publications/2021/Hoeller2021PCP.pdf},\n keywords = {various}\n}\n\n","author_short":["Höller, D.","Lin, S.","Erol, K.","Bercher, P."],"key":"Hoeller2021PCP","id":"Hoeller2021PCP","bibbaseid":"hller-lin-erol-bercher-frompcptohtnplanningthroughcfgs-2021","role":"author","urls":{" paper":"https://bercher.net/publications/2021/Hoeller2021PCP.pdf"},"keyword":["various"],"metadata":{"authorlinks":{}},"downloads":9},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["Gq638hec4HPziarNx","CwwGH5wvmKiEdfaxx","aLjytHkdPr9JkDbNN","WvkzCyK6mKXCp2WFz","qncPitCfDDEWyjnht","tQ8b6ys9L948Efi29","rta5EvLvgMEDFTyZk","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["various"],"search_terms":["pcp","htn","planning","through","cfgs","höller","lin","erol","bercher"],"title":"From PCP to HTN Planning Through CFGs","year":2021,"downloads":9}