This study considers the object localization problem and proposes a novel multiparticle Kalman filter to solve it in complex and symmetric environments. Two well-known classes of filtering algorithms to solve the localization problem are Kalman filter-based methods and particle filter-based methods. We consider these classes, demonstrate their complementary properties, and propose a novel filtering algorithm that takes the best from two classes. We evaluate the multiparticle Kalman filter in symmetric and noisy environments. Such environments are especially challenging for both classes of classical methods. We compare the proposed approach with the particle filter since only this method is feasible if the initial state is unknown. In the considered challenging environments, our method outperforms the particle filter in terms of both localization error and runtime.
翻译:本研究考虑了对象本地化问题, 并提出了在复杂和对称环境中解决问题的新颖的多粒子 Kalman 过滤器。 解决本地化问题的两种众所周知的过滤算法类型是 Kalman 过滤法: Kalman 过滤器法和粒子过滤法。 我们考虑这些类别, 展示其互补特性, 并提议一种新颖的过滤算法, 从两个类别中取最佳。 我们评估了对称和吵闹环境中的多粒子卡尔曼过滤器。 这种环境对两种古典方法都特别具有挑战性。 我们比较了建议的方法和粒子过滤法, 因为只有初始状态未知的情况下, 这种方法才可行。 在被认为具有挑战性的环境中, 我们的方法在本地化错误和运行时间上都优于粒子过滤器 。</s>