Characterizing marginalization and incremental operations on the Bayes tree

DOI10.1007/978-3-030-66723-8_14zbMATH Open1469.68123OpenAlexW3128922389MaRDI QIDQ3381968FDOQ3381968

Authors:

Publication date: 20 September 2021

Published in: Algorithmic Foundations of Robotics XIV (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-66723-8_14

Recommendations

• The Bayes tree: an algorithmic foundation for probabilistic robot mapping
• Incremental Junction Tree Inference
• Local Frame Junction Trees in SLAM
• Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking
• Variational algorithms for marginal MAP

zbMATH Keywords

localizationroboticsbelief propagationsum-productjunction treeBayes networkBayes treeChapman-Kolmogorov transit integral

Mathematics Subject Classification ID

Artificial intelligence for robotics (68T40)

Cites Work

• A column approximate minimum degree ordering algorithm
• Probabilistic graphical models.
• Complexity of Finding Embeddings in a k-Tree
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Factor graphs and the sum-product algorithm
• Square root SAM: simultaneous localization and mapping via square root information smoothing
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Bayes tree: an algorithmic foundation for probabilistic robot mapping
• Title not available (Why is that?)

Cited In (1)

• The Bayes tree: an algorithmic foundation for probabilistic robot mapping

Uses Software

• COLAMD
• iSAM2
• GitHub

This page was built for publication: Characterizing marginalization and incremental operations on the Bayes tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3381968)