Fast Planning Through Planning Graph Analysis
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Planning. Pages 1636-1641.
Abstract
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 interesting natural and artificial planning problems. We also give empirical evidence that the plans produced by Graphplan are quite sensible. Since searches made by this approach are fundamentally different from the searches of other common planning methods, they provide a new perspective on the planning problem.
@inproceedings{ijcai1995p211,
title = {Fast Planning Through Planning Graph Analysis},
author = {Blum, Avrim and Furst, Merrick L.},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1636--1641},
year = {1995},
note = {Planning},
url = {https://ijcai.org/proceedings/1995/211},
}
TY - CPAPER TI - Fast Planning Through Planning Graph Analysis AU - Blum, Avrim AU - Furst, Merrick L. T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1636 EP - 1641 UR - https://ijcai.org/proceedings/1995/211 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
