Journal article Open Access
Bertolazzi, Enrico; Biral, Francesco; Ragni, Matteo
{ "files": [ { "links": { "self": "https://zenodo.org/api/files/19af1140-6452-446b-8083-177eb14ecf83/AF11.2018.79.pdf" }, "checksum": "md5:00ea1b7b626924df565818f2a5cbfb09", "bucket": "19af1140-6452-446b-8083-177eb14ecf83", "key": "AF11.2018.79.pdf", "type": "pdf", "size": 244476 } ], "owners": [ 26524 ], "doi": "10.5281/zenodo.1139258", "stats": { "version_unique_downloads": 57.0, "unique_views": 136.0, "views": 146.0, "version_views": 144.0, "unique_downloads": 57.0, "version_unique_views": 134.0, "volume": 14668560.0, "version_downloads": 60.0, "downloads": 60.0, "version_volume": 14668560.0 }, "links": { "doi": "https://doi.org/10.5281/zenodo.1139258", "conceptdoi": "https://doi.org/10.5281/zenodo.1139257", "bucket": "https://zenodo.org/api/files/19af1140-6452-446b-8083-177eb14ecf83", "conceptbadge": "https://zenodo.org/badge/doi/10.5281/zenodo.1139257.svg", "html": "https://zenodo.org/record/1139258", "latest_html": "https://zenodo.org/record/1139258", "badge": "https://zenodo.org/badge/doi/10.5281/zenodo.1139258.svg", "latest": "https://zenodo.org/api/records/1139258" }, "conceptdoi": "10.5281/zenodo.1139257", "created": "2018-01-09T13:12:11.432186+00:00", "updated": "2020-01-20T17:37:58.936302+00:00", "conceptrecid": "1139257", "revision": 6, "id": 1139258, "metadata": { "access_right_category": "success", "doi": "10.5281/zenodo.1139258", "description": "<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>\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>", "license": { "id": "CC-BY-4.0" }, "title": "GTOC 9: Results from University of Trento (team ELFMAN)", "journal": { "issue": "11", "pages": "79-90", "title": "Acta Futura" }, "relations": { "version": [ { "count": 1, "index": 0, "parent": { "pid_type": "recid", "pid_value": "1139257" }, "is_last": true, "last_child": { "pid_type": "recid", "pid_value": "1139258" } } ] }, "communities": [ { "id": "acta-futura" }, { "id": "esa-act" } ], "publication_date": "2018-01-09", "creators": [ { "affiliation": "DEPARTMENT OF INDUSTRIAL ENGINEERING, UNIVERSITY OF TRENTO", "name": "Bertolazzi, Enrico" }, { "affiliation": "DEPARTMENT OF INDUSTRIAL ENGINEERING, UNIVERSITY OF TRENTO", "name": "Biral, Francesco" }, { "affiliation": "DEPARTMENT OF INDUSTRIAL ENGINEERING, UNIVERSITY OF TRENTO", "name": "Ragni, Matteo" } ], "access_right": "open", "resource_type": { "subtype": "article", "type": "publication", "title": "Journal article" }, "related_identifiers": [ { "scheme": "doi", "identifier": "10.5281/zenodo.1139257", "relation": "isVersionOf" } ] } }
All versions | This version | |
---|---|---|
Views | 144 | 146 |
Downloads | 60 | 60 |
Data volume | 14.7 MB | 14.7 MB |
Unique views | 134 | 136 |
Unique downloads | 57 | 57 |