Entry Trajectory Optimization by Second-Order Cone Programming
Entry Trajectory Optimization by Second-Order Cone Programming
复制标题
DOI：
10.2514/1.g001210
复制
发表时间：
2016-02
影响因子：
2.6
通讯作者：
Xinfu Liu;Zuo-jun Shen;P. Lu
中科院分区：
文献类型：
--
作者：
Xinfu Liu;Zuo-jun Shen;P. Lu
凸优化以其独特的理论优势和最新的凸规划求解算法的多项式时间复杂性，近年来得到了广泛的应用。本文尝试将凸优化的一个分支--二阶锥规划应用于一类高度非线性的进场飞行轨迹优化问题。将凸优化应用于大多数航天工程问题的首要挑战在于问题的非线性和非凸性。完全依赖线性化并不总是很有效，在进入轨迹优化方面也是如此。本文主要研究如何将逐次线性化和松弛技术相结合，以一种适合于二阶锥规划求解的方式来描述现实的、高度约束的进入轨迹优化问题。进行了严格的分析，以支持该方法的合理性。数字演示被提供给……
Convex optimization has found wide applications in recent years due to its unique theoretical advantages and the polynomial-time complexity of state-of-the-art solution algorithms for convex programming. This paper represents an attempt to apply second-order cone programming, a branch of convex optimization, to the class of highly nonlinear trajectory optimization problems in entry flight. The foremost challenge in applying convex optimization in most aerospace engineering problems lies in the nonlinearity and nonconvexity of the problem. Exclusive reliance on linearization does not always work well, as is the case in entry trajectory optimization. This paper focuses on how to formulate realistic, highly constrained entry trajectory optimization problems in a fashion suitable to be solved by second-order cone programming with a combination of successive linearization and relaxation techniques. Rigorous analysis is conducted to support the soundness of the approach. Numerical demonstrations are provided to...