The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Fast Planning Through Planning Graph Analysis.
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 partialorder 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. 1 Introduction In this paper we introduce a new planner, Graphplan, which plans in STRIPS-like domains. The algorithm is based on a paradigm we call Planning-Graph Analysis. In this approach,...
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Fikes, R. E., & Nilsson, N. J. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90010-5 · Cited by 4,882
Planning for conjunctive goals
Chapman, D. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90092-0 · Cited by 1,112
The computational complexity of propositional STRIPS planning
Bylander, T. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90081-7 · Cited by 865
An Introduction to Least Commitment Planning
Weld, D. S. (1994) · doi:10.1609/aimag.v15i4.1109 · Cited by 581
McAllester, D., & Rosenblitt, D. (1991) · Cited by 525
A new approach to the maximum flow problem
Goldberg, A. V., & Tarjan, R. E. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12144 · Cited by 329
Barrett, A., & Weld, D. S. (1994) · Artificial Intelligence · doi:10.1016/0004-3702(94)90012-4 · Cited by 155
A structural theory of explanation-based learning
Etzioni, O. (1993) · Artificial Intelligence · doi:10.1016/0004-3702(93)90035-a · Cited by 64
Linkability: examining causal link commitments in partial-order planning
Veloso, M., & Blythe, J. (1994) · Cited by 55
Cited by
The FF Planning System: Fast Plan Generation Through Heuristic Search
Hoffmann, J., & Nebel, B. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.855 · Cited by 1,838
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
Artificial Intelligence: A New Synthesis
(1998) · Elsevier eBooks · doi:10.1016/c2009-0-27773-7 · Cited by 1,163
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
Boutilier, C., Dean, T., & Hanks, S. (1999) · Journal of Artificial Intelligence Research · doi:10.1613/jair.575 · Cited by 1,074
The 3rd International Planning Competition: Results and Analysis
Long, D., & Fox, M. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1240 · Cited by 289
Metadata
- Authors
- Blum, A. L., & Furst, M. L.
- Publisher
- Defense Technical Information Center
- Published
- 1995-12-01
- OpenAlex
- W1731763842
- Cited by
- 365
- References
- 11
- Type
- report
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast Planning Through Planning Graph Analysis. https://app.cochat.ai/papers/10.21236/ada303260
- The paper
- Blum, A. L., & Furst, M. L. (1995). Fast Planning Through Planning Graph Analysis. https://doi.org/10.21236/ada303260
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.