An algorithm for multi-target prospecting mission trajectory on Apollo asteroids

In recent years the interest in asteroids, for scientific and commercial purposes, is increased. However, the lack of accurate data on this objects class is still a relevant issue for the design of a prospecting space mission. The purpose of this work is to develop a convenient method for an optimized design of trajectory of a multi-target exploration mission at NEAs, focusing on Apollo asteroids class. Firstly, a literature review of the already formulated algorithms for resolution of trajectory optimization problems is reported. Then, an overview of all aspects concerning asteroid missions as the state-of-the-art of science and technology is conducted. In the core of thesis the algorithm’s math theory is explained with particular attention to orbital mechanics problems and logical conditions in order to motivate the adopted procedure. Then, an algorithm-based software AsterX is introduced by highlighting the architecture and the implementation strategies. The work presents also some pratical cases in order to show the dependency of method from mission parameters. Finally, the main results are exposed indicating both merits and limits