Planned intervention: On Wednesday April 3rd 05:30 UTC Zenodo will be unavailable for up to 2-10 minutes to perform a storage cluster upgrade.
Published January 9, 2018 | Version v1
Journal article Open

GTOC 9: Results from University of Trento (team ELFMAN)

  • 1. DEPARTMENT OF INDUSTRIAL ENGINEERING, UNIVERSITY OF TRENTO

Description

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
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
the solution of a constrained minimization problem upon the control action (the magnitude of the overall impulsive velocity changes \(\Delta\)V ). Only a subset of all possible transfers (selected on the basis of acceptable \(\Delta\) V ), enters in the database.

Files

AF11.2018.79.pdf

Files (244.5 kB)

Name Size Download all
md5:00ea1b7b626924df565818f2a5cbfb09
244.5 kB Preview Download