2014
DOI: 10.1016/j.automatica.2014.02.028
|View full text |Cite
|
Sign up to set email alerts
|

Distributed adaptive control for consensus tracking with application to formation control of nonholonomic mobile robots

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
130
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 439 publications
(131 citation statements)
references
References 32 publications
1
130
0
Order By: Relevance
“…A common drawback of is that the system nonlinearities and uncertainties must satisfy the matching condition. With the aid of the popular backstepping design , the matching condition was removed in . Nevertheless, the same as , the schemes in are based on state‐feedback.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…A common drawback of is that the system nonlinearities and uncertainties must satisfy the matching condition. With the aid of the popular backstepping design , the matching condition was removed in . Nevertheless, the same as , the schemes in are based on state‐feedback.…”
Section: Introductionmentioning
confidence: 99%
“…With the aid of the popular backstepping design , the matching condition was removed in . Nevertheless, the same as , the schemes in are based on state‐feedback. By comparison, existing results on output‐feedback adaptive consensus control for high‐order nonlinear multi‐agent systems are very limited.…”
Section: Introductionmentioning
confidence: 99%
“…For a directed connection graph, the adaptive schemes in (Das and Lewis, 2010;Zhang and Lewis, 2012) achieved consensus control at a price of sacrificing the asymptotic convergence. Further results on adaptive control under directed communication graph include adaptive coordination of multiple Lagrangian systems (Mei, Ren, Chen and Ma, 2013) and consensus tracking for state-feedback nonlinear systems in the strict feedback form (Wang, Huang, Wen and Fan, 2014), which were obtained using direct local measurements or certain parameters such as P i in (Wang et al, 2014) that requires the knowledge of the Laplacian matrix. The asymmetric connection in a directed graph remained as an obstacle in the extension of adaptive schemes beyond undirected graphs to fully distributed adaptive consensus control, using the relative state or relative output measurements.…”
Section: Introductionmentioning
confidence: 99%
“…One way to alleviate the problem is to use robust adaptive laws at the cost of asymptotic convergence [11], [12]. Adaptive consensus tracking under directed connection graphs is addressed in [13] for formation control via state feedback. Adaptive laws are also proposed to estimate network connectivity, aiming at a fully distributed control, without using the knowledge of eigenvalues of Laplacian matrices [14].…”
Section: Introductionmentioning
confidence: 99%