A FastSLAM algorithm based on nonlinear adaptive square root unscented Kalman filter (Q1992723)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A FastSLAM algorithm based on nonlinear adaptive square root unscented Kalman filter |
scientific article; zbMATH DE number 6972084
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A FastSLAM algorithm based on nonlinear adaptive square root unscented Kalman filter |
scientific article; zbMATH DE number 6972084 |
Statements
A FastSLAM algorithm based on nonlinear adaptive square root unscented Kalman filter (English)
0 references
5 November 2018
0 references
Summary: For fast simultaneous localization and mapping (FastSLAM) problem, to solve the problems of particle degradation, the error introduced by linearization and inconsistency of traditional algorithm, an improved algorithm is described in the paper. In order to improve the accuracy and reliability of algorithm which is applied in the system with lower measurement frequency, a new decomposition strategy is adopted for a posteriori estimation. In proposed decomposition strategy, the problem of solving a 3-dimensional state vector and N 2-dimensional state vectors in traditional FastSLAM algorithm is transformed to the problem of solving N 5-dimensional state vectors. Furthermore, a nonlinear adaptive square root unscented Kalman filter (NASRUKF) is used to replace the particle filter and Kalman filter employed by traditional algorithm to reduce the model linearization error and avoid solving Jacobian matrices. Finally, the proposed algorithm is experimentally verified by vehicle in indoor environment. The results prove that the positioning accuracy of proposed FastSLAM algorithm is less than 1 cm and the azimuth angle error is 0.5 degrees.
0 references