Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub- problems in Planning
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 445-451.
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 between 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.
@inproceedings{ijcai2001p62,
title = {Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub- problems in Planning},
author = {Fox, Maria and Long, Derek},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {445--451},
year = {2001},
url = {https://ijcai.org/proceedings/2001/62},
}
TY - CPAPER TI - Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub- problems in Planning AU - Fox, Maria AU - Long, Derek T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 445 EP - 451 UR - https://ijcai.org/proceedings/2001/62 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
