On the Complexity of Domain-Independent Planning

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.

Extracted Key Phrases

2 Figures and Tables

Statistics

0510'94'97'00'03'06'09'12'15
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Erol1992OnTC, title={On the Complexity of Domain-Independent Planning}, author={Kutluhan Erol and Dana S. Nau and V. S. Subrahmanian}, booktitle={AAAI}, year={1992} }