期刊文献+

概率规划的研究与发展 被引量:6

Research and advances in probabilistic planning
下载PDF
导出
摘要 概率规划是智能规划研究的一个重要方面,首先给出概率规划领域定义语言,并介绍其语法及语义,随后重点介绍了求解概率规划的各种方法,如动态规划、启发式动态规划和基于规划图的方法等,并分析了各种方法的特点.最后对国际概率规划比赛进行了介绍. Probabilistic planning has an important role in allowing intelligent planning to adapt to uncertainty. This paper introduces a new probabilistic plan domain definition language (PPDDL), followed by its syntax and semantics. Various methods of probabilistic planning are described, such as dynamic program- ming algorithms, heuristic dynamic programming algorithms and algorithms based on planning graph. The features of each algorithm are then analyzed. Finally, we give a brief introduction to the international probabilistic planning competition. The conclusions in this paper should be helpful to researchers interested in this field.
出处 《智能系统学报》 2008年第1期9-22,共14页 CAAI Transactions on Intelligent Systems
基金 国家自然科学基金资助项目(60573067,60473042) 东北师范大学青年自然科学基金资助项目(20070601)
关键词 智能规划 概率规划 动态规划 概率规划领域定义语言 intelligent planning probabilistic planning dynamic programming PPDDL
  • 相关文献

参考文献63

  • 1[1]WELD D.Recent advances in AI planning[R].UW-CSE-98-10-01,1999.
  • 2[2]CIMATTI A,ROVERI M.Conformant planning via symbolic model checking[J].Journal of Artificial Intelligence Research,2000,13:305-338.
  • 3[3]CIMATTI A,ROVERI M,BERTOLI P.Conformant planning via symbolic model checking and heuristic search[J].Artificial Intelligence,2004,159 (1-2):127-206.
  • 4[4]HOFFMAN J,BRAFTMAN R.Conformant planning via heuristic forward search:a new approach[J].Artificial Intelligence,2006,170(6-7):507-541.
  • 5[5]SMITH D,WELD D.Conformant graphplan[C]// Proceedings of 15th National Conference on Artificial Intelligence.Madison,Wisconsin,1998.
  • 6[6]WELD D,ANDERSON C,SMITH D.Extending graphplan to handle uncertainty & sensing actions[C]// Proceedings of 15th National Conference on Artificial Intelligence.Madison,Wisconsin,1998.
  • 7[7]HOFFMANN J,BRAFMAN R I.Contingent planning via heuristic forward search with implicit belief states[C]// Proceedings of Fifteenth International Conference on Automated Planning & Scheduling.[S.l.]:AAAI Press,2005.
  • 8[8]WAH B W,CHEN Y.Constrained partitioning in penalty formulations for solving temporal planning problems[J].Artificial Intelligence,2006,170(3):187-231.
  • 9[9]CHEN Y,HSU C,WAH B.Temporal planning using subgoal partitioning and resolution in SGplan[J].Journal of Artificial Intelligence Research,2006,26:323-369.
  • 10[10]FOX M,LONG D.PDDL2.1:an extension to PDDL for expressing temporal planning domains[J].Journal of Artificial Intelligence Research,2003,20:61-124.

同被引文献96

  • 1吴桂阳,万建成,于清国,刘成柱.基于XML的界面模板技术[J].计算机应用研究,2004,21(10):54-55. 被引量:14
  • 2冯文堂,胡强,万建成.基于XML的界面自动生成[J].计算机应用研究,2006,23(9):75-77. 被引量:13
  • 3赵克勤.集对分析的不确定性系统理论在AⅠ中的应用[J].智能系统学报,2006,1(2):16-25. 被引量:68
  • 4赖志锋,姜云飞.智能规划中基于遗传算法的动作模型学习[J].计算机学报,2007,30(6):945-953. 被引量:6
  • 5GhallabM,NauD,TraversoP.自动规划:理论和实践[M].姜云飞,杨强,凌应标,等译.北京:清华大学出版社,2008.
  • 6Barto A, Bradtke S, Singh S. Learning to act using real - time dynamic programming [J]. Artificial Intelligence, 1995,72(1 -2) :81 - 138.
  • 7Hansen E, Zilberstein S. LAO* :a heuristic search algorithm that finds solutions with loops [ J ]. Artifical Intelligence, 2001,129( 1 - 2) :35 - 62.
  • 8B Bonet, H Geffner. Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback[ C ]. Int. Joint Conference on Artificial Intelligence (IJCAI- 2003), Acapulco, Mexico, August 2003.
  • 9Patrascu R, Poupart P, Schuurmans. Greedy linear value approximation for factored Markov Decision processes [ C ]. In Proe. of AAAI - 02,2002:285 - 291.
  • 10Ferguson D, Stentz A. Focussed dynamic programming: Extensive comparative results [R]. Technical Report , 2004, CMU- R I -TR-04 - 13.

引证文献6

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部