In this paper, the problem of orbital pursuit-evasion game comprised of three maneuverable players is investigated. As opposed to the most existing works where linear quadratic differential game is treated, the interception time rather than the consumed energy is designated as the contradictive objective, so that the mission scenario is more adaptable to practical applications. In particular, two typical cases, depending on whether one or two attackers are involved, are studied respectively, and the optimal game strategies for the three players are identified within the indirect optimization approach. In the first case where two attackers manage to intercept one evader in minimum time, the associated two-on-one problem with different initial conditions can be further divided into two subcases: the (degenerated) one-on-one pursuit-evasion game and the simultaneous interception. The optimal policies for three players in each subcase are obtained, and the criterion for determining which subcase to deal with is provided. In the second case where the attacker-defender-evader game is analyzed, the attacker aims to intercept the evader while avoiding possible interception of the defender, whereas the evader and defender, on the other hand, have to collaborate to maximize the survival time. Numerical simulations validate the effectiveness of the proposed method.
Orbital Three-Player Pursuit-Evasion Game
J Astronaut Sci
2025-05-14
Article (Journal)
Electronic Resource
English
Orbital Three-Player Pursuit-Evasion Game
Springer Verlag | 2025
|Orbital Multi-Player Pursuit-Evasion Game with Deep Reinforcement Learning
Springer Verlag | 2024
|Orbital Multi-Player Pursuit-Evasion Game with Deep Reinforcement Learning
Springer Verlag | 2024
|Three-Player Pursuit and Evasion Conflict
AIAA | 2014
|Three-Player Pursuit and Evasion Conflict
Online Contents | 2014
|