Loading…
Automatic trajectory planning for low-thrust active removal mission in low-earth orbit
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 firs...
Saved in:
Published in: | Advances in space research 2017-03, Vol.59 (5), p.1234-1258 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 0273-1177 1879-1948 |
DOI: | 10.1016/j.asr.2016.11.033 |