Decentralized closed-loop optimization for 6-DOF self-assembly satellites. (December 2021)

• Record Type: Journal Article
• Authors: Lu, Shaozhao; Zhang, Yao; Li, Xingang; Hu, Quan
• Is Part Of: Acta astronautica. Volume 189(2021)
• Page Start: 593
• Page End: 605
• Publication Date: 2021-12
• Subjects: In-orbit assembly -- Difference of convex programming -- Model predictive control -- Outer-bounding tube; Astronautics -- Periodicals; Outer space -- Exploration -- Periodicals; Astronautics; Periodicals; 629.405
• DOI: 10.1016/j.actaastro.2021.09.011
• Languages: English
• ISSNs: 0094-5765

Abstract

Abstract: A decentralized closed-loop optimization based on the difference of convex programming is proposed to assemble large telescopes autonomously in-orbit. This study focuses on assembly problems of mirror satellites with six degrees of freedom. Firstly, the h p -Radau pseudospectral collocation method is adopted to increase computational efficiency. Subsequently, the nonconvex constraints are convexified by applying undominated decomposition and sequential convex programming. Additionally, the fixed trajectory assumption enables the translational optimization problem to be a decentralized problem with convergence-guaranteed proof. The six degrees of freedom optimization problem is decoupled by utilizing the proposed algorithm in translational and rotational planning, and coupled by thruster allocation method. To improve the robustness of the system, the algorithm is wrapped in the model predictive control framework, and the recursive feasible property is ensured using the outer-bounding tube. Therefore, the closed-loop optimal control is robust under additive uncertainties. In the numerical experiments, mirror satellites are released from a high-accuracy fitting carrier satellite to accomplish the assembly, and these satellites are utilized to verify the high-speed algorithm and the effectiveness of the closed-loop optimization. Highlights: A convergence-guaranteed difference of convex algorithm is proposed. Collision avoidance constraints are modeled as high-order multivariate polynomials. Algorithm is validated using 6DOF spacecraft assembly problem. Rapidity and optimal nature of the algorithm are demonstrated by numerical examples. Recursive feasibility model predictive guidance is proved to be robust.