一种新的移动机器人全局定位算法  

A Novel Algorithm for Mobile Robot Global Localization

作　　者：厉茂海[1] 洪炳熔[1] 蔡则苏[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,黑龙江哈尔滨150001

出　　处：《电子学报》2006年第3期553-558,共6页Acta Electronica Sinica

基　　金：国家自然科学基金(No.2002AA735041)

摘　　要：粒子滤波器能够给出移动机器人全局定位非线性非高斯模型的近似解.然而,当新感知出现在先验概率的尾部或者与先验相比感知概率太尖时,传统的粒子滤波器会退化导致定位失败.本文提出了一种重要性采样跟中心差分滤波器(cen tra l d ifference filter,CDF)相结合的新算法,并对测量更新步的加权粒子集应用基于KD-树的加权期望最大(w e igh ted expecta tion m ax im iza tion,W EM)自适应聚类算法获得表示机器人位姿状态后验密度的高斯混合模型(G au ssian m ixtu re m od e l,GMM).实验结果表明,新方法提高了定位准确率,降低了计算复杂度.The particle filter can give the approximate solutions to the non-linear non-Gaussian model of mobile robot global localization. However,if the new measurements appear in the tail of the prior or if the likelihood is too peaked in comparison to the prior,the conventional particle filter can degenerate and make localization fail. We present a novel algorithm that combines an importance sampling with central difference filter （CDF）. The posterior pose state density is represented by Gaussian mixture model （GMM） that is recovered from the weighted particle set of the measurement update step by means of a weighted expectation maximization （WEM） adaptive clustering algorithm, which based on the kd-trees. Experimental results show that this new approach has an improved localization accuracy and reduceds computational complexity.

关 键 词：移动机器人 全局定位 粒子滤波器 中心差分滤波器 加权期望最大 高斯混合模型 

分 类 号：TP24[自动化与计算机技术—检测技术与自动化装置]