Survey of convex optimization for aerospace applications
Survey of convex optimization for aerospace applications
复制标题
航空航天应用凸优化综述
DOI：
10.1007/s42064-017-0003-8
复制
发表时间：
2017-09-01
期刊：
影响因子：
6.1
通讯作者：
Pan, Binfeng
中科院分区：
文献类型：
--
作者：
Liu, Xinfu;Lu, Ping;Pan, Binfeng
凸优化是一类具有多项式复杂性的数学规划问题，对于凸优化，存在最先进的、具有预定计算边界的高效数值算法。在航空航天工程中，计算效率和易处理性，特别是在制导、导航和控制（GN&C）中，是至关重要的。由于对解和计算效率的理论保证，凸优化本身是一个非常有吸引力的工具。与航空航天器自主操作的强烈驱动相一致，凸优化在解决航空航天GN&C问题方面的实用性迅速增加，具有机载实时应用的潜力。本文试图提供一个概述的问题，到目前为止，在航空航天制导，路径规划和控制，凸优化已被应用。各种凸化技术已被用来凸化原来非凸的航空航天问题进行审查。讨论了如何保证凸化过程的有效性。还将介绍一些相关的执行问题。(C)清华大学出版社2018
Convex optimization is a class of mathematical programming problems with polynomial complexity for which state-of-the-art, highly efficient numerical algorithms with predeterminable computational bounds exist. Computational efficiency and tractability in aerospace engineering, especially in guidance, navigation, and control (GN&C), are of paramount importance. With theoretical guarantees on solutions and computational efficiency, convex optimization lends itself as a very appealing tool. Coinciding the strong drive toward autonomous operations of aerospace vehicles, convex optimization has seen rapidly increasing utility in solving aerospace GN&C problems with the potential for onboard real-time applications. This paper attempts to provide an overview on the problems to date in aerospace guidance, path planning, and control where convex optimization has been applied. Various convexification techniques are reviewed that have been used to convexify the originally nonconvex aerospace problems. Discussions on how to ensure the validity of the convexification process are provided. Some related implementation issues will be introduced as well. (C) Tsinghua University Press 2018