Research on the Improvement of Cartographer Mapping Algorithm for Mobile Robots

In response to the noise impact in 2D laser SLAM mapping algorithms and the problem of map blurring and inaccuracy caused by large errors in mapping loop checks, this paper proposes an improved Cartographer algorithm for mapping. Firstly, in the data fusion stage between IMU and wheel odometer, the original UKF fusion algorithm is improved to AUKF algorithm to update noise parameters in real time and reduce the impact on pose data; Secondly, in the detection stage, a closed-loop detection method based on graph and graph loop matching was proposed. Continuous frames of laser data were constructed into a subgraph for matching to obtain more feature points. The results of the improved algorithm were compared experimentally, and relevant points were selected to calculate the error and make a line graph. It can be intuitively seen that the improved algorithm has a smaller mapping error than before.

Authors

Institutions

Publication Details

Published
2025-03-21
DOI
https://doi.org/10.1109/icsi64877.2025.11009548
Primary Topic
Simulation and Modeling Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on the Improvement of Cartographer Mapping Algorithm for Mobile Robots

Yuhao He, Yi Zhang
Simulation and Modeling Applications
article

Research on the Improvement of Cartographer Mapping Algorithm for Mobile Robots

Yuhao He, Yi Zhang
article en

Abstract

In response to the noise impact in 2D laser SLAM mapping algorithms and the problem of map blurring and inaccuracy caused by large errors in mapping loop checks, this paper proposes an improved Cartographer algorithm for mapping. Firstly, in the data fusion stage between IMU and wheel odometer, the original UKF fusion algorithm is improved to AUKF algorithm to update noise parameters in real time and reduce the impact on pose data; Secondly, in the detection stage, a closed-loop detection method based on graph and graph loop matching was proposed. Continuous frames of laser data were constructed into a subgraph for matching to obtain more feature points. The results of the improved algorithm were compared experimentally, and relevant points were selected to calculate the error and make a line graph. It can be intuitively seen that the improved algorithm has a smaller mapping error than before.

Chongqing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 87%
Simulation and Modeling Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.