Optimal dynamic weapon-target assignment based on receding horizon control heuristic

In this paper, we establish a Dynamic Weapon-Target Assignment (DWTA) model based on the killing region of weapon platform. The model considers the time window constraint, intercept feasibility constraint and guidance constraint, which can guarantee the rationality of the solution and is consistent with the real combat scenario. We propose a combinatorial algorithm derived from heuristic algorithm and Receding Horizon Control (RHC), and the algorithm using the domain knowledge can be calculated directly to get the assignment results and determine the weapons' firing time. The advantage is that it makes decisions rapidly and deals with dynamic events timely which appear in distribution process without a great deal of iterative calculations. The algorithm is mainly focused on solving real-time and dynamic problems in DWTA. Experimental verification part, we simulate the combat process in C++, use timer to update real-time target and weapon status information, solve the fire distribution results regularly, and insert random dynamic situation in the process of code running. Experimental results show that the proposed model and algorithm can solve the DWTA problem quickly and effectively.