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

79 Scopus citations

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 - Jul 1995

ASJC Scopus subject areas

  • Language and Linguistics
  • Linguistics and Language
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Planning as refinement search: a unified framework for evaluating design tradeoffs in partial-order planning'. Together they form a unique fingerprint.

Cite this