中国空间科学技术

中国空间科学技术 ›› 2026, Vol. 46 ›› Issue (4): 160-170.doi: 10.16708/j.cnki.1000-758X.2026.0067

• 论文 • 上一篇    下一篇

面向多星抵近的单星护卫机动策略优化方法

茹祥润1,2，袁容昊3，张进1,2,*，沈美栖1,2   

  1. 1.国防科技大学空天科学学院，长沙410073
    2.太空系统运行与控制全国重点实验室，长沙410073
    3.上海宇航系统工程研究所，上海201109
  • 收稿日期:2025-08-25 修回日期:2025-09-22 录用日期:2025-10-10 发布日期:2026-07-16 出版日期:2026-07-31

Optimization of maneuvering strategy for single-satellite protection against multi-satellite approaching

RU Xiangrun1,2, YUAN Ronghao3, ZHANG Jin1,2,*, SHEN Meixi1,2   

  1. 1.College of Aerospace Science and Engineering, National University of Defense Technology, Changsha 410073, China 2.State Key Laboratory of Space System Operation and Control, Changsha 410073, China 3.Shanghai Aerospace Systems Engineering Institute, Shanghai201109, China
  • Received:2025-08-25 Revision received:2025-09-22 Accepted:2025-10-10 Online:2026-07-16 Published:2026-07-31

PDF (PC)

6

摘要： 针对高轨多颗非合作目标星同时抵近大型卫星问题，提出了一种单星护卫机动策略的分层优化方法。首先，通过非合作目标星抵近构型参数和任务约束来描述护卫场景，并构建护卫星依次访问多目标星的任务规划模型；然后，采用贪婪局部搜索与自适应粒子群结合的分层框架，对访问序列与时间参数进行优化；最后，通过数值仿真验证提出的方法。结果表明，对不同目标数量（不超过8颗）及抵近构型的问题，分层优化策略均可实现秒级求解，成功率近100%，综合性能优于作为对比的五种算法。研究揭示了抵近任务时长、抵近时间差、相对位置等任务因素与护卫策略及总速度增量之间的内在关系，可为高轨卫星护卫任务设计与控制提供参考。

关键词: 轨道博弈, 多星抵近, 单星护卫, 分层优化, 混合整数非线性规划

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