Abstract

In this paper two strategies are proposed to de-orbit up to 10 non-cooperative objects per year from the region within 800 and 1400km altitude in Low Earth Orbit (LEO). The underlying idea is to use a single servicing spacecraft to de-orbit several objects applying two different approaches. The first strategy is analogous to the Traveling Salesman Problem: the servicing spacecraft rendezvous with multiple objects in order to physically attach a de-orbiting kit that reduces the perigee of the orbit. The second strategy is analogous to the Vehicle Routing Problem: the servicing spacecraft rendezvous and docks with an object, spirals it down to a lower altitude orbit, undocks, and then spirals up to the next target.In order to maximise the number of de-orbited objects with minimum propellant consumption, an optimal sequence of targets is identified using a bio-inspired incremental automatic planning and scheduling discrete optimisation algorithm. The optimisation of the resulting sequence is realised using a direct transcription method based on an asymptotic analytical solution of the perturbed Keplerian motion. The analytical model takes into account the perturbations deriving from the J2 gravitational effect and the atmospheric drag.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.