• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 382
Next 10 →

Task Interaction in an HTN Planner

by Ilče Georgievski, Er Lazovik, Marco Aiello
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

HTN planning: Complexity and expressivity

by Kutluhan Erol, James Hendler, Dana S. Nau - In AAAI-94 , 1994
"... Most practical work on AI planning systems during the last fteen 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 var ..."
Abstract - Cited by 315 (19 self) - Add to MetaCart
Most practical work on AI planning systems during the last fteen 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

Hatp: An htn planner for robotics

by Lavindra De Silva, Rachid Alami - in 2nd ICAPS Workshop on Planning and Robotics , 2014
"... Hierarchical Task Network (HTN) planning is a popular ap-proach that cuts down on the classical planning search space by relying on a given hierarchical library of domain con-trol knowledge. This provides an intuitive methodology for specifying high-level instructions on how robots and agents should ..."
Abstract - Cited by 3 (3 self) - Add to MetaCart
should perform tasks, while also giving the planner enough flexibility to choose the lower-level steps and their order-ing. In this paper we present the HATP (Hierarchical Agent-based Task Planner) planning framework which extends the traditional HTN planning domain representation and seman

The Fast Downward planning system

by Malte Helmert - Journal of Artifical Intelligence Research , 2006
"... Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other well-known planne ..."
Abstract - Cited by 347 (29 self) - Add to MetaCart
-known planners such as HSP and FF, Fast Downward is a progression planner, searching the space of world states of a planning task in the forward direction. However, unlike other PDDL planning systems, Fast Downward does not use the propositional PDDL representation of a planning task directly. Instead, the input

Efficiently handling temporal knowledge in an HTN planner

by Luis Castillo, Juan Fdez-olivares, Óscar García-pérez, Francisco Palao - In Sixteenth International Conference on Automated Planning and Scheduling, ICAPS , 2006
"... This paper presents some enhancements in the temporal reasoning of a Hierarchical Task Network (HTN) planner, named SIADEX, that, up to authors knowledge, no other HTN planner has. These new features include a sound partial order metric structure, deadlines, temporal landmarking or synchronization c ..."
Abstract - Cited by 40 (19 self) - Add to MetaCart
This paper presents some enhancements in the temporal reasoning of a Hierarchical Task Network (HTN) planner, named SIADEX, that, up to authors knowledge, no other HTN planner has. These new features include a sound partial order metric structure, deadlines, temporal landmarking or synchronization

HTN Planning with . . .

by Shirin Sohrabi, Jorge Baier, Sheila A. McIlraith
"... In this paper, we address the problem of generating preferred plans by combining the procedural control knowledge specified by Hierarchical Task Networks (HTNs) with rich user preferences. To this end, we extend the popular Plan Domain Description Language, PDDL3, to support specification of prefere ..."
Abstract - Add to MetaCart
of preferences over HTN constructs. To compute preferred HTN plans, we propose a branch-and-bound algorithm, together with a set of heuristics that, leveraging HTN structure, measure progress towards satisfaction of preferences. Our preference-based planner, HTNPLAN-P, is implemented as an extension of SHOP2. We

Using Guidelines to Constrain Interactive Case-Based HTN Planning

by Héctor Muñoz-Avila, Daniel C. Mcfarlane, David W. Aha, Len Breslow, James A. Ballas, Dana Nau , 1999
"... This paper describes HICAP, a general purpose and interactive case-based planning architecture. HICAP is a decision support tool for planning a hierarchical course of action. It integrates a hierarchical task editor, HTE, with a conversational case-based planner, NaCoDAE/HTN. HTE maintains a task hi ..."
Abstract - Cited by 35 (21 self) - Add to MetaCart
This paper describes HICAP, a general purpose and interactive case-based planning architecture. HICAP is a decision support tool for planning a hierarchical course of action. It integrates a hierarchical task editor, HTE, with a conversational case-based planner, NaCoDAE/HTN. HTE maintains a task

Complexity Results for HTN Planning

by Kutluhan Erol, James Hendler, Dana S. Nau - Annals of Mathematics and Artificial Intelligence , 1995
"... Most practical work on AI planning systems during the last fteen 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 ..."
Abstract - Cited by 40 (0 self) - Add to MetaCart
Most practical work on AI planning systems during the last fteen 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

2005b. Temporal enhancements of an HTN planner

by Luis Castillo, Juan Fdez-olivares, Óscar García-pérez, Francisco Palao
"... Abstract. This paper presents some enhancements in the temporal reasoning of a Hierarchical Task Network (HTN) planner, named SIADEX, that, up to authors knowledge, no other HTN planner has. These new features include a sound partial order metric structure, deadlines, temporal landmarking or synchro ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Abstract. This paper presents some enhancements in the temporal reasoning of a Hierarchical Task Network (HTN) planner, named SIADEX, that, up to authors knowledge, no other HTN planner has. These new features include a sound partial order metric structure, deadlines, temporal landmarking

1.2 Inclusion of HTN Planners and Studies....................................

by Ilche Georgievski, Marco Aiello , 2014
"... Hierarchies are the most common structure used to understand the world better. In galaxies, for instance, multiple-star systems are organised in a hierarchical system. Then, governmental and company organisations are structured using a hierarchy, while the Internet, which is used on a daily basis, h ..."
Abstract - Add to MetaCart
, has a space of domain names arranged hierarchically. Since Artificial Intelligence (AI) planning portrays information about the world and reasons to solve some of world’s problems, Hierarchical Task Network (HTN) planning has been introduced almost 40 years ago to represent and deal with hierarchies
Next 10 →
Results 1 - 10 of 382
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University