.png){kind=icon}
返回
Calculating criticalities
.png){kind=icon}
OA
AI
DOI：10.1016/S0004-3702(96)00019-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a novel method for building ABSTRIPS style abstraction hierarchies in planning. The aim of this method is to minimize search by limiting backtracking both between abstraction levels and within an abstraction level. Previous approaches for building ABSTRIPS style abstractions have determined the criticality of operator preconditions by reasoning about plans directly. Here, we adopt a simpler and faster approach where we use numerical simulation of the planning process, We develop a simple but powerful theory to demonstrate the theoretical advantages of our approach, We use this theory to identify some simple properties lacking in previous approaches but possessed by our method, We demonstrate the empirical advantages of our approach by a set of four benchmark experiments using the ABTWEAK system, We compare the quality of the abstraction hierarchies generated with those built by tie ALPINE and HIGHPOINT algorithms.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
暂无机构信息
.png){kind=icon}
