Bertolazzi, Enrico
Biral, Francesco
Ragni, Matteo
2018-01-09
<p>The GTOC9 competition requires the design of a sequence of missions to remove debris from the LEO orbit. A mission is a sequence of transfer of the spacecraft from one debris to another. Both missions and transfer must fulfill a set of constraints. The work presents the procedures to develop a solution for the GTOC9 problem (i.e the mission sequence) that does not violate constraints.The solution is obtained through an evolutionary algorithm that combines pre-computed basic missions stored in a database. The main objective of the algorithm is to minimize the overall cost of the solution, in order to maximize the competition<br>
score. The database of pre-computed missions is derived by connecting transfers stored in a database of transfers, through a combinatorial approach that considers the problem constraints. The database of transfer is formulated through<br>
the solution of a constrained minimization problem upon the control action (the magnitude of the overall impulsive velocity changes <span class="math-tex">\(\Delta\)</span>V ). Only a subset of all possible transfers (selected on the basis of acceptable <span class="math-tex">\(\Delta\)</span> V ), enters in the database.</p>
https://doi.org/10.5281/zenodo.1139258
oai:zenodo.org:1139258
Zenodo
https://zenodo.org/communities/acta-futura
https://zenodo.org/communities/esa-act
https://doi.org/10.5281/zenodo.1139257
info:eu-repo/semantics/openAccess
Creative Commons Attribution 4.0 International
https://creativecommons.org/licenses/by/4.0/legalcode
Acta Futura, 11, 79-90, (2018-01-09)
GTOC 9: Results from University of Trento (team ELFMAN)
info:eu-repo/semantics/article