Initial Results on Generating Macro Actions from a Plan Database for Planning on Autonomous Mobile Robots

Planning in an on-line robotics context has the specific requirement of a short planning duration. A property of typical contemporary scenarios is that (mobile) robots perform similar or even repeating tasks during operation. With these robot domains in mind, we propose database-driven macro planning for STRIPS (DBMP/S) that learns macros – action sequences that frequently appear in plans – from experience for PDDL-based planners. Planning duration is improved over time by off-line processing of seed plans using a scalable database. The approach is indifferent about the specific planner by representing the resulting macros again as actions with preconditions and effects determined based on the actions contained in the macro. For some domains we have used separate planners for learning and execution exploiting their respective strengths. Initial results based on some IPC domains and a logistic robot scenario show significantly improved (over non-macro planners) or slightly better and comparable (to existing macro planners) performance.

[1]  Andrew Coles,et al.  Marvin: A Heuristic Search Planner with Online Macro-Action Learning , 2011, J. Artif. Intell. Res..

[2]  Bernhard Nebel,et al.  Continual planning and acting in dynamic multiagent environments , 2006 .

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

[4]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[5]  T. Niemueller,et al.  Planning Competition for Logistics Robots in Simulation , 2016 .

[6]  Alfonso Gerevini,et al.  Combining Domain-Independent Planning and HTN Planning: The Duet Planner , 2008, ECAI.

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

[8]  Paolo Traverso,et al.  Automated planning - theory and practice , 2004 .

[9]  John Levine,et al.  Learning Macro-Actions for Arbitrary Planners and Domains , 2007, ICAPS.

[10]  Andrew Coles,et al.  Online Identification of Useful Macro-Actions for Planning , 2007, ICAPS.

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

[12]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[13]  Gerhard Lakemeyer,et al.  Continual Planning in Golog , 2016, AAAI.

[14]  Craig A. Knoblock,et al.  PDDL-the planning domain definition language , 1998 .

[15]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[16]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[17]  Lukás Chrpa,et al.  MUM: A Technique for Maximising the Utility of Macro-operators by Constrained Generation and Use , 2014, ICAPS.

[18]  Jonathan Schaeffer,et al.  Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators , 2005, J. Artif. Intell. Res..

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

[20]  Ivan Serina,et al.  Planning Through Stochastic Local Search and Temporal Action Graphs in LPG , 2003, J. Artif. Intell. Res..

[21]  Laurent Siklóssy,et al.  The Role of Preprocessing in Problem Solving Systems , 1977, IJCAI.

[22]  Gerhard Lakemeyer,et al.  A generic robot database and its application in fault analysis and performance evaluation , 2012, 2012 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[23]  Thomas Leo McCluskey,et al.  On Exploiting Structures of Classical Planning Problems: Generalizing Entanglements , 2012, ECAI.

[24]  John Levine,et al.  Wizard : Compiled Macro-Actions for Planner-Domain Pairs , .

[25]  Lukás Chrpa,et al.  Generation of macro-operators via investigation of action dependencies in plans , 2010, The Knowledge Engineering Review.