基于改进蚁群算法的无人机三维航路规划

针对蚁群算法存在收敛速度慢,容易陷入局部最优而导致三维航路规划过程中出现规划时间过长、航路没有达到最优等问题,通过对蚁群算法进行改进,提出了一种天牛须融合改进蚁群的无人机航路规划优化算法,算法通过对蚁群算法的启发函数优化并进行蚁群择优排序,然后融合天牛须算法进行航路规划;将优化算法应用于无人机的三维航路规划中,使规划算法的运行速度更快,无人机的最优航路更短。同时用改进算法与天牛须、蚁群算法的收敛时间、最优路径长度进行对比。仿真实验结果表明,改进算法与另外两种算法相比,在算法收敛度、运行速度方面有明显的提升。     

求解旅行商问题的改进育种算法

介绍了基本育种算法,提出了求解旅行商问题的育种算法,给出了4种变异策略,算法的测试表明,策略D是一种简单有效的算法.在分析基本育种算法特征基础上,提出了改进育种算法,对CTSP问题进行了仿真实验,仿真研究表明,改进后的育种算法具有优良的性能.     

基于离散混沌蝙蝠算法的测试点选择

针对模拟电路测试点的选择问题,基于智能优化算法的测试点选择方法相比于传统的迭代法具有一定的优越性,但是仍然存在算法复杂度过高等问题.在深入研究蝙蝠算法(BA)的基础上,采用混沌映射对算法进行优化,并用变换函数将算法离散化,提出一种离散混沌蝙蝠算法(CBBA),将算法应用于测试点选择.通过实验仿真,证明该算法具有较高的准确度,而且与其他算法对比发现,该算法具有更好的性能.     

低空无人机路径规划算法综述

随着无人机技术的发展,无人机在低空的应用场景越来越多,复杂的低空环境对无人机路径规划算法提出了新的要求。本文总结了近年来常用的无人机路径规划算法,包括图搜索算法,线性规划算法,智能优化算法（遗传算法、粒子群算法、蚁群算法）,强化学习算法;对这些算法的原理、适用场景及其优缺点进行了归纳分析;并基于无人机发展现状对无人机路径规划算法进行了展望。     

飞行轨迹预测的两种变结构IMM算法

针对交互式多模型(IMM)算法的缺陷,把变结构思想运用到此算法中,给出变结构交互式多模型(VSIMM)算法。基于图论知识,提出两种变结构算法:转换图交互式多模型(SGIMM)算法和自适应图交互式模型(AGIMM)算法。通过仿真试验,验证了这2种变结构算法的优越性,同时分析了2种算法的不同点。     

UKF-WNN及其在准定常失速气动力建模中的应用

提出一种利用无轨迹卡尔曼滤波估计小波网络参数的算法,该算法可克服算法存在的收敛速度慢、计算量大、局部极小等缺点。以飞机的准定常失速现象的气动力建模为应用背景,分别运用BP算法,扩展卡尔曼滤波算法和无轨迹卡尔曼滤波算法训练小波网络。仿真结果表明,无轨迹卡尔曼滤波算法较之BP算法和扩展卡尔曼滤波算法具有更快的训练速度和更高的预测精度,可以胜任复杂的非线性气动现象的建模任务。     

基于改进MeanShift算法的视线跟踪技术

介绍了SURF算法和MeanShift算法的基本原理。将MeanShift跟踪算法应用于视觉鼠标技术,提出了基于OpenCV技术的视线系统设计方法;提出了基于SURF算法的自动嘴部区域初始化MeanShift改进算法。实验结果表明,算法匹配识别效果较好,基于MeanShift跟踪算法的嘴唇跟踪系统实时性好、具有较好鲁棒性。     

计划调度算法的组件化体系结构

针对计划调度算法多样性和在信息系统中重用的问题,建立了计划调度算法的组件化体系结构,介绍了计划调度算法组件化体系结构的调度算法数据的初始化和调度算法执行原理,设计开发了调度算法、调度模型、计划调度执行、计划调度维护以及调度引擎组件.     

最小生成树算法及其应用

Kruskal算法和Prim算法是求最小生成树的常用算法,设计了这两种算法的C语言程序,并通过实例研究了这两种算法的实际应用价值。     

基于状态观测器的波束形成算法及其航空应用

随着数字信号处理技术的发展,基于声传感器阵列的经典波束形成算法广泛地应用于航空气动噪声检测领域中.但是,经典算法计算量大,并且它的算法结构决定了其无法用作实时算法.本文给出了一种基于状态观测器理论的新算法,介绍了观测器算法的理论背景、算法稳定性的证明、麦克风阵列的设计准则以及基于阵列进行的仿真结果.这种新算法在形式上类...     

多学科设计优化算法及其在飞行器设计中应用

