面向多星任务规划问题的改进遗传算法
An improved genetic algorithm for multi-satellite mission planning problem

卫星数量的快速增加为管控卫星的工作增加了很大的难度，如何有效地进行任务规划，有效管理卫星资源，成为了卫星领域的一个重要问题.针对此问题, 本文构建了多星任务规划的数学模型, 将最大化任务收益作为优化目标. 本文分析了问题的难点并提出了一种包含两种优化策略的改进遗传算法，包括全局优化和局部优化两部分. 全局优化和局部优化根据种群改进情况进行自适应切换. 通过两种优化方法的结合可以提升任务规划的效果.本文还提出了一种任务规划算法，用于为改进遗传算法得到的任务序列选择合适的任务执行时间. 仿真实验证明本文提出的改进遗传算法可以很好地解决多星任务规划问题,与对比算法相比可以得到更优的规划结果. 改进遗传算法有很好的工程应用前景.
Rapid increase in the number of satellites has greatly increased the difficulty of managing satellites. How to effectively plan missions and effectively manage satellite resources has become an important issue in the satellite field. In this paper, a mathematical model of multi-satellite mission planning was constructed, which maximizes mission profit as an optimization goal. Difficulties of the problem were analyzed an improved genetic algorithm of optimization strategy was proposed, which includes two parts: global optimization and local optimization. Global optimization and local optimization are adaptively switched according to the population improvement. Combination of two optimization methods can improve the effect of task planning. A task scheduling algorithm for selecting the appropriate task execution time for the task sequence obtained by genetic algorithm was also proposed. Simulation experiment proves that the improved genetic algorithm proposed can solve the multi-satellite mission planning problem well. Compared with the comparison algorithm, better planning results can be obtained. The improved genetic algorithm has a good engineering application prospect