震灾应急物资动态需求预测模型研究

为提高应急物资需求预测方法的实用性,同时考虑提前期和需求的不确定性,采用安全库存理论构建震灾应急物资动态需求预测模型,以观测得到的实际到货量、实际消耗量和实时剩余库存量等信息来动态预测当前时刻应急物资的需求量。应用算例表明,所建模型不仅能够准确反映需求量与被保障人员总数的正相关关系,而且还能实时体现被保障人员总数的变化情况。因此,该模型能够为震灾过程中应急物资需求量的确定提供科学决策依据,具有一定的实用价值和应用前景。     

基于正交试验法的冗余捷联惯组故障诊断实验方法研究

冗余捷联惯组是运载火箭控制系统的重要设备,需要对其进行故障检测和隔离以保证系统正常工作,所应用的故障检测算法需要进行有效性评估。由于惯组器件配置和故障形式的多样性,所有故障情形进行逐一测试不可能的,因此提出利用正交试验法安排实验,对广义似然比故障检测算法进行性能检测。试验结果表明应用正交试验实现了故障情形的良好覆盖性,有效减少了试验次数,并且从测试数据中验证了故障检测算法的有效性。     

应急器材柔性采购定价建模与求解

由于当前应急器材储备依然存在“多储”或“少储”风险,为提高储备效益,以企业经济效益与军队采购成本为优化目标,提出了应急器材柔性采购策略。通过建立企业储备策略与军队采购定价最优化模型,求解得到了在不同战争爆发概率及器材现货市场价格区间等外部环境因素下的军队最佳柔性定价及对应的企业最优储备策略,并通过实例分析验证了得出的决策结论。结果表明,最优策略的实施将有利于军队与企业共担应急器材数量储备风险。     

两栖仿生机器人登陆自适应越障机构优化设计

两栖仿生机器人是一种能够同时在水下和陆地工作的无人平台,在抢险救灾、环境勘探与资源开发等领域具有广泛应用。本文提出了一种具有自适应登陆越障能力的轮鳍复合式两栖机器人,对其越障过程进行了运动学与力学分析,以其在临界越障时刻转矩为目标函数,应用遗传算法优化设计了结构与运行参数,同时与其他两栖机器人越障能力进行对比。结果表明,优化后越障所需转矩相比优化前降低了718.4 N·mm,轮鳍复合式机器人能够攀越相比自身尺寸更高的垂直障碍。模拟仿真了所设计机器人的越障过程,获得了其在平地行走、越障以及上坡推进过程中的速度、位移与力矩的变化规律,并通过实验进行了验证。     

结合局部描述和拓扑约束的直线段匹配算法

针对弱纹理目标匹配问题,提出了一种基于直线局部邻域梯度信息和全局结构信息的直线匹配算法:对均值标准差直线描述符进行改进用于初始匹配;利用直线间的全局拓扑结构滤除误匹配;利用迭代拓扑滤波寻找更多的匹配,同时引入全局角度约束提高算法效率并进一步滤除错误匹配。实验表明,在光照变化、图像旋转、图像模糊、尺度变换、视点变化等条件下,该方法都具有很强的鲁棒性,并在匹配效率和准确度上优于现有的两种比较流行的方法。     

改进的精密三点法——在线测量直线度方法的再探讨

在原精密三点法的基础上,对插值方法进行了改进,对随机误差采用了相应的数据处理方法,使得分离结果更加接近真实值,并有效地去除了随机误差的影响,得到了采样值加密的曲线,文中给出了改进的精密三点法的算法和流程图。从仿真和实验结果来看,该方法是具有可行性和可靠性的。     

对通用数据链干扰效能评估及仿真

首先介绍了通用数据链(CDL)的技术特点,对CDL的干扰策略进行了讨论,分析了几种干扰样式的可行性。研究了脉冲干扰对CDL前向链路的BPSK扩频调制的干扰效能,对脉冲干扰下BPSK扩频调制的误码率及同步字差错率进行了计算。研究了宽带噪声干扰对CDL返向链路的OQPSK调制的干扰效能,对宽带噪声干扰下OQPSK调制的误码率进行了计算,最后分别进行了仿真分析。仿真结果显示,所研究的干扰样式在一定条件下对CDL通信链路能产生有效的干扰。     

New results on a stochastic duel game with each force consisting of heterogeneous units

Two forces engage in a duel, with each force initially consisting of several heterogeneous units. Each unit can be assigned to fire at any opposing unit, but the kill rate depends on the assignment. As the duel proceeds, each force—knowing which units are still alive in real time—decides dynamically how to assign its fire, in order to maximize the probability of wiping out the opposing force before getting wiped out. It has been shown in the literature that an optimal pure strategy exists for this two‐person zero‐sum game, but computing the optimal strategy remained cumbersome because of the game's huge payoff matrix. This article gives an iterative algorithm to compute the optimal strategy without having to enumerate the entire payoff matrix, and offers some insights into the special case, where one force has only one unit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 56–65, 2014     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

红外图像强固定模式显著性噪声抑制

针对红外成像设备对天远距离观测中得到的小目标、强固定模式噪声这一类典型数据,提出基于显著性的红外图像强固定模式噪声抑制算法。对此类图像数据进行特性分析,指出图像中目标区域相对于背景固定模式噪声区域是显著的,利用显著性检测算法分离出图像中目标区域及背景,对不同区域分别采取不同处理,仅基于单幅图像信息实现强固定模式噪声的有效抑制。通过大量小目标、强固定模式噪声红外图像对算法性能进行测试。结果表明,本算法能够准确提取出图像中目标区域,实现图像中强固定模式噪声的有效抑制。