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

Distributed tracking control of second-order multi-agent systems with sampled data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
5
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(5 citation statements)
references
References 30 publications
0
5
0
Order By: Relevance
“…Therefore, according to (9), if lim t→∞ t t−T e T (τ)e(τ)dτ = 0, we can get that lim t→∞ t t−T δ T (τ)δ(τ)dτ = 0. For the following discussion, we denote the dynamic of e(t) aṡ…”
Section: Adaptive Repetitive Consensus Framework For Multi-agent Systmentioning
confidence: 98%
See 1 more Smart Citation
“…Therefore, according to (9), if lim t→∞ t t−T e T (τ)e(τ)dτ = 0, we can get that lim t→∞ t t−T δ T (τ)δ(τ)dτ = 0. For the following discussion, we denote the dynamic of e(t) aṡ…”
Section: Adaptive Repetitive Consensus Framework For Multi-agent Systmentioning
confidence: 98%
“…Recently, studies on the distributed cooperative control of multi-agent systems or networks have attracted a lot of attention from various research communities [6][7][8][9][10][11][12][13][14][15][16][17]. The consensus problem, i.e., every agent asymptotically approaches a common value, has become a focus in the distributed coordination of multi-agent systems.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, inspired by the above motivations, the problem of the LDRF‐consensus with switching topologies is more meaningful and complicated, which investigates whether it is still possible to achieve followers to trace the leader or not when the communication topology changes over time [19]. The LDRF‐consensus of continuous‐time second‐order MASs subject to the Markovian topology is discussed under the sampled‐data context in [20, 21]. The design of the sampling period is emphasised in [20].…”
Section: Introductionmentioning
confidence: 99%
“…The design of the sampling period is emphasised in [20]. Different from [20], the approximative value of the leader's acceleration is used to design the consensus algorithm instead of the real value in [21]. In [22], a distributed adaptive consensus algorithm has been proposed to achieve the LDRF‐consensus for multiple uncertain Euler–Lagrange systems under a jointly connected topology.…”
Section: Introductionmentioning
confidence: 99%
“…Most work on consensus focuses on protocols taking the form of first-order dynamics [1][2][3][4][5]. Extensions of consensus protocols to second-order dynamics are reported in [6][7][8][9][10][11]. Just as is shown in [9], the convergence of secondorder consensus algorithms relies on not only information exchange topology but also the coupling strength between the information states in contrast to first-order consensus algorithms.…”
Section: Introductionmentioning
confidence: 99%