Simultaneous Localisation and Mapping in Dynamic Environments (SLAMIDE) with Reversible Data Associa
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
The conventional technique for dealing with dynamic objects in SLAM is to detect them and then either treat them as outliers [20][1] or track them separately using traditional multi-target tracking [18].We propose a technique that combines the least-squares formulation of SLAM and sliding window optimisation together with generalised expectation maximisation, to incorporate both dynamic and stationary objects directly into SLAM estimation.The sliding window allows us to postpone the commitment of model selection and data association decisions by delaying when they are marginalised permanently into the estimate.The two main contributions of this paper are thus: (i) using reversible model selection to include dynamic objects into SLAM and (ii) incorporating reversible data association.We show empirically that (i) if dynamic objects are present our method can include them in a single framework and hence maintain a consistent estimate and (ii) our estimator remains consistent when data association is difficult, for instance in the presence of clutter.We summarise the results of detailed and extensive tests of our method against various benchmark algorithms, showing its effectiveness.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Estimation with Applications to Tracking and Navigation: Theory, Algorithms and Software
Bar‐Shalom, Y., Li, X. ‐., & Kirubarajan, T. (2002) · doi:10.1002/0471221279 · Cited by 6,782
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
A View of the Em Algorithm that Justifies Incremental, Sparse, and other Variants
Neal, R. M., & Hinton, G. E. (1998) · Learning in Graphical Models · doi:10.1007/978-94-011-5014-9_12 · Cited by 2,187 · cited 3×
“We also treat data association as a discrete optimisation, but include model selection and propose an alternative method that uses sliding window optimisation and generalised expectation maximisation [13](more specifically an approximate method called classification expectation maximisation [3]).”
BackgroundMethod
Cited by
Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age
Cadena, C., Carlone, L., Carrillo, H., Latif, Y., Scaramuzza, D., Neira, J., Reid, I. D., & Leonard, J. J. (2016) · Zurich Open Repository and Archive (University of Zurich) · doi:10.5167/uzh-138892 · Cited by 3,048
Self-citationA mobile vision system for robust multi-person tracking
Ess, A., Leibe, B., Schindler, K., & Van Gool, L. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587581 · Cited by 721
Stable multi-target tracking in real-time surveillance video
Benfold, B., & Reid, I. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995667 · Cited by 651
Self-citationCoSLAM: Collaborative Visual SLAM in Dynamic Environments
Zou, D., & Tan, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.104 · Cited by 382
Xiao, L., Wang, J., Qiu, X., Rong, Z., & Zou, X. (2019) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2019.03.012 · Cited by 348
Metadata
- Authors
- Bibby, C., & Reid, I.
- Venue
- Robotics: Science and Systems III
- Published
- 2007-06-27
- OpenAlex
- W1232539894
- Cited by
- 75
- References
- 3
- FWCI
- 14.66
- Type
- conference paper
- Language
- en
- Open access
- gold
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
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.