A new condition for asymptotic consensus over switching graphs. (November 2018)

• Record Type: Journal Article
• Authors: Chowdhury, Nilanjan Roy; Sukumar, Srikant; Chatterjee, Debasish
• Is Part Of: Automatica. Volume 97(2018)
• Page Start: 18
• Page End: 26
• Publication Date: 2018-11
• Subjects: Multiagent systems -- Asymptotic consensus -- Switched systems; Automatic control -- Periodicals; Automation -- Periodicals; 629.805
• DOI: 10.1016/j.automatica.2018.07.018
• Languages: English
• ISSNs: 0005-1098

Abstract

Abstract: We investigate asymptotic consensus of linear systems under a class of switching communication graphs. We significantly relax several reciprocity and connectivity assumptions prevalent in the consensus literature by employing switched-systems techniques to establish consensus. Our results rely solely on asymptotic properties of the switching communication graphs in contrast to classical average dwell-time conditions. A bound on the uniform rate of convergence to consensus is also established as part of this work.