Fast Homotopy for Spacecraft Rendezvous Trajectory Optimization with Discrete Logic

What is it about?

Discrete on/off constraints are difficult and computationally expensive to include in traditional optimization frameworks. We develop a fast and efficient trajectory optimization algorithm that can handle discrete constraints without introducing binary variables. A realistic case study for Apollo rendezvous is presented.

Featured Image