A simple and reliable algorithm for collision avoidance maneuvers (CAMs), capable of computing impulsive, multi-impulsive, and low-thrust maneuvers, is proposed. The probability of collision (PoC) is approximated by a polynomial of arbitrary order as a function of the control, transforming the CAM design into a polynomial program, which also considers the change in the time of closest approach and the linear evolution of the covariances due to the maneuver. The solution procedure is initiated by computing the CAM via a first-order greedy optimization approach, wherein the control action is applied in the direction of the gradient of PoC to maximize its change. Successively, the polynomial is truncated at higher orders, and the solution of the previous order is used to linearize the constraint. This enables achieving accurate solutions even for highly nonlinear safety metrics and dynamics. Since the optimization process comprises only polynomial evaluations, the method is computationally efficient, with run times typically below 1 s. Moreover, no restrictions on the considered dynamics are necessary; therefore, results are shown for Keplerian, J2, and circular restricted three-body problem dynamics.
Recursive Polynomial Method for Fast Collision Avoidance Maneuver Design
IEEE Transactions on Aerospace and Electronic Systems ; 61 , 2 ; 2914-2925
2025-04-01
1790247 byte
Article (Journal)
Electronic Resource
English
European Patent Office | 2024
|Low-Thrust Collision Avoidance Maneuver Optimization
AIAA | 2022
|Collision Avoidance Maneuver Optimization (AAS 14-335)
British Library Conference Proceedings | 2014
|