.png){kind=icon}
.png){kind=icon}
Return
Research on mobile robot mapping based on improved Gmapping algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s41315-025-00508-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to realize high-precision mapping of mobile robots in unknown indoor environments, this paper compares and analyzes the Gmapping mapping algorithm and the Hector mapping algorithm in a simulation environment. On this basis, the Gmapping algorithm is optimized in the backend to solve the particle degradation problem caused by large-angle turning or rapid environmental changes. The particle weights are processed in the laser scanning part, and the Gaussian function is used to smooth the weights of abnormal particles with large weight differences. Then, the resampling strategy is optimized, and a low-variance resampling strategy is used to reduce particle degradation and further improve particle diversity. Finally, the number of particles is adaptively adjusted to improve the efficiency of calculation. The simulation and physical experimental results show that the root mean square error of the absolute error of the improved algorithm in this paper is reduced by 39.8% and the standard deviation is reduced by 71.5% compared with the original algorithm in the estimated pose and true pose in the mapping. The relative error is also significantly reduced.
Keywords:
Gmapping
Particle filter
Low variance
Adaptive particle number
Gaussian smoothing
Journal
I
IF:
2
Papers:
52
Citations:
674
Organization
No organization information available