Designing Consensus-Based Distributed Filtering over Directed Graphs
<|reference_start|>Designing Consensus-Based Distributed Filtering over Directed Graphs: This paper proposes a novel consensus-on-only-measurement distributed filter over directed graphs under the collectively observability condition. First, the distributed filter structure is designed with an augmented leader-following measurement fusion strategy. Subsequently, two parameter design methods are presented, and the consensus gain parameter is devised utilizing local information exclusively rather than global information. Additionally, the lower bound of the fusion step is derived to guarantee a uniformly upper bound of the estimation error covariance. Moreover, the lower bounds of the convergence rates of the steady-state performance gap between the proposed algorithm and the centralized filter are provided with the fusion step approaching infinity. The analysis demonstrates that the convergence rate is, at a minimum, as rapid as exponential convergence under the spectral norm condition of the communication graph. The transient performance is also analyzed with the fusion step tending to infinity. The inherent trade-off between the communication cost and the filtering performance is revealed from the analysis of the steady-state performance and the transient performance. Finally, the theoretical results are substantiated through the validation of two simulation examples.<|reference_end|>
@article{lyu2024designing,
    title={Designing Consensus-Based Distributed Filtering over Directed Graphs},
    author={Xiaoxu Lyu, Guanghui Wen, Yuezu Lv, Zhisheng Duan, and Ling Shi},
    journal={arXiv preprint arXiv:2408.06730},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.06730},
    primaryClass={eess.SY cs.SY}
}