Consensus in Networks under Transmission Delays and the Normalized Laplacian
We study the consensus problem on directed and weighted networks in the presence of time delays. We focus on information transmission delays, as opposed to information processing delays, so that each node of the network compares its current state to the past states of its neighbors. The connection structure of the network is described by a normalized Laplacian matrix. We show that consensus is achieved if and only if the underlying graph contains a spanning tree. Furthermore, this statement holds independently of the value of the delay, in contrast to the case of processing delays. We also calculate the consensus value and show that, unlike the case of processing delays, the consensus value is determined not just by the initial states of the nodes at time zero, but also on their past history over an interval of time.
KeywordsSpan Tree Transmission Delay Functional Differential Equation Negative Real Part Vertex Degree
Unable to display preview. Download preview PDF.
- 2.Atay, F.M.: Consensus in networks with transmission delays (forthcoming)Google Scholar
- 6.Bauer, F.: Spectral graph theory of directed graphs (forthcoming)Google Scholar
- 8.Chung, F.R.K.: Spectral Graph Theory. American Mathematical Society, Providence (1997)Google Scholar
- 9.Hale, J.K.: Theory of Functional Differential Equations. Springer (1977)Google Scholar
- 13.Moreau, L.: Stability of continuous-time distributed consensus algorithms. In: Proc. 43rd IEEE Conference on Decision and Control, pp. 3998–4003 (2004)Google Scholar
- 15.Seuret, A., Dimarogonas, D.V., Johansson, K.H.: Consensus under communication delays. In: Proc. 47th IEEE Conference on Decision and Control, CDC 2008, Cancun, Mexique (2008)Google Scholar