On the Use of Landmarks in LPG

Domain-Independent planning is notoriously a very hard search problem. In the literature, several techniques for search control have been proposed in the context of various planning formalisms. In particular, Landmark techniques have been widely used in the planning community in order to guide the search process or to define heuristic functions. A Landmark can be defined as a logical expression, consisting of facts or actions, that certainly becomes true in any solution plan for that problem. In this work, we propose the use of Landmarks for the LPG planner, considering different design choices and analysing empirically its impact on the performance of the planner. Preliminary results show that these techniques can effectively improve the performance of LPG, obtaining results comparable with the state-of-the-art planner LAMA.

[1]  Ivan Serina,et al.  An approach to efficient planning with numerical fluents and multi-criteria plan quality , 2008, Artif. Intell..

[2]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

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

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

[5]  Subbarao Kambhampati,et al.  Domain Independent Approaches for Finding Diverse Plans , 2007, IJCAI.

[6]  Subbarao Kambhampati,et al.  Generating diverse plans to handle unknown and partially known user preferences , 2012, Artif. Intell..

[7]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[8]  Daniel S. Weld,et al.  Determinize, Solve, and Generalize: Classical Planning for MDP Heuristics , 2009 .

[9]  Vincent Vidal,et al.  Problem Splitting Using Heuristic Search in Landmark Orderings , 2013, IJCAI.

[10]  Ivan Serina,et al.  LPG: A Planner Based on Local Search for Planning Graphs with Action Costs , 2002, AIPS.

[11]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

[12]  Ivan Serina,et al.  An Empirical Analysis of Some Heuristic Features for Local Search in LPG , 2004, ICAPS.

[13]  Juan Fernández-Olivares,et al.  Automatic Generation of User Adapted Learning Designs: An AI-Planning Proposal , 2008, AH.

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

[15]  Ivan Serina,et al.  An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events , 2011, J. Artif. Intell. Res..

[16]  R. Givan,et al.  Landmark Extraction via Planning Graph Propagation , 2003 .

[17]  Silvia Richter,et al.  The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks , 2010, J. Artif. Intell. Res..

[18]  Laura Sebastia,et al.  On the extraction, ordering, and usage of landmarks in planning , 2001 .

[19]  Ivan Serina,et al.  Local Search Techniques for Temporal Planning in LPG , 2003, ICAPS.

[20]  Sergio Jiménez Celorrio,et al.  The PELA Architecture: Integrating Planning and Learning to Improve Execution , 2008, AAAI.

[21]  S. Edelkamp,et al.  The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..

[22]  Ivan Serina,et al.  Plan Stability: Replanning versus Plan Repair , 2006, ICAPS.

[23]  Ioannis Vlahavas,et al.  A Visual Programming Tool for Designing Planning Problems for Semantic Web Service Composition , 2007 .

[24]  Ivan Serina,et al.  Planning as Propositional CSP: From Walksat to Local Search Techniques for Action Graphs , 2003, Constraints.

[25]  Ivan Serina,et al.  Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques , 2000, AIPS.