.png){kind=icon}
Return
Power-SLAM: a linear-complexity, anytime algorithm for SLAM
.png){kind=icon}
OA
AI
DOI：10.1177/0278364910390539.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present an extended Kalman filter (EKF)-based estimator for simultaneous localization and mapping (SLAM) with processing requirements that are linear in the number of features in the map. The proposed algorithm, called the Power-SLAM, is based on three key ideas. Firstly, by introducing the Global Map Postponement method, approximations necessary for ensuring linear computational complexity of EKF-based SLAM are delayed over multiple time steps. Then by employing the Power Method, only the most informative of the Kalman vectors, generated during the postponement phase, are retained for updating the covariance matrix. This ensures that the information loss during each approximation epoch is minimized. Next, linear-complexity, rank-2 updates, that minimize the trace of the covariance matrix, are employed to increase the speed of convergence of the estimator. The resulting estimator, in addition to being conservative as compared to the standard EKF, has processing requirements that can be adjusted depending on the availability of computational resources. Lastly, simulation and experimental results are presented that demonstrate the accuracy of the proposed algorithm (Power-SLAM) when compared to the standard EKF-based SLAM with quadratic computational cost and two linear-complexity competing alternatives.
Keywords:
Global map postponement
power method
simultaneous localization and mapping
Journal
IF:
5
Papers:
2.4K
Citations:
1.5W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more