Spacecraft Collision Avoidance Challenge: design and results of a machine learning competition
Thomas Uriot, Dario Izzo, Lu\'is F. Sim{\~o}es, Rasit Abay, Nils, Einecke, Sven Rebhan, Jose Martinez-Heras, Francesca Letizia, Jan Siminski,, Klaus Merz

TL;DR
This paper presents the design, results, and insights from a machine learning competition aimed at predicting collision risks between spacecraft, leveraging a large ESA dataset to improve satellite collision avoidance strategies.
Contribution
It introduces a novel competition framework for spacecraft collision risk prediction and discusses key challenges and lessons learned in applying machine learning to space safety.
Findings
Effective models can predict collision risk evolution
Challenges include data quality and class imbalance
Insights inform future space traffic management
Abstract
Spacecraft collision avoidance procedures have become an essential part of satellite operations. Complex and constantly updated estimates of the collision risk between orbiting objects inform the various operators who can then plan risk mitigation measures. Such measures could be aided by the development of suitable machine learning models predicting, for example, the evolution of the collision risk in time. In an attempt to study this opportunity, the European Space Agency released, in October 2019, a large curated dataset containing information about close approach events, in the form of Conjunction Data Messages (CDMs), collected from 2015 to 2019. This dataset was used in the Spacecraft Collision Avoidance Challenge, a machine learning competition where participants had to build models to predict the final collision risk between orbiting objects. This paper describes the design and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
