2020
DOI: 10.1049/cth2.12071
|View full text |Cite
|
Sign up to set email alerts
|

On bipartite consensus of linear MASs with input saturation over directed signed graphs: Fully distributed adaptive approach

Abstract: This paper studies the bipartite consensus problem with input saturation for general linear represents multi‐agent systems (MASs) with signed digraphs. Based on relative state information among neighbour agents, distributed adaptive protocols and a compensation observer are proposed, wherein both leaderless bipartite consensus and tracking bipartite consensus problems are addressed. For the case only relative output information is available, observer‐based distributed adaptive protocols are also designed, wher… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 39 publications
0
7
0
Order By: Relevance
“…Lemma 3 (Nan et al 31,32 ). For a strongly connected antagonistic graph  1 with L s1 ∈ R l×l as the associated signed Laplacian matrix, there exists a positive diagonal matrix R ≜ diag(r 1 , … , r l ) such that min…”
Section: Assumption 1 (A B) Is Controllablementioning
confidence: 99%
See 1 more Smart Citation
“…Lemma 3 (Nan et al 31,32 ). For a strongly connected antagonistic graph  1 with L s1 ∈ R l×l as the associated signed Laplacian matrix, there exists a positive diagonal matrix R ≜ diag(r 1 , … , r l ) such that min…”
Section: Assumption 1 (A B) Is Controllablementioning
confidence: 99%
“…where Ls1 = RL s1 + L T s1 R with r = [r 1 , r 2 , … , r l ] T being the left zero feature vector of D 1 L s1 D 1 , 𝜆 1 means the smallest nonzero eigenvalue of Ls1 and D 1 𝜉 denotes any vector with positive entries. Lemma 4 (Nan et al 31,32 ). There exists a diagonal positive matrix G ≜ diag(g 1 , … , g N−l ) such that GL s2 + L T s2 G > 0.…”
Section: Assumption 1 (A B) Is Controllablementioning
confidence: 99%
“…On the other hand, the agents should be subject to certain constraints, among which input saturation constraint attracts numerous attentions 27,28 . At present, some works focus on the bipartite consensus control subject to input saturation 29‐32 . In order to conquer saturation, Qin et al 29 designed a low‐gain consensus protocol for bipartite consensus of homogeneous MASs with input saturation.…”
Section: Introductionmentioning
confidence: 99%
“…In order to conquer saturation, Qin et al 29 designed a low‐gain consensus protocol for bipartite consensus of homogeneous MASs with input saturation. Then, the low‐gain technique was further considered by Nan et al, a fully distributed low‐gain protocol with adaptive mechanism was developed for saturated MASs 30 . In the work of Zhu et al, 32 the bipartite consensus problem with input saturation was generalized to singular MASs.…”
Section: Introductionmentioning
confidence: 99%
“…In another paper, a distributed adaptive policy was suggested to analyze MASs subject to sensor attacks [4]. Moreover, a distributed consensus of linear MASs with matching uncertainties was analyzed in [5].…”
Section: Introduction 1literature Reviewmentioning
confidence: 99%