期刊文献+

基于启发式搜索的灵活规划的算法研究与系统实现 被引量:3

Research of Flexible Planning Algorithm and System Implement Based on Heuristic State Search
下载PDF
导出
摘要 随着智能规划研究的深入,经典规划已不能满足实际应用的需要。本文分析了经典规划无法满足实际应用要求及产生灵活规划的原因。在对启发式搜索和灵活规划深入研究的基础上,提出了利用启发式搜索的方法来处理灵活规划问题的思想,并给出了基于启发式搜索的灵活规划算法和求解模型。采用智能规划中的基准问题对该算法进行测试,实验表明该方法在处理很多领域问题上都可以得到非常好的效果。 Traditionally, planning problems are cast in terms of imperative constraints that are either wholly satisfied or wholly violated. In this paper, why classical planning can not capture the full subtlety of many real problems is argued. A new flexible planning problem is defined which supports the soft constraints often found in reality. A new concept using heuristic state search theory to solve flexible planning problem is described. This paper also introduces a novel solving model of flexible planning using heuristic state search theory and exploits the algorithm framework of flexible planning based on heuristic state search.
出处 《计算机科学》 CSCD 北大核心 2008年第4期207-210,共4页 Computer Science
基金 国家自然科学基金项目(编号为:60573067和60473042)
关键词 人工智能 智能规划 灵活规划 启发式搜索 AI, Intelligent planning, Flexible planning, State heuristic search
  • 相关文献

参考文献11

  • 1丁德路,姜云飞.智能规划及其应用的研究[J].计算机科学,2002,29(2):100-103. 被引量:16
  • 2Blum A L, Furst M L. Fast Planning Through Planning Graph Analysis [C]. In:Proceeding of the International Joint Conference on Artificial Intelligence, 1995. 1636-1642
  • 3Kautz H, Selman B. Planning as Satisfiability [C]. In: Proceedings of the European Conference on Artificial Intelligence (ECA92). Vienna, Austria, August 1992
  • 4Bonet B, Geffer H. Planning as heuristic search: New results [C]. In:Biundo S, Fox M,eds. Recent Advances in AI Planning. 5^th European Conference on Planning (ECP' 99) Durham, UK. Springer-Verlag, 1999
  • 5Miguel I, Shen Q, Jarvis P. Efficient Flexible Planning via Dynamic Flexible Constraint Satisfaction. Engineering Applications of Artificial Intelligence, 2001,14(3) : 301-327
  • 6Miguel I, Jarvis P, Shen Q. Flexible Graphplan. In: Proceedings of the Fourteenth European Conference on Artificial Intelligence, 2000. 506-510
  • 7Li Yang, Gu Wen-xiang, Yin Ming-hao, et al. Planning system based on heuristic. In: Proceedings of the Fourth International Conference on Machine Learning and Cybernetics, 2005
  • 8谷文祥 李杨 殷明浩.带标记的反向搜索的规划识别算法[J].计算机科学,2004,31(10):243-244.
  • 9彭祥云,姜云飞.基于资源约束和局部启发搜索的规划系统[J].控制工程,2006,13(2):185-189. 被引量:6
  • 10杨宁,田蔚风,金志华.一种求解DGPS动态整周模糊度问题的交叉禁忌搜索(英文)[J].光学精密工程,2006,14(5):891-895. 被引量:1

二级参考文献57

  • 1林玉池,崔彦平,黄银国.复杂背景下边缘提取与目标识别方法研究[J].光学精密工程,2006,14(3):509-514. 被引量:88
  • 2Green C. Application of theorem proving to problem solving. In:Proc. 1st Int. Joint Conf. AI. 1969. 219~239
  • 3Fikes R,Nilsson N. STRIPS:A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 1971,2:189~208
  • 4McDermott D,et al. Planning:What it is,What it could be,An introduction to the Special Issue on Planning and Scheduling. Artificial Intelligence, 1995,76:1 ~ 16
  • 5Weld D S. Recent Advances in AI Planning. Artificial Intelligence (to appear). 1999. ftp://ftp. cs. washington. edu/pud/ai/pi2. ps
  • 6Yang Qiang. Intelligent Planning A Decomposition and Abstraction Based Approach. Berlin: Springer, 1997
  • 7Kautz H,McAllester D,Selman B. Encoding plans in propositional logic. In:Proc. 5th Int. Conf. Principles of Knowledge Representation and Reasoning, 1996
  • 8Kautz H,Selman B. Pushing the envelope: Planning,prepositional logic, and stochastic search. In: Proc. 13th Nat. Conf. AI. 1996.1194~1201
  • 9Kautz H,Selman B. Blackbox:A new approach to the application of theorem proving to problem solving. In: AIPS98 Workshop on Planning as Combinatorial Search. 1998. 58~60
  • 10Kautz H,Selman B. The role of domain specific knowledge in the planning as satisfiability framework. In: Proc. 4th Intl. Conf. AI Planning Systems. 1998

共引文献26

同被引文献10

引证文献3

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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