• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Fast Planning Through Planning Graph Analysis (1995)

Cached

  • Download as a PDF
  •  
  • Download as a PS

Download Links

  • [www.cs.cmu.edu]
  • [reports.adm.cs.cmu.edu]
  • [www-i5.informatik.rwth-aachen.de]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.eecs.harvard.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu.]
  • [www-cgi.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www.lb.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu.]
  • [www-cgi.cs.cmu.edu]
  • [www-cgi.cs.cmu.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Avrim L. Blum , Merrick L. Furst
Venue:ARTIFICIAL INTELLIGENCE
Citations:852 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Blum95fastplanning,
    author = {Avrim L. Blum and Merrick L. Furst},
    title = {Fast Planning Through Planning Graph Analysis},
    journal = {ARTIFICIAL INTELLIGENCE},
    year = {1995},
    volume = {90},
    number = {1},
    pages = {1636--1642}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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.

Citations

7321 Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
1555 STRIPS: A new approach to the application of theorem proving to problem solving - Fikes, Nilsson - 1971
586 Planning for conjunctive goals - Chapman - 1987
391 A new approach to the maximum flow problem - Goldberg, Tarjan
358 Systematic nonlinear planning - McAllester, Rosenblitt - 1991
59 Partial-order planning: Evaluating possible efficiency gains - Barrett, Weld - 1994
50 A structural theory of explanation-based learning - Etzioni - 1990
41 The need for different domain-independent heuristics - Stone, Veloso, et al. - 1994
41 Linkability: Examining causal link commitments in partial-order planning - Veloso, Blythe - 1994
33 Generating parallel execution plans with a partial-order planner - Knoblock - 1994
9 Comparison of methods for improving search efficiency in a partial-order planner - Srinivasan, Howe - 1995
6 An introduction to partial-order planning - Weld - 1994
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University