Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub- problems in Planning
Hybrid STAN: Identifying and Managing Combinatorial Optimisation Sub- problems in Planning
复制标题
混合 STAN：识别和管理规划中的组合优化子问题
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
D. Long
中科院分区：
文献类型：
--
作者：
M. Fox;D. Long
众所周知，计划是困难的，但如何有效地处理问题实例的困难部分却鲜为人知。使用静态领域分析技术，我们可以从规划实例中识别和抽象出某些组合子问题，并部署专门的技术以与更广泛的规划活动集成的方式解决这些子问题。我们开发了一个混合规划系统（STAN4），它汇集了可选择的规划策略和专门的算法，并根据规划领域的结构选择它们。STAN4成功参加AIPS-2000规划比赛。我们描述了子问题抽象是如何完成的，特别是参考路线规划抽象，并提供了一些竞争数据来展示混合方法的潜在力量。
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.