移动卫星天线指向矢量辅助组合导航系统方法

为弥补SINS/GPS组合导航系统姿态角误差可观测性差的缺陷,根据移动载体卫星天线捕获通信卫星后通过自搜索实现精确对准卫星的原理,提出增加天线指向矢量信息(SAPV)的方位角和俯仰角信息为系统观测量,用于辅助SINS/GPS组合导航系统.根据SINS/GPS组合导航系统数学模型对姿态角误差的可观测性进行了分析,并对SAPV与组合导航误差之间的关系进行了详细数学推导,证明了SAPV辅助组合导航系统的可行性,建立了SAPV辅助组合导航系统的数学模型,采用联邦滤波器进行数据融合.仿真结果表明,SINS/GPS组合导航系统通过SAPV辅助,方位角误差估计精度提高了1个数量级,小于10′,水平姿态角误差估计精度略有提高,小于2 ′.该方法充分利用了天线通过自搜索完成精确对准卫星后的高精度指向信息,无须添加任何硬件系统,通过简单可靠的信息融合算法即可达到提高载体姿态测量精度的目的.     

基于MEMS-IMU辅助的高动态GPS选星方法设计

一般的GPS选星方法通过搜索选取使几何精度衰减因子最小的4颗卫星,对于高动态应用特别是在水平姿态角较大的情况下,传统的选星方法存在许多局限性。针对低成本的MEMS-IMU/GPS组合导航系统,提出了基于MEMS-IMU辅助的GPS选星方法;针对高动态载体姿态变化较大的问题,采用MEMS-IMU输出的高速率姿态信息压缩卫星搜索范围,通过选取不超过6颗可见卫星来降低几何精度衰减因子,从而提高定位性能。使用半实物仿真数据,验证了所提出的方法。测试结果表明,与传统的选星方法相比,基于MEMS-IMU辅助的GPS选星方法在飞机高动态大机动条件下,优化了卫星星座,具有精度高、计算量低、可靠性高等优点。     

简化超球体SRUKF的GPS/MIMU组合姿态估计

针对加速度计、磁强计易受机动加速度和周围环境影响的问题,提出了一种单基线GPS/MIMU组合姿态估计方法。该方法利用单基线GPS天线代替磁强计提供航向信息,并利用GPS的速度信息对加速度计输出的机动加速度分量进行补偿,构成单基线GPS/MIMU组合姿态确定单元。同时考虑实时性要求,在SRUKF的基础上,引入加性非扩展形式和超球体单形采样,提出了简化超球体平方根UKF算法,通过减少状态维数和采样点的数量,降低算法计算量。建立加性噪声下的单基线GPS/MIMU姿态模型,并采用简化超球体平方根UKF算法进行姿态估计。实验结果表明,单基线GPS的速度信息可以有效提高加速度计对水平倾角的确定精度,姿态估计算法收敛后的最大误差小于0.8°,估计精度与UKF相当,且执行时间仅是UKF的42%。     

一种融合互补滤波和卡尔曼滤波高精度姿态测量算法

针对在4级海况下船体大幅度晃动,甚至丢失GPS信号的复杂环境,常规算法会导致姿态测量精度急剧下降的情形,为‘动中通’中的航姿系统设计了一套姿态融合算法。在GPS有效时,卡尔曼滤波的观测量引入双天线GPS输出的航向角,解决航向角观测性弱和估计不准的问题,同时引入互补滤波得到的陀螺修正量,提高了水平姿态角的可观性,融合两种算法提高了解算精度。在GPS无效时,通过互补滤波,抑制陀螺漂移,输出高精度水平姿态角,配合天线所接收信号的强度使‘动中通’正常工作。为验证算法的有效性,进行了动态实验,实验结果表明:该算法在GPS有效的情况下能保证俯仰滚动角(RMSE标准)精度在0.2°以内,航向角精度在0.5°以内,在GPS无效情况下也可使俯仰和滚动角精度长时间维持在0.3°以内,具有一定的工程应用价值。     

基于遗传退火混合算法的弹性地基上框架结构参数识别研究

