arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1902.07263math.OCcs.NAmath.NAmath.PR
收藏

基于扩散图的反馈粒子滤波器中增益函数近似算法

Diffusion map-based algorithm for Gain function approximation in the Feedback Particle Filter

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);University of Florida(佛罗里达大学)

Amirhossein Taghvaei, Prashant G. Mehta, Sean P. Meyn

AI总结:

本文提出了一种基于扩散图的算法,用于近似反馈粒子滤波器中的增益函数,通过严谨的误差分析,探讨了该算法的偏差和方差,并通过数值实验验证了问题维度和样本量对误差的影响。

摘要:

反馈粒子滤波器(FPF)是一种用于连续时间非线性滤波问题数值解的算法。在任何FPF算法的数值实现中,主要挑战是数值近似所谓的增益函数。本文提出了一种用于增益函数近似的数值算法。精确的增益函数是解一个涉及概率加权拉普拉斯算子Δ_ρ的泊松方程的解。数值问题是使用仅有限数量的从概率分布ρ中采样的粒子来近似该解。作者在先前工作中提出了一种基于扩散图的算法来解决这个问题。该算法因此得名,因为它在中间步骤中涉及对精确半群e^{Δ_ρ}的扩散图近似。本文的主要贡献是进行了扩散图算法的严谨误差分析。误差被证明包括两个组成部分:偏差和方差。偏差来自于对精确半群的扩散图近似。方差则源于有限样本量。推导了偏差和方差的尺度和上界。这些界限随后通过数值实验加以说明,以强调问题维度和样本量的影响。所提出的算法应用于两个滤波示例,并与顺序重要性重采样(SIR)粒子滤波器进行了比较。

英文摘要:

Feedback particle filter (FPF) is a numerical algorithm to approximate the solution of the nonlinear filtering problem in continuous-time settings. In any numerical implementation of the FPF algorithm, the main challenge is to numerically approximate the so-called gain function. A numerical algorithm for gain function approximation is the subject of this paper. The exact gain function is the solution of a Poisson equation involving a probability-weighted Laplacian $Δ_ρ$. The numerical problem is to approximate this solution using {\em only} finitely many particles sampled from the probability distribution $ρ$. A diffusion map-based algorithm was proposed by the authors in a prior work to solve this problem. The algorithm is named as such because it involves, as an intermediate step, a diffusion map approximation of the exact semigroup $e^{Δ_ρ}$. The original contribution of this paper is to carry out a rigorous error analysis of the diffusion map-based algorithm. The error is shown to include two components: bias and variance. The bias results from the diffusion map approximation of the exact semigroup. The variance arises because of finite sample size. Scalings and upper bounds are derived for bias and variance. These bounds are then illustrated with numerical experiments that serve to emphasize the effects of problem dimension and sample size. The proposed algorithm is applied to two filtering examples and comparisons provided with the sequential importance resampling (SIR) particle filter.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