Stability of continuous-time consensus algorithms for switching networks with bidirectional interaction

Published: 01 Jan 2013, Last Modified: 22 Oct 2024ECC 2013EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We consider the problem of reaching consensus in a network of the first-order continuous-time agents with switching topology. The coupling gains are neither piecewise-continuous, nor separated from zero, nor symmetric, though the network topology is assumed to be undirected. The main result of the paper provides conditions on the network topology that are necessary and sufficient for reaching consensus.
Loading

OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2025 OpenReview