A. Blum, and M. Furst. Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 95), page 1636--1642. (1995)
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 shortestpossible 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...
%0 Conference Paper
%1 citeulike:557547
%A Blum, Avrim
%A Furst, Merrick
%B Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 95)
%D 1995
%K graph, plan, planning
%P 1636--1642
%T Fast Planning Through Planning Graph Analysis
%U http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.7263
%X 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 shortestpossible 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...
@inproceedings{citeulike:557547,
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 shortestpossible 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...}},
added-at = {2010-12-17T18:47:41.000+0100},
author = {Blum, Avrim and Furst, Merrick},
biburl = {https://www.bibsonomy.org/bibtex/22e796ad69b99fd951674c81be9159313/mortimer_m8},
booktitle = {Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI 95)},
citeulike-article-id = {557547},
citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.7263},
interhash = {6d054e8d69b677b7ede32dce0c60193b},
intrahash = {2e796ad69b99fd951674c81be9159313},
keywords = {graph, plan, planning},
pages = {1636--1642},
posted-at = {2006-10-13 13:48:28},
priority = {2},
timestamp = {2010-12-20T11:11:25.000+0100},
title = {{Fast Planning Through Planning Graph Analysis}},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.7263},
year = 1995
}