Fast planning through planning graph analysis

Artificial Intelligence

Volumn 90, Issue 1-2, 1997, Pages 281-300

  Blum, Avrim L ^a   Furst, Merrick L ^a  

^a Carnegie Mellon University   (United States)

Author keywords

General purpose planning; Graph algorithms; Planning graph analysis; STRIPS planning

Indexed keywords

ALGORITHMS; GRAPHIC METHODS;

GRAPH ALGORITHMS; GRAPHPLAN ALGORITHM; PLANNING GRAPH ANALYSIS;

ARTIFICIAL INTELLIGENCE;

EID: 0031074857     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0004-3702(96)00047-1     Document Type: Article

References (15)

1. A. Barrett and D.S. Weld, Partial-order planning: evaluating possible efficiency gains, Artif. Intell. 67 (1994) 71-112.
2. A. Blum and M. Furst, Fast planning through planning graph analysis, in: Proceedings IJCAI-95, Montreal, Que. (1995) 1636-1642.
3. T. Bylander, The computational complexity of prepositional STRIPS planning, Artif. Intell. 69 (1994) 165-204.
4. J. Carbonell, personal communication, 1994.
5. D. Chapman, Planning for conjunctive goals, Artif. Intell. 32 (1987) 333-377.
6. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms (MIT Press, Cambridge, MA/McGraw-Hill, New York, 1990).
7. O. Etzioni, A structural theory of explanation-based learning, PhD thesis, CMU-CS-90-185, Carnegie Mellon University, Pittsburgh, PA (1990).
8. R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving, Artif. Intell. 2 (1971) 189-208.
9. A.V. Goldberg and R.E. Tarjan, A new approach to the maximum flow problem, in: Proceedings Eighteenth ACM Symposium on Theory of Computing, Berkeley, CA (1986) 136-146.
10. C.A. Knoblock, Generating parallel execution plans with a partial-order planner, in: Proceedings AIPS-94, Chicago, IL (1994) 98-103.
11. D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings AAAI-91, Anaheim, CA (1991) 634-639.
12. R. Srinivasan and A. Howe, Comparison of methods for improving search efficiency in a partial-order planner, in: Proceedings IJCAI-95, Montreal, Que. (1995) 1620-1626.
13. P. Stone, M. Veloso and J. Blythe, The need for different domain-independent heuristics, in: Proceedings AIPS-94, Chicago, IL (1994) 164-169.
14. M. Veloso and J. Blythe, Linkability: examining causal link commitments in partial-order planning, in: Proceedings AIPS-94, Chicago, IL (1994) 164-169.
15. D.S. Weld, An introduction to least-commitment planning, AI Magazine 15 (4) (1994) 27-61.