Graphplan

Known as: Graphplan algorithm 
Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995. Graphplan takes as input a planning problem… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Graphplan (Blum & Furst 1995) has proved a popular and successful basis for a succession of extensions. An extension to handle… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Review
2000
Review
2000
This paper reviews the connections between Graphplan’s planning-graph an d the dynamic constraint satisfaction problem and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2000
2000
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan’s backward search phase, and… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Graphplan planner has enjoyed considerable success as a planning algorithm for classical STRIPS domains In this paper we… (More)
Is this relevant?
1999
1999
The Graphplan algorithm exemplifies the speed-up achieveable with disjunctive representations that leverage opposing directions… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Planning under uncertainty is a difficult task. If sensory information is available, it is possible to do c ntingency planning… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
1998
Highly Cited
1998
If an agent does not have complete information about the world-state, it must reason about alternative possible states of the… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Graphplan has attracted considerable interest because of its extremely high performance, but the algorithm’s inability to handle… (More)
  • figure 2
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
Highly Cited
1997
Highly Cited
1997
There has been a great deal of recent work on new approaches to e ciently generating plans in systems such as Graphplan and… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the… (More)
  • figure 1
  • figure 3
  • figure 4
Is this relevant?