Translating HTNs to PDDL: A Small Amount of Domain Knowledge Can Go a Long Way

We show how to translate HTN domain descriptions (if they satisfy certain restrictions) into PDDL so that they can be used by classical planners. We provide correctness results for our translation algorithm, and show that it runs in linear time and space. We also show that even small and incomplete amounts of HTN knowledge, when translated into PDDL using our algorithm, can greatly improve a classical planner's performance. In experiments on several thousand randomly generated problems in three different planning domains, such knowledge speeded up the well-known Fast-Forward planner by several orders of magnitude, and enabled it to solve much larger problems than it could otherwise solve.

[1]  Subbarao Kambhampati,et al.  Hybrid Planning for Partially Hierarchical Domains , 1998, AAAI/IAAI.

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

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

[4]  Michel Barbeau,et al.  Planning Control Rules for Reactive Agents , 1997, Artif. Intell..

[5]  Tara A. Estlin,et al.  An Argument for a Hybrid HTN/Operator-Based Approach to Planning , 1997, ECP.

[6]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[7]  Yixin Chen,et al.  Temporal Planning using Subgoal Partitioning and Resolution in SGPlan , 2006, J. Artif. Intell. Res..

[8]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[9]  Jorge A. Baier,et al.  Exploiting Procedural Domain Control Knowledge in State-ofthe-Art Planners ( extended version ) , 2008 .

[10]  David E. Wilkins,et al.  Practical planning - extending the classical AI planning paradigm , 1989, Morgan Kaufmann series in representation and reasoning.

[11]  Subbarao Kambhampati,et al.  Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search , 2002, Artif. Intell..

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

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

[14]  Patrick Doherty,et al.  TALplanner: A temporal logic based forward chaining planner , 2001, Annals of Mathematics and Artificial Intelligence.

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

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

[17]  Jorge A. Baier,et al.  ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond , 2008, KR.

[18]  David E. Smith,et al.  The ANML Language , 2007 .

[19]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

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

[21]  Hector Muñoz-Avila,et al.  SHOP: Simple Hierarchical Ordered Planner , 1999, IJCAI.

[22]  ChenYixin,et al.  Temporal planning using subgoal partitioning and resolution in SGPlan , 2006 .

[23]  Jürgen Dix,et al.  Planning in Answer Set Programming using Ordered Task Decomposition , 2003, We Will Show Them!.

[24]  Subbarao Kambhampati,et al.  Encoding HTN Planning in Propositional Logic , 1998, AIPS.