Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming

Alexander Nareyek, Subbarao Kambhampati

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish (US)
Pages (from-to)335-338
Number of pages4
JournalConstraints
Volume8
Issue number4
DOIs
StatePublished - Oct 2003

Fingerprint

Constraint Programming
Intersection
Planning
Graph Search
Model

ASJC Scopus subject areas

  • Hardware and Architecture
  • Applied Mathematics

Cite this

Introduction to the Special Issue on Planning : Research Issues at the Intersection of Planning and Constraint Programming. / Nareyek, Alexander; Kambhampati, Subbarao.

In: Constraints, Vol. 8, No. 4, 10.2003, p. 335-338.

Research output: Contribution to journalArticle

@article{0ee9e9badca6436090b10455f6212ed6,
title = "Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming",
abstract = "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.",
author = "Alexander Nareyek and Subbarao Kambhampati",
year = "2003",
month = "10",
doi = "10.1023/A:1025848402714",
language = "English (US)",
volume = "8",
pages = "335--338",
journal = "Constraints",
issn = "1383-7133",
publisher = "Springer Netherlands",
number = "4",

}

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

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

VL - 8

SP - 335

EP - 338

JO - Constraints

JF - Constraints

SN - 1383-7133

IS - 4

ER -