Multiple space debris collecting mission -- debris selection and trajectory optimization
From MaRDI portal
(Redirected from Publication:1949571)
Abstract: A possible mean to stabilize the LEO debris population is to remove each year 5 heavy debris like spent satellites or launchers stages from that space region. This paper investigates the DeltaV requirement for such a Space Debris Collecting mission. The optimization problem is intrinsically hard since it mixes combinatorial optimization to select the debris among a list of candidates and functional optimization to define the orbital maneuvers. The solving methodology proceeds in two steps : firstly a generic transfer strategy with impulsive maneuvers 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 to optimize simultaneously the debris selection and the orbital maneuvers, yielding a new reference solution. The process is iterated until the solution stabilizes on the optimal path. The trajectory controls and dates are finally re-optimized in order to refine the solution. The method is applicable whatever the numbers of debris (candidate and to deorbit) and whatever the mission duration. It is exemplified on an application case consisting in selecting 5 SSO debris among a list of 11.
Recommendations
- Multiple space debris collecting mission: optimal mission planning
- Optimal plan for multiple debris removal missions
- Spacecraft transfer optimization with releasing the additional fuel tank and the booster to the Earth atmosphere
- Ballistic aspects of large-size space debris flyby at low Earth near-circular orbits
- Processing optimized for symmetry in the problem of evasive maneuvers
Cites work
- Existence and multiple solutions of the minimum-fuel orbit transfer problem
- Finding the k shortest simple paths
- scientific article; zbMATH DE number 1117968 (Why is no real title available?)
- scientific article; zbMATH DE number 3215488 (Why is no real title available?)
- On computing sets of shortest paths in a graph
- On the \(K\) shortest path trees problem
- Optimal control. Theory and applications
- Stochastic Optimization
Cited in
(8)- Optimal control and applications to aerospace: some results and challenges
- Infrared feature extraction and prediction method based on dynamic multi-objective optimization for space debris impact damages inspection
- Processing optimized for symmetry in the problem of evasive maneuvers
- Ballistic aspects of large-size space debris flyby at low Earth near-circular orbits
- Optimal plan for multiple debris removal missions
- Satellite scheduling problems: a survey of applications in Earth and outer space observation
- Space debris removal: a game theoretic analysis
- Multiple space debris collecting mission: optimal mission planning
This page was built for publication: Multiple space debris collecting mission -- debris selection and trajectory optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949571)
