首页 | 官方网站   微博 | 高级检索  
     

图规划框架下规划修补算法的研究与实现
引用本文:李国强,姜云飞.图规划框架下规划修补算法的研究与实现[J].计算机工程与应用,2009,45(13):51-53.
作者姓名:李国强  姜云飞
作者单位:1. 临沂师范学院,信息学院,山东,临沂,276005
2. 中山大学软件所,广州,510275
摘    要:智能规划是人工智能研究领域近年来发展起来的一个研究热点。在图规划框架下,充分考虑了图的层次结构对规划修补的作用,利用已有的修补结果,对GPG修补算法进行了改进,针对特定的变化情况,给出了一种有效的修补算法。实验数据表明,修补算法有较好的有效性。

关 键 词:智能规划  图规划  规划修补
收稿时间:2008-3-20
修稿时间:2008-6-11  

Research and realization on algorithm of planning repair frame of graphplan
LI Guo-qiang,JIANG Yun-fei.Research and realization on algorithm of planning repair frame of graphplan[J].Computer Engineering and Applications,2009,45(13):51-53.
Authors:LI Guo-qiang  JIANG Yun-fei
Affiliation:LI Guo-qiang1,JIANG Yun-fei21.School of Information,LinYi Normal University,LinY,Sh,ong 276005,China 2.Software Research Institute,Sun Yat-Sen University,Guangzhou 510275,China
Abstract:Intelligent planning has recently become a hot topic in AI field.In the frame of the graphplan,this paper pays more attention to the graphic hierarchy in planning repair and improves the algorithm of GPG by adding the idea of making use of the repair results that have been obtained.This paper presents a valid repair method for a kind of special situation.In the end, experimental results show that the method above is very efficient in practice in repairing a plan.
Keywords:intelligent planning  graphplan  planning repair
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号