Complexity, decidability and undecidability results for domain-independent planning

Artificial Intelligence

Volumn 76, Issue 1-2, 1995, Pages 75-88

  Erol, Kutluhan ^a   Nau, Dana S ^a   Subrahmanian, V S ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; FUNCTIONS; PLANNING; PROBLEM SOLVING;

DOMAIN INDEPENDENT PLANNING; PLANNING OPERATORS; UNDECIDABILITY THEOREMS;

ARTIFICIAL INTELLIGENCE;

EID: 0029332411     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(94)00080-K     Document Type: Article

References (37)

1. Planning in polynomial time: the sas-pubs class
2. Complexity results for planning
3. Complexity results for extended planning
4. Planning for conjunctive goals
5. On the NP-hardness of blocks world
6. Reasoning about partially ordered events
7. Complexity, decidability and undecidability results for domain-independent planning
8. When is planning decidable?
9. Toward a general framework for hierarchical task-network planning
10. STRIPS: a new approach to the application of theorem proving to problem solving
11. Complexity results for blocks-world planning
12. On the complexity of blocks-world planning
13. Planning as search: a quantitative approach
14. On the semantics of STRIPS
15. Systematic nonlinear planning
16. Regression planning
17. Commitment strategies in planning
18. On the complexity of possible truth
19. Synthesizing plans that contain actions with context-dependent effects
20. Conditional nonlinear planning
21. Planning in a hierarchy of abstraction spaces
22. The nonlinear nature of plans
23. Database updates and AI planning domains
24. A review of AI planning techniques
25. Generating project networks
26. Domain-independent planning: representation and plan generation
27. Optimization of multiple-goal plans with limited interaction
28. Merging separately generated plans with restricted interactions