Abstract

Although the robustness of indirect methods is enhanced by the homotopic approach and switching detection technique when applied to fuel-optimal low-thrust trajectory optimization, the bottleneck in adjoint initialization still needs further investigation. This paper overcomes this bottleneck by the adjoint mapping between the Lagrange multipliers of direct methods to the adjoint variables. The nonconvex optimization problem deduced from direct methods is converted into a convex one by lossless convexification and successive convex programming. By combining these techniques, a framework is built to effectively solve the fuel-optimal low-thrust trajectory optimization problem.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call