TY - JOUR
T1 - Introduction to the Special Issue on Planning
T2 - Research Issues at the Intersection of Planning and Constraint Programming
AU - Nareyek, Alexander
AU - Kambhampati, Subbarao
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2003/10
Y1 - 2003/10
N2 - The research issues related to planning based on constraint programming are discussed. Most of the explanations of Graphplan's and its extensions' impressive performance point to the connections between its graph search and CSP techniques. The work on the variants of Graphplan has shown that bounded-length plan finding can be usefully posed as a model finding problem and solved using CSP, SAT or IP techniques.
AB - The research issues related to planning based on constraint programming are discussed. Most of the explanations of Graphplan's and its extensions' impressive performance point to the connections between its graph search and CSP techniques. The work on the variants of Graphplan has shown that bounded-length plan finding can be usefully posed as a model finding problem and solved using CSP, SAT or IP techniques.
UR - http://www.scopus.com/inward/record.url?scp=0142185126&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0142185126&partnerID=8YFLogxK
U2 - 10.1023/A:1025848402714
DO - 10.1023/A:1025848402714
M3 - Article
AN - SCOPUS:0142185126
SN - 1383-7133
VL - 8
SP - 335
EP - 338
JO - Constraints
JF - Constraints
IS - 4
ER -