Chit Hong Yam

EP
h-index18
3papers
17citations
Novelty50%
AI Score25

3 Papers

SPACE-PHFeb 3, 2016
GTOC8: Results and Methods of ESA Advanced Concepts Team and JAXA-ISAS

Dario Izzo, Daniel Hennes, Marcus Märtens et al.

We consider the interplanetary trajectory design problem posed by the 8th edition of the Global Trajectory Optimization Competition and present the end-to-end strategy developed by the team ACT-ISAS (a collaboration between the European Space Agency's Advanced Concepts Team and JAXA's Institute of Space and Astronautical Science). The resulting interplanetary trajectory won 1st place in the competition, achieving a final mission value of $J=146.33$ [Mkm]. Several new algorithms were developed in this context but have an interest that go beyond the particular problem considered, thus, they are discussed in some detail. These include the Moon-targeting technique, allowing one to target a Moon encounter from a low Earth orbit; the 1-$k$ and 2-$k$ fly-by targeting techniques, enabling one to design resonant fly-bys while ensuring a targeted future formation plane% is acquired at some point after the manoeuvre ; the distributed low-thrust targeting technique, admitting one to control the spacecraft formation plane at 1,000,000 [km]; and the low-thrust optimization technique, permitting one to enforce the formation plane's orientations as path constraints.

AIMay 13, 2022
The Fellowship of the Dyson Ring: ACT&Friends' Results and Methods for GTOC 11

Marcus Märtens, Dario Izzo, Emmanuel Blazquez et al.

Dyson spheres are hypothetical megastructures encircling stars in order to harvest most of their energy output. During the 11th edition of the GTOC challenge, participants were tasked with a complex trajectory planning related to the construction of a precursor Dyson structure, a heliocentric ring made of twelve stations. To this purpose, we developed several new approaches that synthesize techniques from machine learning, combinatorial optimization, planning and scheduling, and evolutionary optimization effectively integrated into a fully automated pipeline. These include a machine learned transfer time estimator, improving the established Edelbaum approximation and thus better informing a Lazy Race Tree Search to identify and collect asteroids with high arrival mass for the stations; a series of optimally-phased low-thrust transfers to all stations computed by indirect optimization techniques, exploiting the synodic periodicity of the system; and a modified Hungarian scheduling algorithm, which utilizes evolutionary techniques to arrange a mass-balanced arrival schedule out of all transfer possibilities. We describe the steps of our pipeline in detail with a special focus on how our approaches mutually benefit from each other. Lastly, we outline and analyze the final solution of our team, ACT&Friends, which ranked second at the GTOC 11 challenge.

EPOct 28, 2024
Asteroid Mining: ACT&Friends' Results for the GTOC 12 Problem

Dario Izzo, Marcus Märtens, Laurent Beauregard et al.

In 2023, the 12th edition of Global Trajectory Competition was organised around the problem referred to as "Sustainable Asteroid Mining". This paper reports the developments that led to the solution proposed by ESA's Advanced Concepts Team. Beyond the fact that the proposed approach failed to rank higher than fourth in the final competition leader-board, several innovative fundamental methodologies were developed which have a broader application. In particular, new methods based on machine learning as well as on manipulating the fundamental laws of astrodynamics were developed and able to fill with remarkable accuracy the gap between full low-thrust trajectories and their representation as impulsive Lambert transfers. A novel technique was devised to formulate the challenge of optimal subset selection from a repository of pre-existing optimal mining trajectories as an integer linear programming problem. Finally, the fundamental problem of searching for single optimal mining trajectories (mining and collecting all resources), albeit ignoring the possibility of having intra-ship collaboration and thus sub-optimal in the case of the GTOC12 problem, was efficiently solved by means of a novel search based on a look-ahead score and thus making sure to select asteroids that had chances to be re-visited later on.