@InProceedings{Chen2021FlexibleFONDHTNs,
  author     = {Dillon Chen and Pascal Bercher},
  title      = {The Complexity of Flexible FOND HTN Planning},
  booktitle  = {Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)},
  year       = {2021},
  pages      = {62--70},
  abstract   = {Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated as a first choice to address real-world problems. Yet only a few extensions exist that can deal with the many challenges encountered in the real world. One of them is the capability to express uncertainty. Recently, a new HTN formalism for Fully Observable Nondeterministic (FOND) 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 conduct a complexity study of an alternative, more flexible formalism and provide tight complexity bounds for most of the investigated special cases of the problem.},
  url_Paper  = {https://bercher.net/publications/2021/Chen2021FlexibleFONDHTNs.pdf},
  keywords   = {workshop}
}

{"_id":"mZJ9nrGqR3wBT54qu","bibbaseid":"chen-bercher-thecomplexityofflexiblefondhtnplanning-2021","author_short":["Chen, D.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Dillon"],"propositions":[],"lastnames":["Chen"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"title":"The Complexity of Flexible FOND HTN Planning","booktitle":"Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)","year":"2021","pages":"62–70","abstract":"Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated as a first choice to address real-world problems. Yet only a few extensions exist that can deal with the many challenges encountered in the real world. One of them is the capability to express uncertainty. Recently, a new HTN formalism for Fully Observable Nondeterministic (FOND) 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 conduct a complexity study of an alternative, more flexible formalism and provide tight complexity bounds for most of the investigated special cases of the problem.","url_paper":"https://bercher.net/publications/2021/Chen2021FlexibleFONDHTNs.pdf","keywords":"workshop","bibtex":"@InProceedings{Chen2021FlexibleFONDHTNs,\n author = {Dillon Chen and Pascal Bercher},\n title = {The Complexity of Flexible FOND HTN Planning},\n booktitle = {Proceedings of the 4th ICAPS Workshop on Hierarchical Planning (HPlan 2021)},\n year = {2021},\n pages = {62--70},\n abstract = {Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated as a first choice to address real-world problems. Yet only a few extensions exist that can deal with the many challenges encountered in the real world. One of them is the capability to express uncertainty. Recently, a new HTN formalism for Fully Observable Nondeterministic (FOND) 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 conduct a complexity study of an alternative, more flexible formalism and provide tight complexity bounds for most of the investigated special cases of the problem.},\n url_Paper = {https://bercher.net/publications/2021/Chen2021FlexibleFONDHTNs.pdf},\n keywords = {workshop}\n}\n\n","author_short":["Chen, D.","Bercher, P."],"key":"Chen2021FlexibleFONDHTNs","id":"Chen2021FlexibleFONDHTNs","bibbaseid":"chen-bercher-thecomplexityofflexiblefondhtnplanning-2021","role":"author","urls":{" paper":"https://bercher.net/publications/2021/Chen2021FlexibleFONDHTNs.pdf"},"keyword":["workshop"],"metadata":{"authorlinks":{}},"downloads":1},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["jTtEZEw8NJc375xGA","T9LQLt3D2MDhrCfjh","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["workshop"],"search_terms":["complexity","flexible","fond","htn","planning","chen","bercher"],"title":"The Complexity of Flexible FOND HTN Planning","year":2021,"downloads":1}