Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2410.21278 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914994204966912 |
|---|---|
| author | Wang, Chongzhi Shao, Haibin Tan, Ying Li, Dewei |
| author_facet | Wang, Chongzhi Shao, Haibin Tan, Ying Li, Dewei |
| contents | Recent advances in bipartite consensus on matrix-weighted networks, where agents are divided into two disjoint sets with those in the same set agreeing on a certain value and those in different sets converging to opposite values, have highlighted its potential applications across various fields. Traditional approaches often depend on the existence of a positive-negative spanning tree in matrix-weighted networks to achieve bipartite consensus, which greatly restricts the use of these approaches in engineering applications. This study relaxes that assumption by allowing weak connectivity within the network, where paths can be weighted by semidefinite matrices. By analyzing the algebraic constraints imposed by positive-negative trees and semidefinite paths, we derive new sufficient conditions for achieving bipartite consensus. Our findings are validated by numerical simulations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_21278 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Sufficient Condition on Bipartite Consensus of Weakly Connected Matrix-weighted Networks Wang, Chongzhi Shao, Haibin Tan, Ying Li, Dewei Optimization and Control Recent advances in bipartite consensus on matrix-weighted networks, where agents are divided into two disjoint sets with those in the same set agreeing on a certain value and those in different sets converging to opposite values, have highlighted its potential applications across various fields. Traditional approaches often depend on the existence of a positive-negative spanning tree in matrix-weighted networks to achieve bipartite consensus, which greatly restricts the use of these approaches in engineering applications. This study relaxes that assumption by allowing weak connectivity within the network, where paths can be weighted by semidefinite matrices. By analyzing the algebraic constraints imposed by positive-negative trees and semidefinite paths, we derive new sufficient conditions for achieving bipartite consensus. Our findings are validated by numerical simulations. |
| title | Sufficient Condition on Bipartite Consensus of Weakly Connected Matrix-weighted Networks |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2410.21278 |