Name
Title | ||
|---|---|---|
Multiple Space Debris Collecting Mission - Debris selection and Trajectory optimization |
Abstract | ||
|---|---|---|
This paper investigates the cost requirement for a space debris collecting mission aimed at removing heavy debris from low Earth orbits. The problem mixes combinatorial optimization to select the debris among a list of candidates and functional optimization to define the orbital manoeuvres. The solving methodology proceeds in two steps: Firstly, a specific transfer strategy with impulsive manoeuvres is defined so that the problem becomes of finite dimension; secondly the problem is linearized around an initial reference solution. A Branch and Bound algorithm is then applied iteratively to optimize simultaneously the debris selection and the orbital manoeuvres, yielding a new reference solution. The optimal solutions found are close to the initial guess despite a very complicated design space. The method is exemplified on a representative application case. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s10957-012-0130-6 | Journal of Optimization Theory and Applications |
Keywords | DocType | Volume |
combinatorial optimization,branch and bound algorithm,trajectory optimization,optimization problem | Journal | abs/1107.0192 |
Issue | ISSN | Citations |
3 | 1573-2878 | 8 |
PageRank | References | Authors |
1.49 | 4 | 1 |