对传统的简单遗传算法(GA)进行了改进,融合模拟退火技术(SA)的思想,建立了遗传模拟退火算法(GASA)的串行结构.GA采用群体并行搜索,通过概率意义下基于"优胜劣汰"思想的群体遗传操作来实现优化.SA采用串行优化结构,赋予搜索过程一种时变最终趋于零的概率突跳性,避免局部极小并最终趋于全局最优.两者的结合提高了遗传算法的全局搜索能力.本文对一实验室中弹性地基上框架结构进行了逐层模态实验研究,得到了四种工况下的模态频率和振型.首先对利用GASA算法对退火参数进行了优选,SA部分中的退温参数g和扰动幅度参数η对搜索效率及全局搜索能力具有重要的影响;然后对四种工况下混凝土的弹性模量和地基的动剪模量进行了识别,并与灵敏方法识别结果进行了对比,得到了结构物理参数随着结构浇注层数的增加而上升的规律,识别得到的弹性模量比回弹法结果偏大,与结构的静模量和动模量的区别有关.以上方法及其应用对于结构的健康监控具有现实的意义.     

基于INS/GPS/CNS组合系统的高精度测姿方法

为改善INS/CNS/GPS组合导航系统输出姿态信息的稳定性,解决传统FKF算法非线性条件下姿态精度发散的问题,提出了一种基于UKF的FKF滤波算法;同时为解决各系统间时间信息不同步造成姿态精度下降的问题,提出了一种工程上可用的时间同步方案,同步精度优于0.5 ms。在实验室条件下,利用INS/GPS/CNS样机和高精度三轴转台搭建验证系统进行摇摆试验,试验结果表明,提出的方法可实现姿态误差值变化在5%以内条件下系统稳定工作一天以上。     

变基线约束的GNSS单频单历元姿态测量新算法

针对基于值域的GNSS姿态测量算法没有考虑工程应用中基线小动态变化的问题,推导了模糊度反约束值域搜索算法的搜索误差模型,研究了该误差模型对算法成功率的影响,分析了利用基线残差最小固定模糊度在工程应用中的不可靠性,提出了变基线约束的单频单历元姿态测量新算法:以基线长度小动态变化为约束,以惯性导航设备(INS)提供的粗略方位角、俯仰角为辅助,通过对基线长度、俯仰角、方位角三维搜索确定模糊度搜索域,以基于模糊度残余最小的无参化目标函数固定模糊度。试验结果表明,新算法能够在基线动态变化±10 cm、方位角偏差±5°、俯仰角偏差±5°情况下,实现模糊度的单频单历元固定和载体高精度姿态测量,并具有较高的成功率。     

基于射频前端的GPS软件接收机设计与验证

介绍了基于硬件射频前端的GPS软件接收机设计与验证。针对GPS串行的搜索算法速度慢的缺点，采用了高速的并行码相位搜索算法；设计和实现了码跟踪环和载波跟踪环，并用载波环路来辅助码跟踪环路；综合考虑接收机的动态性和噪声影响，采用最优化设计思想，设计了GPS软件接收机最优环路带宽。采用GPS中频信号采样器采集实际GPS数据，对搜索和跟踪算法进行了验证。测试结果证明所设计的搜索和跟踪方法是有效的，使得用户在微弱信号处理、多路径处理和发展新的算法等方面具有更大的灵活性，为实际的高性能硬件GPS接收机设计提供的重要的基础。     

机载SAR用的GPS/SINS组合导航系统研究

提出了进行SINS姿态校正的四元补偿算法。采用闭环KF（卡尔曼滤波）技术实时校正惯性仪表误差，补偿四元数误差，修正位置，速度误差，GPS／SINS组合导航系统样机的试验结果表明：采用该提出的算法后，组合导航精度较高，在组合导航过程中若去掉GPS信息，短时间内纯SINS的导航精度很高，能够满足SAR对运动补偿精度的要求，待恢复GPS信息后，组合导航系统继续正常工作。     

单轴旋转INS/GPS组合导航中重力垂线偏差引起的姿态误差分析

重力垂线偏差是高精度惯性导航中的一个主要误差源。在INS/GPS组合导航系统中,由于GPS可以提供位置和速度修正信息,垂线偏差对组合导航系统精度的影响主要体现在姿态上。从惯性导航系统的误差方程出发,推导INS/GPS组合导航姿态估计误差和陀螺零偏估计误差的解析表达式,从理论上分析组合导航模式下垂线偏差对姿态误差的影响。通过仿真验证理论分析的正确性。分析结果表明:东向姿态误差角由北向垂线偏差决定,北向姿态误差由东向垂线偏差决定;航向误差受东向垂线偏差和北向垂线偏差的一阶导数的共同影响,垂线偏差的剧烈变化将引起较大的航向误差。     

