CoChat

Concurrent filtering and smoothing: A parallel architecture for real-time navigation and full smoothing

Open access
Williams, Stephen, Indelman, Vadim, Kaess, Michael, Roberts, Richard, Leonard, John J., Dellaert, Frank · 2014 · The International Journal of Robotics Research

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.

Abstract

We present a parallelized navigation architecture that is capable of running in real-time and incorporating long-term loop closure constraints while producing the optimal Bayesian solution. This architecture splits the inference problem into a low-latency update that incorporates new measurements using just the most recent states (filter), and a high-latency update that is capable of closing long loops and smooths using all past states (smoother). This architecture employs the probabilistic graphical models of factor graphs, which allows the low-latency inference and high-latency inference to be viewed as sub-operations of a single optimization performed within a single graphical model. A specific factorization of the full joint density is employed that allows the different inference operations to be performed asynchronously while still recovering the optimal solution produced by a full batch optimization. Due to the real-time, asynchronous nature of this algorithm, updates to the state estimates from the high-latency smoother will naturally be delayed until the smoother calculations have completed. This architecture has been tested within a simulated aerial environment and on real data collected from an autonomous ground vehicle. In all cases, the concurrent architecture is shown to recover the full batch solution, even while updated state estimates are produced in real-time.

Overview

Integrity signals

Registry

Crossref · 10.1177/0278364914531056

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

  • On Information and Sufficiency

    Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193 · cited 6×

    “Additionally, a metric known as the Kullback–Leibler divergence (KLD) Kullback and Leibler (1951) has been computed, comparing the CFS and the fixed-lag smoother results with that of the batch optimization.”
    MethodInfluential
  • Object recognition from local scale-invariant features

    Lowe, D. G. (1999) · Proceedings of the Seventh IEEE International Conference on Computer Vision · doi:10.1109/iccv.1999.790410 · Cited by 16,472 · cited 1×

    “In this example, SIFT Lowe (1999) features and descriptors are used.”
    Method
  • Are we ready for autonomous driving? The KITTI vision benchmark suite

    Geiger, A., Lenz, P., & Urtasun, R. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248074 · Cited by 14,897 · cited 3×

    “2 Karlsruhe Dataset To test the proposed method on real-world data, we make use of the KITTI Vision Benchmark Suite (Geiger et al., 2012). These datasets were captured from the autonomous vehicle platform “Annieway” during traverses around the city of Karlsruhe, Germany. This platform consists of a car chassis outfitt…”
    MethodInfluential
  • Factor graphs and the sum-product algorithm

    Kschischang, F. R., Frey, B. J., & Loeliger, H.-A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910572 · Cited by 6,486 · cited 2×

    “For probabilistic inference, the language of factor graphs has been shown to be convenient and appropriate Kschischang et al. (2001).”
    Method
  • Parallel Tracking and Mapping for Small AR Workspaces

    Klein, G., & Murray, D. (2007) · 2007 6th IEEE and ACM International Symposium on Mixed and Augmented Reality · doi:10.1109/ismar.2007.4538852 · Cited by 4,346 · cited 4×

    “Filtering techniques, such as the extended Kalman filter (EKF), maintain constant-time updates by marginalizing out all past variables.”
    BackgroundMethodInfluential
  • KinectFusion: Real-time dense surface mapping and tracking

    Newcombe, R. A., Fitzgibbon, A., Izadi, S., Hilliges, O., Molyneaux, D., Kim, D., Davison, A. J., Kohi, P., Shotton, J., & Hodges, S. (2011) · 2011 10th IEEE International Symposium on Mixed and Augmented Reality · doi:10.1109/ismar.2011.6092378 · Cited by 4,008 · cited 1×

    “The same parallelization is also used in more recent dense solutions such as dense tracking and mapping by Newcombe et al. (2011b) and KinectFusion by Newcombe et al. (2011a).”
    Method
  • Bundle Adjustment — A Modern Synthesis

    Triggs, B., McLauchlan, P. F., Hartley, R. I., & Fitzgibbon, A. W. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44480-7_21 · Cited by 3,988

  • DTAM: Dense tracking and mapping in real-time

    Newcombe, R. A., Lovegrove, S. J., & Davison, A. J. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126513 · Cited by 2,078 · cited 1×

    “The same parallelization is also used in more recent dense solutions such as dense tracking and mapping by Newcombe et al. (2011b) and KinectFusion by Newcombe et al. (2011a).”
    Method
  • A Multi-State Constraint Kalman Filter for Vision-aided Inertial Navigation

    Mourikis, A. I., & Roumeliotis, S. I. (2007) · Proceedings 2007 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2007.364024 · Cited by 1,951 · cited 1×

    “Examples include GPS-aided (Farrell, 2008) and vision-aided (Mourikis and Roumeliotis, 2007; Zhu et al., 2007; Jones and Soatto, 2011) inertial navigation.”
    Background
  • iSAM2: Incremental smoothing and mapping using the Bayes tree

    Kaess, M., Johannsson, H., Roberts, R., Ila, V., Leonard, J. J., & Dellaert, F. (2012) · The International Journal of Robotics Research · doi:10.1177/0278364911430419 · Cited by 1,362 · cited 6×

    “Partial elimination results from the unchanged portion of the filter branch can be reused, as was recognized in incremental smoothing and mapping (iSAM2) Kaess et al. (2011, 2012a).”
    BackgroundMethodInfluentialSelf-citation

