@inproceedings{Lotinac2021Learned,
  title     = {Hierarchical Task Networks Generated Using Invariant Graphs for {IPC}2020},
  author    = {Lotinac, Damir and Kominis, Filippos and Jonsson, Anders},
  booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},
  year      = {2021},
  pages     = {26--30},
  url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p35-p39.pdf},
  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.}
}

{"_id":"oPucGRXcTBhytgg6Y","bibbaseid":"lotinac-kominis-jonsson-hierarchicaltasknetworksgeneratedusinginvariantgraphsforipc2020-2021","author_short":["Lotinac, D.","Kominis, F.","Jonsson, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"Hierarchical Task Networks Generated Using Invariant Graphs for IPC2020","author":[{"propositions":[],"lastnames":["Lotinac"],"firstnames":["Damir"],"suffixes":[]},{"propositions":[],"lastnames":["Kominis"],"firstnames":["Filippos"],"suffixes":[]},{"propositions":[],"lastnames":["Jonsson"],"firstnames":["Anders"],"suffixes":[]}],"booktitle":"Proceedings of the 10th International Planning Competition: Planner and Domain Abstracts – Hierarchical Task Network (HTN) Planning Track (IPC 2020)","year":"2021","pages":"26–30","url_paper":"https://ipc2020.hierarchical-task.net/publications/proceedings_p35-p39.pdf","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.","bibtex":"@inproceedings{Lotinac2021Learned,\n title = {Hierarchical Task Networks Generated Using Invariant Graphs for {IPC}2020},\n author = {Lotinac, Damir and Kominis, Filippos and Jonsson, Anders},\n booktitle = {Proceedings of the 10th {I}nternational {P}lanning {C}ompetition: Planner and Domain Abstracts -- Hierarchical Task Network (HTN) Planning Track (IPC 2020)},\n year = {2021},\n pages = {26--30},\n url_paper = {https://ipc2020.hierarchical-task.net/publications/proceedings_p35-p39.pdf},\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}\n\n","author_short":["Lotinac, D.","Kominis, F.","Jonsson, A."],"key":"Lotinac2021Learned","id":"Lotinac2021Learned","bibbaseid":"lotinac-kominis-jonsson-hierarchicaltasknetworksgeneratedusinginvariantgraphsforipc2020-2021","role":"author","urls":{" paper":"https://ipc2020.hierarchical-task.net/publications/proceedings_p35-p39.pdf"},"metadata":{"authorlinks":{}},"downloads":1,"html":""},"bibtype":"inproceedings","biburl":"https://ipc2020.hierarchical-task.net/bibtex/IPC-2020-papers.bib","dataSources":["CwwGH5wvmKiEdfaxx","qncPitCfDDEWyjnht","9E2GyZaRgNKMmBhLD","tQ8b6ys9L948Efi29"],"keywords":[],"search_terms":["hierarchical","task","networks","generated","using","invariant","graphs","ipc2020","lotinac","kominis","jonsson"],"title":"Hierarchical Task Networks Generated Using Invariant Graphs for IPC2020","year":2021,"downloads":1}