On the Complexity of Domain-Independent Planning

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:

• Type: Conference
• Year: 1992
• Where: AAAI
• Authors: Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
• Keywords: AAAI 1992, Domain-independent Planning, Intelligent Agents, Planning Operators, Strips-style Operators