Research Progress and Prospect of Satellite Constellation Optimization Design

Abstract

Abstract Satellite constellation optimization has gradually developed from simple single-objective optimization to complex multi-objective optimization. Among them, the high-dimensional and multi-objective dynamic optimization problem poses a great challenge to the performance of the algorithm. To improve convergence speed and optimization performance, researchers continue to improve modern optimization algorithms. Firstly, the construction process of the optimization model is reviewed. The model takes the coverage performance, network performance, and system cost as objective functions or constraints. Secondly, the general forms of multi-objective constellation optimization design models under various constraints are given, and the applications of modern optimization algorithms such as genetic algorithm (GA), non-dominated sorting genetic algorithm (NSGA-2), multi-objective particle swarm optimization algorithm (MOPSO), differential evolution algorithm (DE) in different constellation design tasks, as well as their characteristics and development trends are introduced. Finally, it is pointed out that in the era of vigorous development of Leo mega-constellations, the combination of modern optimization algorithms and machine learning is the future research direction to solve high-dimensional and multi-objective dynamic optimization problems.