期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

规划问题编码为约束可满足问题的研究 被引量：3

The Research of Constraint Satisfaction Problems Encoding of Planning Problems
在线阅读 下载PDF
导出
摘要 基于约束可满足问题的规划求解是研究智能规划的重要技术方法。把规划问题编码为约束可满足(CSP)问题,是这种规划求解方法的关键技术之一。本文介绍把规划问题编码为约束可满足问题的方法,及一些已有的并且已经用于规划的可满足过程,并对这些编码方法做进一步的研究,主要讨论领域知识在编码方法中的应用,提出在编码求解中加入领域知识的观点。 The planning solution based on constraint satisfaction problem（CSP） is one of the most important methods of researching intelligent planning. Encoding planning problems into CSPs play a major role in planning solving. In this paper, we focus on the encoding of planning problems into CSP and describe some existing satisfiability procedures that have been used extensively for planning, and the discussion of the application problem about domain knowledge in encoding approach is presented.
作者 伍丽华 陈蔼洋 姜云飞
机构地区 中山大学软件研究所
出处 《计算机科学》 CSCD 北大核心 2006年第8期187-189,292,共4页 Computer Science
基金 国家自然科学基金项目 编号:60173039
关键词 规划问题 CSP SAT 领域知识 Planning problem, CSP, SAT, Domain knowledge
分类号 TP311.13 [自动化与计算机技术—计算机软件与理论] TN919.81 [电子电信—通信与信息系统]
  • 相关文献

参考文献9

  • 1Ghallab M, Nau D, Traverso P. Automated Planning Theory and Practice. Morgan Kaufmann Publishers, 2004
  • 2吴康恒,姜云飞.基于模型检测的领域约束规划[J].软件学报,2004,15(11):1629-1640. 被引量：17
  • 3Kautz H, MeAllester D, Selman B. Encoding plans in prepositional logic. In.. Proc. 5th Int Conf. Principles of Knowledge Representation and Reasoning, 1996
  • 4Kautz H, Selman B. Blackbox.. A new approach to the application of theorem proving to problem solving. AIPS98 Workshop on Planning as Combinatorial Search, 1998
  • 5Kautz H, Selman B. Pushing the envelope: Planning, prepositional logic, and stochastic search. In: Proe. 13th Nat Conf. AI,1996
  • 6Koehler J. Planning under Resource Constraints. 13th European Conference on Artificial Intelligence, ECAI98, 1998
  • 7Bayardo R, Schrag R. Using CSP look-back techniques to solve real-world SAT instances. In: Proe. 14th Nat Conf. AI, Providence, R I, July 1997
  • 8de Kleer J. A comparison of ATMS and CSP techniques. In: Proc.IJCAI-89, 1989
  • 9Haas A. The case for domain-specific frame axioms. The Frame Problem in Artificial Intelligence. In: Proc. of the 1987 Workshop. Morgan Kaufmarm, 1987

二级参考文献16

  • 1Helmert M. Complexity results for standard benchmark domains in planning. Artificial Intelligence, 2003,143(2):219-262.
  • 2Blum AL, Furst ML. Fast planning through planning graph analysis. Artificial Intelligence, 1997,90:281-300.
  • 3Hoffmann J, Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 2001,14:253-302.
  • 4Edelkamp S, Helmert M. The model checking integrated planning system. AI Magazine, 2001,22(3):67-71.
  • 5Bertoli P, Cimatti A, Pistore M, Roveri M, Traverso P. MBP: A model based planner. In: Proc. of IJCAI 2001 Workshop on Planning under Uncertainty and Incomplete Information. Seattle, 2001.
  • 6Jensen RM, Veloso MM, Bowling MH. OBDD-Based optimistic and strong cyclic adversarial planning. In: Proc. of the 6th European Conf. on Planning (ECP 2001). Springer-Verlag, 2001.
  • 7Bryant RE. Graph-Based algorithms for boolwan function manipulation. IEEE Trans. on Computers, 1986,35(8):677-691.
  • 8Fox M, Long D. PDDL2.1: An extension to PDDL for expressing temporal planning domains. 2002. http://www.dur.ac.uk/d.p.long/ pddl2.ps.gz
  • 9Haslum P, Scholz U. Domain knowledge in planning: Representation and use. In: Proc. of the ICAPS 2003 Workshop on PDDL. 2003.
  • 10AIPS 2002 Competition Domains. 2002. http://www.dur.ac.uk/d.p.long/competition.html

共引文献16

同被引文献49

  • 1Walsh T. SAT v CSP [C] // Proceeding of the 6th international Conference on Principles and Practice of Constraint Program- ming. 2000,1894 : 441-456.
  • 2Sadeh N, Sycara K, Xiong Y. Bachtracking techniques for the job shop scheduling constraint satisfaction problem [J]. Artificial Intelligence, 1995,76 (1/2) : 455-480.
  • 3Pham D N, Thornton J, Sattar A. Modelling and Solving tempo- ral reasoning as propositional satisfiability [J]. Artificial Intelli- gence, 2008,172(15) : 1725-1782.
  • 4Miguel I, Shen Q. Solution Techniques for Constraint Satisfac- tion Problems: Foundations [J]. Artificial Intelligence Review, 2001,15 (4) : 243-267.
  • 5Dechter R. Bucket Eliminatiom A Unifying Framework for Rea- soning[J]. Artificial Intelligence, 1999,113 : 41-85.
  • 6Bryant R E. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams [J]. ACM Computer Survey, 1992,24 ( 3 ) : 293-318.
  • 7Burch J, Clarke E, Memillan K, et al. Symbolic Model Checking: 10^20 States and Beyond[J]. Information and Computation, 1998, 98(2):142-170.
  • 8Hachtel G D, Somenzi F. A Symbolic Algorithm for Maximum Flow in 0-1 Networks [J]. Formal Methods in System Design, 1997,10(2/3) : 207-219.
  • 9Pan G, Vardi M Y. Symbolic Techniques in Satisfiability Solving [J]. Journal of Automated Reasoning, 2005,35 (1-3) :25-50.
  • 10Blum A, Furst M L. Fast Planning through Planning Graph Analysis [ C ]//Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence 1995. Montreal, Canada: Morgan Kaufmann Publishers, 1995: 1636-1642.

引证文献3

二级引证文献9

计算机科学
2006年 第8期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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