Partial Plans Completion with GRAPHPLAN

Abstract

Completion of partial plans is a subtask for many planning techniques such as plan reusing, replanning and accomplishing complex user goals. The new generation of fast planners such as Graphplan, Satplan and others, is characterized by very efficent planning algorithms which exploit techniques of multiple plans representation. Unfortunately it is fairly difficult to give Graphplan a partial plan fragment to complete, because the internal plan network representation, only represents ordered by levels and complete plans. On the other hand it is very easy and straigthforward to provide an initial partial plan to complete to a planner like UCPOP, because its planning algorithm completes a partial initial plan in the internal representation. We present an original technique for using Graphplan in order to solve partial plan completion problems. The technique, called domain embedding, modifies the problem domain in order to induce only solutions which are completion of the given partial pl...

Cite this paper

@article{milani1998partial,
  title = {{Partial Plans Completion with GRAPHPLAN}},
  author = {Milani, Alfredo and Marcugini, Stefano and Baioletti, Marco},
  year = {1998}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Related papers