A tree parameterization for efficiently computing maximum likelihood maps using gradient descent

MaRDI QIDQ3598913zbMATH OpenFDO

Authors Giorgio Grisetti, Cyrill Stachniss, Slawomir Grzonka, Wolfram Burgard

Publication date 3 February 2009

Mathematics Subject Classification ID

Robot dynamics and control of rigid bodies (70E60) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• The Bayes tree: an algorithmic foundation for probabilistic robot mapping
• Toward SLAM on graphs
• Square root SAM: simultaneous localization and mapping via square root information smoothing
• Local Frame Junction Trees in SLAM
• scientific article; zbMATH DE number 1871406

Cited in

(6)

• Comparison of two different objective functions in 2D point feature SLAM
• Dimensionality reduction for point feature SLAM problems with spherical covariance matrices
• Variational circular treemaps for hierarchical data
• The Bayes tree: an algorithmic foundation for probabilistic robot mapping
• scientific article; zbMATH DE number 5818908 (Why is no real title available?)
• Visual SLAM Based on Single Omnidirectional Views

This page was built for publication: A tree parameterization for efficiently computing maximum likelihood maps using gradient descent

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