Average Consensus by Graph Filtering: New Approach, Explicit Convergence Rate, and Optimal Design

DOI10.1109/TAC.2019.2907410zbMath1483.93013arXiv1808.01418OpenAlexW2887308905WikidataQ128127705 ScholiaQ128127705MaRDI QIDQ5211325

Jingxin Zhang, Jing-Wen Yi, Li Chai

Publication date: 28 January 2020

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.01418

Mathematics Subject Classification ID

Applications of graph theory (05C90) Discrete-time control/observation systems (93C55) Decentralized systems (93A14) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Consensus (93D50)

Related Items (4)

Consensus-based distributed filtering with fusion step analysis ⋮ Discrete time‐delay multiagent networks: Pseudo‐predictor, full‐order, and reduced‐order observer ⋮ On fast queue consensus of discrete-time second-order multi-agent networks over directed topologies ⋮ Fastest containment control of discrete-time multi-agent systems using static linear feedback protocol

This page was built for publication: Average Consensus by Graph Filtering: New Approach, Explicit Convergence Rate, and Optimal Design