|
|||||
|
|
| 一致性规划中互斥常量合成方法研究 | |
| 引用本文： | 赵晶晶,刘大有,蔡敦波.一致性规划中互斥常量合成方法研究[J].计算机研究与发展,2012,49(6):1279-1287. |
| 作者姓名： | 赵晶晶 刘大有 蔡敦波 |
| 作者单位： | 1. 吉林大学计算机科学与技术学院 长春 130012;长春工业大学工商管理学院 长春130012;符号计算与知识工程教育部重点实验室(吉林大学) 长春 130012 2. 吉林大学计算机科学与技术学院 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学) 长春 130012 3. 符号计算与知识工程教育部重点实验室(吉林大学) 长春 130012 |
| 摘 要： | 为压缩一致性规划的状态空间,并加快一致性规划的求解速度,将常量引入到一致性规划中,定义一致性规划中的常量,形成新的知识表示"多值一致性规划任务",定义多值一致性规划动作模型,提出一致性规划常量合成方法,给出一致性规划常量合成算法.该方法利用常量的特性在所有初始世界状态和所有实例动作中猜测、验证常量.理论分析和实验结果表明该算法能合成正确的一致性规划常量,生成多值一致性规划任务.为说明一致性规划常量的应用效果,把生成的多值一致性规划任务与规划解重用启发式结合求一致性规划解,并与规划系统CFF进行对比实验.实验结果表明求解质量和效率较高. |
| 关 键 词： | 智能规划 多值规划任务 一致性规划 常量合成 启发式应用 |
Invariant Synthesis for Conformant Planning |
|
| Zhao Jingjing , Liu Dayou , Cai Dunbo.Invariant Synthesis for Conformant Planning[J].Journal of Computer Research and Development,2012,49(6):1279-1287. | |
| Authors: | Zhao Jingjing Liu Dayou Cai Dunbo |
| Affiliation: | 1(College of Computer Science and Technology,Jilin University,Changchun 130012) 2(College of Business Administration,Changchun University of Technology,Changchun 130012) 3(Key Laboratory of Symbolic Computation and Knowledge Engineering(Jilin University),Ministry of Education,Changchun 130012) |
| Abstract: | In order to compress the state space and accelerate the speed of conformant planning,invariants are introduced into conformant planning.Invariants of conformant planning are defined formally,and new knowledge representation "multi-valued conformant planning task" is given.The action model of multi-valued conformant planning is defined accordingly.An invariant synthesis method is proposed for conformant planning and a conformant invariant synthesis algorithm is specified.The synthesis method guesses candidates of invariants firstly.Then the synthesis method tests candidates among all initial world states and all actions according to the properties of conformant invariants.Some candidates are given up and some candidates are modified to form new candidates for testing again.Other candidates are proved to be invariants.Theoretical analysis and experimental results show that the algorithm can synthesize correct invariants and produce multi-value conformant planning tasks.For conformant planning,multi-valued conformant task can greatly compress the state space than Boolean codes used by conformant planning.In order to specify the application of the conformant invariants,the heuristics of reusing plan is combined with the multi-valued conformant tasks for solving the conformant tasks.The comparative experiments with planning system CFF are conducted for testing the efficiency and quality of the combination.Experimental results show that this combination is better than planning system CFF in some domains. |
| Keywords: | intelligent planning multi-valued planning task conformant planning invariant synthesis heuristics application |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
