论文部分内容阅读
分布式加注规划的目的在于规划加注过程的交会路径,使任务在满足约束的情况下整体燃料消耗最优。针对异面圆轨道卫星间的分布式加注策略,建立了分布式加注任务规划问题的数学模型,把该规划问题归结为非完全赋权三分图的匹配问题,并将整体最少燃料消耗作为规划目标。其次,进行了算法的流程设计,采用了Kuhn-Mundres图论算法和整数遗传算法相结合的LSGA算法加快了收敛的速度保证了全局最优。最后,选取了两个具有小角度轨道偏差的异面卫星星座对该问题进行分析。计算得到了优化后的双冲量机动下加注任务的服务关系与燃料代价,规划算法的有效性也得到了验证。
The purpose of the distributed refill plan is to plan the rendezvous path of the refueling process so that the task will optimize the overall fuel consumption if the constraints are met. Aiming at the problem of distributed filling strategy among the heterogeneous circular orbit satellites, a mathematical model of distributed filling task planning problem is established. The planning problem is reduced to the matching problem of incompletely weighted three-part map, and the least fuel consumption As a planning goal. Secondly, the flow of the algorithm is designed. The LSGA algorithm which combines the Kuhn-Mundres graph theory algorithm with the integer genetic algorithm speeds up the convergence speed and ensures the global optimum. Finally, the problem is analyzed by selecting two heterogeneous satellite constellations with small orbits deviations. The service relationship and the fuel cost of the optimized two-stroke maneuver underfill were calculated and the validity of the planning algorithm was verified.