返回
Spiral-diving trajectory optimization for hypersonic vehicles by second-order cone programming
DOI:10.1016/j.ast.2019.105427.png)
摘要
En 中文
Spiral maneuvering targets are well known to be very difficult to intercept due to its high maneuverability and unpredictability. This paper focuses on the optimization of a spiral-diving trajectory for a hypersonic vehicle to strike a stationary target. Second-order cone programming (SOCP), a subclass of convex optimization, is applied to achieve this optimization task. First, based on a detailed analysis of spiraling nature, the dynamics are partially reconstructed to better formulate the spiraling motion. Then, a nonconvex optimal control problem is formulated with the maximum impact velocity as a performance index. Constraints on the states, controls, and terminal conditions are helping to shape a feasible and practical spiraling trajectory. This nonconvex problem is convexified and subsequently discretized in a suitable form so that it can be easily solved in polynomial time using the existing primal-dual interior-point algorithm. In addition, a relaxation technique is used to convexify control constraints and is theoretically proved to be valid. The high reliability and efficiency of the successive SOCP method are verified by numerical examples and comparisons with other methods. (C) 2019 Elsevier Masson SAS. All rights reserved.
Keyword:
Hypersonic vehicles
Spiral-diving maneuver
Second-order cone programming
Convex optimization
Relaxation technique
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.8
论文数:
1.0W
被引数:
3.0W
机构
引用论文
Lossless convexification of a class of optimal control problems with non-convex control constraints一类具有非凸控制约束的最优控制问题的无损凸化
AUTOMATICA
IF5.9
The revised UCLA Loneliness Scale: Concurrent and discriminant validity evidence.修订后的加州大学洛杉矶分校孤独量表: 并发和判别效度证据。
Receding horizon guidance and control using sequential convex programming for spacecraft 6-DOF close proximity使用顺序凸规划对航天器六自由度近距离进行后退水平制导和控制

