AAAI

Association for the Advancement of Artificial Intelligence

Home / Proceedings / Proceedings of the International Symposium on Combinatorial Search

HTN Problem Spaces: Structure, Algorithms, Termination

Download PDF

Authors

Ron Alford,Vikas Shivashankar,Ugur Kuter,Dana Nau

University of Maryland, College Park,University of Maryland, College Park,SIFT, LLC,University of Maryland, College Park


DOI:

10.1609/socs.v3i1.18239


Abstract:

For HTN planning, we formally characterize and classify four kinds of problem spaces in which each node represents a planning problem or subproblem. Two of the problem spaces are searched by current HTN planning algorithms; the other two problem spaces are new.This enables us to provide: