Planning Graph as a (Dynamic) CSP

Exploiting EBL, DDB and other CSP Search Techniques in Graphlan

Research output: Contribution to journalArticle

51 Citations (Scopus)

Abstract

This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed back-tracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups)on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.

Original languageEnglish (US)
Pages (from-to)1
Number of pages1
JournalJournal of Artificial Intelligence Research
Volume12
StatePublished - Jan 2000

Fingerprint

Planning
Constraint satisfaction problems

ASJC Scopus subject areas

  • Artificial Intelligence
  • Control and Systems Engineering

Cite this

@article{3ef6ab8f37254500887281df0db18012,
title = "Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphlan",
abstract = "This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed back-tracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups)on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.",
author = "Subbarao Kambhampati",
year = "2000",
month = "1",
language = "English (US)",
volume = "12",
pages = "1",
journal = "Journal of Artificial Intelligence Research",
issn = "1076-9757",
publisher = "Morgan Kaufmann Publishers, Inc.",

}

TY - JOUR

T1 - Planning Graph as a (Dynamic) CSP

T2 - Exploiting EBL, DDB and other CSP Search Techniques in Graphlan

AU - Kambhampati, Subbarao

PY - 2000/1

Y1 - 2000/1

N2 - This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed back-tracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups)on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.

AB - This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan algorithm. It then describes how explanation based learning, dependency directed back-tracking, dynamic variable ordering, forward checking, sticky values and random-restart search strategies can be adapted to Graphplan. Empirical results are provided to demonstrate that these augmentations improve Graphplan's performance significantly (up to 1000x speedups)on several benchmark problems. Special attention is paid to the explanation-based learning and dependency directed backtracking techniques as they are empirically found to be most useful in improving the performance of Graphplan.

UR - http://www.scopus.com/inward/record.url?scp=14344283976&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=14344283976&partnerID=8YFLogxK

M3 - Article

VL - 12

SP - 1

JO - Journal of Artificial Intelligence Research

JF - Journal of Artificial Intelligence Research

SN - 1076-9757

ER -