Scalable Magnetic Field SLAM in 3D Using Gaussian Process Maps
Not on the map. Why?
Abstract (arXiv)
We present a method for scalable and fully 3D magnetic field simultaneous localisation and mapping (SLAM) using local anomalies in the magnetic field as a source of position information. These anomalies are due to the presence of ferromagnetic material in the structure of buildings and in objects such as furniture. We represent the magnetic field map using a Gaussian process model and take well-known physical properties of the magnetic field into account. We build local maps using three-dimensional hexagonal block tiling. To make our approach computationally tractable we use reduced-rank Gaussian process regression in combination with a Rao-Blackwellised particle filter. We show that it is possible to obtain accurate position and orientation estimates using measurements from a smartphone, and that our approach provides a scalable magnetic field SLAM algorithm in terms of both computational complexity and map storage.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Apr 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 4; 2023: 2; 2024: 3; 2025: 1.
10 papers.
- 2022ICP Algorithm: Theory, Practice And Its SLAM-oriented Taxonomycited by 4
- 2022Spatially scalable recursive estimation of Gaussian process terrain maps using local basis functionscited by 2
- 2022Indoor SLAM Using a Foot-mounted IMU and the local Magnetic Fieldcited by 1
- 2024Gaussian Process Upper Confidence Bounds in Distributed Point Target Tracking over Wireless Sensor Networkscited by 1
- 2022Position Tracking using Likelihood Modeling of Channel Features with Gaussian Processescited by 0
- 2023Large-scale magnetic field maps using structured kernel interpolation for Gaussian process regressioncited by 0
- 2023Mapping the magnetic field using a magnetometer array with noisy input Gaussian process regressioncited by 0
- 2024Exploiting Hankel-Toeplitz Structures for Fast Computation of Kernel Precision Matricescited by 0
- 2024Adaptive Basis Function Selection for Computationally Efficient Predictionscited by 0
- 2025Physically-informed change-point kernels for structural dynamicscited by 0
- 2025Physically-informed change-point kernels for structural dynamics13 Jun 2025
- 2024Gaussian Process Upper Confidence Bounds in Distributed Point Target Tracking over Wireless Sensor Networks11 Sep 2024
- 2024Adaptive Basis Function Selection for Computationally Efficient Predictions14 Aug 2024
- 2024Exploiting Hankel-Toeplitz Structures for Fast Computation of Kernel Precision Matrices5 Aug 2024
- 2023Mapping the magnetic field using a magnetometer array with noisy input Gaussian process regression25 Oct 2023
- 2023Large-scale magnetic field maps using structured kernel interpolation for Gaussian process regression25 Oct 2023
- 2022Spatially scalable recursive estimation of Gaussian process terrain maps using local basis functions17 Oct 2022
- 2022ICP Algorithm: Theory, Practice And Its SLAM-oriented Taxonomy13 Jun 2022
- 2022Indoor SLAM Using a Foot-mounted IMU and the local Magnetic Field29 Mar 2022
- 2022Position Tracking using Likelihood Modeling of Channel Features with Gaussian Processes24 Mar 2022