Topic
Hierarchical task network
About: Hierarchical task network is a research topic. Over the lifetime, 502 publications have been published within this topic receiving 15749 citations.
Papers published on a yearly basis
Papers
More filters
Book•
01 Jan 2006TL;DR: This chapter discusses Classical Planning and its Applications, as well as Neoclassical and Neo-Classical Techniques, and discusses search procedures and Computational Complexity.
Abstract: 1 Introduction and Overview I Classical Planning 2 Representations for Classical Planning*3 Complexity of Classical Planning*4 State-Space Planning*5 Plan-Space Planning II Neoclassical Planning 6 Planning-Graph Techniques*7 Propositional Satisfiability Techniques*8 Constraint Satisfaction Techniques III Heuristics and Control Strategies 9 Heuristics in Planning*10 Control Rules in Planning*11 Hierarchical Task Network Planning*12 Control Strategies in Deductive Planning IV Planning with Time and Resources 13 Time for Planning*14 Temporal Planning*15 Planning and Resource Scheduling V Planning under Uncertainty 16 Planning based on Markov Decision Processes*17 Planning based on Model Checking*18 Uncertainty with Neo-Classical Techniques VI Case Studies and Applications 19 Space Applications*20 Planning in Robotics*21 Planning for Manufacturability Analysis*22 Emergency Evacuation Planning *23 Planning in the Game of Bridge VII Conclusion 24 Conclusion and Other Topics VIII Appendices A Search Procedures and Computational Complexity*B First Order Logic*C Model Checking
1,612 citations
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.
Abstract: The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.
838 citations
TL;DR: A sound and complete algorithm is provided to translate OWL-S service descriptions to a SHOP2 domain and it is proved the correctness of the algorithm by showing the correspondence to the situation calculus semantics of OWl-S.
819 citations
Proceedings Article•
01 Aug 1994TL;DR: 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.
747 citations