[论文解读] Information-driven Fully Distributed Kalman Filter for Sensor Networks in Presence of Naive Nodes

Shaocheng Wang, Wei Ren+1 more|arXiv (Cornell University)|Oct 1, 2014

Distributed Control Multi-Agent Systems参考文献 6被引用 13

一句话总结

本文提出了一种信息驱动的全分布式卡尔曼滤波器（IFDKF），这是一种新型的分布式估计算法，适用于传感器网络，无需依赖全局信息（如网络规模或最大节点度数）。通过使用基于广义测量的局部加权最小二乘估计器——包括本地估计值和邻居数据——IFDKF有效缓解了非智能节点（即未观测目标或其邻居的节点）导致的性能下降，在动态拓扑结构和节点故障情况下，相较于现有基于一致性滤波器（如ICF和GKCF），表现出更优的跟踪精度和鲁棒性。

ABSTRACT

We consider the distributed Kalman filtering problem for sensor networks where each node takes the measurement, communicates with its local neighbors, and updates its local estimate and estimation error covariance at the same frequency. In such a scenario, if the target is not directly observed by neither a certain node nor its local neighbors, this node is naive about the target. The well-known Kalman Consensus filter (KCF) has been shown to perform well if there exists no naive node in the network. The case in presence of naive nodes has been considered by the generalized KCF (GKCF) and the Information Weighted Consensus filter (ICF) later on. However, all these consensus-embedded filters require some global information such as the maximum degree of the graph, or the total number of the nodes. If these global information are changing over the time, such as time-varying topologies or unexpected sensor failures in the network, the performance of the GKCF or the ICF might be degraded. With communication topology changes, node failures, or addition of new nodes, the filter performance would be adversely affected. In this paper, we consider a novel local Weighted Least Square estimator for each node that utilizes its generalized measurement formed by not only its own and local neighbors' measurements but their prior local estimates to track the target. With some approximations in the derivation of the covariance matrix, we propose the Information-driven Fully Distributed Kalman filter (IFDKF), which is able to deal with the existence of naive nodes without knowing any global information. Experimental results show that the proposed algorithm performs better than the existing algorithms in the considered realistic scenario.

研究动机与目标

• 解决现有分布式卡尔曼滤波器在传感器网络中存在非智能节点（即未观测目标或其邻居的节点）时性能下降的问题。
• 开发一种不依赖于全局信息（如总节点数、最大节点度数或一致性步长）的分布式滤波算法。
• 在无需重新配置或参数调整的情况下，确保对动态网络变化（包括拓扑变化、节点故障和新增）具有鲁棒性。
• 即使在存在非智能节点和网络条件变化的情况下，也能实现接近集中式最优解的估计性能。

提出的方法

• 每个节点执行本地测量，与相邻节点通信，并实时更新其本地状态估计值和误差协方差。
• 基于将节点自身测量与邻居的先前本地估计值相结合的广义测量，构建局部加权最小二乘估计器。
• 通过信息论原理近似误差协方差矩阵，实现在无需全局知识情况下的全分布式计算。
• 滤波器设计结合了信息加权一致性原理，根据局部估计不确定性动态调整影响权重，而非使用固定权重。
• 通过推导自适应于网络变化并保持一致性的局部更新规则，避免对全局参数的依赖。
• 理论分析与仿真验证了该滤波器在各种网络动态条件下的稳定性、最优性和收敛性。

实验结果

研究问题

• RQ1 如何使分布式卡尔曼滤波对未观测目标或其邻居的非智能节点具有鲁棒性？
• RQ2 能否设计一种无需依赖全局网络参数（如总节点数或最大节点度数）的全分布式卡尔曼滤波器？
• RQ3 所提出的算法在拓扑变化或节点故障等动态网络变化下如何保持性能？
• RQ4 在真实且动态的场景中，所提出的IFDKF相较于现有滤波器（如ICF、GKCF和KCF）的相对性能如何？

主要发现

• 在存在非智能节点的情况下，IFDKF的稳态平均绝对误差低于ICF和GKCF，证明了其更优的跟踪精度。
• 在k=90处出现过程噪声扰动后，IFDKF比ICF具有更快的收敛速度，表现出更优的瞬态响应性能。
• 在k=65处网络拓扑发生变化时，IFDKF保持了稳定的性能，而ICF因过时的一致性参数ε未随新最大度数调整而性能下降。
• 在k=65处发生节点故障（节点5和6失效）后，IFDKF收敛至集中式最优解，而ICF因未更新的全局参数导致邻居置信度被高估而无法收敛。
• IFDKF在动态条件下表现出一致的性能，证明了其无需重新配置或全局信息即可实现自适应与鲁棒性。