The research issues related to planning based on constraint programming are discussed. Most of the explanations of Graphplan's and its extensions' impressive performance point to the connections between its graph search and CSP techniques. The work on the variants of Graphplan has shown that bounded-length plan finding can be usefully posed as a model finding problem and solved using CSP, SAT or IP techniques.
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Artificial Intelligence