论文信息 - On the Path from Classical Planning to Arithmetic Constraint Satisfaction

On the Path from Classical Planning to Arithmetic Constraint Satisfaction

We discuss a method to automatically transform a classical planning problem into an arithmetic constraint satisfaction problem (aCSP). This transformation specifies the variables of the aCSP, their ranges and the binary arithmetic constraints over these variables. A bounds consistency solver is then called to build ranges consistent with the arithmetic constraints. The transformation presented in this paper only produces totally ordered plans and propositional classical planning.

Eric Jacopin | Éric Jacopin | Jacques Penon | J. Penon

[1] Peter van Beek,et al. CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[2] J. Benabou. Introduction to bicategories , 1967 .

[3] Éric Jacopin. Classical AI Planning as Theorem Proving: The Case of a Fragment of Linear Logic , 1993 .

[4] S. Kambhampati. Characterizing multi-contributor causal structures for planning , 1992 .

[5] Peter J. Stuckey,et al. Programming with Constraints: An Introduction , 1998 .

[6] James F. Allen,et al. Planning Using a Temporal World Model , 1983, IJCAI.

[7] Vijay A. Saraswat. The category of constraint systems is Cartesian-closed , 1992, [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science.

[8] Subbarao Kambhampati,et al. Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

[9] David Chapman,et al. Planning for Conjunctive Goals , 1987, Artif. Intell..

[10] David A. McAllester,et al. Systematic Nonlinear Planning , 1991, AAAI.

[11] B. Fronhöfer. Plan generation with the linear connection method , 1997 .

[12] Dana S. Nau,et al. On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.