Abstract
In this paper, we present new results on consensus for continuous-time multiagent 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 examples that make us think that both of our assumptions are tight.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.