Concurrent filtering and smoothing
Author(s)
Kaess, Michael; Williams, Stephen; Indelman, Vadim; Roberts, Richard; Leonard, John Joseph; Dellaert, Frank; ... Show more Show less
DownloadLeonard_Concurrent filtering.pdf (474.1Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
This paper presents a novel algorithm for integrating real-time filtering of navigation data with full map/trajectory smoothing. Unlike conventional mapping strategies, the result of loop closures within the smoother serve to correct the real-time navigation solution in addition to the map. This solution views filtering and smoothing as different operations applied within a single graphical model known as a Bayes tree. By maintaining all information within a single graph, the optimal linear estimate is guaranteed, while still allowing the filter and smoother to operate asynchronously. This approach has been applied to simulated aerial vehicle sensors consisting of a high-speed IMU and stereo camera. Loop closures are extracted from the vision system in an external process and incorporated into the smoother when discovered. The performance of the proposed method is shown to approach that of full batch optimization while maintaining real-time operation.
Date issued
2012-07Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Mechanical EngineeringJournal
Proceedings of the 2012 15th International Conference on Information Fusion (FUSION)
Publisher
Institute of Electrical and Electronics Engineers
Citation
Kaess, Michael, Stephen Williams, Vadim Indelman, Richard Roberts, John J. Leonard, and Frank Dellaert. "Concurrent Filtering and Smoothing." In 2012 15th International Conference on Information Fusion (FUSION), 9-12 July 2012, Singapore. p.1300-1307
Version: Author's final manuscript
Other identifiers
INSPEC Accession Number: 12965807
ISBN
978-0-9824438-4-2
978-1-4673-0417-7