Abstract: A hierarchical optimization method for the maneuver strategy of a single guardian satellite is proposed to address the simultaneous approaching of multiple non-cooperative targets toward a large satellite on the orbit. The scenario was described based on approaching configuration parameters and mission constraints, and a task planning model was established for the guardian satellite to sequentially visit the multiple target satellites. A hierarchical framework combining the greedy local search and adaptive PSO (Particle Swarm Optimization) was designed to optimize the visiting sequence and time parameters. Numerical simulations were conducted to validate the proposed method. Results show that for problems with different numbers of targets (up to 8) and different approaching configurations, the hierarchical optimization strategy can achieve a success rate of nearly 100% with computation in seconds, and its comprehensive performance outperforms the five comparison algorithms. The intrinsic relationships between the approaching task factors (including total approaching task duration, approaching time difference, and relative position) and the guardian strategy as well as the total velocity increment are uncovered, providing valuable references for the design and control of high-orbit satellite guardian missions.

Key words: orbit gaming, multi-satellite approaching, single-satellite protection, hierarchical optimization, MINLP