A new condition for asymptotic consensus over switching graphs

• Autores: Nilanjan Roy Chowdhury, Srikant Sukumar, Debasish Chatterjee
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Nº. 97, 2018, págs. 18-26
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.