Two-to-One Differential Game via Improved MOGWO

When the maneuverability of a pursuer is not significantly higher than that of an evader, it will be difficult to intercept the evader with only one pursuer. Therefore, this article adopts a two-to-one differential game strategy, the game of kind is generally considered to be angle-optimized, which allows unlimited turns, but these practices do not take into account the effect of acceleration, which does not correspond to the actual situation, thus, based on the angle-optimized, the acceleration optimization and the acceleration upper bound constraint are added into the game for consideration. A two-to-one differential game problem is proposed in the three-dimensional space, and an improved multi-objective grey wolf optimization (IMOGWO) algorithm is proposed to solve the optimal game point of this problem. With the equations that describe the relative motions between the pursuers and the evader in the three-dimensional space, a multi-objective function with constraints is given as the performance index to design an optimal strategy for the differential game. Then the optimal game point is solved by using the IMOGWO algorithm. It is proved based on Markov chains that with the IMOGWO, the Pareto solution set is the solution of the differential game. Finally, it is verified through simulations that the pursuers can capture the escapee, and via comparative experiments, it is shown that the IMOGWO algorithm performs well in terms of running time and memory usage.