2016 IEEE 55th Conference on Decision and Control (CDC) 2016
DOI: 10.1109/cdc.2016.7799105
|View full text |Cite
|
Sign up to set email alerts
|

Gain function approximation in the feedback particle filter

Abstract: Abstract-This paper is concerned with numerical algorithms for gain function approximation in the feedback particle filter. The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian. The problem is to approximate this solution using only particles sampled from the probability distribution. Two algorithms are presented: a Galerkin algorithm and a kernel-based algorithm. Both the algorithms are adapted to the samples and do not require approximation of the probabili… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3

Relationship

3
4

Authors

Journals

citations
Cited by 24 publications
(21 citation statements)
references
References 68 publications
0
21
0
Order By: Relevance
“…Here we instead follow the presentation of Taghvaei and Mehta (2016) and Taghvaei et al (2017) and assume that we have M samples z i from a PDF π. The method is based on Since T reproduces constant functions, (155) determines φ i up to a constant contribution, which we fix by requiring for tackling this problem.…”
Section: Discussionmentioning
confidence: 99%
“…Here we instead follow the presentation of Taghvaei and Mehta (2016) and Taghvaei et al (2017) and assume that we have M samples z i from a PDF π. The method is based on Since T reproduces constant functions, (155) determines φ i up to a constant contribution, which we fix by requiring for tackling this problem.…”
Section: Discussionmentioning
confidence: 99%
“…For the purposes of this article, the question of how to optimally estimate the gain shall be left aside and we refer to e.g. [9], [10], [11] and the references therein. The aim is to show that the construction of an FPF-like algorithm for point processes can be fully reduced to the same types of equations as for the FPF gain, i.e.…”
Section: E Uniqueness Approximation and Estimation Of The Gainmentioning
confidence: 99%
“…In the following, we present a recent approach from [48] whose attractive feature is that it does not involve selection of basis functions. In the numerical results presented in Sec.…”
Section: Basis Functions On So(2)mentioning
confidence: 99%
“…For the second term on the right hand side of (47), taking A in (48) to be V α · f (X i t ) and B to be B α,i t ,…”
mentioning
confidence: 99%