基于舰船磁场模型的离线磁定位研究

目前,海上舰船磁场测量试验获得的数据一般为时间通过曲线,不能直接用于舰船磁场建模。为了解决上述问题,利用遗传算法良好的全局搜索能力,在目标舰船运动参数未知、磁探头存在姿态角的情况下,实现了一种基于单旋转椭球体磁场模型的离线磁定位算法.计算结果表明,该方法效果良好。     

一种稳健的自适应IIR陷波器复数级联算法

针对背景噪声中多个复正弦信号的提取问题,提出利用二阶陷波器复数算法的级联来实现,并给出了一种自适应级联算法.基于对软件复杂度和计算量的考虑,在这种算法的基础上又给出一种改进的二阶自适应陷波器级联的复数算法,大大降低了系统复杂度和计算量.仿真实验表明,两种陷波器级联算法均能很好地提取背景噪声中的复正弦信号,并准确估计复正弦信号的频率.     

电液伺服系统的模糊神经网络自适应控制

针对电液伺服控制系统中存在的非线性影响,常规PID控制难以取得良好的控制效果,采用模糊神经网络自适应控制,通过BP算法改变模糊隶属函数的形状及模糊规则的中心值,实验结果表明该方法能有效地跟踪电液位置伺服系统。     

谈算法研究

算法是计算机程序设计的核心。本文结合实际应用,通过研究算法所取得的成效,说明算法研究的必要性和重要作用。     

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     

Two‐stage component test plans for testing the reliability of a series system

A system reliability is often evaluated by individual tests of components that constitute the system. These component test plans have advantages over complete system based tests in terms of time and cost. In this paper, we consider the series system with n components, where the lifetime of the i‐th component follows exponential distribution with parameter λ_i. Assuming test costs for the components are different, we develop an efficient algorithm to design a two‐stage component test plan that satisfies the usual probability requirements on the system reliability and in addition minimizes the maximum expected cost. For the case of prior information in the form of upper bounds on λ_i's, we use the genetic algorithm to solve the associated optimization problems which are otherwise difficult to solve using mathematical programming techniques. The two‐stage component test plans are cost effective compared to single‐stage plans developed by Rajgopal and Mazumdar. We demonstrate through several numerical examples that our approach has the potential to reduce the overall testing costs significantly. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 95–116, 2002; DOI 10.1002/nav.1051     

IIR系统的自适应横向滤波辨识

用自适应线性组合器匹配IIR型离散系统,通过拟合系统传递函数来辨识系统参数;比较了该法与自适应递归算法的动态性能,数值仿真结果证明该法的有效性.     

协同反潜指控决策建模及优化研究

介绍了多目标优化模型.建立了协同反潜作战中目标威胁度和射击有利度模型,将遗传算法引入到指控决策优化过程中.设计了基于遗传算法的指控决策优化算法,并对算法作了适应度值乘幂变换和保存最优个体策略方面的改进.以编队协同防御为例,得到了未改进的遗传算法和改进的遗传算法的优化结果,并对两种方法的优化效果进行了比较,比较结果表明:无论是从算法的收敛速度还是寻优率方面,做过改进的算法都较未改进的算法优越.通过选择不同的初始种群进行多次试验的方法,验证了优化结果的正确性.     

基于候选轨迹统计模型的红外弱小点目标检测(英文)

建立候选目标轨迹集合,以候选目标轨迹集合为样本空间,利用沿候选轨迹的能量积分构造此空间上的概率分布,从而建立候选轨迹的概率统计模型.以此模型为基础,设计了一种弱小点目标检测方法.通过蒙特卡罗实验方法调节模型参数,使得算法的检测性能达到所提出的指标.该算法规避了以往算法中需要获得解析形式的候选轨迹密度函数的限制,因此能检测出沿任意方向作直线运动的点目标.最后,针对给定的弱小点目标观测图像序列,利用所提出的算法进行检测,仿真结果证明此算法是有效的.     

固定目标区域的空中干扰机最优干扰覆盖分布算法

GPS干扰机升空可以增大干扰覆盖面积使干扰效果显著,GPS空中干扰机的合理分布可以有效地实现对目标区域的干扰覆盖.通过分析空中干扰机所能达到的干扰覆盖能力,进而运用遗传算法在解决多目标组合优化问题上的灵活性,提出了基于固定目标区域的空中干扰机最优干扰覆盖分布算法.仿真结果表明该算法能够快速有效地得到最优干扰覆盖分布方案.