Towards efficient universal planning: A randomized approach

Artificial Intelligence

Volumn 117, Issue 1, 2000, Pages 1-29

  Jonsson, Peter ^a   Haslum, Patrik ^a   Bäckström, Christer ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; RANDOM PROCESSES; STRATEGIC PLANNING;

SCHOPPERS' UNIVERSAL PLANS;

ARTIFICIAL INTELLIGENCE;

EID: 0033899630     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00103-4     Document Type: Article

References (28)

1. J. Allen J. Hendler A. Tate Readings in Planning, San Mateo, CA 1990
2. C. Bäckström B. Nebel Complexity results for SAS ^+ planning Comput. Intelligence 11 4 1995 625 655
3. C. Bäckström Expressive equivalence of planning formalisms Artificial Intelligence 76 1–2 1995 17 34
4. C. Baral S.C. Tran Relating theories of actions and reactive control Linköping Electronic Articles in Computer and Information Science 3 9 1998
5. A. Barret D.S. Weld Partial-order planning: Evaluating possible efficiency gains Artificial Intelligence 67 1994 71 112
6. A.L. Blum M.L. Furst Fast planning through planning graph analysis Artificial Intelligence 90 1–2 1997 281 300
7. T. Bylander The computational complexity of propositional STRIPS planning Artificial Intelligence 69 1994 165 204
8. D. Chapman Penguins can make cake AI Magazine 10 4 1989 45 50
9. M. Garey D. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
10. M.L. Ginsberg Ginsberg replies to Chapman and Schoppers AI Magazine 10 4 1989 61 62
11. M.L. Ginsberg Universal planning: An (almost) universally bad idea AI Magazine 10 4 1989 40 44
12. C. Green Application of theorem proving to planning Proc. IJCAI-69, Washington, DC 1969 219 239
13. D.S. Johnson A catalog of complexity classes J. van Leeuwen Handbook of Theoretical Computer Science: Algorithms and Complexity, Vol. A, Chapter 2 1990 Elsevier Amsterdam 67 161
14. P. Jonsson C. Bäckström On the size of reactive plans Proc. AAAI-96, Portland, OR 1996 1182 1187
15. P. Jonsson C. Bäckström Tractable plan existence does not imply tractable plan generation Ann. Math. Artificial Intelligence 22 3–4 1998 281 296
16. R.M. Karp R. Lipton Turing machines that take advice Enseign. Math. 28 1982 191 209
17. J. Köbler O. Watanabe New collapse consequences of NP having small circuits SIAM J. Comput. 28 1 1999 311 324
18. R.E. Korf Planning as search: A quantitative approach Artificial Intelligence 33 1987 65 88
19. H.R. Lewis C.H. Papadimitriou Symmetric space-bounded computation Theoret. Comput. Sci. 19 1982 161 187
20. R. Motwani P. Raghavan Randomized Algorithms 1995 Cambridge University Press Cambridge
21. C.H. Papadimitriou Computational Complexity 1994 Addison Wesley Reading, MA
22. E.D. Sacerdoti The non-linear nature of plans Proc. IJCAI-75, Tbilisi, Georgia 1975 206 214
23. W.J. Savitch Relationships between nondeterministic and deterministic tape complexities J. Comput. System Sci. 4 2 1970 177 192
24. M.J. Schoppers Universal plans for reactive robots in unpredictable environments Proc. IJCAI-87, Milan, Italy 1987 1039 1046
25. M.J. Schoppers In defense of reaction plans as caches AI Magazine 10 4 1989 51 62
26. M.J. Schoppers Estimating reaction plan size Proc. AAAI-94, Seattle, WA 1994 1238 1244
27. B. Selman Near-optimal plans, tractability, and reactivity Proc. 4th Internat. Conference on the Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany 1994 521 529
28. B.C. Williams P.P. Nayak A reactive planner for a model-based executive Proc. IJCAI-97, Nagoya, Japan 1997 1178 1185