Consensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

20 pages, 2 figures

Scientific paper

10.3934/nhm.2011.6.329

We analyze stability of consensus algorithms in networks of multi-agents with time-varying topologies and delays. The topology and delays are modeled as induced by an adapted process and are rather general, including i.i.d.\ topology processes, asynchronous consensus algorithms, and Markovian jumping switching. In case the self-links are instantaneous, we prove that the network reaches consensus for all bounded delays if the graph corresponding to the conditional expectation of the coupling matrix sum across a finite time interval has a spanning tree almost surely. Moreover, when self-links are also delayed and when the delays satisfy certain integer patterns, we observe and prove that the algorithm may not reach consensus but instead synchronize at a periodic trajectory, whose period depends on the delay pattern. We also give a brief discussion on the dynamics in the absence of self-links.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Consensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Consensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consensus and synchronization in discrete-time networks of multi-agents with stochastically switching topologies and time delays will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-533260

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.