Strathprints logo
Strathprints Home | Open Access | Browse | Search | User area | Copyright | Help | Library Home | SUPrimo

Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning

Fox, M. and Long, D. (2001) Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning. In: Proceedings of International Joint Conference on Artificial Intelligence, 2001-08-04 - 2001-08-10, Seattle, Washington, USA.

[img]
Preview
PDF (strathprints001935.pdf)
Download (168Kb) | Preview

    Abstract

    It is well-known that planning is hard but it is less well-known how to approach the hard parts of a problem instance effectively. Using static domain analysis techniques we can identify and abstract certain combinatorial sub-problems from a planning instance, and deploy specialised technology to solve these sub-problems in a way that is integrated with the broader planning activities. We have developed a hybrid planning system (STAN4) which brings together alternative planning strategies and specialised algorithms and selects them according to the structure of the planning domain. STAN4 participated successfully in the AIPS-2000 planning competition. We describe how sub-problem abstraction is done, with particular reference to route-planning abstraction, and present some of the competition data to demonstrate the potential power of the hybrid approach.

    Item type: Conference or Workshop Item (Paper)
    ID code: 1935
    Keywords: Electronic computers. Computer science
    Subjects: Science > Mathematics > Electronic computers. Computer science
    Department: Faculty of Science > Computer and Information Sciences
    Related URLs:
      Depositing user: Professor Maria Fox
      Date Deposited: 26 Oct 2006
      Last modified: 06 Oct 2012 07:09
      URI: http://strathprints.strath.ac.uk/id/eprint/1935

      Actions (login required)

      View Item

      Fulltext Downloads: