Constraints and AI planning

A. Nareyek, E. C. Freuder, R. Fourer, E. Giunchiglia, R. P. Goldman, H. Kautz, J. Rintanen, A. Tate

Research output: Contribution to journalArticlepeer-review

Abstract / Description of output

Tackling real-world planning problems often requires considering various types of constraints, which can range from simple numerical comparators to complex resources. This article provides an overview of techniques to deal with such constraints by expressing planning within general constraint-solving frameworks. Our goal here is to explore the interplay of constraints and planning, highlighting the differences between propositional satisfiability (SAT), integer programming (IP), and constraint programming (CP), and discuss their potential in expressing and solving AI planning problems.
Original languageEnglish
Pages (from-to)62-72
Number of pages11
JournalIEEE Intelligent Systems
Issue number2
Publication statusPublished - Mar 2005


Dive into the research topics of 'Constraints and AI planning'. Together they form a unique fingerprint.

Cite this