基于Dijkstra算法的低轨星座通信路径规划方法优化  

Optimization of Communication Path Planning Method for Low Earth Orbit Constellation Based on Dijkstra Algorithm

作　　者：尹曙明 薛成宬 郝利云 张新军 YIN Shuming;XUE Chengcheng;HAO Liyun;ZHANG Xinjun(Beijing Space Information Transmission Center,Beijing 102300,China)

机构地区：[1]北京空间信息传输中心,北京102300

出　　处：《天地一体化信息网络》2024年第3期55-60,共6页Space-Integrated-Ground Information Networks

摘　　要：低轨星座网络的通信路径规划存在网络拓扑复杂、网络资源利用易不平衡的问题。针对这两个问题,兼顾时延、负载和任务优先级,利用有权图来表征实际的卫星以及相互之间的连通关系,基于Dijkstra算法提出一种改进的优化路径规划方法。该方法通过先分组并行后串行的设计减少规划耗时,通过实时更新拓扑和规划路径的方式解决算法难以适应低轨星座网络动态变化的问题。STK和Python的仿真结果表明,本文提出的方法动态稳定性较好、优化路径规划准确、规划耗时比原始算法平均缩短了约70%。Complex network topologies and unbalanced uses of network resources are key problems in communication path planning for low earth orbit constellations.To address these issues,an optimization path planning method considering time delays,loads and task priorities was proposed.In this method,weighted graphs were used to characterize interconnections between satellites,and Dijkstra al‐gorithm was improved to implement parallel computing and adapt to dynamically changing networks of low earth orbit constellations.Results of simulations based on STK and Python demonstrated that the method presented by this paper performs well in terms of dy‐namic stability and plans optimization paths accurately,and the planning time decreased by about 70%on average compared with the original algorithm.

关 键 词：卫星通信 低轨星座 路径规划 

分 类 号：TN92[电子电信—通信与信息系统]