检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李兆亭 周祥 张洪波[1] 汤国建[1] Li Zhaoting;Zhou Xiang;Zhang Hongbo;Tang Guojian(College of Aerospace Science and Engineering,National University of Defense Technology,Changsha 410073,China)
出 处:《航天控制》2023年第4期27-33,共7页Aerospace Control
摘 要:针对再入滑翔飞行器可达域快速计算问题,研究了一种近似解析求解方法。首先,将可达域求解问题归结为两类纵、横程极值轨迹规划问题,利用极大值原理推导出满足最大纵程/横程要求时飞行攻角对应当前最大升阻比攻角的结论,通过仿真验证了该结论的正确性。其次,结合再入滑翔飞行器动力学特性,设计了不同极值轨迹的倾侧角变化规律,并通过梯度下降方法优化得到相关参数。最后,在不同飞行器初始状态条件下,通过数值仿真得到了所提方法的可达域。其与伪谱法优化结果基本一致,证明了所提方法的有效性。An approximate analytical approach to the footprint of gliding reentry vehicles is studied.Firstly,the problem is attributed to two types of longitudinal and transverse range extreme value trajectory planning problems with reference to the solution ideas in related literature.Regarding these two types of trajectory planning problems,the deduction that the attack angle should be the current maximum lif-to-drag ratio angle of attach is derived by introducing the principle based on extreme value,and the validity of this deduction is verified by simulations.Secondly,the bank angle variation laws for different extreme value trajectories are designed by combining the dynamics of the vehicle,and the relevant parameters are calculated by using the gradient descent optimization method.Finally,the effectiveness of the proposed method is verified by simulations.Under the given conditions of different vehicle starting states,the results of the proposed method in the reachable domain are less different from those obtained by the pseudo-spectral method.
关 键 词:滑翔飞行器 再入可达域 轨迹优化 极大值原理 伪谱法
分 类 号:V412.41[航空宇航科学与技术—航空宇航推进理论与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222