PLTOOL: A knowledge engineering tool for planning and learning

Absract Artificial intelligence (AI) planning solves the problem of generating a correct and efficient ordered set of instantiated activities, from a knowledge base of generic actions, which when executed will transform some initial state into some desirable end-state. There is a long tradition of work in AI for developing planners that make use of heuristics that are shown to improve their performance in many real world and artificial domains. The developers of planners have chosen between two extremes when defining those heuristics. The domain-independent planners use domain-independent heuristics, which exploit information only from the ‘syntactic’ structure of the problem space and of the search tree. Therefore, they do not need any ‘semantic’ information from a given domain in order to guide the search. From a knowledge engineering (KE) perspective, the planners that use this type of heuristics have the advantage that the users of this technology need only focus on defining the domain theory and not on defining how to make the planner efficient (how to obtain ‘good’ solutions with the minimal computational resources). However, the domain-dependent planners require users to manually represent knowledge not only about the domain theory, but also about how to make the planner efficient. This approach has the advantage of using either better domain-theory formulations or using domain knowledge for defining the heuristics, thus potentially making them more efficient. However, the efficiency of these domain-dependent planners strongly relies on the KE and planning expertise of the user. When the user is an expert on these two types of knowledge, domain-dependent planners clearly outperform domain-independent planners in terms of number of solved problems and quality of solutions. Machine-learning (ML) techniques applied to solve the planning problems have focused on providing middle-ground solutions as compared to the aforementioned two extremes. Here, the user first defines a domain theory, and then executes the ML techniques that automatically modify or generate new knowledge with respect to both the domain theory and the heuristics. In this paper, we present our work on building a tool, PLTOOL (planning and learning tool), to help users interact with a set of ML techniques and planners. The goal is to provide a KE framework for mixed-initiative generation of efficient and good planning knowledge.

[1]  Ricardo Aler,et al.  MACHINE LEARNING IN HYBRID HIERARCHICAL AND PARTIAL-ORDER PLANNERS FOR MANUFACTURING DOMAINS , 2005, Appl. Artif. Intell..

[2]  Qiang Yang,et al.  Learning Actions Models from Plan Examples with Incomplete Knowledge , 2005, ICAPS.

[3]  Jonathan Schaeffer,et al.  Learning Partial-Order Macros from Solutions , 2005, ICAPS.

[4]  Juan D. Arias Using ontologies for planning tourist visits , 2005 .

[5]  María Dolores Rodríguez-Moreno,et al.  An AI Planning-based Tool for Scheduling Satellite Nominal Operations , 2004, AI Mag..

[6]  Amedeo Cesta,et al.  IPSS: A Hybrid Reasoner for Planning and Scheduling , 2004, ECAI.

[7]  Manuela M. Veloso,et al.  Lazy Incremental Learning of Control Knowledge for Efficiently Obtaining Quality Plans , 1997, Artificial Intelligence Review.

[8]  Tom M. Mitchell,et al.  Explanation-Based Generalization: A Unifying View , 1986, Machine Learning.

[9]  STEVEN MINTON,et al.  A reply to Zito-Wolf's book review ofLearning search control knowledge: An explanation-based approach , 2004, Machine Learning.

[10]  Angelo Oddi,et al.  IPSS: A problem solver that integrates P&S , 2004 .

[11]  Ricardo Aler,et al.  Using Previous Experience for Learning Planning Control Knowledge , 2004, FLAIRS.

[12]  Dana S. Nau,et al.  SHOP2: An HTN Planning System , 2003, J. Artif. Intell. Res..

[13]  T. L. McCluskey,et al.  GIPO II: HTN Planning in a Tool-supported Knowledge Engineering Environment , 2003, ICAPS.

[14]  Terry L. Zimmerman,et al.  Learning-Assisted Automated Planning: Looking Back, Taking Stock, Going Forward , 2003, AI Mag..

[15]  Pedro Isasi Viñuela,et al.  Using genetic programming to learn and improve control knowledge , 2002, Artif. Intell..

[16]  Ricardo Aler,et al.  On Control Knowledge Acquisition by Exploiting Human-Computer Interaction , 2002, AIPS.

[17]  Fahiem Bacchus,et al.  Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002) , 2002, AAAI 2002.

[18]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[19]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[20]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[21]  Muhammad Afzal Upal Learning Plan Rewriting Rules , 2001, FLAIRS.

[22]  Antonio González Muñoz,et al.  Mixing expressiveness and efficiency in a manufacturing planner , 2001, J. Exp. Theor. Artif. Intell..

[23]  Sira Vegas,et al.  Quality-based Learning for Planning , 2001 .

[24]  T. L. McCluskey Knowledge Engineering for Planning ROADMAP , 2000 .

[25]  Pedro Isasi Viñuela,et al.  Knowledge Representation Issues in Control Knowledge Learning , 2000, ICML.

[26]  Bart Selman,et al.  Learning Declarative Control Rules for Constraint-BAsed Planning , 2000, ICML.

[27]  Muhammad Afzal Upal,et al.  Learning Rewrite Rules versus Search Control Rules to Improve Plan Quality , 2000, Canadian Conference on AI.

[28]  Subbarao Kambhampati,et al.  Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..

[29]  D. Borrajo,et al.  Multistrategy Relational Learning of Heuristics for Problem Solving , 2000 .

[30]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

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

[32]  Tara A. Estlin,et al.  Learning to Improve both Efficiency and Quality of Planning , 1997, IJCAI.

[33]  S. Sitharama Iyengar,et al.  An Event Drive Integration Reasoning Scheme for Handling Dynamic Threats in an Unstructured Environment , 1997, Artif. Intell..

[34]  Dawn E. Wilkins,et al.  The Act-Editor User''s Guide: A Manual for Version2 , 1997 .

[35]  T. L. McCluskey,et al.  Engineering and Compiling Planning Domain Models to Promote Validity and Efficiency , 1997, Artif. Intell..

[36]  Subbarao Kambhampati,et al.  Learning search control rules for plan-space planners: factors affecting the performance , 1996 .

[37]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[38]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

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

[40]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[41]  Xuemei Wang,et al.  Learning Planning Operators by Observation and Practice , 1994, AIPS.

[42]  Gerald DeJong,et al.  COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-Up Learning , 1992, AAAI.

[43]  Oren Etzioni,et al.  Why EBL Produces Overly-Specific Knowledge: A Critique of the PRODIGY Approaches , 1992, ML.

[44]  Oren Etzioni,et al.  PRODIGY4.0: The Manual and Tutorial , 1992 .

[45]  Christer Backstrom,et al.  Computational Complexity of Reasoning about Plans , 1992 .

[46]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[47]  Oren Etzioni,et al.  Integrating Abstraction and Explanation-Based Learning in PRODIGY , 1991, AAAI.

[48]  T. McCluskey Explanation-based and similarity-based heuristic acquisition in a general planner , 1990 .

[49]  James A. Hendler,et al.  Flexible reuse and modification in hierarchical planning: a validation structure-based approach , 1989 .

[50]  Eric Dietrich,et al.  Experimental and theoretical artificial intelligence , 1989, J. Exp. Theor. Artif. Intell..

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

[52]  T. L. McCluskey,et al.  Combining Weak Learning Heuristics in General Problem Solvers , 1987, IJCAI.

[53]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

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