小波神经网络UCAV飞行控制系统

针对采用H∞控制设计方法需求解难度很大的偏微分方程,而导致工程实现难度大的问题,提出了采用小波神经网络进行无人攻击机(UCAV)飞行控制系统设计的方法,该方法集小波变换和神经网络的优点于一身,简化了网络训练,避免了系统达到局部最优解,使得系统具有更好的逼近精度。通过仿真实验表明,利用小波神经网络进行UCAV控制律设计,使系统具有较好的跟踪性和鲁棒性,避免了精确模型的建立,便于分析系统的稳定性。     

船舶静态电场跟踪的渐进更新扩展卡尔曼滤波器

为了实现利用船舶静态电场对船舶进行跟踪的目的,针对传统卡尔曼滤波算法中存在的问题,设计一种新的非线性滤波器。建立船舶的状态空间模型,分析传统卡尔曼滤波算法在船舶跟踪中存在的问题;依据渐进贝叶斯思想,利用连续白噪声与离散白噪声序列噪声协方差之间的关系,设计一种新的渐进更新扩展卡尔曼滤波器。仿真结果表明,该滤波器能有效地抑制由于初始误差较大而造成的滤波性能下降和滤波发散,能够有效地跟踪船舶,具有较高的实用价值。     

Optimal switchover times between two activities utilizing the same resource

The “gold‐mining” decision problem is concerned with the efficient utilization of a delicate mining equipment working in a number of different mines. Richard Bellman was the first to consider this type of a problem. The solution found by Bellman for the finite‐horizon, continuous‐time version of the problem with two mines is not overly realistic since he assumed that fractional parts of the same mining equipment could be used in different mines and this fraction could change instantaneously. In this paper, we provide some extensions to this model in order to produce more operational and realistic solutions. Our first model is concerned with developing an operational policy where the equipment may be switched from one mine to the other at most once during a finite horizon. In the next extension we incorporate a cost component in the objective function and assume that the horizon length is not fixed but it is the second decision variable. Structural properties of the optimal solutions are obtained using nonlinear programming. Each model and its solution is illustrated with a numerical example. The models developed here may have potential applications in other areas including production of items requiring the same machine or choosing a sequence of activities requiring the same resource. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 186–203, 2002; DOI 10.1002/nav.10008     

一种基于多层次网格的高效相关过滤方法

在分布式仿真系统中 ,网上流动的大量冗余数据严重影响了系统的可伸缩性。基于均匀网格的相关过滤法减少了冗余数据 ,但具有匹配不精确 ,格子尺寸单一 ,难以适应所有实体的缺点。提出了一种基于多层次网格的相关过滤方法 ,克服了均匀网格法的上述缺点 ,并继承了均匀网格法处理速度快的特点 ,具有快速灵活的特点     

基于单GPS观测的SINS姿态校正方法

针对车(船)载惯性和GPS组合导航系统(INS/GPS),研究单天线GPS对INS的姿态校正方法。提出一种基于单天线GPS进行捷联惯导(SINS)机动中对准和姿态校正方法,该方法以GPS两个不同时刻的不共线速度向量为参考向量,利用TRIAD算法进行姿态确定,并设计了Kalman滤波器估计姿态四元数。仿真试验表明该方案能较好地校正惯导系统的初始对准误差,并通过实时校正保持长期的姿态精度。     

混沌理论在雷达中的应用

混沌动力学作为一门新学科已经引起了世界各国科学界的重视,是近年来非线性科学领域的热门学科,混沌系统初值的敏感性和两个混沌系统间同步的实现,使得混沌用于保密通信成为可能,海杂波的混沌特性使人们开始探索混沌在雷达中的应用.研究表明,混沌在杂波分析与建模、信号检测、目标识别及伪随机码波形设计等领域内取得了可喜的成果.研究了混沌在雷达中的应用,分析了目前混沌在雷达中的应用现状,预测了未来研究发展的趋势.     

一类非线性控制系统模型的数学分析

采用非线性分析的方法,研究了一类非线性控制系统模型,得到解的整体存在性。     

目标定位和跟踪的卡尔曼滤波加 BP 神经网络的方法

首先分析了卡尔曼滤波应用于单目标定位与跟踪时需要校正的因素,接着用具有反向传播（ＢＰ）学习算法的前向网络,建立校正原理和校正网络体系结构,最后分别给出了它对第１类和第２类火控系统应用的数学模型。     

卡尔曼滤波在坦克目标状态估计中的应用

分析了现有机动目标数学模型及其卡尔曼滤波算法,并用数字信号处理器(DSP)对一个实际算法进行了实验.实验结果表明目标机动性能的提高将使坦克火控系统由于采用现行目标运动模型而产生较大的误差,因此,在火控系统中采用其他模型,如自适应模型等,势在必行.同时,对于跟踪精度高、实时计算量大的卡尔曼滤波算法,应用DSP技术实现具有良好的发展前景.     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000