Discrete-Continuous Smoothing and Mapping
Kevin J. Doherty, Ziqi Lu, Kurran Singh, John J. Leonard

TL;DR
This paper introduces DC-SAM, a novel library and solver for efficient MAP inference in hybrid discrete-continuous factor graphs, enabling improved robotics perception tasks.
Contribution
We present DC-SAM, a general tool extending existing graphical model inference to hybrid problems, with a novel alternating optimization solver for approximate solutions.
Findings
Effective in robot perception applications
Enables approximate inference in hybrid models
Improves robustness in pose graph optimization
Abstract
We describe a general approach for maximum a posteriori (MAP) inference in a class of discrete-continuous factor graphs commonly encountered in robotics applications. While there are openly available tools providing flexible and easy-to-use interfaces for specifying and solving inference problems formulated in terms of either discrete or continuous graphical models, at present, no similarly general tools exist enabling the same functionality for hybrid discrete-continuous problems. We aim to address this problem. In particular, we provide a library, DC-SAM, extending existing tools for inference problems defined in terms of factor graphs to the setting of discrete-continuous models. A key contribution of our work is a novel solver for efficiently recovering approximate solutions to discrete-continuous inference problems. The key insight to our approach is that while joint inference over…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Bayesian Modeling and Causal Inference · Formal Methods in Verification
