基于作战仿真的指令分析研究

分析研究的主要内容是基于作战仿真的各种指挥指令,比较了实际军用文书与仿真指令之间存在的异同,分析了作战仿真系统中指令的类型以及内容结构,列举典型真实军事命令语言,进行便于仿真系统使用的格式化,重点论述实际军事命令等文书在作战仿真系统中如何被准确、高效地识别与运用,提出了两个适用于作战仿真系统的指令格式——基本指令格式和拓展指令格式,并归纳出指令格式的回字架构,为仿真指令在仿真系统中的应用提供支撑。     

一种应用于移动机器人的路径跟踪控制方法

针对移动机器人的路径跟踪复杂性问题,设计了一种易于实现的控制系统,其中的跟踪策略改进了传统的视线导航算法,使机器人光滑趋近到期望路径,控制器的设计采用基于模糊逻辑的变速度控制和角速度滑模控制,减小了角速度的抖振,并使控制具有一定的智能化特点.实验结果表明,设计的控制系统即可以保证路径跟踪的精度,同时避免了运动控制的不稳定性.     

基于面积比矩阵的加权特征向量点匹配算法

提出一种在仿射变换下点集关系描述算子--面积比矩阵,证明了其在仿射变换群下的不变性质;并由该性质推导得出特征向量(EA)匹配算法抗噪性能差的原因,在此基础上给出了基于面积比矩阵的加权特征向量算法.算法构造不同图像的面积比矩阵,对矩阵进行分解得到其特征值和特征向量,通过特征值进行加权获得图像中点的特征向量,比较图像点的特征向量获取匹配关系.因面积比矩阵的仿射不变性质,算法能实现仿射变换下点集精确匹配;采用的加权特征向量法改进了EA匹配法,具有更好的抗噪性能.实验表明算法切实可行.     

过渡流区圆柱体驻点热流的工程计算

以流动分区的界限为Knudsen数的变化区间,使用线性插值和调节参数进行校正的方法,提出一种计算过渡流区热流的桥函数形式,并且确定了端面迎风的圆柱体的调节参数.使用DSMC方法对计算结果进行验证并与其他形式的桥函数进行比较.结果表明该桥函数在马赫数大于10的情况下,能比较准确地计算驻点热流的值,可以为飞行器初步设计提供一定的参考依据.     

一阶非线性脉冲边值问题解的存在性

研究一阶非线性脉冲周期边值问题，应用微分不等式和Schaefer不动点定理，得到了脉冲边值问题解存在的充分性判据，并给出了相应的Green函数。     

存在工作历程产品的加速寿命试验统计分析

加速寿命试验(ALT)可在较短时间内获得产品的寿命及可靠性信息.利用ALT对产品的剩余寿命进行评估时,常常将已工作过的产品进行抽样并投入试验,在这一类样本的ALT数据统计分析时如何处理初始工作时间,成为ALT应用中的一个重要问题.工程实际中评估此类样本的剩余寿命时常常忽略初始工作时间,将其视为"用后如新"或"无记忆性"产品.但此假设必须以产品寿命服从指数分布为前提,而大部分机电产品的寿命服从Weibull分布,因而该方法在应用时必然会产生较大误差.针对这一问题提出了一种新的基于时间折算的ALT数据统计分析方法,并利用Monte Carlo仿真对其估计特性进行对比研究,结果表明此方法能有效评估存在初始工作历程产品的剩余寿命,估计精度优于原方法.     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

电子时间引信检测仿真试验研究

为提高电子时间引信的检测能力，介绍了电子时间引信检测仿真试验，分析了仿真试验的原理，给出了检测仿真试验的试验方法。经实际检测表明，该检测仿真试验能够安全可靠地完成电子时间引信的日常检测任务。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010