The DOI matches its Crossref record; 81 of the 81 references it cites were found in a registry or an index.
Adapting the Sample Size in Particle Filters Through KLD-Sampling
Abstract
Over the past few years, particle filters have been applied with great success to a variety of state estimation problems. In this paper we present a statistical approach to increasing the efficiency of particle filters by adapting the size of sample sets during the estimation process. The key idea of the KLD-sampling method is to bound the approximation error introduced by the sample-based representation of the particle filter. The name KLD-sampling is due to the fact that we measure the approximation error using the Kullback-Leibler distance. Our adaptation approach chooses a small number of samples if the density is focused on a small part of the state space, and it chooses a large number of samples if the state uncertainty is high. Both the implementation and computation overhead of this approach are small. Extensive experiments using mobile robot localization as a test application show that our approach yields drastic improvements over particle filters with fixed sample set sizes and over a previously introduced adaptation technique.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
A tutorial on particle filters for online nonlinear/non-Gaussian Bayesian tracking
Arulampalam, M. S., Maskell, S., Gordon, N., & Clapp, T. (2002) · IEEE Transactions on Signal Processing · doi:10.1109/78.978374 · Cited by 11,502
Continuous Univariate Distributions.
Omori, Y., Johnson, N. L., Kotz, S., & Balakrishnan, N. (1995) · Journal of the American Statistical Association · doi:10.2307/2291547 · Cited by 9,084
Sequential Monte Carlo Methods in Practice
(2001) · Springer eBooks · doi:10.1007/978-1-4757-3437-9 · Cited by 7,366
GELB, A. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 6,405
New extension of the Kalman filter to nonlinear systems
Julier, S. J., & Uhlmann, J. K. (1997) · SPIE Proceedings · doi:10.1117/12.280797 · Cited by 5,331
CONDENSATION—Conditional Density Propagation for Visual Tracking
Isard, M., & Blake, A. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008078328650 · Cited by 4,886
On sequential Monte Carlo sampling methods for Bayesian filtering
Doucet, A., Godsill, S., & Andrieu, C. (2000) · Statistics and Computing · doi:10.1023/a:1008935410038 · Cited by 4,411
The unscented Kalman filter for nonlinear estimation
Wan, E. A., & Van Der Merwe, R. (2002) · Proceedings of the IEEE 2000 Adaptive Systems for Signal Processing, Communications, and Control Symposium (Cat. No.00EX373) · doi:10.1109/asspcc.2000.882463 · Cited by 4,001
Cited by
Design and use paradigms for gazebo, an open-source multi-robot simulator
Koenig, N., & Howard, A. (2005) · 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566) · doi:10.1109/iros.2004.1389727 · Cited by 3,638
Bayesian filtering for location estimation
Fox, D., Hightower, J., Liao, L., Schulz, D., & Borriello, G. (2003) · IEEE Pervasive Computing · doi:10.1109/mprv.2003.1228524 · Cited by 711
Self-citationResampling Methods for Particle Filtering: Classification, implementation, and strategies
Li, T., Bolic, M., & Djuric, P. M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2330626 · Cited by 601
Pedestrian localisation for indoor environments
Woodman, O., & Harle, R. (2008) · Proceedings of the 10th international conference on Ubiquitous computing · doi:10.1145/1409635.1409651 · Cited by 486
Particle filter-based prognostics: Review, discussion and perspectives
Jouin, M., Gouriveau, R., Hissel, D., Péra, M.-C., & Zerhouni, N. (2016) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2015.11.008 · Cited by 354
Distributed Multirobot Exploration and Mapping
Fox, D., Ko, J., Konolige, K., Limketkai, B., Schulz, D., & Stewart, B. (2006) · Proceedings of the IEEE · doi:10.1109/jproc.2006.876927 · Cited by 344
“Particle filters have been applied with great success to this problem [7], [8], [15], [21].”
BackgroundSelf-citationA Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers
Placed, J. A., Strader, J., Carrillo, H., Atanasov, N., Indelman, V., Carlone, L., & Castellanos, J. A. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2023.3248510 · Cited by 332
Fight sample degeneracy and impoverishment in particle filters: A review of intelligent approaches
Li, T., Sun, S., Sattar, T. P., & Corchado, J. M. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.12.031 · Cited by 257
Decision-making authority, team efficiency and human worker satisfaction in mixed human–robot teams
Gombolay, M. C., Gutierrez, R. A., Clarke, S. G., Sturla, G. F., & Shah, J. A. (2015) · Autonomous Robots · doi:10.1007/s10514-015-9457-9 · Cited by 256
Active SLAM and Exploration with Particle Filters Using Kullback-Leibler Divergence
Carlone, L., Du, J., Kaouk Ng, M., Bona, B., & Indri, M. (2014) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-013-9981-9 · Cited by 94
“The problem of quantifying the quality of the particle-based approximation was firstly addressed by Fox [28] with application to Monte Carlo Localization (MCL); Fox applied the Kullback-Leibler divergence (KLD) ξ( p 1 , p 2 ) , which is a measure of fit between two probability distributions p 1 , p 2 , to derive the n…”
Method
Metadata
- Authors
- Fox, D.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2003-12
- Volume
- 22
- Issue
- 12
- Pages
- 985-1003
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W1973876344
- Cited by
- 725
- References
- 81
- FWCI
- 19.79
- Type
- journal article
- Language
- en
- Open access
- closed
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.