Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Ubiquitous computing technology plays a key role for providing context information and makes context-aware services can be… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
We present an OWL-S service composition planner, called OWLS-Xplan, that allows for fast and flexible composition of OWL-S… Expand
  • figure 2
  • table 1
  • figure 3
  • figure 1
  • figure 4
2005
2005
Despite recent progress in AI planning, many problems remain challenging for current planners. In many domains, the performance… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
  • I. Niemelä
  • Annals of Mathematics and Artificial Intelligence
  • 2004
  • Corpus ID: 14465318
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… Expand
  • table 1
  • table 2
  • table 3
Highly Cited
2004
Highly Cited
2004
Military operations planning involves concurrent actions, resource assignment, and conflicting costs. Individual tasks sometimes… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 5
Highly Cited
1998
Highly Cited
1998
Planning under uncertainty is a difficult task. If sensory information is available, it is possible to do contingency planning… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Highly Cited
1998
Highly Cited
1998
Graphplan has attracted considerable interest because of its extremely high performance, but the algorithm's inability to handle… Expand
  • figure 2
  • figure 5
  • figure 6
  • figure 7
  • figure 8
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… Expand
Highly Cited
1997
Highly Cited
1997
There has been a great deal of recent work on new approaches to efficiently generating plans in systems such as Graphplan and… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
Highly Cited
1996
Highly Cited
1996
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to… Expand
  • table 1
  • table 2
  • table 3