Hungarian Algorithm Integrated with Iterative Method for Multi-UAV Penetration Game Strategy

The confrontation between enemy and friendly clus-ter systems will be one of the main forms of combat in the future. For the scenario of cluster penetration game, a cluster pene-tration model was established based on the qualitative solution of Target-Attacker-Defender (TAD) game, and a non-zero sum mixed game Nash equilibrium was designed. A Hungarian algorithm integrated with iteration (HAIl) algorithm was proposed to solve the optimal strategy of the cluster. Firstly, the initial solution is generated by using the Hungarian algorithm, and then the optimal strategy is provided through iterative optimization. Simulation experiments show that compared with traditional iterative solving algorithms, HAIl not only significantly reduces computational costs and shortens computation time, thereby improving iteration efficiency, but also ensures the feasibility and stability of the solution.