A Geometrical, Reachable Set Approach for Constrained Pursuit–Evasion Games With Multiple Pursuers and Evaders

This paper presents a solution strategy for deterministic time-optimal pursuit–evasion games with linear state constraints, convex control constraints, and linear dynamics that is consistent with linearized relative orbital motion models such as the Clohessy–Wiltshire equations and relative orbital elements. The strategy first generates polytopic inner approximations of the players’ reachable sets by solving a sequence of convex programs. A bisection method then computes the optimal termination time, which is the least time at which a set containment condition is satisfied. The pursuit–evasion games considered are games with (1) a single pursuer and single evader, (2) multiple pursuers and a single evader, and (3) a single pursuer and multiple evaders. Compared to variational methods, this reachable set strategy leads to a tractable formulation even when there are state and control constraints. The efficacy of the strategy is demonstrated in three numerical simulations for a constellation of satellites in close proximity in low earth orbit

On game value for a pursuit‑evasion differential game with state and integral constraints

A pursuit-evasion differential game of countably many pursuers and one evader is investigated. Integral constraints are imposed on the control functions of the players. Duration of the game is fixed, and the payoff functional is the greater lower bound of distances between the pursuers and evader when the game is completed. The pursuers want to minimize, and the evader to maximize the payoff. In this paper, we find the value of the game and construct optimal strategies for the players

Optimal Control Methods for Missile Evasion

Optimal control theory is applied to the study of missile evasion, particularly in the case of a single pursuing missile versus a single evading aircraft. It is proposed to divide the evasion problem into two phases, where the primary considerations are energy and maneuverability, respectively. Traditional evasion tactics are well documented for use in the maneuverability phase. To represent the first phase dominated by energy management, the optimal control problem may be posed in two ways, as a fixed final time problem with the objective of maximizing the final distance between the evader and pursuer, and as a free final time problem with the objective of maximizing the final time when the missile reaches some capture distance away from the evader.These two optimal control problems are studied under several different scenarios regarding assumptions about the pursuer. First, a suboptimal control strategy, proportional navigation, is used for the pursuer. Second, it is assumed that the pursuer acts optimally, requiring the solution of a two-sided optimal control problem, otherwise known as a differential game. The resulting trajectory is known as a minimax, and it can be shown that it accounts for uncertainty in the pursuer\u27s control strategy. Finally, a pursuer whose motion and state are uncertain is studied in the context of Receding Horizon Control and Real Time Optimal Control. The results highlight how updating the optimal control trajectory reduces the uncertainty in the resulting miss distance

Differential games through viability theory : old and recent results.

This article is devoted to a survey of results for differential games obtained through Viability Theory. We recall the basic theory for differential games (obtained in the 1990s), but we also give an overview of recent advances in the following areas : games with hard constraints, stochastic differential games, and hybrid differential games. We also discuss several applications.Game theory; Differential game; viability algorithm;