Loop Detection in the PANDA Planning System

The International Planning Competition (IPC) in 2020 was the first one for a long time to host tracks on Hierarchical Task Network (HTN) planning. HYPERTENSION, the winner of the tack on totally-ordered problems, comes with an interesting technique: it stores parts of the decomposition path in the state to mark expanded tasks and forces its depth first search to leave recursive structures in the hierarchy. This can be seen as a form of loop detection (LD) – a technique that is not very common in HTN planning. This might be due to the spirit of encoding enough advice in the model to find plans (so that loop detection is simply not necessary), or because it becomes a computationally hard task in the general (i.e. partially-ordered) setting. We integrated several approximate and exact techniques for LD into the progression search of the HTN planner PANDA. We test our techniques on the benchmark set of the IPC 2020. Both in the partial ordered and total ordered track, PANDA with LD performs better than the respective winner of the competition.

[1]  HyperTensioN A three-stage compiler for planning , 2021 .

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

[3]  Gregor Behnke Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN Planning , 2021, ICAPS.

[4]  Humbert Fiorino,et al.  Totally and Partially Ordered Hierarchical Planners in PDDL4J Library , 2020, ArXiv.

[5]  Susanne Biundo-Stephan,et al.  A Generic Method to Guide HTN Progression Search with Classical Heuristics , 2018, ICAPS.

[6]  Susanne Biundo-Stephan,et al.  HTN Planning as Heuristic Progression Search , 2020, J. Artif. Intell. Res..

[7]  Susanne Biundo-Stephan,et al.  On the Complexity of HTN Plan Verification and Its Implications for Plan Recognition , 2015, ICAPS.

[8]  Gregor Behnke,et al.  Delete- and Ordering-Relaxation Heuristics for HTN Planning , 2020, IJCAI.

[9]  Dominik Schreiber Lilotane: A Lifted SAT-based Approach to Hierarchical Planning , 2021, J. Artif. Intell. Res..

[10]  Susanne Biundo-Stephan,et al.  On Guiding Search in HTN Planning with Classical Planning Heuristics , 2019, IJCAI.

[11]  Susanne Biundo-Stephan,et al.  The PANDA Framework for Hierarchical Planning , 2021, Künstliche Intell..

[12]  Susanne Biundo-Stephan,et al.  On Succinct Groundings of HTN Planning Problems , 2020, AAAI.

[13]  Susanne Biundo-Stephan,et al.  Bringing Order to Chaos - A Compact Representation of Partial Order in SAT-Based HTN Planning , 2019, AAAI.

[14]  Daniel Höller Translating Totally Ordered HTN Planning Problems to Classical Planning Problems Using Regular Approximation of Context-Free Languages , 2021, ICAPS.

[15]  Dominik Schreiber Lifted Logic for Task Networks: TOHTN Planner Lilotane in the IPC 2020 , 2021 .

[16]  James A. Hendler,et al.  Complexity results for HTN planning , 1994, Annals of Mathematics and Artificial Intelligence.

[17]  Pascal Bercher,et al.  On the Decidability of HTN Planning with Task Insertion , 2011, IJCAI.

[18]  PYHIPOP– Hierarchical Partial-Order Planner , 2021 .

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

[20]  Ron Alford,et al.  A Survey on Hierarchical Planning - One Abstract Idea, Many Concrete Realizations , 2019, IJCAI.

[21]  Susanne Biundo-Stephan,et al.  totSAT - Totally-Ordered Hierarchical Planning Through SAT , 2018, AAAI.

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