English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

This paper presents a novel methodology for solving the time-optimaltrajectory optimization problem for interplanetary solar-sail missions usingsuccessive convex programming. Based on the non-convex problem, differentconvexification technologies, such as change of variables, successivelinearization, trust regions and virtual control, are discussed to convert theoriginal problem into the formulation of successive convex programming. Becauseof the free final-time, successive linearization is performed iteratively forthe nonconvex terminal state constraints. After the convexification process,each of problems becomes a convex problem, which can be solved effectively. Anaugmented objective function is introduced to ensure the convergenceperformance and effectiveness of our algorithm. After that, algorithms aredesigned to solve the discrete sub-problems in a successive solution procedure.Finally, numerical results demonstrate the effectiveness and accuracy of ouralgorithms.

Solar-Sail Deep Space Trajectory Optimization Using Successive Convex Programming