Show all 38 references

Research works printed but not linked: 10

  1. Bar-Shalom Y, 1995, Multitarget-multisensor Tracking: Principles and Techniques
  2. Farrell J, 2008, Aided Navigation: GPS with High Rate Sensors
  3. Heggernes P, 1996, Proceedings of the 2nd SIAM conference on sparse matrices
  4. Indelman V, 2012, Proceedings of the International conference on information fusion (FUSION), 2154
  5. 10.1007/978-3-642-17452-0_10 · DOI
  6. Kaess M, 2012, Proceedings of the International conference on information fusion (FUSION), 2154
  7. Maybeck P, 1979, Stochastic Models, Estimation and Control, 1
  8. Moutarlier P, 1989, Proceedings of Experimental Robotics I, the first International symposium, 327
  9. Smith R, 1988, Proceedings of the International symposium on robotics research (ISRR), 467
  10. Thrun S, 2005, Probabilistic Robotics

Cited by

See all 27

Metadata

Authors
Williams, S., Indelman, V., Kaess, M., Roberts, R., Leonard, J. J., & Dellaert, F.
Affiliations
  • Georgia Institute of Technology (US)
  • Carnegie Mellon University (US)
  • MIT Computer Science and Artificial Intelligence Laboratory (US)
Venue
The International Journal of Robotics Research
Published
2014-07-14
Volume
33
Issue
12
Pages
1544-1568
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W1521090460
Cited by
2
References
38
Citations by year
2023: 1 · 2019: 1
FWCI
0.00
Type
journal article
Language
en
Open access
Licence
  • cc-by-nc-sa
  • journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
Locations
  • The International Journal of Robotics Research (publishedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc-sa)
  • SMARTech Repository (Georgia Institute of Technology) (submittedVersion)
  • Other univ. web domain
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotics and Sensor-Based Localization
  • Physical Sciences › Computer Science › Artificial Intelligence › Target Tracking and Data Fusion in Sensor Networks
  • Physical Sciences › Engineering › Aerospace Engineering › Inertial Sensor and Navigation
Keywords
loop closure constraints, factor graphs, Bayesian state estimation, real-time navigation, asynchronous inference, autonomous ground vehicles, aircraft navigation

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Concurrent filtering and smoothing: A parallel architecture for real-time navigation and full smoothing. https://app.cochat.ai/papers/10.1177/0278364914531056
The paper
Williams, S., Indelman, V., Kaess, M., Roberts, R., Leonard, J. J., & Dellaert, F. (2014). Concurrent filtering and smoothing: A parallel architecture for real-time navigation and full smoothing. The International Journal of Robotics Research. https://doi.org/10.1177/0278364914531056

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.