2017
DOI: 10.1177/1729881417748442
|View full text |Cite
|
Sign up to set email alerts
|

Smooth time-invariant control for leaderless consensus of networked nonholonomic systems

Abstract: This article studies the leaderless consensus control problem of multiple nonholonomic chained systems. Two smooth time-invariant static distributed controllers are derived based on Lyapunov method, graph theory, and LaSalle invariance principle. Both of the proposed controllers guarantee that the states of the multiple nonholonomic systems globally asymptotically converge to a common vector, provided that the interconnection topology is undirected and connected. In particular, the second control scheme can re… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
9
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 11 publications
(9 citation statements)
references
References 30 publications
0
9
0
Order By: Relevance
“…• Compared with the works [5,18,21] with local results, this paper presents a global control law. • The results in Jafarian, [19] Maghenem et al [20], Du et al [22], Zhai et al [23], Xie and Ma [24], and Xie et al [25] depend on undirected connected information topology, while our approach relaxes this condition to a more relaxed one that only requires directed communication graph with a spanning tree. • The existing works [5,[8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25] do not take into account the guarantee of convergence rate; nevertheless, this paper can ensure a prescribed convergence speed.…”
Section: Introductionmentioning
confidence: 94%
See 3 more Smart Citations
“…• Compared with the works [5,18,21] with local results, this paper presents a global control law. • The results in Jafarian, [19] Maghenem et al [20], Du et al [22], Zhai et al [23], Xie and Ma [24], and Xie et al [25] depend on undirected connected information topology, while our approach relaxes this condition to a more relaxed one that only requires directed communication graph with a spanning tree. • The existing works [5,[8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25] do not take into account the guarantee of convergence rate; nevertheless, this paper can ensure a prescribed convergence speed.…”
Section: Introductionmentioning
confidence: 94%
“…• The results in Jafarian, [19] Maghenem et al [20], Du et al [22], Zhai et al [23], Xie and Ma [24], and Xie et al [25] depend on undirected connected information topology, while our approach relaxes this condition to a more relaxed one that only requires directed communication graph with a spanning tree. • The existing works [5,[8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25] do not take into account the guarantee of convergence rate; nevertheless, this paper can ensure a prescribed convergence speed. In the literature, similar results on guaranteed convergence rate control are provided for consensus control of linear systems; see, for example, Fruhnert and Corless [26] and Amini et al [27] and reference therein, and distinct from them, this work provides a new controller that reaches a prescribed rate of convergence for formation control of unicycle vehicles with nonlinear models.…”
Section: Introductionmentioning
confidence: 95%
See 2 more Smart Citations
“…To stabilized the augmented system and deal with parametric uncertainties, we then propose a new adaptive control law in dynamic level. Theoretical analysis in Lyapunov sense proves that the formation errors, including both position and orientation, 33 are globally uniformly ultimately convergent to arbitrarily small balls near the origin.…”
Section: Introductionmentioning
confidence: 97%