Domain-independent planning: representation and plan generation
Artificial Intelligence
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
The problem of achieving several goals simultaneously has been central to domain-independent planning research; previous approaches to this problem have been heuristic, complicated, and ill-defined. This paper considers negative goal relationships due to resource limitation and preserved goal violation, and provides a formal analysis of conjunctive planning problems. It can be shown that conjunctive planning problems in general are NP-complete. However, we demonstrate that under certain conditions they are polynomial solvable.