From Abstract Crisis to Concrete Relief — A Preliminary Report on Combining State Abstraction and HTN Planning

Flexible support for crisis management can definitely be improved by making use of advanced planning capabilities. However, the complexity of the underlying domain often causes intractable efforts in modeling the domain as well as a huge search space to be explored by the system. A way to overcome these problems is to impose a structure not only according to tasks but also according to relationships between and properties of the objects involved, thereby using so-called decomposition axioms. We outline the prototype of a system that is capable of tackling planning for complex application domains. It is based on a well-founded combination of action and state abstractions. The paper presents the basic techniques and provides a formal semantic foundation of the approach. It introduces the planning system and illustrates its underlying principles by examples taken from the crisis management domain used in our ongoing project.

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

[2]  Austin Tate,et al.  The Use of Condition Types to Restrict Search in an AI Planner , 1994, AAAI.

[3]  Fausto Giunchiglia,et al.  Using Abstrips Abstractions -- Where do We Stand? , 1999, Artificial Intelligence Review.

[4]  Susanne Biundo-Stephan,et al.  A New Logical framework for Deductive Planning , 1993, IJCAI.

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

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

[7]  Kutluhan Erol,et al.  Hierarchical task network planning: formalization, analysis, and implementation , 1996 .

[8]  Fausto Giunchiglia,et al.  Intelligent Planning: A Decomposition and Abstraction Based Approach to Classical Planning , 1999, Artif. Intell..

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

[10]  Johanna D. Moore,et al.  Decomposition and Causality in Partial-order Planning , 1994, AIPS.

[11]  T. L. McCluskey Object Transition Sequences: A New Form of Abstraction for HTN Planners , 2000, AIPS.

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

[13]  Peter Norvig,et al.  A modern, agent-oriented approach to introductory artificial intelligence , 1995, SGAR.

[14]  Craig A. Knoblock Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

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

[16]  Paolo Traverso,et al.  Hierarchical Task Network Planning , 2004 .

[17]  Susanne Biundo-Stephan,et al.  Deduction-Based Refinement Planning , 1996, AIPS.

[18]  Earl D. Sacerdott Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.

[19]  T. L. McCluskey,et al.  Object-centred planning: lifting classical planning from the literal level to the object level , 1996, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence.

[20]  Qiang Yang,et al.  ON THE IMPLEMENTATION AND EVALUATION OF AbTweak , 1996, Comput. Intell..

[21]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.