Journal of Astronautics ›› 2018, Vol. 39 ›› Issue (11): 1248-1257.doi: 10.3873/j.issn.1000-1328.2018.11.007

Previous Articles     Next Articles

Autonomous Rendezvous for a Non Cooperative Space Target Based on Convex Optimization Guidance

CHI Xian bin, XU Qi, LI Zhi Qiang, YUE Xiao Kui   

  1. 1. General Design Institute, Hubei Aerospace Technology Academy, Wuhan 430040, China; 2. School of Astronautics, Northwestern Polytechnical University, Xi’an 710000, China
  • Received:2017-12-30 Revised:2018-04-17 Online:2018-11-15 Published:2018-11-25

Abstract:

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.

Key words: Non cooperative space target, Autonomous rendezvous, Convex programming, Guidance

CLC Number: