@InProceedings{Chen2022FlexibleFONDHTNs,
  author                    = {Dillon Z. Chen and Pascal Bercher},
  booktitle                 = {Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022)},
  title                     = {Flexible FOND HTN planning: A Complexity Analysis},
  year                      = {2022},
  pages                     = {26--34},
  doi                       = {10.1609/icaps.v32i1.19782},
  publisher                 = {AAAI Press},
  abstract                  = {Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated to address real-world problems. Yet few extensions exist that can deal with the many challenges encountered in the real world, one being the capability to express uncertainty. Recently, a new HTN formalism for fully observable nondeterministic problems was proposed and studied theoretically. In this paper, we lay out limitations of that formalism and propose an alternative definition, which addresses and resolves such limitations. We also study its complexity for certain problems.},
  url_Paper                 = {https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNs.pdf},
  url_Poster                = {https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsPoster.pdf},
  url_Slides                = {https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsSlides.pdf},
  url_video_of_presentation = {http://icaps22.icaps-conference.org/papers/187/index.html},
  note                      = {<b><i>This paper won the ICAPS 2022 Best Undergraduate Student Paper Award</i></b>}
}

{"_id":"qsJeNRsBrAGeW3Xiq","bibbaseid":"chen-bercher-flexiblefondhtnplanningacomplexityanalysis-2022","author_short":["Chen, D. Z.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Dillon","Z."],"propositions":[],"lastnames":["Chen"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"booktitle":"Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022)","title":"Flexible FOND HTN planning: A Complexity Analysis","year":"2022","pages":"26–34","doi":"10.1609/icaps.v32i1.19782","publisher":"AAAI Press","abstract":"Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated to address real-world problems. Yet few extensions exist that can deal with the many challenges encountered in the real world, one being the capability to express uncertainty. Recently, a new HTN formalism for fully observable nondeterministic problems was proposed and studied theoretically. In this paper, we lay out limitations of that formalism and propose an alternative definition, which addresses and resolves such limitations. We also study its complexity for certain problems.","url_paper":"https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNs.pdf","url_poster":"https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsPoster.pdf","url_slides":"https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsSlides.pdf","url_video_of_presentation":"http://icaps22.icaps-conference.org/papers/187/index.html","note":"<b><i>This paper won the ICAPS 2022 Best Undergraduate Student Paper Award</i></b>","bibtex":"@InProceedings{Chen2022FlexibleFONDHTNs,\n author = {Dillon Z. Chen and Pascal Bercher},\n booktitle = {Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022)},\n title = {Flexible FOND HTN planning: A Complexity Analysis},\n year = {2022},\n pages = {26--34},\n doi = {10.1609/icaps.v32i1.19782},\n publisher = {AAAI Press},\n abstract = {Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated to address real-world problems. Yet few extensions exist that can deal with the many challenges encountered in the real world, one being the capability to express uncertainty. Recently, a new HTN formalism for fully observable nondeterministic problems was proposed and studied theoretically. In this paper, we lay out limitations of that formalism and propose an alternative definition, which addresses and resolves such limitations. We also study its complexity for certain problems.},\n url_Paper = {https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNs.pdf},\n url_Poster = {https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsPoster.pdf},\n url_Slides = {https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsSlides.pdf},\n url_video_of_presentation = {http://icaps22.icaps-conference.org/papers/187/index.html},\n note = {<b><i>This paper won the ICAPS 2022 Best Undergraduate Student Paper Award</i></b>}\n}\n\n","author_short":["Chen, D. Z.","Bercher, P."],"key":"Chen2022FlexibleFONDHTNs","id":"Chen2022FlexibleFONDHTNs","bibbaseid":"chen-bercher-flexiblefondhtnplanningacomplexityanalysis-2022","role":"author","urls":{" paper":"https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNs.pdf"," poster":"https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsPoster.pdf"," slides":"https://bercher.net/publications/2022/Chen2022FlexibleFONDHTNsSlides.pdf"," video of presentation":"http://icaps22.icaps-conference.org/papers/187/index.html"},"metadata":{"authorlinks":{}},"downloads":35},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["zKgS72cAu6Ez7npdh","Dv9ACZYWLXYQhNhm2","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":[],"search_terms":["flexible","fond","htn","planning","complexity","analysis","chen","bercher"],"title":"Flexible FOND HTN planning: A Complexity Analysis","year":2022,"downloads":35}