引用本文:[点击复制]
[点击复制]
【打印本页】 【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 665次   下载 951
基于序列凸优化的高超声速滑翔式 再入轨迹快速优化
赵党军,梁步阁,杨德贵,时伟
0
(中南大学航空航天学院)
摘要:
针对具有热流、动压、过载以及多个禁飞区约束的再入轨迹优化问题,提出采用序列凸优化方法快速求解。利用归一化时间作为自变量解决终端时间自由问题,并引入辅助控制变量以减少序列优化结果中的高频振荡,在此基础上,通过线性化、离散化和非凸约束的凸化处理,将非凸非线性优化问题转化为二阶锥规划(Second Order Conic Programming, SOCP)问题,然后采用凸优化求解算法快速求解。数值优化结果与对比验证表明该方法能快速高效求解多约束条件下的再入轨迹优化问题,且计算效率和性能均优于传统的非线性规划方法。
关键词:  序列凸优化  再入轨迹优化  无损凸化  二阶锥规划
DOI:
基金项目:
Rapid Planning of Reentry Trajectory via Sequential Convex Optimization
ZHAO Dang-Jun,LIANG Bu-Ge,YANG De-Gui,SHI Wei
(School of Aeronautics and Astronautics, Central South University)
Abstract:
A sequential convex optimization scheme is proposed for rapid solving the reentry trajectory optimization problem constrained by heat flux, dynamic pressure, normal load, and multiple no-fly zones. The normalized time is used as the independent variable to accommodate the problem of free terminal time, and auxiliary control variables are introduced to alleviate the high frequent chatter in the sequential convex optimization solution. Further, the linearization, discretization, and convexification techniques are used to convert the original concave and nonlinear optimization problem into a standard second order conic programming problem, which can be rapid solved by convex algorithms. Numerical results and comparison study reveal that the proposed method is efficient and effective to solve the problem of reentry trajectory optimization with multiple constraints, and the computational efficiency and performance of the proposed method is superior to that of the classical nonlinear programming.
Key words:  Sequential convex optimization  Reentry trajectory optimization  Lossless convexification  Second order conic programming

用微信扫一扫

用微信扫一扫