RESUMO
This article proposes a data-driven distributed filtering method based on the consensus protocol and information-weighted strategy for discrete-time sensor networks with switching topologies. By introducing a data-driven method, a linear-like state equation is designed by utilizing only the input and output (I/O) data without a controlled object model. In the identification step, data-driven adaptive optimization recursive identification (DD-AORI) is exploited to identify the recurrence of time-varying parameters. It is proved that for discrete-time switching networks, estimation errors of all nodes are ultimately bounded when data-driven distributed information-weighted consensus filtering (DD-DICF) is executed. The algorithm combines with the received neighbors and direct or indirect observations for the target node to produce modified gains, resulting in a novel state estimator containing an information interaction mechanism. Subsequently, convergence analysis is performed on the basis of the Lyapunov equation to guarantee the boundedness of DD-DICF estimate error. Simulations verify the performance of the DD-DICF against the theoretical results as well as in comparison with some existing filtering algorithms.
