The interplay of constraint and planning, and the differences between propositional satisfiability (SAT), integer programming (IP) and constraint programming (CP) are discussed. Constraint optimization requires an additional function that assigns a quality value to a solution and tries to find a solution that maximizes this value. The hierarchical task network planning (HTN) exhibits the capability to stipulate global constraints on plans, meshing well with the needs of systems that combine planning and constraint satisfaction. The expressive powers of HTN planning makes it easy to specify global constraints and make them available to constraint solvers.
|Original language||English (US)|
|Number of pages||11|
|Journal||IEEE Intelligent Systems|
|State||Published - 2005|
ASJC Scopus subject areas
- Computer Networks and Communications
- Artificial Intelligence