Fast planning through planning graph analysis

Barrett, 1994, Partial-order planning: evaluating possible efficiency gains, Artif. Intell., 67, 71, 10.1016/0004-3702(94)90012-4 Blum, 1995, Fast planning through planning graph analysis, 1636 Bylander, 1994, The computational complexity of propositional STRIPS planning, Artif. Intell., 69, 165, 10.1016/0004-3702(94)90081-7 J. Carbonell, personal communication, 1994. Chapman, 1987, Planning for conjunctive goals, Artif. Intell., 32, 333, 10.1016/0004-3702(87)90092-0 Cormen, 1990 Etzioni, 1990, A structural theory of explanation-based learning Fikes, 1971, STRIPS: a new approach to the application of theorem proving to problem solving, Artif. Intell., 2, 189, 10.1016/0004-3702(71)90010-5 Goldberg, 1986, A new approach to the maximum flow problem, 136 Knoblock, 1994, Generating parallel execution plans with a partial-order planner, 98 McAllester, 1991, Systematic nonlinear planning, 634 Srinivasan, 1995, Comparison of methods for improving search efficiency in a partial-order planner, 1620 Stone, 1994, The need for different domain-independent heuristics, 164 Veloso, 1994, Linkability: examining causal link commitments in partial-order planning, 164 Weld, 1994, An introduction to least-commitment planning, AI Magazine, 15, 27