基于拟满应力设计和遗传算法的网架截面优化方法

通过在遗传算法中嵌入拟满应力算子,提出了一种以网架结构杆件截面作为离散变量的优化设计方法,即基于拟满应力设计和遗传算法的网架截面优化方法.分析结果表明,该法能够提高遗传算法的搜索效率和获得全局最优解的可靠性,对于同时有应力和位移约束的网架等空间结构截面优化问题,这种混合算法有较高的效率.     

DIGITAL SPECKLE CORRELATION METHOD IMPROVED BY GENETIC ALGORITHM

The digital speckle correlation method is an important optical metrology for surface displacement and strain measurement. With this technique, the whole field deformation information can be obtained by tracking the geometric points on the speckle images based on a correlation-matching search technique. However, general search techniques suffer from great computational complexity in the processing of speckle images with large deformation and the large random errors in the processing of images of bad quality. In this paper, an advanced approach based on genetic algorithms (GA) for correlation-matching search is developed. Benefiting from the abilities of global optimum and parallelism searching of GA, this new approach can complete the correlation-matching search with less computational consumption and at high accuracy. Two experimental results from the simulated speckle images have proved the efficiency of the new approach.     

An improved genetic algorithm and its applications to the optimisation design of an aspirated compressor profile

Genetic algorithm (GA) is a widely used method for numerical optimisation owing to their good global search ability; however, their local search ability has an obvious shortcoming. To improve local search ability, this paper introduces a simplex method and combines it with a GA to form an improved genetic algorithm (IGA). In the IGA, at each generation of the original GA, high‐fitness individuals are selected as vertices of a simplex, and then a one‐dimensional search within the simplex is conducted to obtain the most‐fit individuals while replacing the inferior ones. Typical test functions show that the IGA can effectively improve the optimisation effect over that of the original GA. To further verify the IGA's practicability, an aspirated compressor profile is optimised with profile, suction flow rate and suction flow location as coupled design parameters. The results again show that the IGA has a better optimising effect than the GA. In addition, it is also verified that coupling the profile and suction flow parameters results in a design that outperforms the uncoupled design; therefore, designing an aspirated compressor blade by arranging suction flow on a conventional blade without considering suction flow is not a good method. Copyright © 2015 John Wiley & Sons, Ltd.     

遗传-粒子群算法模型修正

用部分测量模态数据对5层钢架结构进行模型修正,将遗传算法、粒子群优化算法、 遗传-粒子群组合算法3种算法在该模型修正过程中的效率和精度进行比较,结果表明修正后 模型的全部四阶频率和振型都能在不同程度上向目标值靠近,证明3种算法都能够有效修正 模型,而且遗传-粒子群算法能在前期利用遗传算法进行高效全局搜索,后期利用粒子群算法 进行细致局部搜索,与单独使用遗传算法或粒子群算法相比,组合算法效率和精度更高.     

Optimization of cutting conditions for end milling of Ti6Al4V Alloy by using a Gravitational Search Algorithm (GSA)

Surface roughness is commonly used to indicate the quality of machine parts. Optimizing cutting parameters throughout the machining process is an important aspect for manufacturers, as it allows them to achieve a minimum surface value. During this study, a new optimization technique known as the gravitational search algorithm (GSA) was employed in order to achieve minimum surface roughness when end milling a Ti6Al4V alloy under dry cutting conditions, with both PVD coated and uncoated cutting tools. Regression models have been created based on the results of real experimental data. Through use of SPSS software, it was possible to formulate the objective (fitness) functions which were used in the GSA optimization for each cutting tool. A MATLAB code was then created to instigate the optimization process. The results indicated that high cutting speed and low feed rate and depth of cut could result in a minimum surface roughness value of (0.6255 μm), based on the objective function for the PVD cutting tool. Alternatively, surface roughness of around (0.4165 μm) could be achieved by using an uncoated tool on a lower feed rate, depth of cut and cutting speed. The same GSA technique was used in another case study optimized by Genetic algorithm (GA). The GSA achieved the same results, and proved that it is faster than GA: GSA could reach the optimum solution in the third iteration; GA could only reach it in the 67th.     

遗传算法改进及其在岩土参数反分析中的应用

