A Task Allocation Algorithm of Loitering Munition Group for Regional Blockade Based on Event-Driven

Propose an event-driven online task allocation algorithm to solve the problem of online task allocation for the Loitering Munition Group, which has no information about any targets in operational area. Firstly, analyzing the properties of enemy and friendly equipment in typical regional blockade operations and designing the process of unknown regional blockade operations. Secondly, propose the concept of “benefit-cost ratio” to drive the dynamic scrolling of the task allocation window, and achieve a fast response to sudden events such as new target appearance or projectile damage execution, and timely adjust the task allocation plan. Then, construct a simulation system for the Loitering Munition Group's regional blockade operation, conduct Monte Carlo simulation to verify the effectiveness and reliability of the online task allocation method.