Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems
This article is concerned with the bipartite flocking problem in multi-agent systems. Our contributions can be summarized as follows. Firstly, a class of preassigned-time consensus protocols is proposed to solve the issue of multi-agent systems. Secondly, with the aid of the symmetric properties of...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-05-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/5/1105 |
| _version_ | 1797598248300445696 |
|---|---|
| author | Xiejun Cheng Jiashang Yu Xiurong Chen Jiaju Yu Bing Cheng |
| author_facet | Xiejun Cheng Jiashang Yu Xiurong Chen Jiaju Yu Bing Cheng |
| author_sort | Xiejun Cheng |
| collection | DOAJ |
| description | This article is concerned with the bipartite flocking problem in multi-agent systems. Our contributions can be summarized as follows. Firstly, a class of preassigned-time consensus protocols is proposed to solve the issue of multi-agent systems. Secondly, with the aid of the symmetric properties of the graph theory and the Lyapunov stability theorem, we prove that agents can be divided into two disjointed clusters in a finite time, and they move to opposite directions at the same magnitude and speed. The protocol is novel among existing fixed/finite-time protocols in that the associated settling time is a preassigned constant and a parameter of the protocol. Moreover, it is proven that the diameters of the clusters are bounded and independent of other the protocol parameters. These results are demonstrated through both theoretical analysis and simulation examples. |
| first_indexed | 2024-03-11T03:16:38Z |
| format | Article |
| id | doaj.art-b251d09d12884e9687efe346735abf3b |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-11T03:16:38Z |
| publishDate | 2023-05-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-b251d09d12884e9687efe346735abf3b2023-11-18T03:31:00ZengMDPI AGSymmetry2073-89942023-05-01155110510.3390/sym15051105Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent SystemsXiejun Cheng0Jiashang Yu1Xiurong Chen2Jiaju Yu3Bing Cheng4School of Business, Jiangsu Second Normal University, Nanjing 211200, ChinaSchool of Mathematics and Statistics, Heze University, Heze 274700, ChinaSchool of Science and Information, Qingdao Agricultural University, Qingdao 266109, ChinaSchool of Business, Jiangsu Second Normal University, Nanjing 211200, ChinaSchool of Business, Jiangsu Second Normal University, Nanjing 211200, ChinaThis article is concerned with the bipartite flocking problem in multi-agent systems. Our contributions can be summarized as follows. Firstly, a class of preassigned-time consensus protocols is proposed to solve the issue of multi-agent systems. Secondly, with the aid of the symmetric properties of the graph theory and the Lyapunov stability theorem, we prove that agents can be divided into two disjointed clusters in a finite time, and they move to opposite directions at the same magnitude and speed. The protocol is novel among existing fixed/finite-time protocols in that the associated settling time is a preassigned constant and a parameter of the protocol. Moreover, it is proven that the diameters of the clusters are bounded and independent of other the protocol parameters. These results are demonstrated through both theoretical analysis and simulation examples.https://www.mdpi.com/2073-8994/15/5/1105bipartite-flocking consensuspreassigned timemulti-agent systemsstructural balanced graph |
| spellingShingle | Xiejun Cheng Jiashang Yu Xiurong Chen Jiaju Yu Bing Cheng Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems Symmetry bipartite-flocking consensus preassigned time multi-agent systems structural balanced graph |
| title | Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems |
| title_full | Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems |
| title_fullStr | Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems |
| title_full_unstemmed | Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems |
| title_short | Preassigned-Time Bipartite Flocking Consensus Problem in Multi-Agent Systems |
| title_sort | preassigned time bipartite flocking consensus problem in multi agent systems |
| topic | bipartite-flocking consensus preassigned time multi-agent systems structural balanced graph |
| url | https://www.mdpi.com/2073-8994/15/5/1105 |
| work_keys_str_mv | AT xiejuncheng preassignedtimebipartiteflockingconsensusprobleminmultiagentsystems AT jiashangyu preassignedtimebipartiteflockingconsensusprobleminmultiagentsystems AT xiurongchen preassignedtimebipartiteflockingconsensusprobleminmultiagentsystems AT jiajuyu preassignedtimebipartiteflockingconsensusprobleminmultiagentsystems AT bingcheng preassignedtimebipartiteflockingconsensusprobleminmultiagentsystems |