arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0204044cs.ROcs.AI
收藏

基于离散粒子滤波的鲁棒全局定位

Robust Global Localization Using Clustered Particle Filtering

Javier Nicolas Sanchez, Adam Milstein, Evan Williamson

摘要:

全局移动机器人定位是指当机器人的起始位置未知时,利用传感器数据确定机器人在环境中的位姿。被称为蒙特卡罗定位(MCL)的概率算法家族是目前解决该问题的最流行的方法之一。MCL算法表示一个机器人的信念由一组加权样本,其中近似的后验概率的机器人位于使用贝叶斯公式的定位问题。本文提出了一种扩展的MCL算法,它解决了它的问题时,定位在高度对称的环境中,MCL的情况下,往往无法正确地跟踪同样可能的姿势的机器人。这个问题产生于这样一个事实,即MCL中的样本集往往变得贫困,当样本是根据其后验似然生成的。我们的方法结合了样本聚类的思想,并考虑到这些聚类的概率质量修改了提案分布。实验结果表明,这种新的扩展MCL算法成功地定位在对称环境中,普通MCL往往失败。

英文摘要:

Global mobile robot localization is the problem of determining a robot's pose in an environment, using sensor data, when the starting position is unknown. A family of probabilistic algorithms known as Monte Carlo Localization (MCL) is currently among the most popular methods for solving this problem. MCL algorithms represent a robot's belief by a set of weighted samples, which approximate the posterior probability of where the robot is located by using a Bayesian formulation of the localization problem. This article presents an extension to the MCL algorithm, which addresses its problems when localizing in highly symmetrical environments; a situation where MCL is often unable to correctly track equally probable poses for the robot. The problem arises from the fact that sample sets in MCL often become impoverished, when samples are generated according to their posterior likelihood. Our approach incorporates the idea of clusters of samples and modifies the proposal distribution considering the probability mass of those clusters. Experimental results are presented that show that this new extension to the MCL algorithm successfully localizes in symmetric environments where ordinary MCL often fails.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