基于Epsilon-Nash策略的动态武器-目标分配方法  

Research of Dynamic Weapon-Target Assignment Problem Based on Epsilon-Nash Equlibirum

作　　者：王邑[1] 孙金标[1] 华玉光[1] 王继辉[1] 

机构地区：[1]空军指挥学院,北京100097

出　　处：《火力与指挥控制》2016年第11期12-15,共4页Fire Control & Command Control

基　　金：航空科学基金资助项目(20131789004)

摘　　要：在大型任务规划软件的作战单元任务分配中,搜索零和博弈问题的纳什均衡点是求解任务分配的一种有效的方法。然而,纳什均衡点在决策中并不一定总是存在且唯一,这造成了纳什均衡策略在实际使用时具有较大的局限。通过采用Epsilon-Nash策略克服这种局限,并将其应用于自主空战任务规划系统中,通过仿真实验,证实Epsilon-Nash策略具有近似于纳什策略的效果。In large scale mission planning software,the mission assignment of asset can be effctive when searching nash equilibria in non-cooperative non zero sum game problem.However,the pure nash equlibrium is not always exist and single,in which case limit the use of nash strategy in Weapon-Target assignment. A Epsilon-Nash Equlibirum method to overcome the limitation is proposed. Apply it in a air combat mission planning system,through simulation test,the epsilon-nash strategy can be as effective as pure nash strategy.

关 键 词：战术决策 武器-目标分配 Epsilon-Nash 博弈论 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]