首页 | 本学科首页   官方微博 | 高级检索  
     

GP——基于规划图的遗传规划算法
引用本文:陈蔼祥,姜云飞,张学农,刘国英.GP——基于规划图的遗传规划算法[J].计算机学报,2007,30(1):153-160.
作者姓名:陈蔼祥  姜云飞  张学农  刘国英
作者单位:中山大学软件研究所 广州510275(陈蔼祥,姜云飞),中山大学软件研究所 广州510275广东药学院网络信息中心广州510224(张学农),长沙理工大学计算机与通信工程学院 长沙410076(刘国英)
摘    要:图规划是智能规划领域近年来出现的一种新的规划方法,对智能规划的发展有着重要的影响.图规划的规划产生过程分为两个主要步骤,首先用动作的前提条件和效果产生一个谓词和动作交错出现的图--规划图,然后在规划图中抽取规划解.而第二步往往更为困难和耗时.文章依据遗传算法对规划图提出一种新的解抽取方法,以一种简明、直观的形式给出染色体的编码方式,并在此基础上定义了各种遗传操作算子,将遗传算法引入图规划算法,充分利用遗传算法的并行全局搜索能力实现规划解的搜索.实验表明,在求解大规模的规划问题时,文中的遗传规划算法在求解速度和找到的规划解的质量两方面均显示出优越性.

关 键 词:智能规划  规划图  遗传算法  并行搜索  规划图  遗传规划算法  Graph  Planning  Based  Algorithm  显示  质量  速度  规划问题  大规模  求解  实验  搜索能力  并行  利用  图规划算法  遗传操作算子  编码方式  染色体
修稿时间:2005-09-132006-03-13

GP: Genetic Planning Algorithm Based on Planning Graph
CHEN Ai-Xiang,JIANG Yun-Fei,ZHANG Xue-Nong,LIU Guo-Ying.GP: Genetic Planning Algorithm Based on Planning Graph[J].Chinese Journal of Computers,2007,30(1):153-160.
Authors:CHEN Ai-Xiang  JIANG Yun-Fei  ZHANG Xue-Nong  LIU Guo-Ying
Affiliation:1. Institute of Software, Sun Yat-Sen University , Guangzhou 510275;2.Center of Network, Guangdong College of Pharmacy, Guangzhou 510224;3.College of Computer and Communication Engineer ;4. Changsha University of Science and Technology , Changsha 410076
Abstract:In recent years,a new planning algorithm,graphplan,is presented and has a great impact on the development of intelligent planning.In graph planning,the algorithm has two main phases:Firstly,a directed,leveled graph with two kinds of nodes and three kinds of edges is constructed according to the preconditions and effects of actions,the levels of planning graph alternate between proposition levels containing proposition nodes and action levels containing action nodes.Secondly,a valid plan is extracted from the planning graph.However the searching of the planning graph is very difficult and cost.In this paper,a way of coding chromosome based on the planning graph is given,and the genetic operators are defined.Accordingly the genetic algorithm is introduced to search for the planning.The experiment shows that the genetic planning is advantage in solving the large planning problem because the genetic algorithm is parallel and global in searching.
Keywords:intelligent planning  planning graph  genetic algorithm  parallel searching
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号