Batch SLAM with PMBM Data Association Sampling and Graph-Based Optimization
Journal article, 2025

Simultaneous localization and mapping (SLAM) methods need to both solve the data association (DA) problem and the joint estimation of the sensor trajectory and the map, conditioned on a DA. In this paper, we propose a novel integrated approach to solve both the DA problem and the batch SLAM problem simultaneously, combining random finite set (RFS) theory and the graph-based SLAM approach. A sampling method based on the Poisson multi-Bernoulli mixture (PMBM) density is designed for dealing with the DA uncertainty, and a graph-based SLAM solver is applied for the conditional SLAM problem. In the end, a post-processing approach is applied to merge SLAM results from different iterations. Using synthetic data, it is demonstrated that the proposed SLAM approach achieves performance close to the posterior Cramér-Rao bound, and outperforms state-of-the-art RFS-based SLAM filters in high clutter and high process noise scenarios.

sampling

RFS

DA

SLAM

Batch processing

graph-based SLAM

PMBM

correlation

Author

Yu Ge

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks

Ossi Kaltiokallio

University of Tampere

Yuxuan Xia

Shanghai Jiao Tong University

Angel Garcia

Technical University of Madrid

Hyowon Kim

Chungnam National University

Jukka Talvitie

University of Tampere

M. Valkama

University of Tampere

Henk Wymeersch

Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks

Lennart Svensson

Chalmers, Electrical Engineering, Signal Processing and Biomedical Engineering

IEEE Transactions on Signal Processing

1053-587X (ISSN) 1941-0476 (eISSN)

Vol. 73 2139-2153

Subject Categories (SSIF 2025)

Robotics and automation

Computer graphics and computer vision

Signal Processing

DOI

10.1109/TSP.2025.3567916

More information

Latest update

7/5/2025 4