论文标题
使用凸优化和神经网络实时计算供电的着陆指南
Real-time computational powered landing guidance using convex optimization and neural networks
论文作者
论文摘要
计算指导是航空航天指导和控制的新兴和加速趋势。结合了机器学习和凸优化,本文提出了一种实时计算指导方法,用于6度自由式启动的着陆指南问题。电力着陆指导问题被提出为最佳控制问题,然后将其转换为凸优化问题。我们使用神经网络来改善最新的顺序凸编程(SCP)算法,而不是残酷地使用神经网络作为控制器。基于深度神经网络,初始轨迹发生器旨在为SCP算法提供令人满意的初始猜测。提出的数据驱动的SCP体系结构受益于将初始轨迹生成器设计为序列模型预测指标,它能够在各种应用中改善任何最先进的SCP算法的性能,而不仅仅是有能力的着陆指南。模拟结果表明,所提出的方法可以精确地引导车辆到达着陆点。此外,通过蒙特卡洛测试,与SCP方法相比,所提出的方法可以平均节省40.8%的计算时间,同时确保较高的末端状态准确性。提出的计算指导方案适合实时应用。
Computational guidance is an emerging and accelerating trend in aerospace guidance and control. Combining machine learning and convex optimization, this paper presents a real-time computational guidance method for the 6-degrees-of-freedom powered landing guidance problem. The powered landing guidance problem is formulated as an optimal control problem, which is then transformed into a convex optimization problem. Instead of brutally using the neural networks as the controller, we use neural networks to improve the state-of-the-art sequential convex programming (SCP) algorithm. Based on the deep neural network, an initial trajectory generator is designed to provide a satisfactory initial guess for the SCP algorithm. Benefitting from designing the initial trajectory generator as a sequence model predictor, the proposed data-driven SCP architecture is capable of improving the performance of any state-of-the-art SCP algorithm in various applications, not just powered landing guidance. The simulation results show that the proposed method can precisely guide the vehicle to the landing site. Moreover, through Monte Carlo tests, the proposed method can averagely save 40.8% of the computation time compared with the SCP method, while ensuring higher terminal states accuracy. The proposed computational guidance scheme is suitable for real-time applications.