海量数据集上的分布式Kalman滤波:随机Riccati方程的大偏差分析
Distributed Kalman Filtering over Massive Data Sets: Analysis Through Large Deviations of Random Riccati Equations
摘要:
本文研究了潜在不稳定线性动态大系统分布式Kalman滤波中估计误差过程的收敛性和相应不变测度的刻画。提出了一种称为改进的Gossip交互式卡尔曼滤波(M-GIKF)的流言网络协议,其中传感器交换它们的滤波状态(估计和误差协方差),并通过速率为$\overlineγ$的传感器间通信传播它们的观测; $\overlineγ$被定义为每个信号演化时期传感器间消息通道的平均数量。被过滤的状态被解释为随机粒子交换通过本地相互作用。本文证明了M-GIKF下每个传感器的条件估计误差协方差序列演化为具有马尔可夫调制切换的随机Riccati方程(RRE)。通过将RRE公式化为随机动力系统,表明网络实现了弱共识,即,在随机选择的传感器处的条件估计误差协方差弱地(在分布中)收敛到唯一不变测量。此外,它被证明,作为$\overlineγ \rightarrow \infty$这个不变的措施满足大偏差(LD)的上限和下限,这意味着该措施指数快速收敛(概率)的狄拉克措施$δ_{P^*}$,其中$P^*$是稳定的误差协方差的集中式(卡尔曼)滤波设置。LD的结果回答了一个基本问题,如何量化的速度,分布式方案接近集中式的性能作为传感器间的通信速率的增加。
英文摘要:
This paper studies the convergence of the estimation error process and the characterization of the corresponding invariant measure in distributed Kalman filtering for potentially unstable and large linear dynamic systems. A gossip network protocol termed Modified Gossip Interactive Kalman Filtering (M-GIKF) is proposed, where sensors exchange their filtered states (estimates and error covariances) and propagate their observations via inter-sensor communications of rate $\overlineγ$; $\overlineγ$ is defined as the averaged number of inter-sensor message passages per signal evolution epoch. The filtered states are interpreted as stochastic particles swapped through local interaction. The paper shows that the conditional estimation error covariance sequence at each sensor under M-GIKF evolves as a random Riccati equation (RRE) with Markov modulated switching. By formulating the RRE as a random dynamical system, it is shown that the network achieves weak consensus, i.e., the conditional estimation error covariance at a randomly selected sensor converges weakly (in distribution) to a unique invariant measure. Further, it is proved that as $\overlineγ \rightarrow \infty$ this invariant measure satisfies the Large Deviation (LD) upper and lower bounds, implying that this measure converges exponentially fast (in probability) to the Dirac measure $δ_{P^*}$, where $P^*$ is the stable error covariance of the centralized (Kalman) filtering setup. The LD results answer a fundamental question on how to quantify the rate at which the distributed scheme approaches the centralized performance as the inter-sensor communication rate increases.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。