动态威胁环境下单无人机测向定位航迹优化算法

为解决单架无人机在动态战场环境下的测向定位问题,提出了一种基于动态窗口法的单机测向定位航迹优化算法。以最大化Fisher信息矩阵行列式为测向定位评价准则,在由动态探测雷达和静/动障碍构成的动态战场环境中,基于动态窗口法思想,将测向定位航迹优化评价准则由传统的单步最优原则扩展到对多步预测航迹的评价,同时考虑雷达探测和静/动障碍环境对预测航迹的影响,通过滚动时域方法控制无人机最优航向。仿真结果表明,所提方法能够使无人机在有效逃避雷达探测威胁以及规避环境中静/动障碍的条件下保证对目标的高精度测向定位,为解决动态战场环境下的单架无人机测向定位问题提供了新思路。     

光滑物体表面反射光偏振特征分析及反射光分离技术

物体表面反射光由镜面反射光和漫反射光组成,针对光滑物体表面镜面反射光和漫反射光的分离问题,建立了一个结合镜面反射和漫反射共同作用的偏振态表征模型,并使用该模型对混合反射区域偏振特征进行分析。基于镜面反射光和漫反射光的偏振特征,根据镜面反射光和漫反射光在光滑物体表面垂直方向及平行方向上的分布关系,采用偏振正交分解的方法实现了镜面反射成分和漫反射成分的求解。利用镜面反射光图像和漫反射光图像之间的相关性,通过梯度下降算法得到镜面反射成分和漫反射成分归一化互相关最小值及其对应的镜面反射偏振度和漫反射偏振度,从而实现反射光的分离。通过对不同场景中获取的反射光图像进行测试,实验结果表明,该算法具有较好的反射光分离效果。     

A novel launch dynamics measurement system for multiple launch rocket system and comparative analysis with numerical simulations

In this paper,a novel launch dynamics measurement system based on the photoelectric sensor pair is built.The actual muzzle time(i.e.a time duration that originates from the initial movement to the rocket's departure from the muzzle)and the muzzle velocity are measured.Compared with the classical methods,the actual muzzle time is obtained by eliminating the ignition delay.The comparative analysis method is proposed with numerical simulations established by the transfer matrix method for multibody systems.The experiment results indicate that the proposed measurement system can effectively measure the actual muzzle time and reduce the error of classical methods,which match well with the simulation results showing the launch dynamics model is reliable and helpful for further analysis and design of the MLRS.     

Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

一维金属-介质光子晶体的特性

利用特征矩阵法对一维金属-介质光子晶体的特性进行了计算,发现此种光子晶体具有可见光透明,微波、紫外高反的光谱特性,而且存在比一维介质光子晶体更宽、反射更强的全向带隙.     

利用交互依赖活动集对C4ISR系统进行重组

一个复杂的C4ISR系统由若干子系统组成,子系统之间的交互依赖关系应该尽量少.利用活动模型构造系统的活动邻接矩阵,用图论中的路径矩阵来识别强连通子图,从而得出交互依赖活动集.具有交互依赖关系的活动尽量安排在一个子系统内部.利用这种方法来对C4ISR系统进行重组.     

矩阵多项式aA+bI

本文讨论了矩阵A满足f(A)=0时一次矩阵多项式aB+bI可逆的条件,并给出了来(aA+bI)-1的一般方法。     

Averaging frameworks for simulation optimization with applications to simulated annealing

We present two frameworks for designing random search methods for discrete simulation optimization. One of our frameworks is very broad (in that it includes many random search methods), whereas the other one considers a special class of random search methods called point‐based methods, that move iteratively between points within the feasible region. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. Also, the methods are adaptive in that they can use information gathered in previous iterations to decide how simulation effort is expended in the current iteration. We show that the methods within our frameworks are almost surely globally convergent under mild conditions. Thus, the generality of our frameworks and associated convergence guarantees makes the frameworks useful to algorithm developers wishing to design efficient and rigorous procedures for simulation optimization. We also present two variants of the simulated annealing (SA) algorithm and provide their convergence analysis as example application of our point‐based framework. Finally, we provide numerical results that demonstrate the empirical effectiveness of averaging and adaptivity in the context of SA. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

基于深度优先搜索与增量式求解的极小一阶不可满足子式提取算法

随着寄存器传输级甚至行为级的硬件描述语言应用越来越广泛,基于一阶逻辑的可满足性模理论(Satisfiability Modulo Theories,SMT)逐渐替代布尔可满足性(Boolean Satisfiability,SAT),在VLSI形式化验证领域具有更加重要的应用价值。而极小不可满足子式能够帮助EDA工具迅速定位硬件中的逻辑错误。针对极小SMT不可满足子式的求解问题,采用深度优先搜索与增量式求解策略,提出了深度优先搜索的极小SMT不可满足子式求解算法。与目前最优的宽度优先搜索算法对比实验表明:该算法能够有效地求解极小不可满足子式,随着公式的规模逐渐增大时,深度优先搜索算法优于宽度优先搜索算法。     

基于Coherent Point Drift方法的SAR图像散射中心匹配

散射中心匹配是当前散射中心用于SAR图像目标识别的一个主要技术途径.散射中心匹配的难点在于散射中心特征存在的误差和缺失.Coherent Point Drift (CPD)方法从概率密度估计的角度解决点模式匹配问题,能够较好地考虑散射中心的误差和缺失.本文将CPD方法用于散射中心匹配,并在此基础上引入车辆目标SAR图像方位角估计先验信息和散射中心属性信息,以提高散射中心匹配的准确性和稳健性.MSTAR数据实验说明了该方法的有效性.