基于自组网络的武器火力饱和分配研究

On Firepower Saturation Assignment Based on Ad Hoc Networks

针对武器火力分配中网络自组连通情况及能否饱和分配问题,研究了网络自组及饱和攻击数计算方法和匈牙利分配算法,并对其进行了改进。首先根据有效通信距离和火力单元之间距离求解任意两火力单元的连通概率,得出连通概率矩阵,将矩阵中数值规范化,并利用准平方法计算得出网络连接矩阵;然后,根据敌我双方信息,构建火力分配模型;最后,求出各个目标饱和攻击数,运用改进匈牙利算法构建火力分配模型,并根据目标饱和情况进行二次分配。仿真结果表明,在自组网的基础上,运用改进后的匈牙利算法可以有效的解决饱和分配问题。

The method is studied to describe the Ad Hoc network, and the calculation method of the saturation at- tack number is designed to solve saturation assignment based on the improved Hungarian Algorithm. Firstly, the con- nectivity probability matrix is obtained based on the effective communication distance and the distance between any two fire units, and the elements of this matrix are standardized. Then the network connectivity matrix is obtained by Quasi - square method. Secondly, the firepower assignment model is built on the basis of the information of the fire- power units and targets. Finally, the saturation attack number of each target is calculated, the model of firepower as- signment is solved by the Hungarian Algorithm, and the quadratic assignment is adopted based on target saturation. The simulation results show effectiveness of the proposed method.