Fire scheduling for multiple weapons cooperative engagement considering trajectory crossing

Under the circumstances of multiple weapons cooperative engagement, it is becoming more urgent and difficult to coordinate the launch sequential timing of different weapons and calculate all the weapons' launch timing fast. This paper sets a mixed integer programming model of multi-weapon and multitarget, and optimizes the last sequential timing to the minimum as the objective, in order to solve the problem of scheduling the launch sequential timing of multiple weapons cooperative engagement. This paper also designs a fast heuristic algorithm based on the priority of tasks, which may help commanders provide a launch sequential timing plan with the priority requirement. The paper formulates method to handle the trajectory crossing based on time dimension optimization, and presents the solving algorithm of launch timing and the feasible solution evolution strategy based on space compression. The paper sets a case study of 30 weapons to verify the model and the algorithm, and have a deep discussion on the feasibility of feasible solution evolution strategy. The results show the effectiveness of our method on such a problem.