Research on Multi-Satellite Mission Planning Based on Improved Genetic Algorithm

For the multi-satellite mission planning problem, a multi-satellite mission planning model is constructed by considering the constraints of satellite's visibility window to the target, attitude transition, storage and energy consumption, and an improved genetic algorithm is proposed to solve th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2022 3rd International Conference on Computer Science and Management Technology (ICCSMT) s. 331 - 335
Hlavní autoři: Yang, Yang, Liu, Desheng
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2022
Témata:
Adaptation models
Decoding
Encoding
Energy consumption
improved genetic algorithm (key words)
mission planning
Planning
satellite imaging
Simulation
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:For the multi-satellite mission planning problem, a multi-satellite mission planning model is constructed by considering the constraints of satellite's visibility window to the target, attitude transition, storage and energy consumption, and an improved genetic algorithm is proposed to solve the model. The algorithm adopts the real number coding method to improve the solution efficiency, introduces the adaptive mechanism and the elite retention strategy, which improves the problems that the genetic algorithm is easy to fall into local optimum and converge early. The effectiveness of the improved genetic algorithm for solving multi-star mission planning is verified through simulation case analysis, and it is compared and analyzed with the standard genetic algorithm. The results show that the well genetic algorithm can achieve faster convergence and better planning results, and has better adaptability to large-scale mission planning problems.
DOI:10.1109/ICCSMT58129.2022.00077