Complexity results for HTN planning

DOI10.1007/BF02136175zbMath0891.68104WikidataQ62046403 ScholiaQ62046403MaRDI QIDQ1380419

Kutluhan Erol, Dana S. Nau, James A. Hendler

Publication date: 4 March 1998

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

hierarchical task networkSTRIPS-style planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Decidability and complexity of action-based temporal planning over dense time, Task decomposition on abstract states, for planning under nondeterminism, On the dynamic logic of agency and action, HTN-like solutions for classical planning problems: an application to BDI agent systems, Multiple perspective dynamic decision making, Estimating the probability of meeting a deadline in schedules and plans, Complexity, decidability and undecidability results for domain-independent planning

Cites Work

• Unnamed Item
• Unnamed Item
• Planning for conjunctive goals
• STRIPS: A new approach to the application of theorem proving to problem solving
• A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages