摘要
Space autonomous rendezvous to a non-cooperative target is a key technology of an on-orbit operation mission or space attack and defense mission. Maneuvers of a non-cooperative target spacecraft brings many difficulties, such as avoiding, spin and nutation. A standard convex programming problem for the autonomous rendezvous based on a certain propulsion system under some necessary constraints is formulated in this paper. Then, the guidance errors which are caused by the non-cooperative target's dynamic characteristics and elimination technique are analyzed. An advanced guidance method is proposed. The primal-dual interior point method is the core optimal algorithm of this method. Finally, several explicit simulations are carried out to confirm the feasibility and robustness of the present algorithm.
投稿的翻译标题 | Autonomous Rendezvous for a Non-Cooperative Space Target Based on Convex Optimization Guidance |
---|---|
源语言 | 繁体中文 |
页(从-至) | 1248-1257 |
页数 | 10 |
期刊 | Yuhang Xuebao/Journal of Astronautics |
卷 | 39 |
期 | 11 |
DOI | |
出版状态 | 已出版 - 30 11月 2018 |
关键词
- Autonomous rendezvous
- Convex programming
- Guidance
- Non-cooperative space target