检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:雷虎民[1] 周觐[1] 翟岱亮[1] 张大元[2] 王华吉[1] 李宁波[1]
机构地区:[1]空军工程大学防空反导学院 [2]中国人民解放军95948部队
出 处:《系统工程与电子技术》2016年第12期2807-2813,共7页Systems Engineering and Electronics
基 金:国家自然科学基金(61573374;61503408);航空科学基金(20150196006)资助课题
摘 要:针对反临近空间高超声速目标拦截作战过程中的中制导弹道的规划与修正问题,设计了一种最优弹道修正算法。首先分析了在中制导阶段进行弹道规划与弹道修正的必要性,基于庞特里亚金最小值原理给出了基准最优弹道满足的一阶必要性条件,其次将一阶必要性条件进行二阶变分,得到控制量的修正量,利用基准弹道数据,通过逆向积分,将协态变量的偏差量表示为终端约束修正量以及状态变量偏差量的表达式,从而有效解决了协态变量偏差量的获取问题,最后进行了多种情形下的数字仿真,对所提算法进行验证并与高斯伪谱法(Gauss pseudospectral method,GPM)进行对比。结果表明,该方法不仅具有较高的求解精度,并且其求解效率远高于GPM,有利于弹上在线实现。Aiming at the problem of the midcourse trajectory generation and modification in the interceptton against hypersonic targets in near space, a novel optimal traiectory modification algorithm is designed. Firstly, the demand for trajectory generation and trajectory modification in the midcourse phase is analyzed. The first or- der necessary conditions for the nominal optimal trajectory are given based on the Pontryagin minimization theo- ry. Secondly, the first order necessary conditions are further differentiated to second variation to acquire the control modifications. The difficulty of the co-states deviations acquisition is solved by reversely integrating u- sing the nominal trajectory information to get the expression with the terminal constraints modifications and the current states derivations. Finally, digital simulations under different scenarios are carried out to testify the ef- fectiveness of the proposed algorithm and the results are compared with those given by the Gauss pseudospeetral method (GPM). Simulations results show that the algorithm has the merits of high precision and efficiency than the GPM, which is preferable for the online realization.
分 类 号:TJ765[兵器科学与技术—武器系统与运用工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.196