基于三分图的非共面卫星分布式加注任务规划

Mission Programming of Peer-to-Peer Refueling on Non-Coplanar Circular Orbit

分布式加注规划的目的在于规划加注过程的交会路径,使任务在满足约束的情况下整体燃料消耗最优。针对异面圆轨道卫星间的分布式加注策略,建立了分布式加注任务规划问题的数学模型,把该规划问题归结为非完全赋权三分图的匹配问题,并将整体最少燃料消耗作为规划目标。其次,进行了算法的流程设计,采用了Kuhn-Mundres图论算法和整数遗传算法相结合的LSGA算法加快了收敛的速度保证了全局最优。最后,选取了两个具有小角度轨道偏差的异面卫星星座对该问题进行分析。计算得到了优化后的双冲量机动下加注任务的服务关系与燃料代价,规划算法的有效性也得到了验证。

The aim of the optimal schedule for the Peer-to-Peer refueling strategy is to find the best rendezvous trajectories with the minimum fuel consumption during the whole mission. Firstly, the mathematic model for the mission programming was set up, which was summed up as a three-index match problem, and the minimum fuel expenditure was set to be the objective. Secondly, the algorithm flow for the problem was designed, and the combination of Kuhn-Mundres algorithm and the integer genetic algorithm were adopted, the convergence was accelerated and the global optimization was guaranteed. At last, two constellations in the non-coplanar circular orbit with a small intersection angle was considered as an example, and the optimal scheduling and fuel cost for two impulse maneuver were gotten successfully. And the result shows that the proposed model and algorithm are efficient.