Rapidly Exploring Gmapping
This paper presents an improved algorithm for the proposal distribution.The proposed algorithm enhances the range of filter values, the precision of re-sampling, and the accuracy of the map building.Additionally, the computational overhead is reduced, thereby optimizing the issue of the particle degeneration.The comparative experiments demonstrate that the proposed algorithm enhances the mapping precision and speed.
Authors
- Chao Han (ORCID: https://orcid.org/0000-0001-8580-4697)
- Miao Zhang (ORCID: https://orcid.org/0000-0002-6511-7192)
Institutions
- Tianjin University of Science and Technology (CN)
Publication Details
- Journal
- Proceedings of International Conference on Artificial Life and Robotics
- Published
- 2025-02-13
- DOI
- https://doi.org/10.5954/icarob.2025.os3-6
- Primary Topic
- Law, AI, and Intellectual Property
- Type
- article
- Field-Weighted Citation Impact
- 0.00