期刊文献+

考虑资源分配的HTN规划方法及其应用 被引量:17

HTN Planning method with resource allocation and its application
在线阅读 下载PDF
导出
摘要 针对应急决策中方案制定过程和资源分配过程紧密耦合的特点,设计了一种满足HTN(Hierarchy Task Net)规划动作推理机制的方法来求解带资源分配的规划问题.本方法在HTN规划中扩展了资源时间轴来描述资源函数;对于各类资源,在规划推理过程中通过不同的处理流程,将资源分配信息转化为HTN规划的当前全局资源状态;并在HTN规划搜索行动序列的同时,采用资源约束规则和资源约束层次传播规则控制每一步行动所对应的系统状态满足资源约束和时间约束.最后以某区域应急资源筹集为例,将本方法应用于HTN规划模型SHOP2(Simple Hierarchical Ordered Planner 2)证实了其有效性和实用性. Considering the coupling relationship between planning and resource scheduling in emergency deci- sion-making, this paper proposes a method for planning problem considering resource allocation by extending the mechanism of HTN planning. By designing the resource timeline to describe the resources' functions, this method transforms resource information into the global resource states by different resource allocation processes for different kinds of resources during the process of HTN planning. While searching the actions in HTN plan- ning, the resource constraint rules and the hierarchical resource constraint propagation rules are established to control the global resource states which correspond with every step of actions satisfying resource constraints and temporal constraints. Finally, the effectiveness and practicability is confirmed by applying this method to the HTN planning system SHOP2 in a case of emergency logistics distribution problems.
出处 《管理科学学报》 CSSCI 北大核心 2013年第3期53-60,共8页 Journal of Management Sciences in China
基金 国家自然科学基金重点资助项目(90924301) 国家自然科学基金重大研究计划集成资助项目(91024032) 科技部"十一 五"国家科技支撑计划资助项目(2008BAB29B07-2) 国家杰出青年基金资助项目(71125001) 中央高校基本科研业务费专项资金资助项目(2011TS139)
关键词 层次任务网络规划 智能规划 资源分配 应急决策 hierarchy task net planning intelligent planning resource allocation emergency decision-makin
  • 相关文献

参考文献15

  • 1翟晓敏,盛昭瀚,何建敏.应急研究综述与展望[J].系统工程理论与实践,1998,18(7):17-24. 被引量:42
  • 2Ghallab M, Nan D, Traverso P. Automated Planning: Theory and Practice [ M ]. San Francisco : Elsevier Press, 2004.
  • 3Drabble B, Tate A. The use of optimistic and pessimistic resource profiles to inform search in an activity based planner [ C ]//Proceedings of the International Conference on AI Planning Systems( AIPS), 1994:243 -248.
  • 4Siebra A. A united approach to planning support in hierarchical coalitions [ D ]. Edinburgh: University of Edinburgh, 2006.
  • 5Castillo L, Fdez-Olivares J, Garc Ma-Perez O, et al. Efficiently handling temporal knowledge in an HTN planner[ C ]//Proceedings of International Conference on Automated Planning and Scheduling(ICAPS) , 2006:63 -72.
  • 6Nau D, Cao Y, Lotem A, et al. SHOP: Simple hierarchical ordered planner [ C ]// Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1999:968 -973.
  • 7Nau D, Tsz-Chiu A, Okhtay I, et al. SHOP2 : An HTN planning system [ J ]. Journal of Artificial Intelligence Research, 2003, 20(12): 379-404.
  • 8Nau D, Tsz-Chiu A, Okhtay I, et al. Applications of SHOP and SHOP2 [ J]. IEEE Intelligent Systems, 2005, 20 (5) : 34 -41.
  • 9Wilkins D, Myers K, Lowrance J, et al. Planning and reacting in uncertain and dynamic environment[ J]. Journal of Experiment and Theoretical AI, 1995, 7 ( 1 ) : 197 - 227.
  • 10Wilkins D. Practical Planning: Extending the Classical AI Planning Paradigm [ M ]. San Mateo, CA: Morgan Kaufmann, 1988.

二级参考文献41

  • 1徐寅峰,王刊良.局内出租车调度与竞争算法[J].西安交通大学学报,1997,31(S1):58-63. 被引量:26
  • 2张建勇,李军,郭耀煌.具有模糊预约时间的VRP混合遗传算法[J].管理科学学报,2005,8(3):64-71. 被引量:34
  • 3钟石泉,贺国光.有时间窗约束车辆调度优化的一种禁忌算法[J].系统工程理论方法应用,2005,14(6):522-526. 被引量:35
  • 4Dantzig G B, Ramser J H. The truck dispatching problem[J]. Management Science, 1959, 6(1): 80-91.
  • 5Garey M R, Johnson D S. Computers and Intractability: A Guide to Theory of NP-Completeness[M]. San Francisco: W. H. Freeman and Company, 1979 : 17 - 38.
  • 6Refael Hassin, Shlomi Rubinstein. On the complexity of the k-customer vehicle routing problem[ J ]. Operations Research Letters, 2005,33(1 ): 71 -76.
  • 7David Mester, Olli Braysy, Wout Dullaert. A multi-parametric evolution strategies algorithm for vehicle routing problems [ J ]. Expert Systems with Applications, 2007, 32 (02) : 508 -517.
  • 8Gabriel Gutierrez-Jarpa, Guy Desaulniers, Gilbert Laporte, et al. A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows [ J ]. European Journal of Operational Research, 2010, 206 (2) : 341 - 349.
  • 9Koskosidis Y A, Powell W B, Solomon M M. An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints[ J]. Transportation Science, 1992, 26(2) : 69 - 85.
  • 10George Ioannou, Manolis Kritikos, Gregory Prastacos. A problem generator-solver heuristic for vehicle routing with soft time windows [J]. Omega, 2003, 31(1):41-53.

共引文献79

同被引文献216

引证文献17

二级引证文献118

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部