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} }
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
Figures and Topics from this paper
2,245 Citations
Domain-independent temporal planning in a planning-graph-based approach
- Computer Science
- AI Commun.
- 2006
- 4
- Highly Influenced
- PDF
Incremental Local Search for Planning Problems
- Mathematics, Computer Science
- Local Search for Planning and Scheduling
- 2000
- 3
On the application of least-commitment and heuristic search in temporal planning
- Computer Science
- IJCAI
- 2003
- 9
- PDF
A Novel Constraint Model for Parallel Planning
- Computer Science
- FLAIRS Conference
- 2011
- 5
- Highly Influenced
- PDF
FIP: A Fast Planning-Graph-Based Iterative Planner
- Computer Science
- 2008 20th IEEE International Conference on Tools with Artificial Intelligence
- 2008
- 7
- PDF
Goal-Directed Flexible Graphplan
- Computer Science
- 2005 International Conference on Machine Learning and Cybernetics
- 2005
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
- Computer Science
- AAAI/IAAI
- 2000
- 49
- PDF
References
SHOWING 1-10 OF 30 REFERENCES
Generating Parallel Execution Plans with a Partial-order Planner
- Computer Science
- AIPS
- 1994
- 71
- Highly Influential
- PDF
Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner
- Mathematics, Computer Science
- IJCAI
- 1995
- 15
- PDF
Linkability: Examining Causal Link Commitments in Partial-order Planning
- Computer Science, Mathematics
- AIPS
- 1994
- 69
- Highly Influential
- PDF
Partial-Order Planning: Evaluating Possible Efficiency Gains
- Mathematics, Computer Science
- Artif. Intell.
- 1994
- 245
The Computational Complexity of Propositional STRIPS Planning
- Mathematics, Computer Science
- Artif. Intell.
- 1994
- 880
- PDF