Reference : Distributed Kalman Filter with minimum-time covariance computation
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Multidisciplinary, general & others
http://hdl.handle.net/10993/20337
Distributed Kalman Filter with minimum-time covariance computation
English
Thia, Jerry []
Yuan, Ye mailto []
Shi, Ling []
Goncalves, Jorge mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
2013
The proceedings of the IEEE 52nd Annual Conference on Decision and Control
IEEE
1995 - 2000
Yes
978-1-4673-5714-2
IEEE 52nd Annual Conference on Decision and Control
December 10-13, 2013
Florence
Italy
[en] This paper considerably improves the well-known Distributed Kalman Filter (DKF) algorithm by Olfati-Saber (2007) by introducing a novel decentralised consensus value computation scheme, using only local observations of sensors. It has been shown that the state estimates obtained in [8] and [9] approaches those of the Central Kalman Filter (CKF) asymptotically. However, the convergence to the CKF can sometimes be too slow. This paper proposes an algorithm that enables every node in a sensor network to compute the global average consensus matrix of measurement noise covariance in minimum time without accessing global information. Compared with the algorithm in [8], our theoretical analysis and simulation results show that the new algorithm can offer improved performance in terms of time taken for the state estimates to converge to that of the CKF.
http://hdl.handle.net/10993/20337

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
Distributed Kalman Filter with minimum-time covariance computation.pdfPublisher postprint372.34 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.