Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free Languages

Daniel Höller. Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free Languages. 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 159-167, AAAI Press, 2021. [doi]

Abstract

Abstract is missing.