Journal article Open Access

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

Bertolazzi, Enrico; Biral, Francesco; Ragni, Matteo


Citation Style Language JSON Export

{
  "publisher": "Zenodo", 
  "DOI": "10.5281/zenodo.1139258", 
  "container_title": "Acta Futura", 
  "title": "GTOC 9: Results from University of Trento (team ELFMAN)", 
  "issued": {
    "date-parts": [
      [
        2018, 
        1, 
        9
      ]
    ]
  }, 
  "abstract": "<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&nbsp;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>\nscore. 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>\nthe 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>", 
  "author": [
    {
      "family": "Bertolazzi, Enrico"
    }, 
    {
      "family": "Biral, Francesco"
    }, 
    {
      "family": "Ragni, Matteo"
    }
  ], 
  "page": "79-90", 
  "type": "article-journal", 
  "issue": "11", 
  "id": "1139258"
}
78
37
views
downloads
All versions This version
Views 7880
Downloads 3737
Data volume 9.0 MB9.0 MB
Unique views 7476
Unique downloads 3535

Share

Cite as