Skip to main navigation Skip to search Skip to main content

Minimum-Time Continuous Trajectory Optimization For Electric Sails with Sequential Convex Programming

  • Dawei Wang*
  • , Dong Ye*
  • , Yu Zhao
  • , Yan Xiao*
  • , Xu Tang*
  • *Corresponding author for this work
  • Harbin Institute of Technology
  • Institue of Spacecraft System Engineering

Research output: Contribution to journalConference articlepeer-review

Abstract

The electric sail is a propellant-less propulsion system that utilizes the force exerted by the solar wind on the high-voltage tethers. This paper introduces a sequential convex programming (SCP) approach to solving the minimum-time continuous trajectory problem for the electric sail. The primary contribution is the transformation of the original non-convex optimal control problem into a convex program. Specifically, change of variables and a path constraint are introduced. Given that the final time is free, the path and terminal state constraints are convexified. The successive linearization technique transforms the nonlinear problem into a sequence of second-order cone programming problems, which are then solved iteratively by a successive solution algorithm. Numerical simulations of interplanetary transfers demonstrate the SCP approach's effectiveness and robustness, outperforming traditional direct methods.

Original languageEnglish
Pages (from-to)114-119
Number of pages6
JournalIFAC-PapersOnLine
Volume59
Issue number20
DOIs
StatePublished - 1 Aug 2025
Event23th IFAC Symposium on Automatic Control in Aerospace, ACA 2025 - Harbin, China
Duration: 2 Aug 20256 Aug 2025

Keywords

  • Electric solar wind sail
  • Sequential Convex Programming
  • Trajectory optimization

Fingerprint

Dive into the research topics of 'Minimum-Time Continuous Trajectory Optimization For Electric Sails with Sequential Convex Programming'. Together they form a unique fingerprint.

Cite this