e/Graphplan

Information
has gloss	eng: Graphplan is an algorithm for automated planning developed by Avrim Blum and Merrick Furst in 1995. Graphplan takes as input a planning problem expressed in STRIPS and produces, if one is possible, a sequence of operations for reaching a goal state. The name graphplan is due to the use of a novel planning graph to reduce the amount of search needed to find the solution from straightforward exploration of the state space graph, in which the nodes are possible states and edges indicate reachability through a certain action.
lexicalization	eng: Graphplan
instance of	e/Search algorithm