摘要
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.
| 投稿的翻译标题 | Approaching High-Earth-orbit Satellites along Sunlight using Convex Programming with Switching Approximation Functions |
|---|---|
| 源语言 | 繁体中文 |
| 页(从-至) | 116-126 |
| 页数 | 11 |
| 期刊 | Yuhang Xuebao/Journal of Astronautics |
| 卷 | 47 |
| 期 | 1 |
| DOI | |
| 出版状态 | 已出版 - 2026 |
关键词
- High-Earth-orbit satellite
- Sequential convex programming
- Switch approximation function
- Trajectory planning
学术指纹
探究 '基于开关逼近函数的高轨卫星顺光抵近轨迹凸规划方法' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver