基于RBF网络的滑模变结构控制在无刷直流电机伺服系统中的应用

无刷直流电动机的参数强耦合、高度非线性特性增加了对其速度控制的难度,针对这一特点,设计了一种神经网络滑模变结构速度控制器。将无刷直流电机速度伺服系统分成名义模型和不确定模型,采用状态反馈方法对名义模型进行控制,以RBF神经网络为滑模动态补偿器对不确定系统进行控制。该方法不仪具有变结构控制的抗参数摄动、抗干扰以及速度快等优点,神经网络控制的加入还有效地减弱了单纯滑模变结构控制所带来的“抖振”现象。Matlab仿真结果表明,该控制器具有良好的控制性能和鲁棒性能。     

基于RLC振荡电路电磁超声换能器激励研究

根据目前电磁超声的基本理论以及现有的激发方式,在EMAT基本模型基础上,应用新型开关电源IG—BT代替交流接触器优化激发电路系统,旨在提高电磁超声换能器的磁声转换效率,解决其灵敏度低以及热效应的不良影响等问题。通过实验对系统优化前后的数据进行比较,表明优化后的系统不仅降低了能耗,而且提高了原有交流接触器作为开关时超声幅值和转换效率。     

潜射巡航导弹现在点攻击捕获概率计算

由于潜艇探测设备所获得的目标方位和距离信息存在误差,造成目标初始位置在一定的区域内存在散布情况,分析了潜射导弹在攻击水面舰艇时目标的散布情况,给出了目标散布区域的表示方法,根据巡航导弹搜捕目标的原理,给出导弹捕获散布目标的概率计算模型,并进一步探讨导弹齐射对散布目标的捕获情况,可为海战中导弹攻击方式的选择和导弹优化使用提供辅助决策.     

信源数动态变化的一种稳健超定盲分离算法

针对大多数现有盲分离算法都假定信源数已知,分析了信源数未知且动态变化时的超定盲分离(接收天线数多于信源数)算法,通过奇异值分解在线估计信源个数,并修正自适应神经网络的维数。文章在经典Cichocki-Unbenauen算法中加入动量项,设置可变步长,使分离性能得到较大的改进,同时避免训练陷入局部最小。与文献[1]新提出的ANA算法相比,仿真结果证明本文算法具有更快的收敛速度和更小的稳态误差。     

基于单一聚类方法的航空器相撞HFACS诱发模式分析

为了有效防控航空器相撞事故的发生,保证航空系统安全、有序和高效运行,提出一种基于单一聚类过程的人为因素分析分类系统(HFACS)诱发模式分析方法。在该方法中,首先,根据航空器相撞的具体特点建立了HFACS。然后,利用HFACS对发生的航空器相撞事故/事故征候进行量化,构建历史信息的数据表。最后,采用单一聚类方法对得到的数据表进行诱发模式分析,识别出重要的诱发模式及模式中包含的重要影响因素,并据此提出防相撞的管控措施。实例分析表明,所提出方法的实现过程简便,定性定量结合,形式易于理解,分析结果也更加贴近实际,对于提升防相撞的管理和决策水平,防范航空器相撞及减少造成的损失具有重要的实用价值。     

飞机发动机关键系统智能故障诊断方法

飞机发动机是一个非常复杂的大系统,由于其结构复杂,工作环境恶劣,对其关键系统的故障进行准确诊断始终是困扰业界的技术瓶颈之一。提出了采用EMD小波阈值降噪与主元分析相结合的方法,对飞机发动机气路系统故障诊断进行了深入研究。针对某型真实飞机发动机进行测试试验采集的气路多参量数据,首先采用经验模态分解(Empirical Mode Decomposition,EMD)对气路系统各参量信号进行EMD分解,然后采用软阈值函数对其进行降噪,并进行信号重构,从而可得到飞机发动机气路工作状态有效数据。在此基础上,设计了飞机发动机气路系统主元分析故障诊断模型,并结合预处理得到的飞机发动机气路有效数据,运用所设计的主元分析故障诊断模型对飞机发动机进行故障诊断技术研究。研究结果表明,所提出的方法能够很好地诊断出飞机发动机气路系统实际运行时所出现的故障,具有重要的实际应用价值,并有广泛的应用前景。     

基于反馈线性化的深海潜标姿态滑模控制

针对潜标空间运动的强非线性及数学模型中存在的干扰不确定性为控制带来的挑战,提出了一种基于反馈线性化的深海潜标姿态滑模控制律,并编程进行了仿真及与输入输出线性化控制方法进行比较,结果表明,两种方法均能将潜标控制到参考姿态,滑模控制对系统的不确定性干扰和执行器滞后具有更好的鲁棒性。另外,通过程序可以数值模拟的方式观察潜标在控制过程中的水动力、力矩,潜标姿态、空间运动轨迹、缆索动力学特征等信息,为客观分析潜标的控制与水动力机理提供了支撑。     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

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     

光纤光栅技术与应用专题讲座(一) 第2讲 光纤布拉格光栅的仿真方法与设计

文中介绍了光纤布拉格光栅的原理;根据耦合模方程,介绍了几种光栅的仿真方法;分别以光纤布拉格光栅滤波器、色散补偿器、相移光栅和采样光栅为例说明了光纤光栅的设计方法。