Hierarchical task network
In artificial intelligence, hierarchical task network (HTN) planning is an approach to automated planning in which the dependency among actions can be given in the form of hierarchically structured networks.
Planning problems are specified in the hierarchical task network approach by providing a set of tasks, which can be:
- primitive (initial state) tasks, which roughly correspond to the actions of STRIPS;
- compound tasks (intermediate state), which can be seen as composed of a set of simpler tasks;
- goal tasks (goal state), which roughly corresponds to the goals of STRIPS, but are more general.
A solution to an HTN problem is then an executable sequence of primitive tasks that can be obtained from the initial task network by decomposing compound tasks into their set of simpler tasks, and by inserting ordering constraints.
A primitive task is an action that can be executed directly given the state in which it is executed supports its precondition. A compound task is a complex task composed of a partially ordered set of further tasks, which can either be primitive or abstract. A goal task is a task of satisfying a condition. The difference between primitive and other tasks is that the primitive actions can be directly executed. Compound and goal tasks both require a sequence of primitive actions to be performed; however, goal tasks are specified in terms of conditions that have to be made true, while compound tasks can only be specified in terms of other tasks via the task network outlined below.
Constraints among tasks are expressed in the form of networks, called (hierarchical) task networks. A task network is a set of tasks and constraints among them. Such a network can be used as the precondition for another compound or goal task to be feasible. This way, one can express that a given task is feasible only if a set of other actions (those mentioned in the network) are done, and they are done in such a way that the constraints among them (specified by the network) are satisfied. One particular formalism for representing hierarchical task networks that has been fairly widely used is TAEMS.
Some of the best-known domain-independent HTN-planning systems are:
- NOAH, Nets of Action Hierarchies.[1]
- Nonlin, one of the first HTN planning systems.[2]
- SIPE-2[3]
- O-Plan, Open Planning Architecture[4]
- UMCP, the first probably sound and complete HTN planning systems.[5]
- I-X/I-Plan[6]
- SHOP2, a HTN-planner developed at University of Maryland, College Park.[7]
- PANDA, a system designed for hybrid planning, an extension of HTN planning developed at Ulm University, Germany.[8]
- HTNPlan-P, preference-based HTN planning.[9]
HTN planning is strictly more expressive than STRIPS, to the point of being undecidable in the general case.[10] However, many syntactic restrictions of HTN planning are decidable, with known complexities ranging from NP-complete to 2-EXPSPACE-complete,[11] and some HTN problems can be efficiently compiled into PDDL, a STRIPS-like language.[12]
See also
[edit]- STRIPS
- Hierarchical control system - a feedback control system well suited for HTN planning
References
[edit]- ^ NOAH
- ^ Nonlin
- ^ David E. Wilkins. "SIPE-2: System for Interactive Planning and Execution". Artificial Intelligence Center. SRI International. Retrieved 2013-06-13.
- ^ O-Plan
- ^ UMCP
- ^ I-X/I-Plan
- ^ SHOP2
- ^ PANDA
- ^ HTNPlan-P
- ^ Erol, Kutluhan; Hendler, James; Nau, Dana S. (1996). "Complexity results for htn planning" (PDF). Annals of Mathematics and Artificial Intelligence. 18. Springer: 69–93. Retrieved 8 February 2015.
- ^ Alford, Ron; Bercher, Pascal; Aha, David (June 2015). Tight Bounds for HTN Planning (PDF). Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS). Retrieved 8 February 2015.[permanent dead link]
- ^ Alford, Ron; Kuter, Ugur; Nau, Dana S. (July 2009). Translating HTNs to PDDL: A small amount of domain knowledge can go a long way (PDF). Twenty-First International Joint Conference on Artificial Intelligence (IJCAI). Retrieved 8 February 2015.