Planning in Answer Set Programming using Ordered Task Decomposition

In this paper we introduce a formalism for solving Hierarchical Task Network (HTN) Planning using Answer Set Programming (ASP). We consider the formulation of HTN planning as described in the SHOP planning system and define a systematic translation method from SHOP’s representation of the planning problem into logic programs with negation. We show that our translation is sound and complete: answer sets of the logic program obtained by our translation correspond exactly to the solutions of the planning problem. We compare our method to (1) similar approaches based on non-HTN planning and (2) SHOP, a dedicated planning system. We show that our approach outperforms non-HTN methods and that its performance is better with ASP systems that allow for nonground programs than with ASP systems that require ground programs.

[1]  Héctor Muñoz-Avila,et al.  SHOP and M-SHOP: Planning with Ordered Task Decomposition , 2000 .

[2]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[3]  D. Warren,et al.  Xsb -a System for Eeciently Computing Well Founded Semantics , 1997 .

[4]  David W. Aha,et al.  SiN: Integrating Case-based Reasoning with Task Decomposition , 2001, IJCAI.

[5]  T. Eiter,et al.  Answer Set Planning under Action Costs , 2002, JELIA.

[6]  Dana S. Nau,et al.  Computer Bridge - A Big Win for AI Planning , 1998, AI Mag..

[7]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

[8]  Piero A. Bonatti,et al.  Prototypes for Reasoning with Infinite Stable Models and Function Symbols , 2001, LPNMR.

[9]  Yue Cao,et al.  Total-Order Planning with Partially Ordered Subtasks , 2001, IJCAI.

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

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

[12]  Miroslaw Truszczynski,et al.  Logic Programming and Nonmotonic Reasoning , 2001, Lecture Notes in Computer Science.

[13]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[14]  Dana S. Nau,et al.  Complexity results for hierarchical task-network planning , 1996 .

[15]  J. Davenport.  Editor , 1960 .

[16]  John S. Baras,et al.  Integrating Tradeoff Analysis and Plan-Based Evaluation of Designs for Microwave Modules , 1996 .

[17]  Gerald Pfeifer,et al.  The KR System dlv: Progress Report, Comparisons and Benchmarks , 1998, KR.

[18]  Francesco Scarcello,et al.  Improving ASP Instantiators by Join-Ordering Methods , 2001, LPNMR.

[19]  Jürgen Dix,et al.  HTN Planning in Answer Set Programming , 2002 .

[20]  Hudson Turner,et al.  Causal Theories of Action and Change , 1997, AAAI/IAAI.

[21]  Hudson Turner,et al.  Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach , 1997, J. Log. Program..

[22]  Ilkka Niemelä,et al.  Logic programs with stable model semantics as a constraint programming paradigm , 1999, Annals of Mathematics and Artificial Intelligence.

[23]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[24]  Earl David Sacerdoti,et al.  A Structure for Plans and Behavior , 1977 .

[25]  Stig K. Andersen,et al.  Probabilistic reasoning in intelligent systems: Networks of plausible inference , 1991 .

[26]  Ilkka Niemelä,et al.  Efficient Implementation of the Well-founded and Stable Model Semantics , 1996, JICSLP.

[27]  Dana S. Nau,et al.  Success in Spades: Using AI Planning Techniques to Win the World Championship of Computer Bridge , 1998, AAAI/IAAI.

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

[29]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[30]  Chitta Baral,et al.  Reasoning about actions in a probabilistic setting , 2002, AAAI/IAAI.

[31]  Fahiem Bacchus,et al.  The AIPS '00 Planning Competition , 2001, AI Mag..

[32]  Juliana Freire,et al.  XSB: A System for Effciently Computing WFS , 1997, LPNMR.

[33]  Victor W. Marek,et al.  The Logic Programming Paradigm: A 25-Year Perspective , 2011 .

[34]  K. A. Ross,et al.  Tabled Evaluation with Delaying for General Logic Programs , 1996 .

[35]  Ulrich Furbach,et al.  Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations , 2001, Handbook of Automated Reasoning.

[36]  Hector Muñoz-Avila,et al.  Theoretical and Empirical Aspects of a Planner in a Multi-agent Environment , 2002, JELIA.

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

[38]  James A. Hendler,et al.  UMCP: A Sound and Complete Procedure for Hierarchical Task-network Planning , 1994, AIPS.

[39]  Fahiem Bacchus,et al.  AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems , 2001 .

[40]  Hector Muñoz-Avila,et al.  IMPACTing SHOP: Putting an AI Planner Into a Multi-Agent Environment , 2003, Annals of Mathematics and Artificial Intelligence.

[41]  David E. Wilkins,et al.  Can AI planners solve practical problems? , 1990, Comput. Intell..

[42]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

[43]  Wolfgang Faber,et al.  The DLVK Planning System: Progress Report , 2002, JELIA.

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

[45]  Vladimir Lifschitz,et al.  Action Languages, Answer Sets, and Planning , 1999, The Logic Programming Paradigm.

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

[47]  Dana Nau,et al.  Integrating electrical and mechanical design and process planning , 1997 .

[48]  Earl D. Sacerdoti,et al.  The Nonlinear Nature of Plans , 1975, IJCAI.

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

[50]  Piero A. Bonatti,et al.  Reasoning with infinite stable models , 2001, Artif. Intell..

[51]  Victor W. Marek,et al.  The Logic Programming Paradigm , 1999, Artificial Intelligence.

[52]  Michael Gelfond,et al.  Action Languages , 1998, Electron. Trans. Artif. Intell..