The paper proposes new consensus protocols for the agreement problem in networks of agents with a discrete time model. A new class of consensus algorithms is introduced on the basis of the positive splitting of the standard iteration matrix. In the framework of non negative matrix theory, some results are proved to guarantee the convergence of the proposed algorithms. In addition, numerous numerical experiments show that the proposed iterative schemes enjoy good rate of convergence even in the cases in which the standard iterative algorithms do not guarantee good performances
New Consensus Algorithms Based on a Positive Splitting Approach / V., Boschian; Fanti, Maria Pia; Mangini, Agostino Marcello; W., Ukovich. - STAMPA. - (2011), pp. 6636-6641. (Intervento presentato al convegno 50th IEEE Conference on Decision and Control and European Control Conference, CDC-ECC 2011 tenutosi a Orlando, FL nel December 12-15, 2011) [10.1109/CDC.2011.6160711].
New Consensus Algorithms Based on a Positive Splitting Approach
FANTI, Maria Pia;MANGINI, Agostino Marcello;
2011-01-01
Abstract
The paper proposes new consensus protocols for the agreement problem in networks of agents with a discrete time model. A new class of consensus algorithms is introduced on the basis of the positive splitting of the standard iteration matrix. In the framework of non negative matrix theory, some results are proved to guarantee the convergence of the proposed algorithms. In addition, numerous numerical experiments show that the proposed iterative schemes enjoy good rate of convergence even in the cases in which the standard iterative algorithms do not guarantee good performancesI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
