Consensus over directed static networks with arbitrary finite communication delays.

  title={Consensus over directed static networks with arbitrary finite communication delays.},
  author={Jianquan Lu and Daniel W. C. Ho and J{\"u}rgen Kurths},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={80 6 Pt 2},
  • Jianquan Lu, D. Ho, J. Kurths
  • Published 23 December 2009
  • Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
We study the consensus problem in directed static networks with arbitrary finite communication delays and consider both linear and nonlinear coupling. For the considered networked system, only locally delayed information is available for each node and also the information flow is directed. We find that consensus can be realized whatever the communications delays are. In fact, we do not even need to know the explicit values of the communication delays. One well-informed leader is proved to be… 

Figures from this paper

Average consensus of multi-agent systems with communication time delays and noisy links
This paper analytically shows that the average consensus could be achieved almost surely with the perturbation of noise and the communication time delays even if the time delay is time-varying.
Consensus of Multi-Agent Systems With Unbounded Time-Varying Delays
In this note, the consensus problem with infinite time-varying delays for linearly coupled static network is investigated and it is proved that under some mild conditions, the network can realize consensus.
Distributed Consensus for Discrete-Time Directed Networks of Multiagents with Time-Delays and Random Communication Links
This paper is concerned with the leader-following consensus problem in mean-square for a class of discrete-time multiagent systems. The multiagent systems under consideration are the directed and
Distributed stochastic consensus of multi-agent systems with noisy and delayed measurements
Networked systems are often subject to environmental uncertainties and communication delays, which make timely and accurate information exchange among neighbours difficult or impossible. This study
Distributed practical consensus in multi-agent networks with communication constrains
It is shown that Filippov solutions converge to a practical consensus set asymptotically and how initial state of the agents, time delay and quantization parameter affect the finalractical consensus set is presented.


Consensus problems in networks of agents with switching topology and time-delays
A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.
Synchronization in networks of nonlinear dynamical systems coupled via a directed graph
We study synchronization in an array of coupled identical nonlinear dynamical systems where the coupling topology is expressed as a directed graph and give synchronization criteria related to
Exponential stabilization of switched stochastic dynamical networks
A switched stochastic dynamical network (SSDN) model will firstly be formulated in this paper, which considers two mutually independent switching signals including individual node switching and
Consensus seeking in multiagent systems under dynamically changing interaction topologies
It is shown that information consensus under dynamically changing interaction topologies can be achieved asymptotically if the union of the directed interaction graphs have a spanning tree frequently enough as the system evolves.
Contraction analysis of time-delayed communications and group cooperation
It is shown that contraction is preserved through specific time-delayed feedback communications, and that this property is independent of the values of the delays, which is applied to group cooperation with linear protocols.
Synchronization in dynamical networks: evolution along commutative graphs.
It is shown that synchronization in a dynamical network can be achieved even in the case in which each individual commutative graphs does not give rise to synchronized behavior.
Pinning Stabilization of Linearly Coupled Stochastic Neural Networks via Minimum Number of Controllers
Pinning stabilization problem of linearly coupled stochastic neural networks (LCSNNs) is studied and some criteria are derived to judge whether the LCSNNs can be controlled in mean square by using designed controllers.
Consensus formation on adaptive networks.
  • B. Kozma, A. Barrat
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2008
The investigations reveal that the adaptation of the network topology fosters cluster formation by enhancing communication between agents of similar opinion, although it also promotes the division of these clusters.
Dynamics of opinion formation in a small-world network.
The dynamical process of opinion formation within a model using a local majority opinion updating rule is studied numerically in networks with the small-world geometrical property, showing the effects of having shortcuts in a lattice of fixed spatial dimension to be analogous to that of increasing the spatial dimension in regular lattices.