摘要
多星多载荷敏捷成像卫星自主任务规划是一个复杂的多约束、非线性NP困难问题.分析了卫星观测任务约束和星上资源约束,建立了多星多载荷自主任务规划模型.针对此任务规划模型的特点,以及传统遗传算法和禁忌搜索算法的优缺点,采用了一种遗传禁忌混合算法进行求解.混合算法将禁忌算法嵌入遗传算法作为禁忌算法变异算子,解决了遗传算法早熟的问题.仿真结果表明混合算法比遗传算法收敛速度更快,比禁忌算法优化效果更好.
The problem of autonomous scheduling mission for multi-satellite and multi-load agile earth observation satellites is a complex multi-constrained,nonlinear NP-hard optimization problem.The satellite observation task constraints and on-board resource constraints are analyzed to establish the scheduling model for multi-satellite and multi-load autonomous mission.The algorithm used in this paper combines the genetic algorithm and the tabu search algorithm,which replaces the traditional mutation operator in the genetic algorithm by tabu search mutation operator.The algorithm makes full use of the complementarity of the two methods,and solves the problem of premature in the genetic algorithm.The simulation results show that the hybrid algorithm converges faster than the genetic algorithm and has better optimization results than the tabu search algorithm.
作者
丁祎男
田科丰
王淑一
Ding Yinan;TIAN Kefeng;WANG Shuyi(Beijing Institute of Control Engineering,Beijing 100080,China)
出处
《空间控制技术与应用》
CSCD
北大核心
2019年第6期27-32,共6页
Aerospace Control and Application
关键词
敏捷卫星
任务规划
混合遗传算法
禁忌变异
agile satellite
mission scheduling
hybrid genetic algorithm
tabu search mutation
