Genetic Algorithm for Lunar Flower Constellation
- Paper number
IAC-24,A3,IP,213,x89820
- Author
Mr. Giacomo Porcarelli, University of Padova, Italy
- Coauthor
Mr. Federico Toson, CISAS "G. Colombo" - University of Padova, Italy
- Coauthor
Mr. Giacomo Colombatti, Università degli Studi di Padova, Italy
- Year
2024
- Abstract
As the number of lunar missions continues to grow, so does the need for accurate lunar observation and full signal coverage. However, the nature of lunar orbital perturbations makes it difficult to study frozen ground orbits, and the cost of deploying large numbers of satellites around the Moon, although decreasing, is prohibitive. The aim of this work is to present a genetic optimization algorithm that searches for a flower constellation in Low Lunar Orbits (LLOs) of nanosatellites, providing complete coverage of a selected area. Due to the complexity of the gravitational field near the lunar surface, full Keplerian and J2 perturbation solutions and optimizations are not accurate enough. Thus, propagation taking into account the LP-165 gravity field, Earth and Sun perturbations are performed in the algorithm. To account for orbital shift, small corrections are made to maintain the constellation formation. Considering the importance of orbital stability and fuel efficiency in this specific application, the presented genetic algorithm is being developed using a cost function that takes these parameters into account. The aim of this research is to develop a tool that can determine the most efficient flower constellation for complete coverage of a specific lunar site, given enough calculation power and time.
- Abstract document
- Manuscript document
IAC-24,A3,IP,213,x89820.pdf (🔒 authorized access only).
To get the manuscript, please contact IAF Secretariat.