基于开关逼近函数的高轨卫星顺光抵近轨迹凸规划方法

Translated title of the contribution: Approaching High-Earth-orbit Satellites along Sunlight using Convex Programming with Switching Approximation Functions
  • Rui Hou
  • , Guoxu Zhang*
  • , Changxuan Wen
  • , Panfeng Huang
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Approaching high-orbit satellites along sunlight is a critical prerequisite for optical observation and in-orbit services. To meet the requirements of trajectory planning optimality and real-time performance, a convex planning method based on switching approximation function is proposed for trajectory sequence alignment along sunlight. First, an optimal control model for trajectory planning is constructed, incorporating dynamics constraints, sunlight conditions, and terminal constraints. The dynamics equations are linearized, and a switching approximation function is introduced to approximate the sunlight approach constraint, effectively avoiding integer variables and achieving convexification. Finally, a sequence convex programming algorithm with dynamically adjusted switching parameters is designed to reduce sensitivity to the initial profile and improve solution optimality. Simulation results verify that the proposed method demonstrates significant advantages in computational efficiency and trajectory optimality compared to traditional approaches.

Translated title of the contributionApproaching High-Earth-orbit Satellites along Sunlight using Convex Programming with Switching Approximation Functions
Original languageChinese (Traditional)
Pages (from-to)116-126
Number of pages11
JournalYuhang Xuebao/Journal of Astronautics
Volume47
Issue number1
DOIs
Publication statusPublished - 2026
Externally publishedYes

Fingerprint

Dive into the research topics of 'Approaching High-Earth-orbit Satellites along Sunlight using Convex Programming with Switching Approximation Functions'. Together they form a unique fingerprint.

Cite this