Convex Optimization of Linear Impulsive Rendezvous

TL;DR

This paper presents a straightforward convex optimization method for linear impulsive rendezvous problems, adaptable to various constraints, making it accessible for newcomers and flexible for different scenarios.

Contribution

It introduces a clear, self-contained convex optimization approach for linear impulsive rendezvous that can handle additional constraints with minor modifications.

Findings

Method is easy to understand and implement.

Flexible to incorporate additional constraints.

Suitable for newcomers to the topic.

Abstract

This note aims at providing a concise and self-contained document that describes a clear and easy-to-understand method, that could be useful for a reader that is approaching the linear-impulsive rendezvous topic for the first time, but that is also flexible enough to accommodate problem variations, such as additional constraints like bounded-magnitude DV, or direction constraints with minor modifications.