作战仿真系统中高性能随机数发生器研究

为满足作战仿真系统对随机数发生器随机性、鲁棒性、周期和效率等的苛刻要求,采用组件技术,开发了素数模乘同余组合发生器。该随机数发生器生成的随机数,其分布类型、参数和独立性经检验满足要求;其周期长达10^18,且不受种子的影响。该随机数发生器采用的算法经过优化后,运算速度提高了近40％。研究成果解决了仿真作战过程随机性的难题,为多样本的并行仿真、仿真结果置信区间的得出奠定了基础,有助于提高仿真系统的可信性。     

基于禁忌退火算法的巡航导弹航迹规划

针对巡航导弹航迹规划这个复杂的优化问题,一个禁忌退火混合优化算法被提出.首先,该算法是以基本模拟退火算法为基础.其次,为了加快该模拟退火算法的收敛速度,在恶化解的接受判断过程中,增加了一定动态的约束条件.最后,为了使最优解能够跳出局部最优的陷阱,使用了一个动态的禁忌表.仿真结果验证了该禁忌退火混合优化算法能够取得目标函数更优的航迹规划路径,从而有效提高巡航导弹的作战效能.     

基于故障树的导航装备故障诊断专家系统研究

针对导航装备比较常见的故障诊断方法,提出了基于故障树的通用故障诊断的概念．为使故障诊断专家系统具有通用性,在分析故障树流程图特点的基础上,提出了逻辑关系的数字编码和故障诊断数据库的思想,设计了对导航装备故障诊断专家系统具有通用性的系统软件及数据库．     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

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

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

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

往返搜索发现概率仿真分析与应用

往返搜索是一种最常见的搜索样式,其搜索效能与搜索宽度、发现距离、搜索速度、突破速度等因素密切相关。在建立往返搜索行动模型的基础上,通过仿真实验得到耕耘数据,进而通过数据分析和处理得到往返搜索发现概率的经验公式。应用经验公式并结合声纳探测模型,对多搜索艇分段封锁搜索案例进行了优化研究。     

基于改进LS-SVM的异步电机转子故障诊断

为了提高异步电动机转子故障的诊断精度,给出了一种基于改进最小二乘支持向量机(LS-SVM)的多故障分类算法。首先运用FFT处理电机的定子电流信号得到信号频谱图,从中提取故障特征向量;然后将特征向量送入改进算法进行故障诊断时,在原有多分类算法的基础上引入层次分析法确定故障类别的权重,根据权重值确定故障的诊断顺序,依次进行故障分类。实验表明,改进算法用于故障诊断节省了诊断时间,提高了诊断精度,具有很好的推广前景。     

基于多Agent无人机协同侦察任务规划模型

建立了多无人机协同侦察任务规划模型,在考虑侦察时间间隔约束和目标载荷需求基础上,给出了位于不同基地的无人机优化部署和调度策略,并提出了基于多Agent的优化搜索仿真算法,利用Matlab实现了无人机优化配置和任务规划模型,得出了无人机优化配置和任务规划方案,最后分析了模型算法存在的某些不足,提出了模型改进的方向。