计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (13): 51-53.DOI: 10.3778/j.issn.1002-8331.2009.13.015

• 研究、探讨 • 上一篇    下一篇

图规划框架下规划修补算法的研究与实现

李国强1,姜云飞2   

  1. 1.临沂师范学院 信息学院,山东 临沂 276005
    2.中山大学 软件所,广州 510275
  • 收稿日期:2008-03-20 修回日期:2008-06-11 出版日期:2009-05-01 发布日期:2009-05-01
  • 通讯作者: 李国强

Research and realization on algorithm of planning repair frame of graphplan

LI Guo-qiang1,JIANG Yun-fei2   

  1. 1.School of Information,LinYi Normal University,LinY,Shandong 276005,China
    2.Software Research Institute,Sun Yat-Sen University,Guangzhou 510275,China
  • Received:2008-03-20 Revised:2008-06-11 Online:2009-05-01 Published:2009-05-01
  • Contact: LI Guo-qiang

摘要: 智能规划是人工智能研究领域近年来发展起来的一个研究热点。在图规划框架下,充分考虑了图的层次结构对规划修补的作用,利用已有的修补结果,对GPG修补算法进行了改进,针对特定的变化情况,给出了一种有效的修补算法。实验数据表明,修补算法有较好的有效性。

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.