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.
11-964: HTN can refer to: Computing [ edit ] Hierarchical task network , planning formalism in artificial intelligence " Homesteading the Noosphere ", essay on computer programming Medicine [ edit ] Hypertension Organisations [ edit ] Home Theater Network , defunct movie subscription service Houghton Mifflin , now part of Houghton Mifflin Harcourt Hughes Television Network , defunct American television network Transport [ edit ] Hammonton station , New Jersey, United States Hathiyan railway station , Pakistan Hatton railway station, Sri Lanka Hatton (Warwickshire) railway station , England Hotan Airport , Xinjiang, China Houten railway station , Netherlands Topics referred to by
22-422: A STRIPS-like language. Task analysis environment modeling simulation Task Analysis, Environment Modeling, and Simulation (TAEMS or TÆMS) is a problem domain independent modeling language used to describe the task structures and the problem-solving activities of intelligent agents in a multi-agent environment. The intelligent agent operates in environments where: The modeling language represents
33-429: 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
44-404: 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
55-491: A task structure including the quantitative representation of complex task interrelationships, with the task structure model divided into generative, objective, and subjective viewpoints. The generative viewpoint describes the statistical characteristics required to generate the objective and subjective episodes in an environment; it is a workload generator. The objective viewpoint is the actual, real, instantiated task structures that are present in an episode. The subjective viewpoint
66-416: A task structure so that an intelligent agent can reason about its potential actions in the context of its working environment. The intelligent agent needs to determine what goals can and should be achieved, and what actions are needed to achieve those goals. This includes determining the implications of those actions, and of actions performed by other agents in the environment. The modeling language represents
77-405: Is TAEMS . Some of the best-known domain-independent HTN-planning systems are: HTN planning is strictly more expressive than STRIPS , to the point of being undecidable in the general case. However, many syntactic restrictions of HTN planning are decidable, with known complexities ranging from NP-complete to 2-EXPSPACE-complete , and some HTN problems can be efficiently compiled into PDDL ,
88-431: 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
99-506: Is different from Wikidata All article disambiguation pages All disambiguation pages Hierarchical task network Planning problems are specified in the hierarchical task network approach by providing a set of tasks, which can be: 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
110-493: Is the view that the agents have of objective reality. Coordination of agents is accomplished by the Generalized Partial Global Planning (GPGP) family of algorithms that are used to respond to particular features of the task structure. GPGP is a cooperative (team-oriented) coordination component that is built of modular mechanisms that work in conjunction with, but do not replace, a fully functional agent with
121-403: The same term [REDACTED] This disambiguation page lists articles associated with the title HTN . If an internal link led you here, you may wish to change the link to point directly to the intended article. Retrieved from " https://en.wikipedia.org/w/index.php?title=HTN&oldid=1217793700 " Category : Disambiguation pages Hidden categories: Short description
SECTION 10
#1732858574619#618381