View in EDS

A distributed Kalman filtering algorithm with a fast convergence rate for networked systems with multiplicative noise.

Saved in:
Bibliographic Details
Title: A distributed Kalman filtering algorithm with a fast convergence rate for networked systems with multiplicative noise.
Authors: Yang, Qiqi1 (AUTHOR) yangqiqi23@sdjzu.edu.cn, Zhang, Huanshui2 (AUTHOR), Fu, Minyue3 (AUTHOR) brianfu2106@outlook.com
Source: Asian Journal of Control. May2026, Vol. 28 Issue 3, p1396-1409. 14p.
Subject Terms: *Kalman filtering, *Message passing (Computer science), *Directed acyclic graphs, *Signal-to-noise ratio, *Graph theory, *Multiagent systems
Abstract: This article studies a distributed Kalman filtering (DKF) algorithm with a fast convergence rate, based on a networked system with multiplicative noise. Each node involved in the distributed estimation can independently compute the optimal state estimate using its local measurements and by exchanging information with neighboring nodes. First, a DKF algorithm is proposed based on the idea of a message‐passing algorithm. Subsequently, the convergence of this DKF algorithm in a finite number of steps for acyclic graphs is given. Moreover, the equivalence between cyclic and acyclic graphs is demonstrated using the depth‐first search algorithm, thereby illustrating its convergence for general topological graphs. Finally, three examples are provided to demonstrate that this distributed algorithm can converge to the central Kalman filter estimate. Compared to other distributed algorithms, it exhibits faster convergence. [ABSTRACT FROM AUTHOR]
Database: Energy & Power Source
Description
Abstract:This article studies a distributed Kalman filtering (DKF) algorithm with a fast convergence rate, based on a networked system with multiplicative noise. Each node involved in the distributed estimation can independently compute the optimal state estimate using its local measurements and by exchanging information with neighboring nodes. First, a DKF algorithm is proposed based on the idea of a message‐passing algorithm. Subsequently, the convergence of this DKF algorithm in a finite number of steps for acyclic graphs is given. Moreover, the equivalence between cyclic and acyclic graphs is demonstrated using the depth‐first search algorithm, thereby illustrating its convergence for general topological graphs. Finally, three examples are provided to demonstrate that this distributed algorithm can converge to the central Kalman filter estimate. Compared to other distributed algorithms, it exhibits faster convergence. [ABSTRACT FROM AUTHOR]
ISSN:15618625
DOI:10.1002/asjc.3746