Research of mobile robot SLAM based on EKF and its improved algorithms

Authors:
Chen Chen;Yinhang Cheng
Affiliations:
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China;School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 3
Cited 0

A stochastic map for uncertain spatial relationships

Proceedings of the 4th international symposium on Robotics Research
Hierarchical SLAM: Real-Time Accurate Mapping of Large Environments

IEEE Transactions on Robotics
Convergence and Consistency Analysis for Extended Kalman Filter Based SLAM

IEEE Transactions on Robotics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extended Kalman Filter (EKF) based solution is one of the most popular techniques for solving mobile robot Simultaneous Localization and Mapping (SLAM) problem. In this paper, the basic algorithm of EKF based SLAM and its improved algorithms are introduced. The improved algorithms are mainly on two aspects: data association and computational complexity. First, the classical data association algorithm, Individual Compatibility Nearest Neighbor (ICNN), is presented. And two improved methods including batch validation gating and multi-hypothesis are also introduced. Then, partitioned updates and submapping methods are introduced as the main ones of reducing computational complexity. Some representative improved algorithms are presented. These algorithms enable EKF to solve the mobile robot SLAM problem in cluttered and large scale environments.