Linear Consensus Algorithms Based on Balanced Asymmetric Chains

2012/04/27 by Sadegh Bolouki, Bolouki, Sadegh, Roland P. Malhame +1
Computer Science · Engineering · Mathematics · #Dynamical Systems (math.DS) #FOS: Electrical engineering #FOS: Mathematics #Optimization and Control (math.OC) #Systems and Control (eess.SY) #cs.SY #eess.SY #electronic engineering #information engineering #math.DS #math.OC

paper · pdf · doi:10.48550/arxiv.1204.6093

15 pages

arxiv created 2013/03/26 · arxiv updated 2020/08/04

Abstract

Multi agent consensus algorithms with update steps based on so-called balanced asymmetric chains, are analyzed. For such algorithms it is shown that (i) the set of accumulation points of states is finite, (ii) the asymptotic unconditional occurrence of single consensus or multiple consensuses is directly related to the property of absolute infinite flow for the underlying update chain. The results are applied to well known consensus models.

Related

• Theorems about Ergodicity and Class-Ergodicity of Chains with Applications in Known Consensus Models
• Tight Bounds for Asymptotic and Approximate Consensus
• Consensus with Linear Objective Maps
• Consensus with Output Saturations
• Consensus in continuous-time multi-agent systems under discontinuous nonlinear protocols