Fully Observable Nondeterministic HTN Planning - Formalisation and Complexity Results

Dillon Chen, Pascal Bercher. Fully Observable Nondeterministic HTN Planning - Formalisation and Complexity Results. In Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang 0001, Hankz Hankui Zhuo, editors, Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICASP 2021, Guangzhou, China (virtual), August 2-13, 2021. pages 74-84, AAAI Press, 2021. [doi]

@inproceedings{ChenB21-4,
  title = {Fully Observable Nondeterministic HTN Planning - Formalisation and Complexity Results},
  author = {Dillon Chen and Pascal Bercher},
  year = {2021},
  url = {https://ojs.aaai.org/index.php/ICAPS/article/view/15949},
  researchr = {https://researchr.org/publication/ChenB21-4},
  cites = {0},
  citedby = {0},
  pages = {74-84},
  booktitle = {Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICASP 2021, Guangzhou, China (virtual), August 2-13, 2021},
  editor = {Susanne Biundo and Minh Do and Robert Goldman and Michael Katz and Qiang Yang 0001 and Hankz Hankui Zhuo},
  publisher = {AAAI Press},
  isbn = {978-1-57735-867-1},
}