Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

XuanLong Nguyen, Subbarao Kambhampati, Romeo S. Nigenda

Research output: Contribution to journalArticle

59 Citations (Scopus)

Abstract

Most recent strides in scaling up planning have centered around two competing themes-disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the two competing paradigms to develop planners that are significantly more powerful than either of the approaches. Specifically, we show that the polynomial-time planning graph structure that the Graphplan builds provides a rich substrate for deriving a family of highly effective heuristics for guiding state space search as well as CSP style search. The main leverage provided by the planning graph structure is a systematic and graded way to take subgoal interactions into account in designing state space heuristics. For state space search, we develop several families of heuristics, some aimed at search speed and others at optimality of solutions, and analyze many approaches for improving the cost-quality tradeoffs offered by these heuristics. Our normalized empirical comparisons show that our heuristics handily outperform the existing state space heuristics. For CSP style search, we describe a novel way of using the planning graph structure to derive highly effective variable and value ordering heuristics. We show that these heuristics can be used to improve Graphplan's own backward search significantly. To demonstrate the effectiveness of our approach vis a vis the state-of-the-art in plan synthesis, we present AltAlt, a planner literally cobbled together from the implementations of Graphplan and state search style planners using our theory. We evaluate AltAlt on the suite of problems used in the recent AIPS-2000 planning competition. The results place AltAlt in the top tier of the competition planners-outperforming both Graphplan based and heuristic search based planners.

Original languageEnglish (US)
Pages (from-to)73-123
Number of pages51
JournalArtificial Intelligence
Volume135
Issue number1-2
DOIs
StatePublished - Feb 2002

Fingerprint

heuristics
Planning
planning
Graph
Heuristics
Polynomials
time planning
Substrates
scaling
Costs
paradigm
costs
interaction
Values

Keywords

  • CSP
  • Graphplan
  • Heuristics
  • Planning
  • Planning graph

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

Cite this

Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. / Nguyen, XuanLong; Kambhampati, Subbarao; Nigenda, Romeo S.

In: Artificial Intelligence, Vol. 135, No. 1-2, 02.2002, p. 73-123.

Research output: Contribution to journalArticle

@article{835ea90922ac48f085db9237a77ea28b,
title = "Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search",
abstract = "Most recent strides in scaling up planning have centered around two competing themes-disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the two competing paradigms to develop planners that are significantly more powerful than either of the approaches. Specifically, we show that the polynomial-time planning graph structure that the Graphplan builds provides a rich substrate for deriving a family of highly effective heuristics for guiding state space search as well as CSP style search. The main leverage provided by the planning graph structure is a systematic and graded way to take subgoal interactions into account in designing state space heuristics. For state space search, we develop several families of heuristics, some aimed at search speed and others at optimality of solutions, and analyze many approaches for improving the cost-quality tradeoffs offered by these heuristics. Our normalized empirical comparisons show that our heuristics handily outperform the existing state space heuristics. For CSP style search, we describe a novel way of using the planning graph structure to derive highly effective variable and value ordering heuristics. We show that these heuristics can be used to improve Graphplan's own backward search significantly. To demonstrate the effectiveness of our approach vis a vis the state-of-the-art in plan synthesis, we present AltAlt, a planner literally cobbled together from the implementations of Graphplan and state search style planners using our theory. We evaluate AltAlt on the suite of problems used in the recent AIPS-2000 planning competition. The results place AltAlt in the top tier of the competition planners-outperforming both Graphplan based and heuristic search based planners.",
keywords = "CSP, Graphplan, Heuristics, Planning, Planning graph",
author = "XuanLong Nguyen and Subbarao Kambhampati and Nigenda, {Romeo S.}",
year = "2002",
month = "2",
doi = "10.1016/S0004-3702(01)00158-8",
language = "English (US)",
volume = "135",
pages = "73--123",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

AU - Nguyen, XuanLong

AU - Kambhampati, Subbarao

AU - Nigenda, Romeo S.

PY - 2002/2

Y1 - 2002/2

N2 - Most recent strides in scaling up planning have centered around two competing themes-disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the two competing paradigms to develop planners that are significantly more powerful than either of the approaches. Specifically, we show that the polynomial-time planning graph structure that the Graphplan builds provides a rich substrate for deriving a family of highly effective heuristics for guiding state space search as well as CSP style search. The main leverage provided by the planning graph structure is a systematic and graded way to take subgoal interactions into account in designing state space heuristics. For state space search, we develop several families of heuristics, some aimed at search speed and others at optimality of solutions, and analyze many approaches for improving the cost-quality tradeoffs offered by these heuristics. Our normalized empirical comparisons show that our heuristics handily outperform the existing state space heuristics. For CSP style search, we describe a novel way of using the planning graph structure to derive highly effective variable and value ordering heuristics. We show that these heuristics can be used to improve Graphplan's own backward search significantly. To demonstrate the effectiveness of our approach vis a vis the state-of-the-art in plan synthesis, we present AltAlt, a planner literally cobbled together from the implementations of Graphplan and state search style planners using our theory. We evaluate AltAlt on the suite of problems used in the recent AIPS-2000 planning competition. The results place AltAlt in the top tier of the competition planners-outperforming both Graphplan based and heuristic search based planners.

AB - Most recent strides in scaling up planning have centered around two competing themes-disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the two competing paradigms to develop planners that are significantly more powerful than either of the approaches. Specifically, we show that the polynomial-time planning graph structure that the Graphplan builds provides a rich substrate for deriving a family of highly effective heuristics for guiding state space search as well as CSP style search. The main leverage provided by the planning graph structure is a systematic and graded way to take subgoal interactions into account in designing state space heuristics. For state space search, we develop several families of heuristics, some aimed at search speed and others at optimality of solutions, and analyze many approaches for improving the cost-quality tradeoffs offered by these heuristics. Our normalized empirical comparisons show that our heuristics handily outperform the existing state space heuristics. For CSP style search, we describe a novel way of using the planning graph structure to derive highly effective variable and value ordering heuristics. We show that these heuristics can be used to improve Graphplan's own backward search significantly. To demonstrate the effectiveness of our approach vis a vis the state-of-the-art in plan synthesis, we present AltAlt, a planner literally cobbled together from the implementations of Graphplan and state search style planners using our theory. We evaluate AltAlt on the suite of problems used in the recent AIPS-2000 planning competition. The results place AltAlt in the top tier of the competition planners-outperforming both Graphplan based and heuristic search based planners.

KW - CSP

KW - Graphplan

KW - Heuristics

KW - Planning

KW - Planning graph

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

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

U2 - 10.1016/S0004-3702(01)00158-8

DO - 10.1016/S0004-3702(01)00158-8

M3 - Article

AN - SCOPUS:0036468047

VL - 135

SP - 73

EP - 123

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

IS - 1-2

ER -