A Decomposition Approach for the Gain Function in the Feedback Particle Filter
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911572634370048 |
|---|---|
| author | Wang, Ruoyu Miao, Huimin Luo, Xue |
| author_facet | Wang, Ruoyu Miao, Huimin Luo, Xue |
| contents | The feedback particle filter (FPF) is an innovative, control-oriented and resampling-free adaptation of the traditional particle filter (PF). In the FPF, individual particles are regulated via a feedback gain, and the corresponding gain function serves as the solution to the Poisson's equation equipped with a probability-weighted Laplacian. Owing to the fact that closed-form expressions can only be computed under specific circumstances, approximate solutions are typically indispensable. This paper is centered around the development of a novel algorithm for approximating the gain function in the FPF. The fundamental concept lies in decomposing the Poisson's equation into two equations that can be precisely solved, provided that the observation function is a polynomial. A free parameter is astutely incorporated to guarantee exact solvability. The computational complexity of the proposed decomposition method shows a linear correlation with the number of particles and the polynomial degree of the observation function. We perform comprehensive numerical comparisons between our method, the PF, and the FPF using the constant-gain approximation and the kernel-based approach. Our decomposition method outperforms the PF and the FPF with constant-gain approximation in terms of accuracy. Additionally, it has the shortest CPU time among all the compared methods with comparable performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_23662 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Decomposition Approach for the Gain Function in the Feedback Particle Filter Wang, Ruoyu Miao, Huimin Luo, Xue Optimization and Control 93-08, 93E11 The feedback particle filter (FPF) is an innovative, control-oriented and resampling-free adaptation of the traditional particle filter (PF). In the FPF, individual particles are regulated via a feedback gain, and the corresponding gain function serves as the solution to the Poisson's equation equipped with a probability-weighted Laplacian. Owing to the fact that closed-form expressions can only be computed under specific circumstances, approximate solutions are typically indispensable. This paper is centered around the development of a novel algorithm for approximating the gain function in the FPF. The fundamental concept lies in decomposing the Poisson's equation into two equations that can be precisely solved, provided that the observation function is a polynomial. A free parameter is astutely incorporated to guarantee exact solvability. The computational complexity of the proposed decomposition method shows a linear correlation with the number of particles and the polynomial degree of the observation function. We perform comprehensive numerical comparisons between our method, the PF, and the FPF using the constant-gain approximation and the kernel-based approach. Our decomposition method outperforms the PF and the FPF with constant-gain approximation in terms of accuracy. Additionally, it has the shortest CPU time among all the compared methods with comparable performance. |
| title | A Decomposition Approach for the Gain Function in the Feedback Particle Filter |
| topic | Optimization and Control 93-08, 93E11 |
| url | https://arxiv.org/abs/2503.23662 |