Tackling real-world planning problems often requires considering various types of constraints, ranging from simple numerical comparators to complex resources. This article provides an overview of how to solve planning tasks within general constraint-solving frameworks, such as propositional satisfiability, integer programming, and constraint programming. In many cases, the complete planning problem can be cast in these frameworks.
Index Terms:
planning, constraint programming, propositional satisfiability, integer programming
Citation:
Alexander Nareyek, Eugene C. Freuder, Robert Fourer, Enrico Giunchiglia, Robert P. Goldman, Henry Kautz, Jussi Rintanen, Austin Tate, "Constraints and AI Planning," IEEE Intelligent Systems, vol. 20, no. 2, pp. 62-72, Mar./Apr. 2005, doi:10.1109/MIS.2005.25