Abstract
This paper studies the distributed state estimation in sensor network, where <formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex>$m$</tex></formula> sensors are deployed to infer the <formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex>$n$</tex></formula> -dimensional state of a Linear Time-Invariant (LTI) Gaussian system. By a lossless decomposition of the optimal steady-state Kalman filter, we show that the problem of distributed estimation can be reformulated as that of the synchronization of homogeneous linear systems. Based on such decomposition, a distributed estimator is proposed, where each sensor node runs a local filter using only its own measurement, alongside with a consensus algorithm to fuse the local estimate of every node. We prove that the average of estimates from all sensors coincides with the optimal Kalman estimate, and under certain condition on the graph Laplacian matrix and the system matrix, the consensus error is bounded and the asymptotic error covariance is derived. As a result, the distributed estimator is stable for each single node. We further show that the proposed algorithm has a low message complexity of min( <formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex>$m$</tex></formula> , <formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex>$n$</tex></formula> n). Numerical examples are provided in the end to illustrate the efficiency of the proposed algorithm.
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call