提出单轮通信的多智能体状态估计算法,兼顾精度与隐私。
Decentralized Input and State Estimation for Multi-agent System with Dynamic Topology and Heterogeneous Sensor Network
- 基于信息滤波分解与协方差交集融合输入
- 仅需一次通信迭代即达最优无偏估计
- 适用于拓扑动态变化的异构传感器网络
异构传感器网络中动态拓扑下的状态估计是去中心化系统的核心挑战,尤其在未知输入条件下。现有共识算法常需多次通信以保证精度,导致信息交换量大且隐私泄露风险高。本文提出一种高效算法,通过信息滤波分解与协方差交集融合输入,实现与全局信息滤波相当的无偏最优估计。该方法仅需一轮通信交换个体估计值,无需共享观测数据或系统方程,有效保护隐私。针对动态拓扑带来的间歇观测与不完整估计问题,设计了两项实用策略以提升鲁棒性与准确性。在静态与动态环境下的实验及消融研究均表明,本算法性能优于其他基线,甚至媲美具有全局邻居视图的算法。
原文摘要 · Abstract (English)
A crucial challenge in decentralized systems is state estimation in the presence of unknown inputs, particularly within heterogeneous sensor networks with dynamic topologies. While numerous consensus algorithms have been introduced, they often require extensive information exchange or multiple communication iterations to ensure estimation accuracy. This paper proposes an efficient algorithm that achieves an unbiased and optimal solution comparable to filters with full information about other agents. This is accomplished through the use of information filter decomposition and the fusion of inputs via covariance intersection. Our method requires only a single communication iteration for exchanging individual estimates between agents, instead of multiple rounds of information exchange, thus preserving agents' privacy by avoiding the sharing of explicit observations and system equations. Furthermore, to address the challenges posed by dynamic communication topologies, we propose two practical strategies to handle issues arising from intermittent observations and incomplete state estimation, thereby enhancing the robustness and accuracy of the estimation process. Experiments and ablation studies conducted in both stationary and dynamic environments demonstrate the superiority of our algorithm over other baselines. Notably, it performs as well as, or even better than, algorithms that have a global view of all neighbors.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。