Global Information Lookup Global Information

Hierarchical task network information


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:

  1. primitive (initial state) tasks, which roughly correspond to the actions of STRIPS;
  2. compound tasks (intermediate state), which can be seen as composed of a set of simpler tasks;
  3. 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]

  1. ^ NOAH
  2. ^ Nonlin
  3. ^ David E. Wilkins. "SIPE-2: System for Interactive Planning and Execution". Artificial Intelligence Center. SRI International. Retrieved 2013-06-13.
  4. ^ O-Plan
  5. ^ UMCP
  6. ^ I-X/I-Plan
  7. ^ SHOP2
  8. ^ PANDA
  9. ^ HTNPlan-P
  10. ^ 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.
  11. ^ 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.
  12. ^ 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.

and 27 Related for: Hierarchical task network information

Request time (Page generated in 1.0043 seconds.)

Hierarchical task network

Last Update:

form of hierarchically structured networks. Planning problems are specified in the hierarchical task network approach by providing a set of tasks, which...

Word Count : 626

Hierarchy

Last Update:

modeling Hierarchical modulation Hierarchical proportion Hierarchical radial basis function Hierarchical storage management Hierarchical task network Hierarchical...

Word Count : 5951

Default mode network

Last Update:

certain goal-oriented tasks and was sometimes referred to as the task-negative network, in contrast with the task-positive network. This nomenclature is...

Word Count : 7014

Recurrent neural network

Last Update:

Bergson, whose philosophical views have inspired hierarchical models. Hierarchical recurrent neural networks are useful in forecasting, helping to predict...

Word Count : 8081

Deep learning

Last Update:

based on hierarchical generative models and deep belief networks, may be closer to biological reality. In this respect, generative neural network models...

Word Count : 17587

Hierarchical control system

Last Update:

world model and performing planning. A hierarchical task network is a good fit for planning in a hierarchical control system. Besides artificial systems...

Word Count : 1328

Network model

Last Update:

arcs, is not restricted to being a hierarchy or lattice. The network model was adopted by the CODASYL Data Base Task Group in 1969 and underwent a major...

Word Count : 568

Behavior selection algorithm

Last Update:

Finite-state machines Hierarchical finite-state machines Decision trees Behavior trees Hierarchical task networks Hierarchical control systems Utility...

Word Count : 166

Stanford Research Institute Problem Solver

Last Update:

higher layer. Action description language (ADL) Automated planning Hierarchical task network Planning Domain Definition Language (PDDL) Sussman anomaly Richard...

Word Count : 1433

HTN

Last Update:

HTN can refer to: Hierarchical task network, planning formalism in artificial intelligence "Homesteading the Noosphere", essay on computer programming...

Word Count : 101

Task analysis environment modeling simulation

Last Update:

artificial intelligence Cooperative distributed problem solving STRIPS Hierarchical task network Keith S. Decker (1995). "Environment Centered Analysis and Design...

Word Count : 418

Simple Network Management Protocol

Last Update:

Suite as defined by the Internet Engineering Task Force (IETF). It consists of a set of standards for network management, including an application layer...

Word Count : 5033

Hierarchy of evidence

Last Update:

within-group variability, which can only be done if the hierarchy of evidence is replaced by a network that takes into account the relationship between epidemiological...

Word Count : 3997

Types of artificial neural networks

Last Update:

characteristics of both HB and deep networks. The compound HDP-DBM architecture is a hierarchical Dirichlet process (HDP) as a hierarchical model, incorporating DBM...

Word Count : 10294

Network Time Protocol

Last Update:

time from an SNTP source. NTP uses a hierarchical, semi-layered system of time sources. Each level of this hierarchy is termed a stratum and is assigned...

Word Count : 5898

Action description language

Last Update:

Effect: ¬At(p, from) ^ At(p, to) ) Action language Action selection Hierarchical task network Planning Domain Definition Language (PDDL) Edwin Pednault. "IBM...

Word Count : 1850

Computer network

Last Update:

performance of packet-switched networks, which underpinned the development of the ARPANET. His theoretical work on hierarchical routing in the late 1970s with...

Word Count : 11021

Bayesian hierarchical modeling

Last Update:

Bayesian hierarchical modelling is a statistical model written in multiple levels (hierarchical form) that estimates the parameters of the posterior distribution...

Word Count : 3630

Automated planning and scheduling

Last Update:

describing planning problems is that of hierarchical task networks, in which a set of tasks is given, and each task can be either realized by a primitive...

Word Count : 2247

Local Interconnect Network

Last Update:

for hierarchical networks. Operating voltage of 12 V. Data is transferred across the bus in fixed-form messages of selectable lengths. The master task transmits...

Word Count : 2996

Unsupervised learning

Last Update:

Neural network tasks are often categorized as discriminative (recognition) or generative (imagination). Often but not always, discriminative tasks use supervised...

Word Count : 2431

Organizational structure

Last Update:

resemble later consultation rather than vertical command”. Network organizations lack the hierarchical aspects of other structures and are characterized by...

Word Count : 6304

Upstream server

Last Update:

move in opposite ways. It is not used when discussing hierarchical routing or hierarchical network topologies, as packets can be transferred both ways....

Word Count : 232

Convolutional deep belief network

Last Update:

Ranganath; Andrew Ng. "Convolutional Deep Belief Networks for Scalable Unsupervised Learning of Hierarchical Representations" (PDF). {{cite journal}}: Cite...

Word Count : 204

Bayesian network

Last Update:

shrinkage is a typical behavior in hierarchical Bayes models. Some care is needed when choosing priors in a hierarchical model, particularly on scale variables...

Word Count : 6628

Markov model

Last Update:

information, such as in what task or activity the person is performing. Two kinds of Hierarchical Markov Models are the Hierarchical hidden Markov model and...

Word Count : 1201

Hierarchical Data Format

Last Update:

originally dubbed AEHOO (All Encompassing Hierarchical Object Oriented format) began in 1987 by the Graphics Foundations Task Force (GFTF) at the National Center...

Word Count : 1332

PDF Search Engine © AllGlobal.net