基于遗传禁忌算法的多星协同任务规划方法  

Multi-satellite Cooperative Mission Planning Method Based on Genetic Tabu Algorithm

作　　者：张泽华 张加友 张嘉凯 马松靖 李宇哲 ZHANG Zehua;ZHANG Jiayou;ZHANG Jiakai;MA Songjing;LI Yuzhe(College of Aerospace and Civil Engineering,Harbin Engineering University,Harbin 150001,China)

机构地区：[1]哈尔滨工程大学航天与建筑工程学院,黑龙江哈尔滨150001

出　　处：《无线电工程》2022年第7期1127-1135,共9页Radio Engineering

基　　金：国家自然科学基金面上项目(11772185)。

摘　　要：为了合理、高效地利用逐渐增多的在轨卫星资源,更好地完成对地观测任务,提出了一种基于遗传禁忌算法的多星协同任务规划方法,解决了多星协同任务规划问题。建立多星协同任务规划问题模型,并设计综合考虑任务总收益值和总完成度、卫星资源总侧摆角的目标函数。兼顾遗传算法较强的全局寻优能力和禁忌搜索算法较强的局部寻优能力,设计包含遗传搜索和禁忌搜索2个阶段的多星协同任务规划算法。建立不同种群数量、不同任务规模的仿真场景,验证了所提出方法的稳定性和有效性。In order to reasonably and efficiently utilize the increasing satellite resources and complete the earth observation mission with high quality and quantity,a multi-satellite collaborative mission planning method based on genetic tabu algorithm is proposed to solve the multi-satellite collaborative mission planning problem.First,a multi-satellite collaborative mission planning problem model is established,and an objective function is designed that comprehensively considers the total mission revenue value,the total completion degree,and the total roll angle of satellite resources.Secondly,with the strong global optimization ability of genetic algorithm and the strong local optimization ability of tabu search algorithm taken into account,a multi-satellite collaborative mission planning algorithm including two stages of genetic search and tabu search is designed.Finally,simulation scenarios with different population numbers and different task scales are established to verify the stability and effectiveness of the proposed method.

关 键 词：对地观测 任务规划 多星协同 遗传禁忌算法 

分 类 号：V11[航空宇航科学与技术—人机与环境工程]