基于模糊干扰观测器的高超声速飞行器一体化制导控制方法

为充分利用高超声速飞行器在俯冲段的质心运动与绕质心运动之间的耦合作用和飞行过程中的不确定性,基于模糊干扰观测器提出了三维一体化制导与控制问题。首先根据飞行器的动力学方程以及飞行器-目标的视线角相对运动方程,推导出来适用于倾斜转弯控制的一体化制导控制模型。接着,针对模型中的不确定性采用模糊干扰观测器进行补偿,并使用块动态面方法设计了一种一体化制导控制律。然后,通过选取适当的李雅普诺夫函数证明了闭环系统状态的一致毕竟有界性。最后,仿真结果验证了该一体化制导控制方法的有效性和鲁棒性。     

一种变质心高速旋转炮弹鲁棒姿态控制律

针对采用变质心技术的高速旋转炮弹的姿态控制问题,提出一种基于扩张状态观测器的动态面控制方法。根据由弹体和单滑块组成的多体系统的特点,建立了系统的姿态动力学模型,并对其进行了合理的简化。将系统的滚转通道引起的强耦合、建模误差及外部扰动等视为未知不确定干扰,并且考虑由于炮弹尺寸限制而引起的多体系统控制输入(滑块位移)的有限性,设计了扩张状态观测器和辅助系统,分别对系统的干扰进行观测以及处理控制输入的有限性,综合动态面控制技术设计了姿态控制律,最后基于李雅普诺夫稳定性原理证明了控制器的稳定性。仿真结果表明,该控制器能够在克服干扰的前提下快速稳定地跟踪指令信号,具有良好的控制精度和鲁棒性。     

BDS导航信号抗电离层闪烁载波跟踪的自适应卡尔曼滤波算法

电离层闪烁会引起导航信号幅度和相位的快速衰落,严重影响跟踪环路的精度和稳健性,而相比频率跟踪和伪码跟踪,载波跟踪环路更易受电离层闪烁的影响而失锁。因此,提出一种基于相位锁定指示自适应扩展卡尔曼滤波的北斗导航信号抗电离层闪烁载波跟踪算法,其以同相与正交支路的积分结果估计相位锁定指示值,并采用该指示作为控制参数对不同闪烁场景下扩展卡尔曼滤波的观测向量进行自适应调整,这不仅能够提高跟踪环路的精度和稳健性,而且能够降低扩展卡尔曼滤波发散的概率。实验结果验证了相关分析和所提跟踪算法的有效性。     

过载系数未知的反舰导弹跃升俯冲过程跟踪算法

针对反舰导弹跃升机动过程的跟踪中,过载系数未知导致跟踪模型与导弹实际运动的不匹配问题,对状态变量进行扩展,应用扩展卡尔曼滤波对过载系数实时估计,实现对跃升俯冲机动过程的跟踪。仿真结果表明,该算法可准确估计出过载系数,显著提高跟踪性能。     

备件冷储备方案下装备群任务可靠性建模

针对具有相同结构功能的装备群系统可靠性评估问题,根据任务周期内对装备完好数的要求,合理表示了系统状态转移过程。以部件任务期间状态变化为研究对象,将系统等效表示为多阶段任务系统,即串行k/N(G)系统。在确定系统可行状态过程基础上,分别建立了部件寿命分布在3种不同情形下的系统任务可靠性模型,并分析了备件冷储备方案的影响。为确定系统任务期间备件携带量提供决策支持,最后给出了一个应用实例。     

Generalizing the survival signature to unrepairable homogeneous multi‐state systems

The notion of signature has been widely applied for the reliability evaluation of technical systems that consist of binary components. Multi‐state system modeling is also widely used for representing real life engineering systems whose components can have different performance levels. In this article, the concept of survival signature is generalized to a certain class of unrepairable homogeneous multi‐state systems with multi‐state components. With such a generalization, a representation for the survival function of the time spent by a system in a specific state or above is obtained. The findings of the article are illustrated for multi‐state consecutive‐k‐out‐of‐n system which perform its task at three different performance levels. The generalization of the concept of survival signature to a multi‐state system with multiple types of components is also presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 593–599, 2017     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

非线性系统的神经网络广义预测控制

研究了神经网络广义预测控制方法在非线性系统中的应用,基于BP网络构造神经网络预测器,利用非线性系统的开环输入输出数据离线训练神经网络,根据拟牛顿BFGS优化算法使得二次型性能指标函数达到最小,得到了最优的控制序列。同时给出了神经网络广义预测控制算法的步骤,讨论了提高系统鲁棒性的措施。仿真结果表明,这种神经网络预测控制算法具有响应速度快、控制效果好和跟踪精度高等特点。     

基于计算机三维建模技术的两栖车辆静水性能计算

为了解决传统静水性能计算中倾斜浮态下浮心计算困难的问题,建立了两栖车辆的三维实体模型,研究了任意浮态下浮心的计算方法。在此基础上,求解了两栖车辆在静水平衡时的浮态,并利用SolidWorks提供的API函数进行二次开发,实现了计算的自动化。经实例验证表明,该算法准确、快速。     

Lipschitz非线性系统状态观测器设计新方法

针对Lipschitz非线性系统状态观测器,提出了一种以极小化条件数为目标准则的新的设计方法。运用梯度下降法和Slyvester方程,计算极小化条件数,优化增益矩阵和最大允许Lipschitz常数,完成观测器设计。通过同其它文献的算例比较,结果发现按文中方法设计的观测器具有迭代次数少、优化结果好的特点。