随机共振理论在雷达信号截获中的应用

雷达侦察主要通过无源侦察接收设备对空域中敌方雷达辐射源信号进行检测,若要实现对敌辐射源信号的截获,基本条件就是敌雷达信号能量能够达到雷达信号侦收设备的截获灵敏度。然而现代战场中,电磁环境复杂多变,敌雷达信号往往被干扰信号、噪声等掩盖,导致侦收设备漏警概率提高。针对以上问题,提出基于随机共振原理的雷达信号截获判断的方法,增大了截获信号的输出信噪比,解决了由于噪声过大掩盖的雷达信号的侦收问题。将该方法应用于雷达告警接收机的前端截获部分,大大降低了截获系统的漏警概率,保证了整个截获系统的稳定性。仿真实验验证了该方法的有效性。     

一种改进的均方根容积粒子滤波算法

传统的粒子滤波算法在重要性采样估计时忽略了当前量测影响。在非线性场景下,传统的粒子滤波导致个别粒子具有大权值,造成估计结果精度差。针对该问题,结合均方根容积卡尔曼滤波(SCKF)算法和Gating技术,提出了一种新的重要性函数估计算法。本算法将后验概率作为重要性采样函数,通过利用SCKF和统计距离,建立粒子与量测的关联关系,实现对重要性采样函数的均值和协方差矩阵的估计。而后,使用粒子滤波算法,对多目标状态和数目进行估计。实验表明,在非线性跟踪场景下,本算法估计精度高,估计结果稳定。     

基于直觉模糊时间Petri网的不确定性时间推理方法

针对Petri网模型在对复杂不确定性时间信息描述和推理方面的局限性,在定义直觉模糊时间函数以及网络变迁约减规则的基础上,融合直觉模糊时序逻辑(IFTL)、直觉模糊Petri网(IFPN)以及线性逻辑推理的理论优势,构建了直觉模糊时间Petri网(IFTPN)推理模型,并提出了基于IFTPN的不确定性时间推理算法,较好地解决了态势评估中冲突事件间的不确定性时间推理问题。最后,通过典型的战场想定验证了该时间推理方法的有效性和优越性。     

一种改进的基于交互式模型的机动目标跟踪算法

针对传统的以匀速(CV)或匀加速(CA)运动作为目标运动模型的卡尔曼跟踪滤波器的计算量大及跟踪精度低的固有缺陷,提出了一种基于CV和CA的交互式卡尔曼滤波模型的机动目标跟踪算法,该算法能在保持直线运动跟踪精度不变的前提下,使做曲线运动的目标的跟踪精度逼近做直线运动的目标的跟踪精度。并将CV和CA模型混合起来进行仿真估计,系统仿真结果表明该算法提高了系统的跟踪精度。     

基于磁流变液的飞机起落架嵌入式缓冲控制器设计

基于飞机着陆和滑行过程中,飞机起落架中磁流变阻尼器的阻尼力的不可控的问题。提出基于磁流变液的飞机起落架嵌入式缓冲控制器设计方法,设计了针对控制磁流变阻尼器阻尼力的缓冲控制系统,主要包括嵌入式数字信号处理器DSP的选择,控制系统的原理设计,电源产生电路和复位电路模块,JTAG仿真电路模块,A/D采样校正模块,D/A转换模块,压控电流源驱动模块。通过电路模块的仿真,由控制系统中压控电流源出来的电流在阻尼器接受范围之内,证明了设计的磁流变缓冲控制器能对阻尼力的大小进行控制,对飞机起落架的缓冲系统起到调节作用。     

舰艇对空自防御系统集成优化方法

舰艇对空自防御系统的集成优化设计是提高系统使用性能的重要途径,系统地分析了舰艇对空自防御系统集成优化的总体思路和主要工作内容,提出了采用开放式体系架构和基于公共计算服务环境技术的舰艇对空自防御系统集成优化方案。     

基于先验知识的降秩STAP方法研究

提出了一种基于杂波先验知识的降秩(RR)空时自适应处理(STAP)方法——KA-RR法,该方法首先利用载机平台运动参数、雷达系统参数及地形、地貌参数等先验知识构建机载雷达杂波模型,然后通过该模型对机载雷达杂波数据进行预白化处理,最后利用降秩STAP方法自适应抑制剩余杂波。仿真结果表明,相对于传统的降秩STAP方法,KA-RR方法具有更好的杂波抑制性能和更强的鲁棒性。     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

FMEA与粗糙集相结合的故障预测方法

基于FMEA和粗糙集决策系统基本理论,对飞机中分系统故障预测问题进行了研究。首先定义故障预测所需的征兆并对系统进行FMEA,按照FMEA分析结果分次向系统模型注入引起特定故障的事件,采集含有故障趋势的系统模型的信息用于构建适用于故障预测的粗糙集决策表,对该表进行了处理,最终发现用于故障预测的知识(即决策规则和算法);最后运用所发现的知识进行故障预测。