2016
DOI: 10.1007/s12555-015-0103-2
|View full text |Cite
|
Sign up to set email alerts
|

Consensus seeking of multi-agent systems from an iterative learning perspective

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 14 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…The result of the formation control with the iteration k = 100 is shown in Fig. 9, which shows that the desired formation is well achieved by using distributed learning control protocol (21) with the switching topology. …”
Section: Examplementioning
confidence: 86%
See 3 more Smart Citations
“…The result of the formation control with the iteration k = 100 is shown in Fig. 9, which shows that the desired formation is well achieved by using distributed learning control protocol (21) with the switching topology. …”
Section: Examplementioning
confidence: 86%
“…Let v(t) be a scalar function of t, the upper right-hand derivative D + v(t) is defined by (21) with initial state learning (22). If for all σ ∈ P, there exists the parameters γ 1 , γ 2 and β satisfying σ < 1 with…”
Section: Definition 4 ([27]mentioning
confidence: 99%
See 2 more Smart Citations
“…Remark Assumption implies that the directed graph trueG¯contains a spanning tree where the leader is the root and has an influence directly or indirectly on all followers through a series of directed paths in the network. In addition, the effect of Assumption is to ensure that all the eigenvalues of H have positive real parts known by Lemma , thereby the inverse of matrix H exists, which plays a key role in the convergence analysis of systems and is a fundamental assumption as well as easy to realize for leader‐following MAS .…”
Section: Preliminaries and Problem Formulationmentioning
confidence: 99%