Plan Quality Optimisation via Block Decomposition

AI planners have to compromise between the speed of the planning process and the quality of the generated plan. Anytime planners try to balance these objectives by finding plans of better quality over time, but current anytime planners often do not make effective use of increasing runtime beyond a certain limit. We present a new method of continuing plan improvement, that works by repeatedly decomposing a given plan into subplans and optimising each subplan locally. The decomposition exploits block-structured plan deordering to identify coherent subplans, which make sense to treat as units. This approach extends the "anytime capability" of current planners - to provide continuing plan quality improvement at any time scale.

[1]  Rami Puzis,et al.  Potential Search: A Bounded-Cost Search Algorithm , 2011, ICAPS.

[2]  Patrik Haslum,et al.  Computing Genome Edit Distances using Domain-Independent Planning , 2011, ICAPS 2011.

[3]  Martin Müller,et al.  Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement , 2010, ICAPS.

[4]  Carmel Domshlak,et al.  Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.

[5]  Wheeler Ruml,et al.  Faster Bounded-Cost Search Using Inadmissible Estimates , 2012, ICAPS.

[6]  Roman Barták,et al.  On Improving Plan Quality via Local Enhancements , 2012, SOCS.

[7]  Wim Nuijten,et al.  Randomized Large Neighborhood Search for Cumulative Scheduling , 2005, ICAPS.

[8]  David Furcy.  ITSA * : Iterative Tunneling Search with A * , 2006 .

[9]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

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

[11]  Jörg Hoffmann,et al.  Fast Downward Stone Soup , 2011 .

[12]  Craig A. Knoblock,et al.  Planning by Rewriting , 2001, J. Artif. Intell. Res..

[13]  Paolo Traverso,et al.  Automated Planning: Theory & Practice , 2004 .

[14]  Christer Bäckström.  Computational Aspects of Reordering Plans , 1998, J. Artif. Intell. Res..

[15]  Wheeler Ruml,et al.  The Joy of Forgetting: Faster Anytime Search via Restarting , 2010, ICAPS.

[16]  Patrik Haslum.  Incremental Lower Bounds for Additive Cost Planning Problems , 2012, ICAPS.

[17]  Alfonso Gerevini,et al.  An Automatically Configurable Portfolio-based Planner with Macro-actions: PbP , 2009, ICAPS.

[18]  Ira Pohl,et al.  Joint and LPA*: Combination of Approximation and Search , 1986, AAAI.

[19]  Patrik Haslum,et al.  Block-Structured Plan Deordering , 2012, Australasian Conference on Artificial Intelligence.

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

[21]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[22]  Alban Grastien,et al.  Diagnosis As Planning: Two Case Studies , 2011, ICAPS 2011.

[23]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..