Optimization of satellite constellations in the moon

• Autor(a) principal: Winter, Othon C. [UNESP]
• Data de Publicação: 2010
• Outros Autores: Schulz, W., Izidoro, A. [UNESP], Mazal, L.
• Tipo de documento: Artigo de conferência
• Idioma: eng
• Título da fonte: Repositório Institucional da UNESP
• Texto Completo: http://www.iafastro.net/iac/archive/browse/IAC-10/A3/2B/8458/; http://hdl.handle.net/11449/72168
• topic: Constellation; Genetic algorithm; Lunar potential; Continuous coverage; Global coverage; Gravitational potential; Mission requirements; Polar Regions; Satellite constellations; Space objects; Specific tasks; Time interval; Visual abilities; Genetic algorithms; Lunar missions; Optimization; Satellites

Nowadays, we return to live a period of lunar exploration. China, Japan and India heavily invest in missions to the moon, and then try to implement manned bases on this satellite. These bases must be installed in polar regions due to the apparent existence of water. Therefore, the study of the feasibility of satellite constellations for navigation, control and communication recovers importance. The Moon's gravitational potential and resonant movements due to the proximity to Earth as the Kozai-Lidov resonance, must be considered in addition to other perturbations of lesser magnitude. The usual satellite constellations provide, as a basic feature, continuous and global coverage of the Earth. With this goal, they are designed for the smallest number of objects possible to perform a specific task and this amount is directly related to the altitude of the orbits and visual abilities of the members of the constellation. However the problem is different when the area to be covered is reduced to a given zone. The required number of space objects can be reduced. Furthermore, depending on the mission requirements it may be not necessary to provide continuous coverage. Taking into account the possibility of setting up a constellation that covers a specific region of the Moon on a non-continuous base, in this study we seek a criterion of optimization related to the time between visits. The propagation of the orbits of objects in the constellation in conjunction with the coverage constraints, provide information on the periods of time in which points of the surface are covered by a satellite, and time intervals in which they are not. So we minimize the time between visits considering several sets of possible constellations and using genetic algorithms.