基于IINFO的粒子重组FastSLAM在SLAM中的研究  

Research on IINFO Based Particles Recombination FastSLAM in SLAM

作　　者：蔡艳 杨光永[1] 樊康生 徐天奇[1] CAI Yan;YANG Guangyong;FAN Kangsheng;XU Tianqi(School of Electrical Information Engineering,Yunnan Minzu University,Kunming 650000,China)

机构地区：[1]云南民族大学电气信息工程学院,昆明650000

出　　处：《组合机床与自动化加工技术》2023年第9期31-34,38,共5页Modular Machine Tool & Automatic Manufacturing Technique

基　　金：国家自然科学基金项目(61761049);国家自然科学基金项目(61261022)。

摘　　要：针对FastSLAM算法需要增加粒子数提高精度以及重采样导致的粒子多样性缺失的问题,提出一种改进INFO(向量加权平均算法)优化的粒子重组FastSLAM算法。首先,在预测粒子集时加入最新时刻的观测信息并通过INFO计算粒子适应度值,为增强INFO跳出局部最优的能力,对最优个体进行柯西变异;其次,通过改进INFO寻优能力强,收敛速度快的特性更新预测粒子集,使得在计算权重前粒子集的位姿就更接近期望值,以此提高估计精度;最后,重采样阶段将筛选后保留的粒子与剩余粒子重新组合成新的粒子,以此增加粒子多样性。仿真实验结果表明,IINFO-FastSLAM算法较FastSLAM、INFO-FastSLAM算法相比,其位姿与路标估计精度更高且鲁棒性更佳。To solve the problem that FastSLAM algorithm needs to increase the number of particles to improve the accuracy and the lack of particle diversity caused by resampling,a particle recombination FastSLAM algorithm optimized by improved INFO(weighted mean of vectors algorithm)is proposed.First,the latest observation information is added into the prediction of particle set and the particle fitness value is calculated through INFO.In order to enhance the ability of INFO to jump out of the local optimum,Cauchy mutation is performed on the optimal individual;Secondly,the predicted particle set is updated by improving the characteristics of strong optimization ability and fast convergence speed of INFO,so that the pose of the particle set is closer to the expected value before calculating the weight,so as to improve the estimation accuracy;Finally,in the resampling stage,the particles retained after screening and the remaining particles are recombined into new particles to increase particle diversity.The simulation results show that the IINFO FastSLAM algorithm has higher accuracy and better robustness than FastSLAM and INFO FastSLAM algorithms.

关 键 词：同时定位与建图 FASTSLAM算法 向量加权平均算法 提议分布 

分 类 号：TH164[机械工程—机械制造及自动化] TG65[金属学及工艺—金属切削加工及机床]