中国空间科学技术

中国空间科学技术 ›› 2022, Vol. 42 ›› Issue (3): 39-48.doi: 10.16708/j.cnki.1000-758X.2022.0034

• 论文 • 上一篇    下一篇

多约束多星快响巡察任务规划方法

彭晨远，张进，严冰，周洪喜，罗亚中   

  1. 1国防科技大学 空天科学学院，长沙410073
    2空天任务智能规划与仿真湖南省重点实验室，长沙410073
  • 出版日期:2022-06-25 发布日期:2022-06-21

Multi-satellite responsive inspection mission planning with multiple constraints

PENG Chenyuan，ZHANG Jin，YAN Bing，ZHOU Hongxi，LUO Yazhong   

  1. 1College of Aerospace Science and Engineering，National University of Defense Technology，Changsha 410073，China
    2Hunan Key Laboratory of Intelligent Planning and Simulation for Aerospace Missions，Changsha 410073，China
  • Published:2022-06-25 Online:2022-06-21

PDF (PC)

358

摘要： 多星快响巡察任务是指多个目标卫星出现不明状况，巡察服务平台在短时间内进行轨道转移，携带多个子航天器对目标进行飞越巡察。对于该问题的任务规划，首先基于共面机动给出了平台调相策略并建立了满足光照和机动能力等约束的巡察窗口筛选计算模型；其次提出了一种贪婪搜索和多轮规划的方法，用于确定任务分配方案和巡察次序；最后在高精度轨道模型下验证了方法的有效性并将该方法与混合编码遗传算法进行了对比。在算例中，该方法的优化效果稍优于混合编码遗传算法，而且求解效率是后者的约227倍，表明贪婪搜索和多轮规划方法更适用该问题的高效求解。

关键词: 多约束条件, 多星巡察, 任务规划, 贪婪搜索, 遗传算法

Abstract: Multi-satellite responsive inspection mission refers to the fact that multiple target satellites appear unknown, and the inspection service platform carries out orbit transfer within a short period of time, and carries a number of sub spacecraft to perform overflight inspection on the targets. For mission planning of this kind of problem, the platform phasing strategy based on coplanar maneuver was firstly presented and a screening calculation model of inspection window satisfying the constraints of illumination and maneuvering ability was established. Secondly, a greedy search and multiround planning method was proposed to determine the task assignment scheme and inspection order. Finally, this method’s effectiveness was tested under high precision orbit model and it was compared with hybrid en-coding genetic algorithm. In the example, the optimization effect of this method is slightly better than that of hybrid en-coding genetic algorithm and the efficiency is about 227 times of the latter, which indicates that greedy search algorithm and multiround planning method are more suitable for solving this problem efficiently.

Key words: multiple constraints, multiple satellites inspection, mission planning, greedy search, genetic algorithm