Complexity, decidability and undecidability results for 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.