Efficient Global 6D Localization in 3D TSDF Maps Using Point-wise and Scan-wise Reduction Methods on Embedded GPUs

Monte Carlo Localization is a widely used approach in the field of mobile robotics. While this problem has been well studied in the 2D case, global localization in 3D maps with six degrees of freedom has so far been too computationally demanding. Hence, no mobile robot system has yet been presented in the literature that can solve it in real-time. The computationally most intensive step is the evaluation of the sensor model, but it also offers high parallelization potential. In this paper, we investigate the massive parallelization of the evaluation of particles in truncated signed distance fields for three-dimensional laser scanners on embedded GPUs. In addition to providing a reference implementation, we compare two different parallelization schemes and compare the results to a CPU baseline. The results show that the GPU is up to 30 times faster and more than 50 times as energy efficient as the CPU implementation.

Authors

Institutions

Publication Details

Journal
International Journal of Semantic Computing
Published
2025-03-01
DOI
https://doi.org/10.1142/s1793351x25410053
Primary Topic
Advanced Vision and Imaging
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Global 6D Localization in 3D TSDF Maps Using Point-wise and Scan-wise Reduction Methods on Embedded GPUs

Mario Porrmann, Alexander Mock, Marc Eisoldt, Thomas Wiemann
International Journal of Semantic Computing
Advanced Vision and Imaging
article

Efficient Global 6D Localization in 3D TSDF Maps Using Point-wise and Scan-wise Reduction Methods on Embedded GPUs

Mario Porrmann, Alexander Mock, Marc Eisoldt, Thomas Wiemann
article en

Abstract

Monte Carlo Localization is a widely used approach in the field of mobile robotics. While this problem has been well studied in the 2D case, global localization in 3D maps with six degrees of freedom has so far been too computationally demanding. Hence, no mobile robot system has yet been presented in the literature that can solve it in real-time. The computationally most intensive step is the evaluation of the sensor model, but it also offers high parallelization potential. In this paper, we investigate the massive parallelization of the evaluation of particles in truncated signed distance fields for three-dimensional laser scanners on embedded GPUs. In addition to providing a reference implementation, we compare two different parallelization schemes and compare the results to a CPU baseline. The results show that the GPU is up to 30 times faster and more than 50 times as energy efficient as the CPU implementation.

International Journal of Semantic ComputingVol. 19(01)
Osnabrück University (DE), Fulda University of Applied Sciences (DE), Hochschule Osnabrück (DE)
Openalex Percentile: Top 97%
Advanced Vision and Imaging
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.