This paper presents a receding horizon implementation of sequential convex programming for the spacecraft six-degree-of-freedom close proximity to a non-cooperative target satellite. With linearized relative translational dynamics and newly derived discrete rotational equations in terms of modified Rodrigues parameters, nonlinear system dynamics of the original optimal guidance and control problem for proximity are converted into convex ones for sequentially planning. The nonconvex constraint on field-of-view of the visual sensor pointing with coupled attitude and relative position is then approximately relaxed as a convex standard second-order cone, and concave spherical and ellipsoidal obstacle regions respectively around the target's body and solar arrays are convexified by affine constraints in terms of tangent planes. The original nonlinear optimal guidance and control problem is accordingly transformed into a series of second-order cone programming sub-problems via iteratively successive convexification with the trust region constraints, and sequentially solved using disciplined convex programming method. A close-loop guidance and control using the proposed sequential convex programming scheme is then demonstrated by means of receding horizon to robustly drive the spacecraft maneuvering close to the target. Numerical simulations and results reveal that the proposed method provides rapid and reliable guidance and control performance for six-degree-of-freedom close proximity and shows the potential for on-board implementations in real-time applications.
Read full abstract