DISTILL: Learning Domain-Specific Planners by Example

An interesting alternative to domain-independent planning is to provide example plans to demonstrate how to solve problems in a particular domain and to use that information to learn domain-specific planners. Others have used example plans for case-based planning, but the retrieval and adaptation mechanisms for the inevitably large case libraries raise efficiency issues of concern. In this paper, we introduce dsPlanners, or automatically generated domain-specific planners. We present the DISTILL algorithm for learning dsPlanners automatically from example plans. DISTILL converts a plan into a dsPlanner and then merges it with previously learned dsPlanners. Our results show that the dsPlanners automatically learned by DISTILL compactly represent its domain-specific planning experience. Furthermore, the dsPlanners situationally generalize the given example plans, thus allowing them to efficiently solve problems that have not previously been encountered. Finally, we present the DISTILL procedure to automatically acquire one-step loops from example plans, which permits experience acquired from small problems to be applied to solving arbitrarily large ones.

[1]  Richard Fikes,et al.  Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[2]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[3]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

[4]  Jaime G. Carbonell,et al.  Learning effective search control knowledge: an explanation-based approach , 1988 .

[5]  Michael R. Lowry,et al.  Automating software design , 1989, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[6]  Jaime G. Carbonell,et al.  Learning by experimentation: the operator refinement method , 1990 .

[7]  Ryszard S. Michalski,et al.  Machine learning: an artificial intelligence approach volume III , 1990 .

[8]  Douglas R. Smith,et al.  KIDS - A Knowledge-Based Software Development System , 1991 .

[9]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[10]  Manuela M. Veloso,et al.  Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.

[11]  Paolo Traverso,et al.  Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains , 1998, AAAI/IAAI.

[12]  Roni Khardon,et al.  Learning Action Strategies for Planning Domains , 1999, Artif. Intell..

[13]  Manuela M. Veloso,et al.  The Lumberjack Algorithm for Learning Linked Decision Forests , 2000, PRICAI.

[14]  Pedro M. Domingos,et al.  Programming by demonstration: a machine learning approach , 2001 .

[15]  Manuela M. Veloso,et al.  Analyzing Plans with Conditional Effects , 2002, AIPS.

[16]  Ute Schmid,et al.  Inductive Synthesis of Functional Programs , 2003, Lecture Notes in Computer Science.

[17]  Yumi Iwasaki,et al.  The concept and implementation of skeletal plans , 1985, Journal of Automated Reasoning.