@inproceedings{65fcf6682c924bd8937b9f28304dca73,
title = "Flexible FOND HTN Planning: A Complexity Analysis",
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.",
author = "Chen, \{Dillon Z.\} and Pascal Bercher",
note = "Publisher Copyright: {\textcopyright} 2022, Association for the Advancement of Artificial Intelligence.; 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 ; Conference date: 13-06-2022 Through 24-06-2022",
year = "2022",
month = jun,
day = "13",
doi = "10.1609/icaps.v32i1.19782",
language = "English",
volume = "32",
series = "Proceedings International Conference on Automated Planning and Scheduling, ICAPS",
publisher = "Association for the Advancement of Artificial Intelligence",
pages = "26--34",
editor = "Akshat Kumar and Sylvie Thiebaux and Pradeep Varakantham and William Yeoh",
booktitle = "Proceedings of the 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022",
address = "United States",
}