规划问题编码为约束可满足问题的研究

基于约束可满足问题的规划求解是研究智能规划的重要技术方法。把规划问题编码为约束可满足（CSP）问题，是这种规划求解方法的关键技术之一。本文介绍把规划问题编码为约束可满足问题的方法，及一些已有的并且已经用于规划的可满足过程，并对这些编码方法做进一步的研究，主要讨论领域知识在编码方法中的应用，提出在编码求解中加入领域知识的观点。

The Research of Constraint Satisfaction Problems Encoding of Planning Problems

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.