Domain-independent planning: representation and plan generation
Artificial Intelligence
Practical planning: extending the classical AI planning paradigm
Practical planning: extending the classical AI planning paradigm
O-Plan: the open planning architecture
Artificial Intelligence
Learning by analogical reasoning in general problem-solving
Learning by analogical reasoning in general problem-solving
HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Hybrid planning for partially hierarchical domains
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
An Argument for a Hybrid HTN/Operator-Based Approach to Planning
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
Planning as Heuristic Search: New Results
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Applications of SHOP and SHOP2
IEEE Intelligent Systems
Task decomposition on abstract states, for planning under nondeterminism
Artificial Intelligence
Combining Domain-Independent Planning and HTN Planning: The Duet Planner
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
SHOP: simple hierarchical ordered planner
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Translating HTNs to PDDL: a small amount of domain knowledge can go a long way
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Information gathering during planning for Web Service composition
Web Semantics: Science, Services and Agents on the World Wide Web
Reactive reasoning and planning
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 2
The GoDeL planning system: a more perfect union of domain-independent and hierarchical planning
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Plan generation is important in a number of agent applications, but such applications generally require elaborate domain models that include not only the definitions of the actions that an agent can perform in a given domain, but also information about the most effective ways to generate plans for the agent in that domain. Such models typically take a large amount of human effort to create. To alleviate this problem, we have developed a hierarchical goal-based planning formalism and a planning algorithm, GDP (Goal-Decomposition Planner), that combines some aspects of both HTN planning and domain-independent planning. For example, it allows the planning agent to use domain-independent heuristic functions to guide the application of both methods and actions. This paper describes the formalism, planning algorithm, correctness theorems, and the results of a large experimental study. The experiments show that our planning algorithm works as well as the well-known SHOP2 HTN planner, using domain models only about half the size of SHOP2's.