Comparing EKF and SPKF Algorithms for Simultaneous Localization and Mapping (SLAM)

  • Javad Z
  • Cai Y
  • Majid Y
N/ACitations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

Simultaneous Localization and Mapping (SLAM) is the problem in which a sensor-enabled mobile robot incrementally builds a map for an unknown environment, while localizing itself within this map. A problem with detection of correct path of moving objects is the received noisy data. Therefore, it is possible that the information is incorrectly detected. The Kalman Filter's linearized error propagation can result in big errors and instability in the SLAM problem. One approach to reduce this situation is using of iteration in Extended Kalman Filter (EKF) and Sigma Point Kalman Filter (SPKF). We will show that the recapitulate versions of kalman filters can improve the estimation accuracy and robustness of these filters beside of linear error propagation. Simulation results are presented to validate this improvement of state estimate convergence through repetitive linearization of the nonlinear model in EKF and SPKF for SLAM algorithms. Results of this evaluation are introduced by computer simulations and verified by offline implementation of the SLAM algorithm on mobile robot in MRL Robotic Lab.

Cite

CITATION STYLE

APA

Javad, Z., Cai, Y., & Majid, Y. (2017). Comparing EKF and SPKF Algorithms for Simultaneous Localization and Mapping (SLAM). Journal of Robotics, Networking and Artificial Life, 3(4), 217. https://doi.org/10.2991/jrnal.2017.3.4.2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free