Cost-Optimal External Planning

This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costoptimal solution. We contribute a procedure for finding the upper bound on the locality of the search in planning graphs that dictates the number of layers that have to be kept to avoid re-openings. We also discuss an external variant of Enforced Hill Climbing. Using relaxed-plan heuristic without helpful-action pruning we have been able to perform large explorations on metric planning problems, providing better plan lengths than have been reported earlier. A novel approach to plan reconstruction in external setting with linear I/O complexity is proposed. We provide external exploration results on some recently proposed planning domains.

[1]  Eric A. Hansen,et al.  Breadth-first heuristic search , 2004, Artif. Intell..

[2]  Yixin Chen,et al.  Constraint partitioning in penalty formulations for solving temporal planning problems , 2006, Artif. Intell..

[3]  Derek Long,et al.  Plan validation and mixed-initiative planning in space operations , 2005 .

[4]  Kamesh Munagala,et al.  I/O-complexity of graph algorithms , 1999, SODA '99.

[5]  Stefan Edelkamp,et al.  On the Compilation of Plan Constraints and Preferences , 2006, ICAPS.

[6]  Malte Helmert,et al.  Decidability and Undecidability Results for Planning with Numerical State Variables , 2002, PuK.

[7]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[8]  Patrik Haslum,et al.  Planning with Reduced Operator Sets , 2000, AIPS.

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

[10]  Eric A. Hansen,et al.  Structured Duplicate Detection in External-Memory Graph Search , 2004, AAAI.

[11]  Venkatesh Raman,et al.  Sorting Multisets and Vectors In-Place , 1991, WADS.

[12]  Jörg Hoffmann,et al.  The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..

[13]  Stefan Edelkamp,et al.  Parallel External Directed Model Checking with Linear I/O , 2006, VMCAI.

[14]  Derek Long,et al.  Plan Constraints and Preferences in PDDL3 , 2006 .

[15]  Richard E. Korf,et al.  Divide-and-Conquer Frontier Search Applied to Optimal Sequence Alignment , 2000, AAAI/IAAI.

[16]  Richard E. Korf,et al.  Large-Scale Parallel Breadth-First Search , 2005, AAAI.

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

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