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 language | English |
---|---|
Pages (from-to) | 5668-5671+5680 |
Journal | Xitong Fangzhen Xuebao / Journal of System Simulation |
Volume | 21 |
Issue number | 18 |
Publication status | Published - 20 Sept 2009 |
Keywords
- Compressed extended Kalman filter
- Computational complexity
- Simultaneous localization and mapping (SLAM)
- State augment