射频识别系统的多目标识别-反碰撞算法

对多目标识别技术的二进制搜索算法、时隙ALOHA算法进行了剖析,并对ALOHA算法用概率论和数理统计的方法进行了深入的理论分析,得出要根据所设计的射频识别系统的特点合理采用各种算法方可得到良好的效果.该算法的实现对提高高速公路上自动收费系统、人员和物流管理等各领域的工作效率具有一定的指导意义.     

实时仿真计算机系统的若干问题

本文比较了实时仿真计算机系统中配备A/D、D/A变换器的两种方案。分析了几种检索算法,并且提出了一种新的全并行检索方法——映象检索。文中论述了仿真计算任务的特点及其并行性的开发。本文在分析了AD-10的缺点之后指出,纯异构型仿真专用多处理机的局限性较大,不能充分开发仿真计算任务的并行性。较好的结构形式应是以同构型多处理机为核心。     

Exponential size neighborhoods for makespan minimization scheduling

We investigate the quality of local search heuristics for the scheduling problem of minimizing the makespan on identical parallel machines. We study exponential size neighborhoods (whose size grows exponentially with the input length) that can be searched in polynomial time, and we derive worst‐case approximation guarantees for the local optima of such neighborhoods. The so‐called split neighborhood splits a feasible schedule into two layers, and then recombines the two layers by finding a perfect matching. We show that the makespan of every local optimum for split is at most a factor of 2 away from the globally optimal makespan. We then combine the split neighborhood with two neighborhoods from the literature. The combination of split with the jump neighborhood only marginally improves the approximation guarantee, whereas the combination with the lexicographic‐jump neighborhood decreases the approximation guarantee from 2 to 3/2. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles

Given a number of patrollers that are required to detect an intruder in a channel, the channel patrol problem consists of determining the periodic trajectories that the patrollers must trace out so as to maximized the probability of detection of the intruder. We formulate this problem as an optimal control problem. We assume that the patrollers' sensors are imperfect and that their motions are subject to turn‐rate constraints, and that the intruder travels straight down a channel with constant speed. Using discretization of time and space, we approximate the optimal control problem with a large‐scale nonlinear programming problem which we solve to obtain an approximately stationary solution and a corresponding optimized trajectory for each patroller. In numerical tests for one, two, and three underwater patrollers, an underwater intruder, different trajectory constraints, several intruder speeds and other specific parameter choices, we obtain new insight—not easily obtained using simply geometric calculations—into efficient patrol trajectory design under certain conditions for multiple patrollers in a narrow channel where interaction between the patrollers is unavoidable due to their limited turn rate.© 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

决策树知识表示的多故障源搜索算法研究

在深入研究产生式规则知识表示的基础上,运用决策树知识表示方法,完成故障诊断专家系统的知识库设计,对传统的单故障源决策树搜索算法进行了改进,解决了相同故障现象的多故障源连续搜索和定位问题,提高了推理机单次故障诊断的定位率和搜索效率,缩短了故障诊断专家系统的诊断时间。     

自适应两步滤波算法在机载IRSTS被动定位中的应用

在机载红外搜索跟踪系统被动定位研究中,针对扩展卡尔曼滤波算法要求先验的噪声统计及存在系统观测模型线性化误差影响滤波精度的特点,利用两步滤波算法并结合Sage-Husa噪声估计器构建了适用于机载IRSTS被动定位特点的自适应两步滤波算法模型,算法不仅实时在线地估计了观测噪声的统计特性,而且避免了观测模型线性化误差.仿真结果表明,在完全相同的初始条件下,自适应两步滤波算法对目标运动参数的估计结果明显优于扩展卡尔曼滤波,从而提高了机载IRSTS被动定位的精度.     

函数生成器的优化设计

本文介绍了一种优化的多变量函数产生器的设计思想,详尽论述了多变量函数快速插值算法、消除冗余断点搜索的思想以及搜索次数为１的断点搜索策略。实用表明,该产生器高效可行,比一般的多变量函数产生器减少计算量一半左右,有效地缩短了仿真问题的求解时间。     

直升机吊放声纳搜索方法效能研究

利用直升机吊放声纳对潜艇目标进行搜索,是航空反潜作战的重要环节.引入蒙特卡罗法对吊放声纳搜潜方法进行效能评估,以概率和统计理论方法得出其搜索概率作为评定吊放声纳搜潜方法效能的指标.对三种吊放声纳搜潜方法进行了效能仿真.通过计算机模拟对三种方法对潜艇目标的搜索概率进行比较,结果表明采用蒙特卡罗法对吊放声纳搜潜方法进行效能评估是可行有效的.     

一种基于目标的雷达对抗侦察策略

传统的电子战接收系统的搜索方式主要针对参数完全未知的敌方信号,通过在频域、空域等各维度进行大范围的逐段重复搜索可在较长时间内获得较好的侦察效果,但不适合短时间内对特定目标群的搜索和验证。针对电子战接收机存在的盲目侦察接收、与作战目标结合不紧密等问题,提出了一种基于作战目标的侦察策略,能够智能引导超外差接收机进行搜索截获,有效提升了超外差接收机对重点目标的实时截获与准确识别能力。     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010