Search Complexities for HTN Planning

Title of dissertation: SEARCH COMPLEXITIES FOR HTN PLANNING Ronald Alford, Doctor of Philosophy, 2013 Dissertation directed by: Professor Dana Nau Department of Computer Science Hierarchical Task Network (HTN) planning is the problem of decomposing an initial task into a sequence of executable steps. Often viewed as just a way to encode human knowledge to solve classical planning problems faster, HTN planning is more expressive than classical planning, even to the point of being undecidable in the general case. However, HTN planning is not just a way to solve planning problems faster, but is itself a search problem that can benefit from its own distinct search algorithms and heuristics. The dissertation examines the complexities of various HTN planning problem classes in order to motivate the development of heuristic search algorithms for HTN planning which are guaranteed to terminate on a large class of syntactically identifiable problems, as well as domain independent heuristics f...

• Type: Journal
• Year: 2016
• Where: KI
• Authors: Ronald Alford
• Keywords: Artificial Intelligence, KI 2016