Abstract
The density of orbital space debris constitutes an increasing environmental challenge. There are two ways to alleviate the problem: debris mitigation and debris removal. This paper addresses collision avoidance, a key aspect of debris mitigation. We describe a method that contributes to achieving a requisite increase in orbit prediction accuracy for objects in the publicly available two-line element (TLE) catalog. Batch least-squares differential correction is applied to the TLEs. Using a high-precision numerical propagator, we fit an orbit to state vectors derived from successive TLEs. We then propagate the fitted orbit further forward in time. These predictions are validated against precision ephemeris data derived from the international laser ranging service (ILRS) for several satellites, including objects in the congested sun-synchronous orbital region. The method leads to a predicted range error that increases at a typical rate of 100m per day, approximately a 10-fold improvement over individual TLE’s propagated with their associated analytic propagator (SGP4). Corresponding improvements for debris trajectories could potentially provide conjunction analysis sufficiently accurate for an operationally viable collision avoidance system based on TLEs only.We discuss additional optimization and the computational requirements for applying all-on-all conjunction analysis to the whole TLE catalog, present and near future. Finally, we outline a scheme for debris–debris collision avoidance that may become practicable given these developments.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.