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.