Yau-Yau非线性滤波算法的收敛性分析:概率视角
On the Convergence Analysis of Yau-Yau Nonlinear Filtering Algorithm: from a Probabilistic Perspective
AI总结:
本文从概率视角分析Yau-Yau非线性滤波算法的收敛性,通过估计近似误差期望,证明其可在宽松假设下以任意精度逼近条件均值和协方差矩阵。
摘要:
本世纪初,第三作者与其合作者在文献[1,2]中提出了一种无记忆非线性滤波问题的实时求解方法,后来被称为Yau-Yau算法。在过去二十年中,基于该框架提出并研究了大量非线性滤波算法。本文将推广原始工作中的结果,并从概率视角对Yau-Yau算法进行新颖的收敛性分析。我们不再考虑特定轨迹,而是估计近似误差的期望,并证明在假设条件非常宽松的一般非线性滤波系统中,条件分布的常用统计量(如条件均值和协方差矩阵)能够由Yau-Yau算法以任意精度准确近似。这种新颖的概率版本收敛性分析更契合现代随机控制理论的发展,并将为Yau-Yau算法的实际实现提供更有价值的理论指导。
英文摘要:
At the beginning of this century, a real time solution of the nonlinear filtering problem without memory was proposed in [1, 2] by the third author and his collaborator, and it is later on referred to as Yau-Yau algorithm. During the last two decades, a great many nonlinear filtering algorithms have been put forward and studied based on this framework. In this paper, we will generalize the results in the original works and conduct a novel convergence analysis of Yau-Yau algorithm from a probabilistic perspective. Instead of considering a particular trajectory, we estimate the expectation of the approximation error, and show that commonly-used statistics of the conditional distribution (such as conditional mean and covariance matrix) can be accurately approximated with arbitrary precision by Yau-Yau algorithm, for general nonlinear filtering systems with very liberal assumptions. This novel probabilistic version of convergence analysis is more compatible with the development of modern stochastic control theory, and will provide a more valuable theoretical guidance for practical implementations of Yau-Yau algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。