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: | Xiejun Cheng, Jiashang Yu, Xiurong Chen, Jiaju Yu, Bing Cheng |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2023-05-01
|
Series: | Symmetry |
Subjects: | |
Online Access: | https://www.mdpi.com/2073-8994/15/5/1105 |
Similar Items
-
A Unified Framework Design for Finite-Time Bipartite Consensus of Multi-Agent Systems
by: Jiaju Yu, et al.
Published: (2021-01-01) -
Ordered-Bipartite Consensus of Multi-Agent Systems under Finite Time Control
by: Tiehui Zhang, et al.
Published: (2022-12-01) -
Distributed Model-Free Bipartite Consensus Tracking for Unknown Heterogeneous Multi-Agent Systems with Switching Topology
by: Huarong Zhao, et al.
Published: (2020-07-01) -
Practical Prescribed-Time Event-Triggered Bipartite Consensus of Linear Multi-Agent Systems
by: Jianpeng Zang, et al.
Published: (2020-01-01) -
Adaptive Bipartite Consensus of Second-Order Multi-Agent Systems With Bounded Disturbances
by: Haichuan Xu, et al.
Published: (2020-01-01)