Sufficient Conditions on Bipartite Consensus of Weakly Connected Matrix-weighted Networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912048641736704 |
|---|---|
| author | Wang, Chongzhi Shao, Haibin Tan, Ying Li, Dewei |
| author_facet | Wang, Chongzhi Shao, Haibin Tan, Ying Li, Dewei |
| contents | Recent advancements in bipartite consensus, a scenario where agents are divided into two disjoint sets with agents in the same set agreeing on a certain value and those in different sets agreeing on opposite or specifically related values, have highlighted its potential applications across various fields. Traditional research typically relies on the presence of a positive-negative spanning tree, which limits the practical applicability of bipartite consensus. This study relaxes that assumption by allowing for weak connectivity within the network, where paths can be weighted by semidefinite matrices. By exploring the algebraic constraints imposed by positive-negative trees and semidefinite paths, we derive sufficient conditions for achieving bipartite consensus. Our theoretical findings are validated through numerical results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_00824 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Sufficient Conditions on Bipartite Consensus of Weakly Connected Matrix-weighted Networks Wang, Chongzhi Shao, Haibin Tan, Ying Li, Dewei Systems and Control Multiagent Systems Recent advancements in bipartite consensus, a scenario where agents are divided into two disjoint sets with agents in the same set agreeing on a certain value and those in different sets agreeing on opposite or specifically related values, have highlighted its potential applications across various fields. Traditional research typically relies on the presence of a positive-negative spanning tree, which limits the practical applicability of bipartite consensus. This study relaxes that assumption by allowing for weak connectivity within the network, where paths can be weighted by semidefinite matrices. By exploring the algebraic constraints imposed by positive-negative trees and semidefinite paths, we derive sufficient conditions for achieving bipartite consensus. Our theoretical findings are validated through numerical results. |
| title | Sufficient Conditions on Bipartite Consensus of Weakly Connected Matrix-weighted Networks |
| topic | Systems and Control Multiagent Systems |
| url | https://arxiv.org/abs/2307.00824 |