DPlan-

Universal Planning and Control Rule Learning

DPlan is a domain-independent, non-linear state-based backward planner developed 1998-2000 at Technical University Berlin, Department of Computer Science, Methods of AI Group and since 2000 at University of Osnabrück, Computer Science Group (of the Department of Mathematics and Computer Science), by Ute Schmid. Modifications and extensions are supported by diploma and project students. DPlan is part of a larger system which combines universal planning, generalization-to-n, analogical reasoning and abstraction for synthesis of recursive functions (IPAL). DPlan is combined with inductive program synthesis to automatically generate domain-dependent control rules from universal plans for problems with small complexity (rocket with 3 objects, blocks-world with 3 blocks, ...). Control rules are represented as recursive functions. If control rules are learned, for this domain search can be omitted completely. The last major extension of DPlan was the inclusion of function application.
Code People Papers Projects Links Contact

Code

DPlan is implemented in Common LISP. Programs can be interpreted with clisp or Allegro Common Lisp.

1.  [zip] DPlan-1.0 (dec 1998)

1.1   [zip] DPlan-1.1 (re-implementation, pddl format, with cond-effects, oct 2001)

2.  [zip] DPlan-2.0 (incl. function application, may 2000)

3.  DPlan uses PDDL for representing domains

4.  Graphic Output: xtree or graphlet. (called by scripts -- paths must be changed for your environment!)

4.  Work in Progress: Transformation of universal plans into initial program terms.


People


Papers


Projects


Links