Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights

Details Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights

2011-05-13

arxiv.org/abs/1105.2755v2

Mathematics

Optimization and Control

Scientific paper

In this paper, we present new results on consensus for continuous-time multi- agent systems. We introduce the assumptions of persistent connectivity of the interaction graph and of slow divergence of reciprocal interaction weights. Persistent connectivity can be considered as the counterpart of the notion of ultimate connectivity used in discrete- time consensus protocols. Slow divergence of reciprocal interaction weights generalizes the assumption of cut-balanced interactions. We show that under these two assumptions, the continuous-time consensus protocol succeeds: the states of all the agents converge asymptotically to a common value. Moreover, our proof allows us to give an estimate of the rate of convergence towards the consensus. We also provide two examples that make us think that both of our assumptions are tight.

Affiliated with

Also associated with

No associations

Rating

Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights 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 Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuous-time consensus under persistent connectivity and slow divergence of reciprocal interaction weights will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27772