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 |