Abstract
The proliferation of debris in Low Earth Orbit raises increasing challenges about the sustainability of the space environment. The current international recommendations to deorbit satellites at the end of their life are not sufficient to ensure this sustainability. To accelerate the process, it would be necessary to remove hazardous debris and thus de-congest the high-risk orbits. However, active debris removal missions are very expensive, and still in their early stages. One way to reduce its costs is to remove several pieces of debris per removal mission, which corresponds to a global optimization problem, with the objective of optimizing the number of debris removed while minimizing the cost in mission time and in propellant.In our study, the trajectory optimization is performed using a simulated annealing algorithm. The tool classifies the targets in groups gathered by similarities of orbital parameters, with the objective for each mission not to exceed a total ΔV=4 km/s for a mission time lower than 3 years. To achieve this, a weighting is made between out-of-plane maneuvers, costly in propellant, and the use of the orbital parameter Ω drift, costly in time, to allow the spacecraft to pass from one debris to another. A criterion is set up to determine from which threshold it is more interesting to carry out a maneuver on Ω rather than to let the gravitational drift act. As a result, applied on the 50 most hazardous debris established by the International Astronautical Federation, we obtain a classification of the 50 pieces of debris into 11 optimal groups, with an average ΔV of 3.05 km/s and an average mission time of 1.5 years, which corresponds to the imposed criteria and validates the feasibility of such ADR missions.
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.