Comparison between convex and non-convex optimization methods for collision avoidance maneuvers by a spacecraft.

The number of space debris has rapidly increased in the recent times with the rising number of space missions. Thus, to ensure the safety of any operating satellite, collision avoidance maneuvers must be performed. It is also practically impossible to make the state measurements and dynamic models completely error-free. So, this study deals with fuel-optimal collision avoidance maneuvers while also incorporating the effects of uncertainty on them. In this paper, one formulation for convex optimization and another formulation for non-convex optimization have been presented and compared. Effects that the choice of the optimization algorithms and the number of discretization points used have on the optimal Δv as well as on the computational speed have also been discussed. • Convex and non-convex optimization for collision avoidance maneuvers are compared. • Choice of algorithms and number of discretization points affect the optimal result. • The more conservative convex formulation leads to slightly higher Δv requirement. • The non-convex formulation can implement more accurate state dynamics. • If suitable algorithms are used, non-convex formulation can be a better choice. [ABSTRACT FROM AUTHOR]