基于静态前提的谓词知识树分解策略  

Decomposition Strategy for Knowledge Tree of Predicate Based on Static Preconditions

作　　者：边芮[1] 吴向军[2] 陈蔼祥[3] BIAN Rui WU Xiang-jun CHEN Ai-xiang(School of Public Management, Guangdong University of Finance and Economics, Guangzhou 510320, China）1 （Software School, Sun Yat-sen University, Guangzhou 510006, China） z （School of Mathematics and Statistics, Guangdong University of Finance and Economies, Guangzhou 510320, China）3)

机构地区：[1]广东财经大学公共管理学院,广州510320 [2]中山大学软件学院,广州510006 [3]广东财经大学数学与统计学院,广州510320

出　　处：《计算机科学》2017年第1期235-242,270,共9页Computer Science

基　　金：国家自然科学基金(71272084);广东高校优秀青年创新人才培养计划(育苗工程)项目(2012LYM_0065);广东财经大学自然科学研究项目(11BS52001)资助

摘　　要：智能规划问题实质是一种搜索问题,通常需采用某种策略来缩小搜索空间,提高规划效率。在"以谓词为主体"的规划求解方法中,规划树的生成效率将直接影响规划求解效率。为此,提出了基于静态前提的谓词知识树分解策略,并给出了相应的分解算法。对任意一个规划领域,利用该分解算法可将知识树分解成若干个较小规模的知识子树。在规划求解的过程中,利用知识子树可有效地减少搜索空间,从而快速生成规划树,提高规划效率。同时,利用知识子树还可提取出隐含在动作描述中的领域知识。实验结果表明该分解算法是有效的。AI planning is essentially a search problem, usually using some strategies to reduce the search space, impro- ving planning efficiency. In the planning method of taking the predicate as target, the efficiency of planning tree genera- tion will affect planning efficiency directly. Therefore, this paper proposesd a decomposition strategy for knowledge tree of predicate based on the static preconditions, and gave the corresponding decomposition algorithm. For any domain, using the algorithm, knowledge tree of predicate can be decomposed into a number of smaller knowledge sub-trees. The use of knowledge sub-trees in planning process can reduce the search space effectively, thus generating plan tree quickly and improving the planning efficiency. At the same time, the domain knowledge is extracted from the domain with them. Finally.the experiment results show that decomposition algorithm is efficient.

关 键 词：智能规划 知识树 静态前提 分解策略 

分 类 号：TP182[自动化与计算机技术—控制理论与控制工程]