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

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

谈算法研究

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

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

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

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     

油料装备中发动机与油泵的匹配设计探讨

油料装备中发动机与油泵的合理匹配是设计中需解决的一个重要问题。介绍 了油料装备发动机与油泵的匹配原则,分析了油泵和发动机工作时所需的动力,发现发动机 在驱动油泵时具有一定的功率储备,尤其是共用发动机具有较大的功率储备,提出利用发动 机万有特性曲线进行匹配设计。     

基于改进SLP的军事物流基地设施平面布局研究

由于传统SLP方法的不足,在解决设施较多的军事物流基地布局问题上面临较大困难。为解决此问题,提出了改进SLP方法,以军事物流基地设施间综合相互关系为基础,构建平面布局模型,并确定目标函数和主要约束条件。随后对模型的求解进行遗传算法设计,并运用Matlab编程实现模型的求解,从而得出平面布局的最优解。最后以最优解为基础,结合限制条件进行修正,完成军事物流基地设施平面布局设计。     

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     

基于熵的地磁匹配定位算法

地磁匹配定位是近年来发展起来的新技术,针对地磁匹配定位中的匹配算法问题,引入了熵的概念,定义了地磁信息熵和地磁差异熵,提出了地磁信息熵和地磁差异熵综合的匹配算法,详细分析了其基本原理和实现过程。仿真实验表明,地磁熵算法的匹配误差并不随实时数据测量误差的增加而增加,该算法计算速度快、具有良好的抗测量误差干扰的能力,符合匹配精度和速度的要求。     

粒子群算法的弹道参数辨识方法

提出一种基于粒子群算法的航空武器气动参数辨识算法,该算法采用粒子群算法计算航空武器气动参数分段函数的分段边界点马赫数值,在此基础上采用实数编码遗传算法计算分段函数的多项式系数.采用该算法进行某型炸弹阻力系数辨识计算,计算结果表明:该算法可行,且计算的阻力系数精度高.计算结果已成功应用于某型航电火控系统的设计中.     

非线性最小二乘算法在双基地雷达目标定位中的应用

双基地雷达的目标定位解是一个非线性优化问题,引入了高斯-牛顿迭代法解非线性最小二乘方程组,为了提高迭代的收敛性和目标位置解的准确性,采用精度最高的一组测量子集单元解算出的定位解作为迭代初始值,并充分利用了所有的观测信息.仿真结果表明,采用该种算法迭代次数少,比简化加权最小二乘算法(SWLS)有更准确的目标定位解,从而使得整个受控区域内的定位精度有较大提高,定位性能得到优化和改善.