Polynomial Filtering for Fast Convergence in Distributed Consensus

DOI10.1109/TSP.2008.2006147zbMath1391.94898arXiv0802.3992OpenAlexW2122624829MaRDI QIDQ4571527

Effrosyni Kokiopoulou, Pascal Frossard

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Analytic circuit theory (94C05)

Related Items (12)

Distributed filtering in sensor networks with randomly occurring saturations and successive packet dropouts ⋮ An anticipatory protocol to reach fast consensus in multi-agent systems ⋮ On fast queue consensus of discrete-time second-order multi-agent networks over directed topologies ⋮ Accelerating distributed average consensus by exploring the information of second-order neighbors ⋮ Linear Time Average Consensus and Distributed Optimization on Fixed Graphs ⋮ Synchronization of multi-agent systems with delayed control input information from neighbors ⋮ Fast convergent average consensus of multiagent systems based on community detection algorithm ⋮ Average consensus in multiagent systems with the problem of packet losses when using the second-order neighbors' information ⋮ Asynchronous communication under reliable and unreliable network topologies in distributed multiagent systems: a robust technique for computing average consensus ⋮ Event-triggered control for multiagent systems with the problem of packet losses and communication delays when using the second-order neighbors' information ⋮ A new class of consensus protocols for agent networks with discrete time dynamics ⋮ Characterizing limits and opportunities in speeding up Markov chain mixing

This page was built for publication: Polynomial Filtering for Fast Convergence in Distributed Consensus