TY - GEN
T1 - Joint Probability Density Immune Algorithm for Multi-satellite Earth Observation Scheduling
AU - Ren, Lili
AU - Ning, Xin
AU - Ma, Shi Chao
AU - Yuan, Jian Ping
N1 - Publisher Copyright:
© 2021, The Author(s), under exclusive license to Springer Nature Switzerland AG.
PY - 2021
Y1 - 2021
N2 - As a multi-objective combinatorial optimization problem, multi-agile satellite scheduling of earth observation, which with long observation time and multiple observation windows under complex constraints, has been a hotspot research problem in recent years. As a scarce resource, improving the in-orbit utilization of satellites and optimizing the imaging observation plan have been the goals of many researchers. For small scale task scheduling, the optimal solution is obtained by precise algorithm. However, for the large-scale task scheduling, it is difficult to find the exact solution, and the precise algorithm no longer has the advantage. Intelligent algorithms have been widely studied to obtain approximate optimal solutions. Genetic algorithm and immune algorithm are the most widely used intelligent algorithm. But the immune algorithm follows the evolutionary mode of the genetic algorithm, when confronted with large-scale task scheduling, the evolution operations such as crossover and mutation tend to make the solution fall into local optimization easily, and the randomness of these two operations make the scheduling time increases. Therefore, the traditional evolutionary approaches not only resulted in a waste of resources but also extended the evolutionary generations. In this paper we developed an improved immune algorithm, which the evolutionary idea of probability distribution instead. The specific evolution process are as follows. First, discretized the observation time of the all tasks, then coded all observation periods of tasks as antibody genes. Secondly, assigned an average probability value to the different observation periods of tasks, so the initial joint probability density matrix was constructed. Finally, updates the joint probability density matrix until convergence according to the fitness value of antibodies, then the optimal scheduling solution was obtained. The simulation results show that compared with the genetic algorithm, both scheduling time and scheduling efficiency have a significant improvement.
AB - As a multi-objective combinatorial optimization problem, multi-agile satellite scheduling of earth observation, which with long observation time and multiple observation windows under complex constraints, has been a hotspot research problem in recent years. As a scarce resource, improving the in-orbit utilization of satellites and optimizing the imaging observation plan have been the goals of many researchers. For small scale task scheduling, the optimal solution is obtained by precise algorithm. However, for the large-scale task scheduling, it is difficult to find the exact solution, and the precise algorithm no longer has the advantage. Intelligent algorithms have been widely studied to obtain approximate optimal solutions. Genetic algorithm and immune algorithm are the most widely used intelligent algorithm. But the immune algorithm follows the evolutionary mode of the genetic algorithm, when confronted with large-scale task scheduling, the evolution operations such as crossover and mutation tend to make the solution fall into local optimization easily, and the randomness of these two operations make the scheduling time increases. Therefore, the traditional evolutionary approaches not only resulted in a waste of resources but also extended the evolutionary generations. In this paper we developed an improved immune algorithm, which the evolutionary idea of probability distribution instead. The specific evolution process are as follows. First, discretized the observation time of the all tasks, then coded all observation periods of tasks as antibody genes. Secondly, assigned an average probability value to the different observation periods of tasks, so the initial joint probability density matrix was constructed. Finally, updates the joint probability density matrix until convergence according to the fitness value of antibodies, then the optimal scheduling solution was obtained. The simulation results show that compared with the genetic algorithm, both scheduling time and scheduling efficiency have a significant improvement.
KW - Immune algorithm
KW - Multi-satellite
KW - Probability distribution
UR - http://www.scopus.com/inward/record.url?scp=85111140375&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-67090-0_3
DO - 10.1007/978-3-030-67090-0_3
M3 - 会议稿件
AN - SCOPUS:85111140375
SN - 9783030670894
T3 - Mechanisms and Machine Science
SP - 27
EP - 38
BT - Computational and Experimental Simulations in Engineering - Proceedings of ICCES 2020
A2 - Atluri, Satya N.
A2 - Vušanovic, Igor
PB - Springer Science and Business Media B.V.
T2 - 26th International Conference on Computational and Experimental Engineering and Sciences, ICCES 2020
Y2 - 6 January 2021 through 10 January 2021
ER -