Solar-Sail Deep Space Trajectory Optimization Using Successive Convex Programming

TL;DR

This paper introduces a new method for optimizing interplanetary solar-sail trajectories using successive convex programming, effectively handling non-convexities and free final-time constraints to find time-optimal solutions.

Contribution

It develops a novel convexification approach for solar-sail trajectory optimization, incorporating iterative linearization and trust regions to solve non-convex problems efficiently.

Findings

Algorithms successfully solve the non-convex trajectory optimization problem.

Numerical results demonstrate high accuracy and effectiveness.

Method handles free final-time constraints effectively.

Abstract

This paper presents a novel methodology for solving the time-optimal trajectory optimization problem for interplanetary solar-sail missions using successive convex programming. Based on the non-convex problem, different convexification technologies, such as change of variables, successive linearization, trust regions and virtual control, are discussed to convert the original problem into the formulation of successive convex programming. Because of the free final-time, successive linearization is performed iteratively for the nonconvex terminal state constraints. After the convexification process, each of problems becomes a convex problem, which can be solved effectively. An augmented objective function is introduced to ensure the convergence performance and effectiveness of our algorithm. After that, algorithms are designed to solve the discrete sub-problems in a successive solution procedure. Finally, numerical results demonstrate the effectiveness and accuracy of our algorithms.