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