Closed-Form Full Map Posteriors for Robot Localization with Lidar Sensors
Lukas Luft, Alexander Schaefer, Tobias Schubert, Wolfram Burgard

TL;DR
This paper introduces a method to compute full map posteriors for lidar-based grid maps in robot localization, providing richer probabilistic information than traditional maximum likelihood approaches, and demonstrates improved localization accuracy.
Contribution
It derives closed-form full map posteriors for two lidar models that are computationally efficient and enhances robot localization by using these posteriors in Bayesian filtering.
Findings
Full map posteriors improve localization accuracy.
Closed-form solutions are computationally efficient.
Method validated through simulations and real-world experiments.
Abstract
A popular class of lidar-based grid mapping algorithms computes for each map cell the probability that it reflects an incident laser beam. These algorithms typically determine the map as the set of reflection probabilities that maximizes the likelihood of the underlying laser data and do not compute the full posterior distribution over all possible maps. Thereby, they discard crucial information about the confidence of the estimate. The approach presented in this paper preserves this information by determining the full map posterior. In general, this problem is hard because distributions over real-valued quantities can possess infinitely many dimensions. However, for two state-of-the-art beam-based lidar models, our approach yields closed-form map posteriors that possess only two parameters per cell. Even better, these posteriors come for free, in the sense that they use the same…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
