Can AI planners solve practical problems?
Computational Intelligence
O-Plan: the open planning architecture
Artificial Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
HTN planning: complexity and expressivity
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Least-cost flaw repair: a plan refinement strategy for partial-order planning
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
UM Translog: a planning domain for the development and benchmarking of planning systems
UM Translog: a planning domain for the development and benchmarking of planning systems
Fast planning through planning graph analysis
Artificial Intelligence
Backtrack programming techniques
Communications of the ACM
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
Flaw selection strategies for partial-order planning
Journal of Artificial Intelligence Research
IJCAI'77 Proceedings of the 5th international joint conference on Artificial intelligence - Volume 2
The downward refinement property
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Search rearrangement backtracking and polynomial average time
Artificial Intelligence
Total-order multi-agent task-network planning for contract bridge
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Commitment strategies in hierarchical task network planning
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Top-down search for coordinating the hierarchical plans of multiple agents
Proceedings of the third annual conference on Autonomous Agents
Theory for coordinating concurrent hierarchical planning agents using summary information
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Performance of Coordinating Concurrent Hierarchical Planning Agents Using Summary Information
ATAL '00 Proceedings of the 7th International Workshop on Intelligent Agents VII. Agent Theories Architectures and Languages
On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm
Journal of Artificial Intelligence Research
Abstract reasoning for planning and coordination
Journal of Artificial Intelligence Research
A weighted CSP approach to cost-optimal planning
AI Communications
Hi-index | 0.00 |
One difficulty with existing theoretical work on HTN planning is that it does not address some of the planning constructs that are commonly used in HTN planners for practical applications. Although such constructs can make it difficult to ensure the soundness and completeness of HTN planning, they are important because they can greatly improve the efficiency of planning in practice. In this paper, we describe a way to achieve some of the advantages of such constructs while preserving soundness and completeness, through the use of what we will call external conditions. We describe how to detect some kinds of external conditions automatically by preprocessing the planner's knowledge base, and how to use this knowledge to improve the efficiency of the planner's refinement strategy. We present experimental results showing that by making use of external conditions as described here, an HTN planner can be significantly more efficient and scale better to large problems.