Fast Planning Through Planning Graph Analysis

@article{Blum1995FastPT,
  title={Fast Planning Through Planning Graph Analysis},
  author={A. Blum and M. Furst},
  journal={Artif. Intell.},
  year={1995},
  volume={90},
  pages={281-300}
}
  • A. Blum, M. Furst
  • Published 1995
  • Mathematics, Computer Science
  • Artif. Intell.
  • We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest-possible partial-order plan, or states that no valid plan exists. We provide empirical evidence in favor of this approach, showing that Graphplan outperforms the total-order planner, Prodigy, and the partial-order planner, UCPOP, on a variety of… CONTINUE READING
    2,245 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Domain-independent temporal planning in a planning-graph-based approach
    • 4
    • Highly Influenced
    • PDF
    Incremental Local Search for Planning Problems
    • 3
    A Graph-based Approach for POCL Planning
    • 4
    • PDF
    A Novel Constraint Model for Parallel Planning
    • 5
    • Highly Influenced
    • PDF
    FIP: A Fast Planning-Graph-Based Iterative Planner
    • 7
    • PDF
    Goal-Directed Flexible Graphplan
    Extracting Effective and Admissible State Space Heuristics from the Planning Graph
    • 49
    • PDF
    4SP: A four stage incremental planning approach
    • 2
    • Highly Influenced
    • PDF
    A Planning Algorithm not based on Directional Search
    • 84
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 30 REFERENCES
    Generating Parallel Execution Plans with a Partial-order Planner
    • 71
    • Highly Influential
    • PDF
    Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner
    • 15
    • PDF
    Planning for Conjunctive Goals
    • D. Chapman
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1987
    • 1,333
    • PDF
    Linkability: Examining Causal Link Commitments in Partial-order Planning
    • 69
    • Highly Influential
    • PDF
    Partial-Order Planning: Evaluating Possible Efficiency Gains
    • 245
    Systematic Nonlinear Planning
    • 714
    • PDF
    An Introduction to Least Commitment Planning
    • 726
    • Highly Influential
    • PDF
    The Need for Different Domain-independent Heuristics
    • 56
    • PDF
    Nonlinear problem solving using intelligent casual-commitment
    • 47
    The Computational Complexity of Propositional STRIPS Planning
    • T. Bylander
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1994
    • 880
    • PDF