Average consensus on strongly connected weighted digraphs: A generalized error bound

• Eduardo Montijano ^[1] ; Andrea Gasparri ^[2] ; Attilio Priolo ^[2] ; Carlos Sagues ^[1]
  1. [1] Universidad de Zaragoza

     Universidad de Zaragoza

     Zaragoza, España

     
  2. [2] Roma Tre University

     Roma Tre University

     Roma Capitale, Italia

     
• Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 58, 2015, págs. 1-4
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • This technical communique represents a generalization of the convergence analysis for the consensus algorithm proposed in Priolo et al. (2014). Although the consensus was reached for any strongly connected weighted digraphs (SCWD), the convergence analysis provided in Priolo et al. (2014) was only valid for diagonalizable matrices encoding a SCWD. The result we present here generalizes the previous one to all possible matrices encoding a SCWD that can be used in the algorithm.