Understanding and extending Graphplan

Subbarao Kambhampati, Eric Parker, Eric Lambrecht

Research output: Chapter in Book/Report/Conference proceedingConference contribution

35 Citations (Scopus)

Abstract

We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process of growing the planning-graph and inferring mutex relations corresponds to doing forward state-space refinement over disjunctively represented plans. The backward search phase of Graphplan corresponds to solving a binary dynamic constraint satisfaction problem. Our reconstruction sheds light on the sources of strength of Graph-plan. We also use the reconstruction to explain how Graphplan can be made goal-directed, how it can be extended to handle actions with conditional effects, and how backward state-space refinement can be generalized to apply to disjunctive plans. Finally, we discuss how the backward search phase of Graphplan can be improved by applying techniques from CSP literature, and by teasing apart planning and scheduling (resource allocation) phases in Graphplan.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages260-272
Number of pages13
Volume1348 LNAI
ISBN (Print)3540639128, 9783540639121
StatePublished - 1997
Event4th European Conference on Planning, ECP 1997 - Toulouse, France
Duration: Sep 24 1997Sep 26 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1348 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th European Conference on Planning, ECP 1997
CountryFrance
CityToulouse
Period9/24/979/26/97

Fingerprint

Planning
Constraint satisfaction problems
Resource allocation
Scheduling
State Space
Refinement
Planning and Scheduling
Constraint Satisfaction Problem
Dynamic Problem
Graph in graph theory
Resource Allocation
Binary

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kambhampati, S., Parker, E., & Lambrecht, E. (1997). Understanding and extending Graphplan. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1348 LNAI, pp. 260-272). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1348 LNAI). Springer Verlag.

Understanding and extending Graphplan. / Kambhampati, Subbarao; Parker, Eric; Lambrecht, Eric.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1348 LNAI Springer Verlag, 1997. p. 260-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1348 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kambhampati, S, Parker, E & Lambrecht, E 1997, Understanding and extending Graphplan. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1348 LNAI, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1348 LNAI, Springer Verlag, pp. 260-272, 4th European Conference on Planning, ECP 1997, Toulouse, France, 9/24/97.
Kambhampati S, Parker E, Lambrecht E. Understanding and extending Graphplan. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1348 LNAI. Springer Verlag. 1997. p. 260-272. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Kambhampati, Subbarao ; Parker, Eric ; Lambrecht, Eric. / Understanding and extending Graphplan. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1348 LNAI Springer Verlag, 1997. pp. 260-272 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{86c4d7e6118848a0a0266a725c1c9522,
title = "Understanding and extending Graphplan",
abstract = "We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process of growing the planning-graph and inferring mutex relations corresponds to doing forward state-space refinement over disjunctively represented plans. The backward search phase of Graphplan corresponds to solving a binary dynamic constraint satisfaction problem. Our reconstruction sheds light on the sources of strength of Graph-plan. We also use the reconstruction to explain how Graphplan can be made goal-directed, how it can be extended to handle actions with conditional effects, and how backward state-space refinement can be generalized to apply to disjunctive plans. Finally, we discuss how the backward search phase of Graphplan can be improved by applying techniques from CSP literature, and by teasing apart planning and scheduling (resource allocation) phases in Graphplan.",
author = "Subbarao Kambhampati and Eric Parker and Eric Lambrecht",
year = "1997",
language = "English (US)",
isbn = "3540639128",
volume = "1348 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "260--272",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Understanding and extending Graphplan

AU - Kambhampati, Subbarao

AU - Parker, Eric

AU - Lambrecht, Eric

PY - 1997

Y1 - 1997

N2 - We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process of growing the planning-graph and inferring mutex relations corresponds to doing forward state-space refinement over disjunctively represented plans. The backward search phase of Graphplan corresponds to solving a binary dynamic constraint satisfaction problem. Our reconstruction sheds light on the sources of strength of Graph-plan. We also use the reconstruction to explain how Graphplan can be made goal-directed, how it can be extended to handle actions with conditional effects, and how backward state-space refinement can be generalized to apply to disjunctive plans. Finally, we discuss how the backward search phase of Graphplan can be improved by applying techniques from CSP literature, and by teasing apart planning and scheduling (resource allocation) phases in Graphplan.

AB - We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process of growing the planning-graph and inferring mutex relations corresponds to doing forward state-space refinement over disjunctively represented plans. The backward search phase of Graphplan corresponds to solving a binary dynamic constraint satisfaction problem. Our reconstruction sheds light on the sources of strength of Graph-plan. We also use the reconstruction to explain how Graphplan can be made goal-directed, how it can be extended to handle actions with conditional effects, and how backward state-space refinement can be generalized to apply to disjunctive plans. Finally, we discuss how the backward search phase of Graphplan can be improved by applying techniques from CSP literature, and by teasing apart planning and scheduling (resource allocation) phases in Graphplan.

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

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

M3 - Conference contribution

AN - SCOPUS:21944446103

SN - 3540639128

SN - 9783540639121

VL - 1348 LNAI

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 260

EP - 272

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -