Application of differential countermeasure machine learning model in the field of UAV circuit inspection

In this paper, we establish one-objective differential game equations for one-to-one attack and defense in a two-dimensional plane. Through calculation and visual analysis, obtain the optimal pursuit path movement trajectory, and through machine learning method to training UAV, using cycle process of simulation, output with time growth each cycle pursuit path results, by comparing the movement trajectory image of the pursuit results and find the sheep just escape critical point exit. After that, the angle difference between the two initial positions was changed and tested again to enable the UAV to learn the optimal escape strategy more comprehensively, thus making a more precise path selection. Finally, this method can be reasonably evaluated.

PURSUIT-EVASION DIFFERENTIAL GAMES WITH THE GRÖNWALL TYPE CONSTRAINTS ON CONTROLS

A simple pursuit-evasion differential game of one pursuer and one evader is studied. The players' controls are subject to differential constraints in the form of the integral Grönwall inequality. The pursuit is considered completed if the state of the pursuer coincides with the state of the evader. The main goal of this work is to construct optimal strategies for the players and find the optimal pursuit time. A parallel approach strategy for Grönwall-type constraints is constructed and it is proved that it is the optimal strategy of the pursuer. In addition, the optimal strategy of the evader is constructed and the optimal pursuit time is obtained. The concept of a parallel pursuit strategy (\(\Pi\)-strategy for short) was introduced and used to solve the quality problem for "life-line" games by L.A.Petrosjan. This work develops and expands the works of Isaacs, Petrosjan, Pshenichnyi, and other researchers, including the authors.

An Optimal Pursuit Differential Game Problem with One Evader and Many Pursuers

The objective of this paper is to study a pursuit differential game with finite or countably number of pursuers and one evader. The game is described by differential equations in l 2 -space, and integral constraints are imposed on the control function of the players. The duration of the game is fixed and the payoff functional is the greatest lower bound of distances between the pursuers and evader when the game is terminated. However, we discuss the condition for finding the value of the game and construct the optimal strategies of the players which ensure the completion of the game. An important fact to note is that we relaxed the usual conditions on the energy resources of the players. Finally, some examples are provided to illustrate our result.