Abstract
Aiming at the high computational complexity of particle filters, in order to reduce the number of samples, this paper proposes an improved particle filter based on subtractive clustering. Cluster vectors, composed of particles and their corresponding weights, are classified at a given radius through the improved sub-cluster algorithm presented by this paper, and then all the cluster vectors are replaced by the central vectors obtained from the classifying processing. Finally the central vectors are decomposed and the new particles and their weights are restructured. The simulation results show that the proposed algorithm maintains the performance of the general particle filters, and meanwhile keeps less number of samples and higher computational efficiency.
| Original language | English |
|---|---|
| Pages (from-to) | 427-431 |
| Number of pages | 5 |
| Journal | Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology |
| Volume | 42 |
| Issue number | 3 |
| State | Published - Mar 2010 |
| Externally published | Yes |
Keywords
- Computational efficiency
- Particle filter
- Subtractive clustering
Fingerprint
Dive into the research topics of 'Spatial subtractive clustering-based particle filter'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver