Abstract A method to compute optimal collision avoidance maneuvers for short-term encounters is presented. The maneuvers are modeled as multiple-impulses to handle impulsive cases and to approximate finite burn arcs associated either with short alert times or the use of low-thrust propulsion. The maneuver design is formulated as a sequence of convex optimization problems solved in polynomial time by state-of-the-art primal–dual interior-point algorithms. The proposed approach calculates optimal solutions without assumptions about the thrust arc structure and thrust direction. The execution time is fraction of a second for an optimization problem with hundreds of variables and constraints, making it suitable for autonomous calculations.
Highlights Collision avoidance maneuver for short-term close encounters. Convex multi-impulse formulation for low- and high-thrust maneuvers. Minimization of propellant while enforcing safety constraints. Convergence and computational efficiency compatible with onboard use.
Collision avoidance maneuver optimization with a multiple-impulse convex formulation
Acta Astronautica ; 186 ; 347-362
2021-05-31
16 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Low-Thrust Collision Avoidance Maneuver Optimization
AIAA | 2022
|Collision Avoidance Maneuver Optimization (AAS 14-335)
British Library Conference Proceedings | 2014
|