• Computer Science
• Published in IJCAI 1995
• DOI:10.1016/S0004-3702(96)00047-1

Fast Planning Through Planning Graph Analysis

@inproceedings{Blum1995FastPT,
  title={Fast Planning Through Planning Graph Analysis},
  author={Avrim Blum and Merrick L. Furst},
  booktitle={IJCAI},
  year={1995}
}

• Avrim Blum, Merrick L. Furst

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

View via Publisher

Open Access

Save to Library

Create Alert

Cite