Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm

被引:0
作者
Wang Yanxia Qian Longjun Guo Zhi Ma Lifeng Coll of Automation Nanjing Univ of Science and Technology Nanjing P R China [210094 ]
机构
关键词
weapon target assignment; ant colony algorithm; optimization;
D O I
暂无
中图分类号
E920 [武器技术一般性问题];
学科分类号
0826 ; 082601 ;
摘要
A weapon target assignment (WTA) model satisfying expected damage probabilities with an ant colony algorithm is proposed. In order to save armament resource and attack the targets effectively, the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted. The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result. Ant colony algorithm has been successfully used in many fields, especially in combination optimization. The ant colony algorithm for this WTA problem is described by analyzing path selection, pheromone update, and tabu table update. The effectiveness of the model and the algorithm is demonstrated with an example.
引用
收藏
页码:939 / 944
页数:6
相关论文
共 4 条
[1]   武器-目标分配(WTA)问题研究进展 [J].
蔡怀平 ;
陈英武 .
火力与指挥控制, 2006, (12) :11-15
[2]   SVNTS算法的动态武器目标分配问题研究 [J].
蔡怀平 ;
陈英武 ;
邢立宁 .
计算机工程与应用 , 2006, (31) :7-10+22
[3]  
W eapons A llocation is NP-com p lete. Lloyd S P,H S W. P roceed ings of the IEEE Summ erS im u lation Con ference . 1986
[4]  
Hybrid genetic approach for the dynamicweapon-target allocation problem. Khosla,D. Proceedings ofthe SPIE-The International Society for Optical Engi-neering . 2001