Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem

Izzo, Dario, Märtens, Marcus, Beauregard, Laurent, Bannach, Max, Acciarini, Giacomo, Blazquez, Emmanuel, Hadjiivanov, Alexander, Grover, Jai, Heißel, Gernot, Shimane, Yuri, Yam, Chit Hong

arXiv.org Artificial Intelligence 

Global Trajectory Optimization Competitions (GTOC) [1] represent a biennial cornerstone event within the international aerospace community, dedicated to addressing the intricacies of interplanetary trajectory optimization. The 12th edition of this well established competition, held in June-July 2023, proposed a challenging design of a "sustainable asteroid mining" mission. The problem demanded the concurrent extraction of resources from a set A of 60,000 target asteroids, to be accomplished during a fixed 15 years wide window (from 2035-Jan-01 to 2050-Jan-01) by multiple spacecraft. The participating spacecraft, dispatched from Earth and possibly flying by Venus and Mars, had to be meticulously designed to maximize the quantity of mined material returned to our home planet. A comprehensive exposition of the mathematical intricacies underpinning the problem definition can be found in [2], while in this paper we will primarily provide essential definitions and selectively reference these mathematical foundations. For the purpose of clarity, we shall employ the term'ship' interchangeably with'spacecraft.' In the context of the multi-spacecraft asteroid mining mission presented in GTOC12, each ship possesses the capability to deploy a specified number of mining devices onto the asteroids' surface. Furthermore, these ships have the capacity to collect mined resources if a mining device is already in place on the visited asteroid. Importantly, each ship is not confined to gathering material exclusively from asteroids where it initially deposited a miner; it can collect resources from asteroids where miners were deployed by other ships.

Duplicate Docs Excel Report

Title
None found

Similar Docs  Excel Report  more

TitleSimilaritySource
None found