多学科设计优化(MDO)算法是复杂系统设计优化的策略。对现有的各种MDO算法及其在飞机设计中应用状况进行分析、归纳和评述。内容包括:MDO问题的表述及其有关术语;MDO算法的任务;现有的MDO算法及其应用。     

New track correlation algorithms in a multisensor data fusion system

In order to resolve the problem of track-to-track association in a distributed multisensor situation, this paper presents independent and dependent sequential track correlation algorithms based on Singer's and Bar-Shalom's algorithms. Based on sequential track correlation algorithm, the restricted and attenuation memory track correlation algorithms and sequential classic assignment rules are proposed. In this paper, these algorithms are described in detail. Then, the track correlation mass and multivalency processing methods are discussed as well. Finally, simulations are designed to compare the correlation performance of these algorithms with that of Singer's and Bar-Shalom's algorithms. The simulation results show that the performance of these algorithms proposed here is much better than that of the classical methods under the environments of dense targets, interfering, noise, track cross, and so on. Under the above situations, their correct correlation ratio is improved about 69 percent over the classical methods     

M-ary sequential hypothesis tests for automatic targetrecognition

Several forms of sequential hypothesis testing algorithms are described and their performance as classification algorithms for automatic target recognition is evaluated and compared. Several forms of parameteric algorithms, as well as a sequential form of a useful nonparametric algorithm are considered. The primary focus is the design of algorithms for automatic target recognition that produce maximally reliable decisions while requiring, on the average, a minimum number of backscatter measurements. The tradeoffs between the average number of required measurements and the error performance of the resulting algorithms are compared by means of Monte-Carlo simulation studies     

由后验概率密度递推导出的地形轮廓匹配定位算法

 飞行器一边飞行,一边不断测出下方地面的海拔高度或飞行器与地面间的高程差,和已知的基准地形图比较,从而确定飞行器的位置,这就是地形轮廓匹配定位问题。本文给出了根据测高数据进行后验概率密度递推的基本公式,由此简化得到的几个具体算法,经计算机在实际地形图上仿真表明,具有递推执行,截获概率和定位精度较高,可用于任意飞行航迹和不等间隔测高,可对付较严重的随机扰动、航速误差和航向偏差等特点。     

多变量系统参数辨识的相关分析法

 <正> 近20年来,线性系统的辨识和参数估计的研究工作得到了迅速发展。系统辨识的方法主要有:最小二乘法、广义最小二乘法、推广最小二乘法、多级最小二乘法、辅助变量法、随机逼近法、极大似然法以及相关分析法等。在这些方法中,相关分析法是一种公认最有效的算法。1974年,Iserman、Saridis和Sinha等人通过若干数值算例证实     

基于酉变换的约束优化均衡算法

基于李道本等人提出的代价函数，在特定的约束条件下，利用酉变换方法，提出了两个约束化均衡算法。这两种均衡算法是传统的直接梯度算法和共轭梯度算法的改进方法。这两种约束算法是在Householder变换下或GiVen平面旋转变换下获得的，它们完全不同于前人的各种线性约来自适应算法，这两种算法的计算复杂度是可以接受的。计算机仿真结果验证了这两种变换域算法的性能。     

ERP 系统中 BOM 的模型分析与算法实现

BOM 是 ERP 的核心模块,其数据结构与算法直接影响到了系统使用效率,本文通过对 BOM 标模型的分析,提出了递归展 BOM 和双向链表展 BOM 两种算法的具体实现     

Outlier resistant adaptive matched filtering

Robust adaptive matched filtering (AMF) whereby outlier data vectors are censored from the covariance matrix estimate is considered in a maximum likelihood estimation (MLE) setting. It is known that outlier data vectors whose steering vector is highly correlated with the desired steering vector, can significantly degrade the performance of AMF algorithms such as sample matrix inversion (SMI) or fast maximum likelihood (FML). Four new algorithms that censor outliers are presented which are derived via approximation to the MLE solution. Two algorithms each are related to using the SMI or the FML to estimate the unknown underlying covariance matrix. Results are presented using computer simulations which demonstrate the relative effectiveness of the four algorithms versus each other and also versus the SMI and FML algorithms in the presence of outliers and no outliers. It is shown that one of the censoring algorithms, called the reiterative censored fast maximum likelihood (CFML) technique is significantly superior to the other three censoring methods in stressful outlier scenarios.     

Position Location: Triangulation Versus Circulation

Position location algorithms, using data from electronic surveillance systems have, for the most part, been based upon statistical analysis of the points of intersection of the lines of bearing. These triangulation ion algorithms may well minimize the effect of random measurement errors on the location estimate, but few existing algorithms account for systematic (bias) errors. An algorithm based upon intersecting circles which eliminates certain types of systematic error is presented with simulation data utilized to compare the position location estimates obtained from both triangulation and circulation algorithms.