-
Graphplan is an
algorithm for
automated planning developed by
Avrim Blum and
Merrick Furst in 1995.
Graphplan takes as
input a
planning problem expressed...
- search,
possibly enhanced by the use of
state constraints (see STRIPS,
graphplan) partial-order
planning reduction to the
propositional satisfiability...
- this is to go
through horizon lengths sequentially, 0, 1, 2, and so on.
Graphplan H. A.
Kautz and B.
Selman (1992).
Planning as satisfiability. In Proceedings...
-
STRIPS took a
different approach,
viewing planning as
theorem proving.
Graphplan takes a least-commitment
approach to planning,
rather than sequentially...
- ****lock, C. A., "Combining the
Expressivity of
UCPOP with the
efficiency of
Graphplan." In ECP97, pp. 221233. Toulouse, France. 1997 Nebel, B., "On the Compilability...
