Issue No. 02 - March/April (2005 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MIS.2005.25
Alexander Nareyek , University College Cork
Eugene C. Freuder , University College Cork
Robert Fourer , Northwestern University
Enrico Giunchiglia , University of Genova
Robert P. Goldman , Smart Information Flow Technologies
Henry Kautz , University of Washington
Jussi Rintanen , Albert-Ludwigs-University Freiburg
Austin Tate , University of Edinburgh
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.
planning, constraint programming, propositional satisfiability, integer programming
R. P. Goldman et al., "Constraints and AI Planning," in IEEE Intelligent Systems, vol. 20, no. , pp. 62-72, 2005.