This work explores a & UDelta;V-based approach to analyzing spacecraft pursuit-evasion games with large initial separation between the spacecraft. Reachable sets in semimajor axis, eccentricity, and inclination space are generated using time-free two-impulse transfers and set intersections are used as a basis for understanding & UDelta;V optimal pursuit and evasion strategies. The evading spacecraft attempts to exit the reachable set of the pursuing spacecraft for a conservative guarantee that capture cannot occur. For cases where an evading spacecraft does not know the extent of the pursuing spacecraft's reachable set, optimal evasion strategies are found. Nonlinear analysis is also performed to find any evasion orbits that are advantageous for the evading spacecraft to escape to. Finally, endgame strategies are briefly explored as well to understand the applicability of this analysis as the distance between the spacecraft decreases.
展开▼
