# Collision Avoidance Maneuver Optimization with a Multiple-Impulse Convex Formulation

arXiv: https://arxiv.org/abs/2101.07403 · HTML: https://mlsanity.com/paper/2101.07403/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Jan 2021.

## Built on by (most cited first, 2 of 2)

- [A Markov Decision Process Framework for Early Maneuver Decisions in Satellite Collision Avoidance](https://mlsanity.com/paper/2508.05876/) (2025)
- [Satellite Trajectory Optimization via Proximal Policy Optimization for Space Debris Avoidance](https://mlsanity.com/paper/2608.09628/) (2026)

## Abstract (arXiv)

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.