Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning

Subbarao Kambhampati, Craig A. Knoblock, Qiang Yang

Research output: Contribution to journalArticle

76 Citations (Scopus)

Abstract

Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper we show that refinement search provides a unifying framework within which various planning algorithms can be cast and compared. Specifically, we will develop refinement search semantics for planning, provide a generalized algorithm for refinement planning, and show that planners that search in the space of (partial) plans are specific instantiations of this algorithm. The different design choices in partial-order planning correspond to the different ways of instantiating the generalized algorithm. We will analyze how these choices affect the search space size and refinement cost of the resultant planner, and show that in most cases they trade one for the other. Finally, we will concentrate on two specific design choices, viz., protection strategies and tractability refinements, and develop some hypotheses regarding the effect of these choices on the performance on practical problems. We will support these hypotheses with a series of focused empirical studies.

Original languageEnglish (US)
Pages (from-to)167-238
Number of pages72
JournalArtificial Intelligence
Volume76
Issue number1-2
DOIs
StatePublished - 1995

Fingerprint

Planning
planning
performance
vocabulary
History
Semantics
semantics
history
costs
Costs

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics

Cite this

Planning as refinement search : a unified framework for evaluating design tradeoffs in partial-order planning. / Kambhampati, Subbarao; Knoblock, Craig A.; Yang, Qiang.

In: Artificial Intelligence, Vol. 76, No. 1-2, 1995, p. 167-238.

Research output: Contribution to journalArticle

@article{886ec46eabe74285955b90ac2407e60b,
title = "Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning",
abstract = "Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper we show that refinement search provides a unifying framework within which various planning algorithms can be cast and compared. Specifically, we will develop refinement search semantics for planning, provide a generalized algorithm for refinement planning, and show that planners that search in the space of (partial) plans are specific instantiations of this algorithm. The different design choices in partial-order planning correspond to the different ways of instantiating the generalized algorithm. We will analyze how these choices affect the search space size and refinement cost of the resultant planner, and show that in most cases they trade one for the other. Finally, we will concentrate on two specific design choices, viz., protection strategies and tractability refinements, and develop some hypotheses regarding the effect of these choices on the performance on practical problems. We will support these hypotheses with a series of focused empirical studies.",
author = "Subbarao Kambhampati and Knoblock, {Craig A.} and Qiang Yang",
year = "1995",
doi = "10.1016/0004-3702(94)00076-D",
language = "English (US)",
volume = "76",
pages = "167--238",
journal = "Artificial Intelligence",
issn = "0004-3702",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - Planning as refinement search

T2 - a unified framework for evaluating design tradeoffs in partial-order planning

AU - Kambhampati, Subbarao

AU - Knoblock, Craig A.

AU - Yang, Qiang

PY - 1995

Y1 - 1995

N2 - Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper we show that refinement search provides a unifying framework within which various planning algorithms can be cast and compared. Specifically, we will develop refinement search semantics for planning, provide a generalized algorithm for refinement planning, and show that planners that search in the space of (partial) plans are specific instantiations of this algorithm. The different design choices in partial-order planning correspond to the different ways of instantiating the generalized algorithm. We will analyze how these choices affect the search space size and refinement cost of the resultant planner, and show that in most cases they trade one for the other. Finally, we will concentrate on two specific design choices, viz., protection strategies and tractability refinements, and develop some hypotheses regarding the effect of these choices on the performance on practical problems. We will support these hypotheses with a series of focused empirical studies.

AB - Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly due to the many different vocabularies within which planning algorithms are usually expressed. In this paper we show that refinement search provides a unifying framework within which various planning algorithms can be cast and compared. Specifically, we will develop refinement search semantics for planning, provide a generalized algorithm for refinement planning, and show that planners that search in the space of (partial) plans are specific instantiations of this algorithm. The different design choices in partial-order planning correspond to the different ways of instantiating the generalized algorithm. We will analyze how these choices affect the search space size and refinement cost of the resultant planner, and show that in most cases they trade one for the other. Finally, we will concentrate on two specific design choices, viz., protection strategies and tractability refinements, and develop some hypotheses regarding the effect of these choices on the performance on practical problems. We will support these hypotheses with a series of focused empirical studies.

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

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

U2 - 10.1016/0004-3702(94)00076-D

DO - 10.1016/0004-3702(94)00076-D

M3 - Article

AN - SCOPUS:0029333545

VL - 76

SP - 167

EP - 238

JO - Artificial Intelligence

JF - Artificial Intelligence

SN - 0004-3702

IS - 1-2

ER -