On the complexity of domain-independent planning

  • Authors:

  • Kutluhan Erol;Dana S. Nau;V. S. Subrahmanian

  • Affiliations:

  • Computer Science Department, University of Maryland, College Park, MD;Computer Science Department, University of Maryland, College Park, MD and Systems Research Center and Institute for Advanced Computer Studies;Computer Science Department, University of Maryland, College Park, MD and Institute for Advanced Computer Studies

  • Venue:
  • AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show how the time complexity varies depending on a wide variety of conditions: • whether or not delete lists are allowed; • whether or not negative preconditions are allowed; • whether or not the predicates are restricted to be propositions (i.e., 0-ary); • whether the planning operators are given as part of the input to the planning problem, or instead are fixed in advance.