A nonlinear convergence consensus: extreme doubly stochastic quadratic operators for multi-agent systems
We investigate a novel nonlinear consensus from the extreme points of doubly stochastic quadratic operators (EDSQO), based on majorization theory and Markov chains for time-varying multi-agent distributed systems. We describe a dynamic system that has a local interaction network among agents. EDSQO...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
MDPI
2020
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/84595/7/84595%20A%20Nonlinear%20Convergence%20Consensus.pdf http://irep.iium.edu.my/84595/8/84595%20A%20Nonlinear%20Convergence%20Consensus%20SCOPUS.pdf http://irep.iium.edu.my/84595/ https://www.mdpi.com/2073-8994/12/4/540/htm |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We investigate a novel nonlinear consensus from the extreme points of doubly stochastic quadratic operators (EDSQO), based on majorization theory and Markov chains for time-varying multi-agent distributed systems. We describe a dynamic system that has a local interaction network among agents. EDSQO has been applied for distributed agent systems, on a finite dimensional stochastic matrix. We prove that multi-agent systems converge at a center (common value) via the extreme waited value of doubly stochastic quadratic operators (DSQO), which are only 1 or 0 or 1/2 1 2 if the exchanges of each agent member has no selfish communication. Applying this rule means that the consensus is nonlinear and low-complexity computational for fast time convergence. The investigated nonlinear model of EDSQO follows the structure of the DeGroot linear (DGL) consensus model. However, EDSQO is nonlinear and faster convergent than the DGL model and is of lower complexity than DSQO and cubic stochastic quadratic operators (CSQO). The simulation result and theoretical proof are illustrated. |
|---|