面向低轨星座馈电链路切换问题的混合克隆选择算法  

Hybrid clonal selection algorithm for feeder link handover problem inLEO satellite constellation

作　　者：任思达 冯彦翔 陈炜 张广辉 杨宜康[1] REN Si-da;FENG Yan-xiang;CHEN Wei;ZHANG Guang-hui;YANG Yi-kang(School of Automation Science and Engineering,Xi’an Jiaotong University,Xi’an 710049,China;Human Resources Office,Hebei Agricultural University,Baoding 071001,China;School of Information Science and Technology,Hebei Agricultural University,Baoding 071001,China)

机构地区：[1]西安交通大学自动化科学与工程学院,西安710049 [2]河北农业大学人事处,河北保定071001 [3]河北农业大学信息科学与技术学院,河北保定071001

出　　处：《控制与决策》2024年第10期3385-3394,共10页Control and Decision

基　　金：2020年度科技创新2030—“新一代人工智能”重大项目(2020AAA0108200)。

摘　　要：随着低轨星座规模的不断扩张,本就相对匮乏的信关站资源变得更加紧张.为提高信关站天线的使用效率,提出一种混合克隆选择算法.首先,将卫星与信关站可见弧段转化为任务集合,将馈电链路切换问题转化为任务分配问题,并建立相应的数学整数规划模型;然后,将抗体编码为一组任务分配向量,结合启发式冲突消解规则,建立基于有向图最短路的解码方法,引入阈值参数降低解码的计算开销,提出基于自适应邻域选择的局部搜索算法,增强局部寻优能力;最后,搭建低轨星座馈电链路切换仿真场景,生成不同规模的算例来开展对比实验.仿真实验结果表明,所提出算法能够快速收敛到小规模算例的最优解,同时在大规模算例上比现有启发式算法表现出更强的求解能力和更稳定的性能,从而验证所提出算法的有效性.The continuous expansion of LEO satellite constellation has made the relatively scarce gateway stations even more strained.To improve the utilization rate of gateway station antennas,a hybrid clonal selection algorithm is proposed.First,by transforming visible arcs into a task set,the feeder link handover problem is transformed into a task assignment problem,and the corresponding integer programming model is established.Then the antibody is encoded as a set of task assignment vectors,and a decoding method based on the shortest path in directed graphs is proposed in combination with heuristic conflict resolution rules.A threshold parameter is introduced to reduce the computation cost of the decoding method.Furthermore,an adaptive neighborhood selection-based local search algorithm is proposed to enhance local optimization capabilities.Finally,the simulation scenario of feeder link handover in LEO satellite constellation is constructed,and instances of different scales are generated.Experimental results show that the proposed algorithm can quickly converge to the optimal solution for small-scale instances,while showing stronger solving ability and more stable performance than the existing heuristics on large-scale instances,thus verifying its effectiveness.

关 键 词：低轨星座 馈电链路切换 克隆选择算法 有向图 任务分配 元启发式算法 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]