An integration-free approach for particle flow filtering
一种无需积分的粒子流滤波方法
Domonkos Csuzdi, Tamás Bécsi, Olivér Törő
AI总结 本文提出了一种无需积分的粒子流滤波方法,通过将ODE转换为特定的本征空间,推导出闭合形式的代数表达式,并证明其等价于精确的卡尔曼测量更新,从而在非线性测量模型中实现了高效且稳定的粒子更新。
详情
Log-homotopy粒子流滤波器通过连续地将样本从先验分布迁移至后验分布来实现非线性贝叶斯估计。这种迁移由伪时间常微分方程(ODE)控制。这些滤波器的主要实际挑战是需要数值积分,这导致计算成本高且易出现刚性问题。本文开发了一种精确的、无需积分的闭合形式解,用于精确的Daum-Huang确定性粒子流,适用于向量线性高斯测量。通过将ODE转换为特定的本征空间,我们推导出同质状态转移矩阵和非同质激励项的闭合形式代数表达式。我们证明这种解析解等同于精确的卡尔曼测量更新。我们将这种闭合形式评估嵌入到N步分段方法中,用于非线性测量模型。我们进一步提出一个常数收缩率子步骤计划,使每一步在D的本征方向上的收缩率趋于相等。结果是一种能够缓解刚性的、无需积分的粒子更新方法,适用于高度非线性的测量模型。在仅靠轴承跟踪基准测试中,它在比较的滤波器中实现了最低的误差,每更新成本与确定性粒子流基线相当,远低于随机流。
Log-homotopy particle flow filters realize nonlinear Bayesian estimation by continuously migrating samples from the prior to the posterior distribution. This transport is governed by a pseudo-time ordinary differential equation (ODE). A major practical challenge of these filters is the need for numerical integration, which suffers from high computational cost and susceptibility to stiffness. This paper develops an exact, integration-free closed-form solution for the exact Daum--Huang deterministic particle flow under vector linear Gaussian measurements. By transforming the ODE into a specific eigenspace, we derive closed-form algebraic expressions for both the homogeneous state transition matrix and the inhomogeneous forcing term. We prove that this analytic solution is equivalent to the exact Kalman measurement update. We embed this closed-form evaluation within an $N$-step piecewise method for nonlinear measurement models. We further propose a constant contraction rate substep schedule that equalizes the per-step contraction along the eigendirection of $D$ associated with the largest eigenvalue $α_{\max}$. The result is a stiffness-mitigating, integration-free particle update for highly nonlinear measurement models. On a bearings-only tracking benchmark, it achieves the lowest error among the compared filters, at a per-update cost comparable to deterministic particle flow baselines and substantially lower than stochastic flows.