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

M. Fox, D. Long, B. Nebel (Editor)

Research output: Contribution to conferencePaper

21 Citations (Scopus)
17 Downloads (Pure)

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.
Original languageEnglish
Pages445-452
Number of pages7
Publication statusPublished - 2001
EventProceedings of International Joint Conference on Artificial Intelligence - Seattle, Washington, USA
Duration: 4 Aug 200110 Aug 2001

Conference

ConferenceProceedings of International Joint Conference on Artificial Intelligence
CitySeattle, Washington, USA
Period4/08/0110/08/01

Fingerprint Dive into the research topics of 'Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning'. Together they form a unique fingerprint.

  • Cite this

    Fox, M., Long, D., & Nebel, B. (Ed.) (2001). Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning. 445-452. Paper presented at Proceedings of International Joint Conference on Artificial Intelligence, Seattle, Washington, USA, .