Nareyek, A.; Fourer, R.; Freuder, E. C.; Giunchiglia, E.; Goldman, R. P.; Kautz, H.; Rintanen, J.; and Tate, A. 2005.|
Constraints and AI Planning.
IEEE Intelligent Systems, 20(2), 62-72.
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.
|Download||Rules and Regulations [PDF; 497 Kb] [zipped PDF; 437 Kb] [download viewer]|
The editing by the publisher introduced some errors. This is mainly only a problem with the hardcopy version, and errors were corrected in the publisher's online version (which is available for download here). One of the remaining errors is the authors' order (see above for correct order).