Research on Mobile Robot Localization Method Based on Adaptive Motion Model and Double-Threshold Relocation Strategy

To address the problems of particle degradation, localization failure, and sensor noise in mobile robot localization algorithms, Robust Monte Carlo Localization is proposed in this paper. It is an enhanced approach combining adaptive odometry motion model and adaptive relocation detection. The approach incorporates velocity factors and environmental variation factors to optimize the particle filter model. Then, the result is used as initial value, and a precise result is obtained based on scan-matching. The accurately matched result is then reintroduced into the particle filter as particles. Finally, the decision for re-localization is made based on the results of precise matching and the particle distribution. The simulated experiments were conducted to evaluate the performance of our algorithm. The real-world experiments are also conducted employing a sub-millimeter high-precision instrument. The experimental results demonstrate that compared with the mainstream 2D laser-based localization methods, the accuracy of our algorithm is improved by more than 29.97%, and the failure rate of positioning in the real environment is below 10%. Thus, our algorithm substantially enhances accuracy for complex indoor positioning.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Instrumentation and Measurement
Published
2025-01-01
DOI
https://doi.org/10.1109/tim.2025.3568973
Primary Topic
Advanced Algorithms and 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 Mobile Robot Localization Method Based on Adaptive Motion Model and Double-Threshold Relocation Strategy

Jian Yang, Xiaobin Xu, Hui-Jun Cheng, Yingying Ran et al.
IEEE Transactions on Instrumentation and Measurement
Advanced Algorithms and Applications
article

Research on Mobile Robot Localization Method Based on Adaptive Motion Model and Double-Threshold Relocation Strategy

Jian Yang, Xiaobin Xu, Hui-Jun Cheng, Yingying Ran, Ting Wang, Zhiying Tan, Ziheng Chen
article en

Abstract

To address the problems of particle degradation, localization failure, and sensor noise in mobile robot localization algorithms, Robust Monte Carlo Localization is proposed in this paper. It is an enhanced approach combining adaptive odometry motion model and adaptive relocation detection. The approach incorporates velocity factors and environmental variation factors to optimize the particle filter model. Then, the result is used as initial value, and a precise result is obtained based on scan-matching. The accurately matched result is then reintroduced into the particle filter as particles. Finally, the decision for re-localization is made based on the results of precise matching and the particle distribution. The simulated experiments were conducted to evaluate the performance of our algorithm. The real-world experiments are also conducted employing a sub-millimeter high-precision instrument. The experimental results demonstrate that compared with the mainstream 2D laser-based localization methods, the accuracy of our algorithm is improved by more than 29.97%, and the failure rate of positioning in the real environment is below 10%. Thus, our algorithm substantially enhances accuracy for complex indoor positioning.

IEEE Transactions on Instrumentation and MeasurementVol. 74
Hohai University (CN), Nanjing University of Posts and Telecommunications (CN), Yangzhou University (CN)
Openalex Percentile: Top 89%
Advanced Algorithms and 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.