Bipartite Consensus Algorithm Under Second-Order Multi-Agent Systems with Matrix Weight-Based Network

Currently, the research on consensus in second-order scalar-weighted multi-agent systems has made significant progress. However, when describing complex problems, scalar weighted networks are difficult to accurately represent the coupling relationships between these problems. The dimensional expansion offered by matrix-weighted networks facilitates the description and analysis of complex issues. Currently, there is still limited research on second-order matrix-weighted networks. In this paper, a novel control protocol is designed using the backstepping method, enabling second-order matrix-weighted networks to achieve bipartite consensus. The impact of the Laplacian's null space on the network's bipartite consensus results is analyzed, and numerical simulations are conducted to validate the conclusions presented in the paper.

Authors

Institutions

Publication Details

Published
2024-11-01
DOI
https://doi.org/10.1109/cac63892.2024.10865587
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Bipartite Consensus Algorithm Under Second-Order Multi-Agent Systems with Matrix Weight-Based Network

Yu Wang, Y. C. Zhai, Yingjiang Zhou, Ming Lü et al.
Distributed Control Multi-Agent Systems
article

Bipartite Consensus Algorithm Under Second-Order Multi-Agent Systems with Matrix Weight-Based Network

Yu Wang, Y. C. Zhai, Yingjiang Zhou, Ming Lü, Guoping Jiang
article en

Abstract

Currently, the research on consensus in second-order scalar-weighted multi-agent systems has made significant progress. However, when describing complex problems, scalar weighted networks are difficult to accurately represent the coupling relationships between these problems. The dimensional expansion offered by matrix-weighted networks facilitates the description and analysis of complex issues. Currently, there is still limited research on second-order matrix-weighted networks. In this paper, a novel control protocol is designed using the backstepping method, enabling second-order matrix-weighted networks to achieve bipartite consensus. The impact of the Laplacian's null space on the network's bipartite consensus results is analyzed, and numerical simulations are conducted to validate the conclusions presented in the paper.

Nanjing University of Posts and Telecommunications (CN)
National Natural Science Foundation of China, Nanjing University of Posts and Telecommunications, Nanjing University
Openalex Percentile: Top 68%
Distributed Control Multi-Agent Systems
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.

Bipartite Consensus Algorithm Under Second-Order Multi-Agent Systems with Matrix Weight-Based Network — Yu Wang, Y. C. Zhai, et al. · (2024) | TGRS Research Map | TGRS