Open Access
ARTICLE
The SLAM Algorithm for Multiple Robots Based on Parameter Estimation
1 Key Lab of Electric Drive and Control of Anhui Province, Anhui Polytechnic University, Wuhu 241000, China
2 Department of Precision Machinery and Precision Instrumentation, University of Science and Technology of China, Hefei 230027, China
* Corresponding Author: MengYuan Chen,
Intelligent Automation & Soft Computing 2018, 24(3), 593-602. https://doi.org/10.31209/2018.100000026
Abstract
With the increasing number of feature points of a map, the dimension of systematic observation is added gradually, which leads to the deviation of the volume points from the desired trajectory and significant errors on the state estimation. An Iterative Squared-Root Cubature Kalman Filter (ISR-CKF) algorithm proposed is aimed at improving the SR-CKF algorithm on the simultaneous localization and mapping (SLAM). By introducing the method of iterative updating, the sample points are re-determined by the estimated value and the square root factor, which keeps the distortion small in the highly nonlinear environment and improves the precision further. A robust tracking Square Root Cubature Kalman Filter algorithm (STF-SRCKF-SLAM) is proposed to solve the problem of reduced accuracy in the condition of state change on the SLAM. The algorithm is predicted according to the kinematic model and observation model of the mobile robot at first, and then the algorithm updates itself by spreading the square root of the error covariance matrix directly, which greatly reduces the computational complexity. At the same time, the time-varying fading factor is introduced in the process of forecasting and updating, and the corresponding weight of the data is adjusted in real time to improve the accuracy of multi-robot localization. The results of simulation shows that the algorithm can improve the accuracy of multi-robot pose effectively.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.