In this paper we investigate how stability and optimality of consensus-based distributed filters depend on the number of consensus steps in a discrete-time setting for both directed and undirected graphs. By introducing two new algorithms, a simpler one based on dynamic averaging of the estimates and a more complex version where local error covariance matrices are exchanged as well, we are able to derive a complete theoretical analysis. In particular we show that dynamic averaging alone suffices to approximate the optimal centralized estimate if the number of consensus steps is large enough and that the number of consensus steps needed for stability can be computed in a distributed way. These results shed light on the advantages as well as the fundamental limitations shared by all the existing proposals for this class of algorithms in the basic case of linear time-invariant systems, that are relevant for the analysis of more complex situations.

A stability with optimality analysis of consensus-based distributed filters for discrete-time linear systems / Battilotti, S.; Cacace, F.; D’Angelo, M.. - In: AUTOMATICA. - ISSN 0005-1098. - 129:(2021). [10.1016/j.automatica.2021.109589]

A stability with optimality analysis of consensus-based distributed filters for discrete-time linear systems

S. Battilotti
;
M. d’Angelo
2021

Abstract

In this paper we investigate how stability and optimality of consensus-based distributed filters depend on the number of consensus steps in a discrete-time setting for both directed and undirected graphs. By introducing two new algorithms, a simpler one based on dynamic averaging of the estimates and a more complex version where local error covariance matrices are exchanged as well, we are able to derive a complete theoretical analysis. In particular we show that dynamic averaging alone suffices to approximate the optimal centralized estimate if the number of consensus steps is large enough and that the number of consensus steps needed for stability can be computed in a distributed way. These results shed light on the advantages as well as the fundamental limitations shared by all the existing proposals for this class of algorithms in the basic case of linear time-invariant systems, that are relevant for the analysis of more complex situations.
2021
Discrete time filters; Kalman filters; Filtering theory; Consensus filters;
01 Pubblicazione su rivista::01a Articolo in rivista
A stability with optimality analysis of consensus-based distributed filters for discrete-time linear systems / Battilotti, S.; Cacace, F.; D’Angelo, M.. - In: AUTOMATICA. - ISSN 0005-1098. - 129:(2021). [10.1016/j.automatica.2021.109589]
File allegati a questo prodotto
File Dimensione Formato  
Battilotti_preprint_A-stability_2021.pdf

accesso aperto

Note: https://doi.org/10.1016/j.automatica.2021.109589
Tipologia: Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza: Creative commons
Dimensione 389.69 kB
Formato Adobe PDF
389.69 kB Adobe PDF
Battilotti_A-stability_2021.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 816.81 kB
Formato Adobe PDF
816.81 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1533604
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 21
  • ???jsp.display-item.citation.isi??? 21
social impact