所属单位：南京航空航天大学

摘要：Sequential Convex Programming (SCP) has been widely applied to trajectory optimization due to its favorable convergence properties. However, the monotonicity and non-monotonicity of the penalty function in SCP may influence the algorithm's line search process, thereby affecting its computational efficiency. To improve the efficiency of SCP, this paper reformulates the convex subproblem based on L∞ penalty function, in contrast to the commonly adopted L1 penalty function. This reformulation reduces both the dimensionality of the optimization variables and the number of constraints.……

备注：ResearchGate 预印本，暂无正式刊源和 DOI

论文类型：预印本

学科门类：工学

一级学科：航空宇航科学与技术

文献类型：预印本

是否译文：否

发表时间：2026-06-01

合写作者： Hong-Bo Zhang,谢磊,Rui-Zhi He

第一作者：Cheng-Long Dong