Open AccessProceedings Article
HTN planning: complexity and expressivity
Kutluhan Erol,James A. Hendler,Dana S. Nau +2 more
- pp 1123-1128
Reads0
Chats0
TLDR
How the complexity of HTN planning varies with various conditions on the task networks is described.Abstract:
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on the properties of HTN planners. This paper describes how the complexity of HTN planning varies with various conditions on the task networks.read more
Citations
More filters
Book
Artificial Intelligence: A New Synthesis
TL;DR: Intelligent agents are employed as the central characters in this new introductory text and Nilsson gradually increases their cognitive horsepower to illustrate the most important and lasting ideas in AI.
Journal ArticleDOI
SHOP2: an HTN planning system
TL;DR: The SHOP2 planning system as discussed by the authors received one of the awards for distinguished performance in the 2002 International Planning Competition and described the features that enabled it to excel in the competition, especially those aspects of SHOP 2 that deal with temporal and metric planning domains.
Journal ArticleDOI
Recent Advances in AI Planning
TL;DR: A survey of the latest techniques in planning algorithms, with an emphasis on propositional methods such as GRAPHPLAN and compilers that convert planning problems into propositional conjunctive normal form formulas for solution using systematic or stochastic SAT methods.
Proceedings Article
UMCP: a sound and complete procedure for hierarchical task-network planning
TL;DR: This paper presents a formal syntax and semantics for HTn planning and is able to define an algorithm for HTN planning and prove it sound and complete.
Journal ArticleDOI
The 1998 AI Planning Systems Competition
TL;DR: The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, and set up a framework for long-term creation of a repository of problems in a standard notation.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Strips: A new approach to the application of theorem proving to problem solving
Richard Fikes,Nils J. Nilsson +1 more
TL;DR: In this paper, the authors describe a problem solver called STRIPS that attempts to find a sequence of operators in a space of world models to transform a given initial world model in which a given goal formula can be proven to be true.
Journal ArticleDOI
Planning for Conjunctive Goals
TL;DR: Theorems that suggest that efficient general purpose planning with more expressive action representations is impossible are presented, and ways to avoid this problem are suggested.
Proceedings Article
Generating project networks
TL;DR: The planner (NONLIN) and the Task Formalism (TF) used to hierarchically specify a domain are described, which can aid in the generation of project networks.
Related Papers (5)
Strips: A new approach to the application of theorem proving to problem solving
Richard Fikes,Nils J. Nilsson +1 more
The FF planning system: fast plan generation through heuristic search
Jörg Hoffmann,Bernhard Nebel +1 more