• DOI:10.1016/S0004-3702(96)00047-1
Corpus ID: 11518222

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

View via Publisher

doi.org

Save to Library

Create Alert

Cite

Launch Research Feed