基于拍卖算法的动态防空武器目标分配

为解决网络化防空作战中“制导平台-武器-目标”三者的优化匹配问题，提出一种基于拍卖算法的武器目标分配(weapon-target assignment，WTA)问题求解方法。建立多约束条件下的动态武器目标优化分配模型，将动态作战过程离散化为静态分配问题处理。实例验证结果表明，该方法具备有效性、快速性。

Dynamic Air Defense Weapon Target Assignment Based on Auction Algorithm

In order to solve the problem of optimal matching among guidance platform, weapon and target in networked air defense, a method for solving weapon-target assignment (WTA) problem based on auction algorithm is proposed. The dynamic weapon target optimal allocation model under multiple constraints is established, and the dynamic combat process is discretized into a static allocation problem. The example shows that the method is effective and fast.