Abstract：To resolve the problem of cooperative trajectory planning of multi-near space vehicles in the glide phase, a sequential convex programming (SCP) under a decoupled framework was designed to enhance efficiency. Firstly, discretisation and linearisation methods formulated the convex optimisation model for cooperative trajectory planning. The original complicated problem was decoupled by decomposing design variables and decoupling coupled constraints to reduce the model's dimensions. Then, a trust-region shrinking strategy was introduced, accelerating the convergence of SCP. Numerical simulation results show that the proposed decoupled SCP can acquire the cooperative glide trajectories satisfying the constraints, and the computational efficiency is higher than the coupled SCP.
宋瑞, 张刚, 刘斯禹, 王世超, 秦佳星, 杨艺. 多临近空间飞行器滑翔段协同轨迹规划方法[J]. 空天防御, 2025, 8(2): 66-76.
SONG Rui, ZHANG Gang, LIU Siyu, WANG Shichao, QIN Jiaxing, YANG Yi. Cooperative Trajectory Planning for Multi-Near Space Vehicle in Glide Phase. Air & Space Defense, 2025, 8(2): 66-76.
