A probabilistic analysis of prepositional STRIPS planning

Artificial Intelligence

Volumn 81, Issue 1-2, 1996, Pages 241-271

  Bylander, Tom ^a  

^a University of Texas at San Antonio   (United States)

Author keywords

Average case analysis; Planning; PSPACE complete; STRIPS

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; PROBABILITY; PROBLEM SOLVING;

AVERAGE CASE ANALYSIS; GROUND ATOMS; PLANNING INSTANCE; POSTCONDITIONS; PRECONDITIONS; PROPOSITIONAL STRIPS PLANNING;

ARTIFICIAL INTELLIGENCE;

EID: 0030110672     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00055-0     Document Type: Article

References (28)

1. C. Bäckström and I. Klein, Parallel non-binary planning in polynomial time, in: Proceedings IJCAI-91, Sydney, Australia (1991) 268-273.
2. T. Bylander, Complexity results for planning, in: Proceedings IJCAI-91, Sydney, Australia (1991) 274-279.
3. T. Bylander, An average case analysis of planning, in: Proceedings AAAI-93, Washington, DC (1993) 480-485.
4. T. Bylander, The computational complexity of prepositional STRIPS planning, Artif. Intell. 69 (1994) 161-204.
5. D. Chapman, Planning for conjunctive goals, Artif. Intell 32 (3) (1987) 333-377; also in: J. Allen, J. Hendler and A. Tate, eds., Readings in Planning (Morgan Kaufmann, San Mateo, CA, 1990).
6. D. Chapman, Planning for conjunctive goals, Artif. Intell 32 (3) (1987) 333-377; also in: J. Allen, J. Hendler and A. Tate, eds., Readings in Planning (Morgan Kaufmann, San Mateo, CA, 1990).
7. P. Cheeseman, B. Kanefsky and W.M. Taylor, Where the really hard problems are, in: Proceedings IJCAI-91, Sydney, Australia (1991) 331-337.
8. P.R. Cohen, A survey of the Eighth National Conference on Artificial Intelligence: pulling together or pulling apart?, AI Mag. 12 (1) (1991) 17-41.
9. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA, 1990).
10. J.M. Crawford and L.D. Auton, Experimental results on the crossover point in satisfiability problems, in: Proceedings AAAI-93, Washington, DC (1993) 46-51.
11. K. Erol, D.S. Nau and V.S. Subrahmanian, On the complexity of domain-independent planning, in: Proceedings AAAI-92, San Jose, CA (1992) 381-386.
12. K. Erol, D.S. Nau and V.S. Subrahmanian, When is planning decidable?, in: Proceedings First International Conference on AI Planning Systems (1992) 222-227.
13. R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving, Artif. Intell. 2 (3/4) (1971) 189-208; also in: J. Allen, J. Hendler and A. Tate, eds., Readings in Planning (Morgan Kaufmann, San Mateo, CA, 1990).
14. R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving, Artif. Intell. 2 (3/4) (1971) 189-208; also in: J. Allen, J. Hendler and A. Tate, eds., Readings in Planning (Morgan Kaufmann, San Mateo, CA, 1990).
15. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, New York, 1979).
16. K.J. Hammond, Explaining and repairing plans that fail, Artif. Intell. 45 (1-2) (1990) 173-228.
17. S. Kambhampati and J.A. Hendler, A validation-structure-based theory of plan modification and reuse, Artif. Intell. 55 (2-3) (1992) 193-258.
18. D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings AAAI-91, Anaheim, CA (1991) 634-639.
19. M. Minsky, Logical versus analogical or symbolic versus connectionist or neat versus scruffy, AI Mag. 12 (2) (1991) 34-51.
20. S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artif. Intell. 58 (1992) 161-205.
21. D. Mitchell, B. Selman and H.J. Levesque, Hard and easy distributions of SAT problems, in: Proceedings AAAI-92, San Jose, CA (1992) 459-465.
22. R. Musick and S. Russell, How long will it take?, in: Proceedings AAAI-92, San Jose, CA (1992) 466-471.
23. B. Nebel and J. Koehler, Plan modification versus plan generation: a complexity-theoretic perspective, in: Proceedings IJCAI-93, Chambery, France (1993) 1436-1441.
24. N.J. Nilsson, Principles of Artificial Intelligence (Tioga, Palo Alto, CA, 1980).
25. J.S. Penberthy and D.S. Weld, UCPOP: a sound, complete, partial order planning for ADL, in: Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA (1992) 103-114.
26. B. Selman and H.A. Kautz, An empirical study of greedy local search for satisfiability testing, in: Proceedings AAAI-93, Washington, DC (1993) 46-51.
27. B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, in: Proceedings AAAI-92, San Jose, CA (1992) 440-446.
28. C.P. Williams and T. Hogg, Using deep structure to locate hard problems, in: Proceedings AAAI-92, San Jose, CA (1992) 472-477.