Characterizing Marginalization and Incremental Operations on the Bayes Tree
Name
Fourie20wafr.pdf
Size
789.57 KB
Format
Adobe PDF
Checksum (MD5)
bacf8aa2254fe7fca7fe036cce94ecd8
Author(s) • • •
Fourie, Dehann
Espinoza, Antonio Terán
Kaess, Michael
Leonard, John
Date Issued
2021
Publisher
Springer International Publishing
Citation
Fourie, Dehann, Espinoza, Antonio Terán, Kaess, Michael and Leonard, John. 2021. "Characterizing Marginalization and Incremental Operations on the Bayes Tree."
Version
Author's final manuscript
Abstract
Perception systems for autonomy are most useful if they can operate within limited/predictable computing resources. Existing algorithms in robot navigation—e.g. simultaneous localization and mapping—employ concepts from filtering, fixed-lag, or incremental smoothing to find feasible inference solutions. Using factor graphs as a probabilistic modeling language, we emphasize the importance of marginalization operations on the equivalent Bayes (junction) tree. The objective is to elucidate the connection between simple tree-based message passing rules with the aforementioned state estimation approaches, and their frequently overlooked relation to direct marginalization on the Bayes tree. We characterize the inherent marginalization operation as part of the
fundamental Chapman-Kolmogorov transit integrals which unifies many state-of-the-art approaches. The belief propagation model is then used to define five major tree inference strategies, with regard to computation recycling and resource constrained operation. A series of illustrative examples and results show the versatility of the method.
Description
Algorithmic Foundations of Robotics XIV. WAFR 2020
MIT Department
Massachusetts Institute of Technology. Department of Mechanical Engineering
Massachusetts Institute of Technology. Department of Mechanical Engineering
Terms of Use
Creative Commons Attribution-Noncommercial-ShareAlike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-030-66723-8_14