本文的主要目的是开发基于实数编码的杂交遗传算法来识别土体的本构参数。该杂交遗传算法在经典遗传算法框架下开发,融合两个新开发的交叉算子,形成了一个新的杂交策略。为了保持种群的多样性,在算法中采用了一个动态随机变异算子。另外,为了提高算法收敛性,采用了一个基于混沌的局部搜索技术。分别基于室内试验和现场试验,通过识别土的本构参数来测试新算法的搜索能力和搜索效率。为了测试新开发算法的突出表现,特选用5种经典的随机类算法（遗传算法、粒子群算法、模拟退火算法、差分算法和蜂巢算法）,分析同样的案例进行比较。结果表明,在收敛速度和最优解的准确度方面,新改进的算法可以很好地处理岩土工程的参数反演。     

遗传算法求解可行域分离的结构优化问题

应用遗传算法求解了两类可行域分离的结构优化问题：局部屈曲约束的桁架拓扑优化问题和动力响应约束优化问题．对第一类问题，提出了新的数学表达式，适合于遗传算法求解．采用了改进的适应度函数及约束处理方法、约束凝聚选择、交叉操作改进和竞争最优保留，提高了遗传算法的效率和可靠性．算例说明，该方法能够克服可行域分离给传统优化算法带来的困难，有效地在多连通可行域中搜索全局最优解．     

Evolutionary optimization techniques as versatile solvers for hard‐to‐converge problems in computational fluid dynamics

Evolutionary algorithms mimic the process of natural evolution governed by the ‘survival of the fittest’ principle. In this work, a genetic algorithm (GA) is successfully used to solve problems in potential flow in a gradual contraction, viscous flow over a backward facing step, and non‐Newtonian flow using the power law model. Specifically, the GA heuristically searches the domain for potential solutions, precluding many convergence difficulties associated with the stiffness of a problem. The GA was able to solve problems that the gradient‐based method could not mainly because of its relative indifference to regions of high gradients when performing the search and that systems of discretized equations are never actually solved. The GA exhibited excellent scalability properties for solving problems with a large number of nodes. These results show evolutionary techniques to be of great utility in solving stiff problems in fluid flow. Copyright © 2006 John Wiley & Sons, Ltd.     

基于遗传算法和参数化建模的非线性结构优化

提出了一种对存在接触关系的非线性结构(装配体)进行优化设计的新方法。该方法将遗传算法与结构几何及有限元参数化建模方法相结合，在通用CAE软件的二次开发编程环境中实现对带接触的结构装配体进行结构尺寸和形状优化设计。文中利用该方法对某浮动式闭气结构的重要结构参数和关键构件形状实施了优化设计，使其闭气性能得到大幅度提高，体现了本文方法在解决这类优化问题中的优势。本文的方法有利于拓宽结构优化技术在机械设计领域的应用范围。     

A genetic algorithm particle pairing technique for 3D velocity field extraction in holographic particle image velocimetry

 This research explores a novel technique, using Genetic Algorithm Particle Pairing (GAPP) to extract three-dimensional (3D) velocity fields of complex flows. It is motivated by Holographic Particle Image Velocimetry (HPIV), in which intrinsic speckle noise hinders the achievement of high particle density required for conventional correlation methods in extracting 3D velocity fields, especially in regions with large velocity gradients. The GA particle pairing method maps particles recorded at the first exposure to those at the second exposure in a 3D space, providing one velocity vector for each particle pair instead of seeking statistical averaging. Hence, particle pairing can work with sparse seeding and complex 3D velocity fields. When dealing with a large number of particles from two instants, however, the accuracy of pairing results and processing speed become major concerns. Using GA’s capability to search a large solution space parallelly, our algorithm can efficiently find the best mapping scenarios among a large number of possible particle pairing schemes. During GA iterations, different pairing schemes or solutions are evaluated based on fluid dynamics. Two types of evaluation functions are proposed, tested, and embedded into the GA procedures. Hence, our Genetic Algorithm Particle Pairing (GAPP) technique is characterized by robustness in velocity calculation, high spatial resolution, good parallelism in handling large data sets, and high processing speed on parallel architectures. It has been successfully tested on a simple HPIV measurement of a real trapped vortex flow as well as a series of numerical experiments. In this paper, we introduce the principle of GAPP, analyze its performance under different parameters, and evaluate its processing speed on different computer architectures. Received: 7 September 1997/Accepted: 3 February 1998