Complexity Analysis and Efficient Measurement Selection Primitives for High-Rate Graph SLAM
© 2018 IEEE. Sparsity has been widely recognized as crucial for efficient optimization in graph-based SLAM. Because the sparsity and structure of the SLAM graph reflect the set of incorporated measurements, many methods for sparsification have been proposed in hopes of reducing computation. These me...
Main Authors: | Frey, Kristoffer M., Steiner, Ted J., How, Jonathan P. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
Online Access: | https://hdl.handle.net/1721.1/137882 |
Similar Items
-
Efficient constellation-based map-merging for semantic SLAM
by: Frey, Kristoffer M., et al.
Published: (2021) -
Robust Object-based SLAM for High-speed Autonomous Navigation
by: Ok, Kyel, et al.
Published: (2021) -
Belief-Space Planning for Real-World Systems: Efficient SLAM-Based Belief Propagation and Continuous-Time Safety
by: Frey, Kristoffer M.
Published: (2022) -
Collision Probabilities for Continuous-Time Systems Without Sampling
by: Frey, Kristoffer M., et al.
Published: (2022) -
Spectral Measurement Sparsification for Pose-Graph SLAM
by: Doherty, Kevin J., et al.
Published: (2024)