Fixed‐time leader–follower bipartite consensus of nonlinear multi‐agent systems with a leader of nonzero input

Abstract This study investigates the fixed‐time bipartite consensus (FTBC) problem for leader–follower nonlinear multi‐agent systems (MASs) with nonzero control input for leader and external disturbances. The cooperative–antagonistic relationships between agents are characterized by a structurally balanced signed graph. First, a generalized Lipschitz‐type condition is introduced to realize the bipartite consensus of the MASs. A distributed fixed‐time controller was then designed to guarantee the FTBC. The upper bound of the convergence time and the sufficient condition for the realization of the FTBC are obtained by applying graph theory and Lyapunov theory. Finally, the effectiveness of the control algorithm is verified through numerical simulations.

Authors

Institutions

Publication Details

Journal
Asian Journal of Control
Published
2025-04-06
DOI
https://doi.org/10.1002/asjc.3660
Citations
1
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Fixed‐time leader–follower bipartite consensus of nonlinear multi‐agent systems with a leader of nonzero input

Jiemei Zhao, Mingming Liu, Binbin Chen
1 citations
Asian Journal of Control
Distributed Control Multi-Agent Systems
1.49
article

Fixed‐time leader–follower bipartite consensus of nonlinear multi‐agent systems with a leader of nonzero input

Jiemei Zhao, Mingming Liu, Binbin Chen
article en
1 citations

Abstract

Abstract This study investigates the fixed‐time bipartite consensus (FTBC) problem for leader–follower nonlinear multi‐agent systems (MASs) with nonzero control input for leader and external disturbances. The cooperative–antagonistic relationships between agents are characterized by a structurally balanced signed graph. First, a generalized Lipschitz‐type condition is introduced to realize the bipartite consensus of the MASs. A distributed fixed‐time controller was then designed to guarantee the FTBC. The upper bound of the convergence time and the sufficient condition for the realization of the FTBC are obtained by applying graph theory and Lyapunov theory. Finally, the effectiveness of the control algorithm is verified through numerical simulations.

Asian Journal of ControlVol. 28(2)
Wuhan Polytechnic University (CN)
Openalex Percentile: Top 19%
Distributed Control Multi-Agent Systems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.