Aiming at the problem of distributed state estimation in sensor networks, a novel optimal distributed finite-time fusion filtering method based on dynamic communication weights has been developed. To tackle the fusion errors caused by incomplete node information in distributed sensor networks, the concept of limited iterations of global information aggregation was introduced, namely, fast finite-time convergence techniques. Firstly, a local filtering algorithm architecture was constructed to achieve fusion error convergence within a limited number of iterations. The maximum number of iterations was derived to be the diameter of the communication topology graph in the sensor network. Based on this, the matrix weight fusion was used to combine the local filtering results, thereby achieving optimal estimation in terms of minimum variance. Next, by introducing the generalized information quality (GIQ) calculation method and associating it with the local fusion result bias, the relative communication weights were obtained and embedded in the fusion algorithm. Finally, the effectiveness and feasibility of the proposed algorithm were validated through numerical simulations and experimental tests.
Keywords: distributed Kalman filter; dynamic communication weight; finite-time consensus; sensor networks.