基于平方根UKF的多传感器融合跟踪

为了提高融合算法的精度,将UKF(Unscented Kalman Filter)算法与多传感器顺序滤波融合跟踪算法相结合,提出了基于UKF的多传感器序贯融合算法.UKF算法利用非线性方程自身的传播,估计系统状态,避免了对非线性方程线性化的过程.顺序滤波融合算法用同一时刻的量测依次更新状态,计算复杂性低.仿真结果表明,UKF顺序滤波融合跟踪算法比传统的扩展卡尔曼滤波(EKF)算法有更高的跟踪性能,是一种有效的非线性融合算法.     

基于二维几何特征的微地形快速识别算法

为满足水下超声波准确、实时探测海底微地形的需要,研制出一种摆动式单波束探测系统.该系统在探测实验过程中,因出现高程奇异值而造成数字"伪"地形产生,由此提出一种基于二维几何特征的水平、斜坡和凹凸不平三种微地形模式的快速识别算法.该算法建立在现代统计分析与模糊聚类的理论基础上,具有准确性高、实时性好以及抗干扰能力强等优点;并由物理模拟实验证明,利用该算法能有效消除高程奇异值的影响,识别出来的微地形模式准确可靠,为下一步快速重构逼真的数字微地形提供了保障,能够应用于真实的海底微地形探测.     

基于解析振速的ESPRIT算法

基于声矢量传感器在二维平面波入射时的输出信息,提出了其"解析振速"的输出模型,将目标的方位信息蕴含在输出信号的相位之中,并由此得到了矢量阵的输出模型.当ESPRIT算法应用于矢量阵时,由于矢量阵的内禀属性,旋转矩阵不再与阵型和信号的频率有关,只与目标方位信息有关,从而能够实现任意阵型全空间的无模糊测向.理论分析和仿真表明:本算法无需先验已知阵型;单声矢量传感器也可以应用ESPRIT算法,且此时其性能逼近克拉美-罗界.湖试表明本算法是有效的.     

集装箱倒箱问题的启发式算法研究

为降低集装箱堆场的倒箱率,对翻倒箱落箱位置的确定问题进行了研究,提出了一种启发式算法H及其改进算法IH。利用仿真实验将所提出的两种启发式算法与最优解及已有启发式算法OH进行了比较,结果表明,提出的两种启发式算法在解的效果和稳定性上均明显优于算法OH,其中改进算法IH相对算法H又有进一步的提高。     

An improved branch-and-bound algorithm to minimize the weighted flowtime on identical parallel machines with family setup times

This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times, the problem is known to be strongly NP-hard. We propose a constructive heuristic algorithm and three complementary lower bounds. Two of these bounds proceed by elimination of setup times or by distributing each of them to jobs of the corresponding family, while the third one is based on a lagrangian relaxation. The bounds and the heuristic are incorporated into a branch-and-bound algorithm. Experimental results obtained outperform those of the methods presented in previous works, in term of size of solved problems.     

Krylov subspace method based on data preprocessing technology

The performance of adaptive beamforming techniques is limited by the nonhomogeneous clutter scenario. An augmented Krylov subspace method is proposed, which utilizes only a single snapshot of the data for adaptive processing. The novel algorithm puts together a data preprocessor and adaptive Krylov subspace algorithm, where the data preprocessor suppresses discrete interference and the adaptive Krylov subspace algorithm suppresses homogeneous clutter. The novel method uses a single snapshot of the data received by the array antenna to generate a cancellation matrix that does not contain the signal of interest （SOI） component, thus, it mitigates the problem of highly nonstationary clutter environment and it helps to operate in real-time. The benefit of not requiring the training data comes at the cost of a reduced degree of freedom （DOF） of the system. Simulation illustrates the effectiveness in clutter suppression and adaptive beamforming. The numeric results show good agreement with the proposed theorem.     

Simulated annealing algorithm for the optimal translation sequence of the jth agent in rough communication

In rough communication, because each agent has a different language and cannot provide precise communication to each other, the concept translated among multi-agents will loss some information and this results in a less or rougher concept. With different translation sequences, the problem of information loss is varied. To get the translation sequence, in which the jth agent taking part in rough communication gets maximum information, a simulated annealing algorithm is used. Analysis and simulation of this algorithm demonstrate its effectiveness.     

储层含油性识别中ANN和GA融合的模糊规则提取

提出一种基于ANN和GA融合的自学习自适应的模糊规则提取算法,用来对油层进行识别.其方法是:首先运用人工神经网络(ANN)对训练样本进行有导师学习,网络的输入是测井属性,输出表达为网络权值和输入的函数Ψk=f(xi(WG1)ij,(WG2)jk)(其中:Ψk代表含油性类别Ck的判别函数;C1为干层;C2为水层;C3为差油层;C4为油层).然后,以Ψk作为遗传算法(GA)中的适应度函数提取对应于类别Ck的模糊规则.最后,通过某油田oilsk81和oilsk83油井的实证研究表明,该方法能够有效地识别储层的含油性.     

Algorithms for degree-constrained Euclidean Steiner minimal tree

A new problem of degree-constrained Euclidean Steiner minimal tree is discussed, which is quite useful in several fields. Although it is slightly different from the traditional degree-constrained minimal spanning tree, it is also NP-hard. Two intelligent algorithms are proposed in an attempt to solve this difficult problem. Series of numerical examples are tested, which demonstrate that the algorithms also work well in practice.     

基于两次Kalman滤波的观测噪声自适应调整算法

在实际的目标跟踪过程中,由于目标远近等各种客观因素的影响,观测噪声是随时变化的.但是在标准卡尔曼滤波中,如果将观测噪声协方差设为恒定值,必然造成跟踪结果不理想.针对这种情况,通过在任意时刻施行两次卡尔曼滤波的结果来自适应地调整观测噪声协方差,使卡尔曼滤波算法中的观测噪声协方差与实际值更加接近,从而提高对目标的跟踪精度.最后Monte Carlo仿真实验证明了本算法的有效性.