Analyzing External Conditions to Improve the Efficiency of HTN Planning
نویسندگان
چکیده
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.
منابع مشابه
A Critical Look at Critics in HTN Planning
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have provided extra efficiency and flexibility to HTN planning systems, but their procedural –and sometimes domain-specific – nature has not been amenable to analytical studies. As a result, little work is...
متن کاملComparing Partial Order Planning and Task Reduction Planning: A preliminary report
Although task reduction (HTN) planning historically preceded partial order (PO) planning, and is understood to be more general than the latter, very little analysis has been done regarding its performance. Part of the reason for this has been the lack of systematic understanding of the functionalities provided by HTN planning over and above that of partial order planning. HTN planning has been ...
متن کاملHTN Problem Spaces: Structure, Algorithms, Termination
For HTN planning, we formally characterize and classify four kinds of problem spaces in which each node represents a planning problem or subproblem. Two of the problem spaces are searched by current HTN planning algorithms; the other two problem spaces are new. This enables us to provide: • Sufficient (and in one case, necessary) conditions for finiteness of each kind of problem space. The cond...
متن کاملAnalyzing the Impact of Service Accessibility Enhancement on Urban Energy Efficiency Based on GIS Network Analysis
متن کامل
HTN Planning: Complexity and Expressivity
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) d ecomposition, 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 various conditions on the task networks. networks are required to be totally ordered, and (3) whe...
متن کامل