Optimal sampling time for consensus in time-delayed networked systems

Optimal sampling time for consensus in time-delayed networked systems

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Control Theory & Applications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

In this study, a method is presented to compute the optimal sampling time in a network such that consensus is reached with a minimum number of iterations. In particular, the authors analyse a network composed of N first-order agents with communication delays. The communication is done in discrete time, sampling all the signals associated with every agent at the same sampling time, taking into account the existence of a time delay. The authors look for the optimal sampling time such that consensus is reached in a minimum number of iterations, which minimises the communication cost, in terms of energy and bandwidth. The analysis is performed by minimising an objective function that takes into account a measure of the convergence rate to reach a consensus. This objective function mainly depends on the eigenvalues of the sampled transition matrix of the system. The method can be applied to medium/large-scale networks, since it requires computing the eigenvalues of the adjacency matrix just once. Finally, a case study is presented based on the torus topology, where the interconnection of 100 agents is analysed, and we obtain the optimal sampling time to reach consensus with and without communication delay.


    1. 1)
      • Tsitsiklis, J.: `Problems in decentralized decision making and computation', 1984, PhD, MIT, Department of EECs.
    2. 2)
    3. 3)
    4. 4)
      • Blondel, V., Hendrickx, J.M., Olshevsky, A., Tsitsiklis, J.N.: `Convergence in multi-agent coordination, consensus, and flocking', 44thIEEE Conf. Decision and Control and European Control Conf. (CDC-ECC ’05), 2005, p. 2996–3000.
    5. 5)
      • Seuret, A., Dimarogonas, D.V., Johansson, K.: `Consensus under communication delays', 47thIEEE Conf. Decision and Control, 2008.
    6. 6)
      • Seuret, A., Dimarogonas, D.V., Johansson, K.: `Consensus of double integrator multi-agents under communication delay', Eighth IFAC Workshop on Time Delay Systems, 2009.
    7. 7)
    8. 8)
      • V.D. Blondel , A. Olshevsky . (2012) On the cost of deciding consensus.
    9. 9)
    10. 10)
    11. 11)
    12. 12)
      • Rodrigues-de-Campos, G., Seuret, A.: `Continuous-time double integrator consensus algorithms improved by an appropriate sampling', Second IFAC Workshop on Distributed Estimation and Control in Networked Systems. Necsys’10, 2010.
    13. 13)
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • Carli, R., Garin, F., Zampieri, S.: `Quadratic indices for the analysis of consensus algorithms', Proc. Fourth Int. Workshop on Information Theory and Applications, 2009.
    18. 18)
      • J.E. Normey-Rico , E.F. Camacho . (2007) Control of dead-time processes.
    19. 19)
      • A. Bemporad , M. Heemels , M. Johansson . (2010) Networked control systems.
    20. 20)
      • C.D. Meyer . (2000) Matrix analysis and applied linear algebra.
    21. 21)
      • Frasca, P.: `Distributed optimization with communication constraints', 2009, PhD, Politecnico di Torino, Department of Information Engineering.
    22. 22)

Related content

This is a required field
Please enter a valid email address