On the Path from Classical Planning to Arithmetic Constraint Satisfaction

Éric Jacopin and Jacques Penon

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.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.