Multiple-bipartite consensus for networked Lagrangian systems without using neighbours' velocity information in the directed graph

This paper investigates the multiple-bipartite consensus problem without considering neighbours' velocity information in networked Lagrangian systems (NLSs). A distributed adaptive control algorithm without using neighbours' velocity information is proposed, which facilitates the practical...

Full description

Saved in:
Bibliographic Details
Published inSystems science & control engineering Vol. 11; no. 1
Main Authors Zhang, Tiehui, Liu, Qiuxiang, Liu, Jingyi, Wang, Zhaoyan, Li, Hengyu
Format Journal Article
LanguageEnglish
Published Macclesfield Taylor & Francis 31.12.2023
Taylor & Francis Ltd
Taylor & Francis Group
Subjects
Adaptive algorithms
Adaptive control
Automation
Control algorithms
Control theory
coopetition networks
Eigenvalues
Eigenvectors
Graph theory
Mathematical analysis
Multiple-bipartite consensus
networked Lagrangian systems
Open access publishing
Stability analysis
Velocity
without relative velocity information
Online AccessGet full text

Cover

More Information
Summary:This paper investigates the multiple-bipartite consensus problem without considering neighbours' velocity information in networked Lagrangian systems (NLSs). A distributed adaptive control algorithm without using neighbours' velocity information is proposed, which facilitates the practical configuration deployments in the coopetition networks. By borrowing a subtle vector composed of the eigenvector components associated with zero eigenvalue of Laplacian matrix, a novel reference estimated vector is introduced to conduct the stability analysis step-by-step in the coopetition networks. Finally, simulations are provided to show the effectiveness of the proposed algorithm.
ISSN:2164-2583
2164-2583
DOI:10.1080/21642583.2023.2210185