Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems

Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems

Thumbnail Image
Download
Name

Tsitsiklis_Convergence of.pdf

Size

228.67 KB

Format

Adobe PDF

Checksum (MD5)

3e5488d975fc08af478b4e4428917b70

Author(s)
Hendrickx, Julien
•
Tsitsiklis, John N.
Date Issued
December 2012
Journal
IEEE Transactions on Automatic Control
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Hendrickx, Julien M., and John N. Tsitsiklis. “Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems.” IEEE Trans. Automat. Contr. 58, no. 1 (January 2013): 214–218.
Version
Original manuscript
Abstract
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 always converge. 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. These results allow treating systems where the agent interactions are a priori unknown, being for example random or determined endogenously by the agent values.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
http://creativecommons.org/licenses/by-nc-sa/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/90991
DOI of Published Version
https://doi.org/10.1109/tac.2012.2203214
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.