基于灰色非线性回归模型的故障预测

为克服传统灰色模型的局限性,通过对一阶累加生成序列规律性的分析,将灰色模型和非线性回归模型相结合,构造了一种灰色非线性回归模型。实例仿真结果表明,该模型既拓展了传统灰色模型的适用条件,又比传统灰色模型和非线性回归模型具有更高的预测精度,且适用性广。     

某舰炮托架多目标拓扑优化设计

为避免单目标拓扑优化无法考虑其他因素的缺点,通过基于密度法中的SIMP法,采用折衷规划法定义了多目标拓扑优化。以某舰炮为例,对其托架进行了多目标拓扑优化,得到了同时满足舰炮射角为0°、49°和方向角为0°时刚度最大以及动态低阶振动频率最大要求的舰炮托架的拓扑结构,并根据此优化对托架进行了结构重新改进和有限元的验证,表明了该优化设计方法的可行性。对于舰炮托架结构改进设计具有工程应用价值,对其他一般机械结构问题也提供了一种设计思路。     

基于高斯和-容积Kalman滤波的高轨双星辐射源跟踪

高轨双星系统可通过测量辐射源信号的到达时差、频差和到达高轨卫星的多普勒频移,跟踪沿地球表面巡航且载频固定、已知的运动辐射源。针对辐射源运动方程和观测方程的强非线性,提出了基于高斯和框架与5阶容积Kalman滤波的运动辐射源跟踪算法GS-5CKF。算法将起始时刻的时差观测量所确定的处于地球表面的时差线按辐射源经度等间隔划分,初始化多个并行的5阶容积Kalman滤波器,线性组合各滤波器每个时刻的输出以获得辐射源运动状态的估计。针对5阶容积Kalman滤波器,提出了相应的非线性测度并引入滤波器分裂与合并,以提高跟踪精度并保持GS-5CKF算法计算复杂度基本不变。仿真表明,相对仅使用单个5阶容积Kalman滤波器和基于高斯和框架但使用3阶容积Kalman滤波器的GS-3CKF等算法,提出的跟踪算法具有更高的估计精度。     

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

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

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

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

Nonlinear pricing with consumer satiation

In various scenarios, consumers may become satiated with products, and the degree of satiation is directly associated with their prior experiences. Confronted with consumer satiation, the seller is unable to either identify consumers who have a higher likelihood of being satiated ex ante or distinguish satiated from non‐satiated consumers ex post. Therefore, the seller should address dynamic selling, valuation uncertainty, and quantity decisions, all of which are important operational issues. We consider a two‐period problem in which consumer types are influenced by their prior consumption experiences. Faced with these consumers, the seller intends to optimize quantities and adjust the prices of the products in each period to maximize revenue. We find that the seller may reduce ex ante production quantity as some consumers become satiated. Moreover, the ex ante quantity is first decreasing and then increasing with regard to the satiation rate. Furthermore, two‐period information asymmetries may provide a rationale for upward distortion in quantity when consumer preferences are highly sensitive to first‐period consumption. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 386–400, 2016     

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

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

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

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

采用终端滑模控制实现交会对接逼近段姿态跟踪

针对交会对接逼近段追踪器的姿态控制问题,采用反馈线性化理论推导了非线性姿态动力学方程的相变量模型.基于导出的姿控模型,引入模型误差和随机噪声,结合终端滑模控制理论,给出了能够在有限时间内完成姿态跟踪,并使状态跟踪误差收敛的控制律的设计方法.对具有扰动项的系统,仿真结果仍能满足交会任务对时间的要求,且姿态角跟踪误差趋于0,说明控制律对相变量系统的姿态跟踪控制具有较好的鲁棒性.     

Route optimization for multiple searchers

We consider a discrete time‐and‐space route‐optimization problem across a finite time horizon in which multiple searchers seek to detect one or more probabilistically moving targets. This article formulates a novel convex mixed‐integer nonlinear program for this problem that generalizes earlier models to situations with multiple targets, searcher deconfliction, and target‐ and location‐dependent search effectiveness. We present two solution approaches, one based on the cutting‐plane method and the other on linearization. These approaches result in the first practical exact algorithms for solving this important problem, which arises broadly in military, rescue, law enforcement, and border patrol operations. The cutting‐plane approach solves many realistically sized problem instances in a few minutes, while existing branch‐and‐bound algorithms fail. A specialized cut improves solution time by 50[percnt] in difficult problem instances. The approach based on linearization, which is applicable in important special cases, may further reduce solution time with one or two orders of magnitude. The solution time for the cutting‐plane approach tends to remain constant as the number of searchers grows. In part, then, we overcome the difficulty that earlier solution methods have with many searchers. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010