Convergence of type-symmetric and cut-balanced consensus seeking systems

Details Convergence of type-symmetric and cut-balanced consensus seeking systems Convergence of type-symmetric and cut-balanced consensus seeking systems

2011-02-11

arxiv.org/abs/1102.2361v1

Computer Science

Systems and Control

18 pages, 11 tex files, no figure

Scientific paper

We consider continuous-time consensus seeking systems whose time-dependent interactions are cut-balanced, in the following sense: if a group of agents influences the remaining ones, the former group is also influenced by the remaining ones by at least a proportional amount. Models involving symmetric interconnections and models in which a weighted average of the agent values is conserved are special cases. We prove that such systems converge unconditionally. We give a sufficient condition on the evolving interaction topology for the limit values of two agents to be the same. Conversely, we show that if our condition is not satisfied, then these limits are generically different. Using the fact that our convergence result is unconditional, we show that it also applies to systems where the agent connectivity and interactions are random, or endogenous, that is, determined by the agent values. We also derive corresponding results for discrete-time systems.

Affiliated with

Also associated with

No associations

Rating

Convergence of type-symmetric and cut-balanced consensus seeking systems 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 Convergence of type-symmetric and cut-balanced consensus seeking systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence of type-symmetric and cut-balanced consensus seeking systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-632510