Resampling algorithms for particle filters: a computational complexity perspective (Q1773796)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Resampling algorithms for particle filters: a computational complexity perspective |
scientific article |
Statements
Resampling algorithms for particle filters: a computational complexity perspective (English)
0 references
3 May 2005
0 references
Particle (sample) filters (PF) are used for tracking states of plants described by means of discrete-time dynamic state-space models. The main goal of this paper is the development of resampling methods that allow for increased speed of PF, require less memory, achieve timings regardless of the statistics of the samples, and that are computationally less complex. The resampling algorithms, replicating samples having large weights and removing samples with negligible weights, are based on stratified resampling. The computational complexity of the proposed resampling algorithms is evaluated.
0 references
particle filters
0 references
tracking
0 references
resampling methods
0 references
stratified resampling
0 references
computational complexity
0 references