Skip to main navigation Skip to search Skip to main content

Improved SLAM algorithm based on compressed-EKF

  • Hai Qiang Zhang*
  • , Li Hua Dou
  • , Hao Fang
  • , Jie Chen
  • *Corresponding author for this work
  • Beijing Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

The compressed extended Kalman filter (CEKF)-based algorithm for simultaneous localization and mapping (SLAM) has low efficiency on state augment and map management. An improved algorithm (ICEKF) was proposed. The ICEKF algorithm achieves the state augment by only augmenting one auxiliary coefficient matrix, and the computational complexity is reduced from O(N2) to O(NA), where N and NA denote the number of the landmarks in the global and local maps respectively. A Euclidian distance-based method for map management was presented which selects the local map dynamically. In this way, the landmarks assignment and other problems issued from dividing the global map before the SLAM starts as in the CEKF algorithm were avoided. Simulations show that the ICEKF algorithm obtaines the same optimal results as the EKF algorithm, and its computational cost is greatly reduced in comparion with the CEKF algorithm.

Original languageEnglish
Pages (from-to)5668-5671+5680
JournalXitong Fangzhen Xuebao / Journal of System Simulation
Volume21
Issue number18
StatePublished - 20 Sep 2009
Externally publishedYes

Keywords

  • Compressed extended Kalman filter
  • Computational complexity
  • Simultaneous localization and mapping (SLAM)
  • State augment

Fingerprint

Dive into the research topics of 'Improved SLAM algorithm based on compressed-EKF'. Together they form a unique fingerprint.

Cite this