Article,
Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP
Artificial Intelligence, 132 (2): 151--182 (2001)
Abstract
Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily used to adapt CSP search techniques into the backward search phase of Graphplan. This paper describes GP-CSP, a system that does planning by automatically converting Graphplan's planning graph into a CSP encoding, and solving the CSP encoding using standard CSP solvers. Our comprehensive empirical...
