Batch SLAM with PMBM Data Association Sampling and Graph-Based Optimization
Abstract
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\'er-Rao bound, and outperforms state-of-the-art RFS-based SLAM filters in high clutter and high process noise scenarios.
Cite
@article{arxiv.2407.11643,
title = {Batch SLAM with PMBM Data Association Sampling and Graph-Based Optimization},
author = {Yu Ge and Ossi Kaltiokallio and Yuxuan Xia and Ángel F. García-Fernández and Hyowon Kim and Jukka Talvitie and Mikko Valkama and Henk Wymeersch and Lennart Svensson},
journal= {arXiv preprint arXiv:2407.11643},
year = {2024}
}