The increasing number of objects in Earth orbit has encouraged the development of space surveillance and tracking (SST) applications. A critical aspect of SST is the identification and characterization of close encounters between pairs of space objects. The present work introduces a tool for the analysis of conjunctions, consisting of several modules. The first module, which has been shown to greatly speed up the process, employs a series of geometric and temporal filters to shorten the list of potential colliding pairs. The remaining objects are then propagated to compute important parameters such as time of closest approach (TCA), miss distance (MD), and probability of collision (PoC), the latter using three different methods. When a conjunction assessment returns an MD or a PoC that exceeds predefined alert thresholds, the algorithm enables the planning of an impulsive collision avoidance maneuver (CAM) at specific maneuver epochs. CAM candidates are determined using an analytical Keplerian approach, with the goal of achieving the desired PoC or MD. The user can then verify the performance of a specific candidate through perturbed propagation, and the MD and PoC are recalculated after the maneuver to ensure that they meet the desired thresholds. In conclusion, this paper evaluates the performance of the tool using synthetic and real data, providing valuable insights into its effectiveness.
Conjunction Analysis Software Suite for Space Surveillance and Tracking
Bonaccorsi, Sergio;Montaruli, Marco Felice;Di Lizia, Pierluigi;Panico, Alessandro;
2024-01-01
Abstract
The increasing number of objects in Earth orbit has encouraged the development of space surveillance and tracking (SST) applications. A critical aspect of SST is the identification and characterization of close encounters between pairs of space objects. The present work introduces a tool for the analysis of conjunctions, consisting of several modules. The first module, which has been shown to greatly speed up the process, employs a series of geometric and temporal filters to shorten the list of potential colliding pairs. The remaining objects are then propagated to compute important parameters such as time of closest approach (TCA), miss distance (MD), and probability of collision (PoC), the latter using three different methods. When a conjunction assessment returns an MD or a PoC that exceeds predefined alert thresholds, the algorithm enables the planning of an impulsive collision avoidance maneuver (CAM) at specific maneuver epochs. CAM candidates are determined using an analytical Keplerian approach, with the goal of achieving the desired PoC or MD. The user can then verify the performance of a specific candidate through perturbed propagation, and the MD and PoC are recalculated after the maneuver to ensure that they meet the desired thresholds. In conclusion, this paper evaluates the performance of the tool using synthetic and real data, providing valuable insights into its effectiveness.File | Dimensione | Formato | |
---|---|---|---|
BONAS01-24.pdf
accesso aperto
:
Publisher’s version
Dimensione
441.58 kB
Formato
Adobe PDF
|
441.58 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.