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

Distributed average tracking for multiple signals generated by linear dynamical systems: An edge-based framework

Abstract: This paper studies the distributed average tracking problem for multiple time-varying signals generated by linear dynamics, whose reference inputs are nonzero and not available to any agent in the network. In the edge-based framework, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths are designed. Based on the boundary layer concept, the proposed continuous algorithm with static coupling strengths can asymptotically track the average of multiple reference signals withou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
45
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 144 publications
(45 citation statements)
references
References 34 publications
0
45
0
Order By: Relevance
“…The containment errors are bounded and the error variables in satisfy the requirement of error constraints.Remark For algorithms and , sign function is used to ensure that the related variables could reach the sliding surface in finite time. In order to eliminate the chattering phenomenon that the discontinuous functions may introduce, inspired by the works of Zhao et al and Zhao et al, we can use the following function h i (·) to replace sign function for follower i so that the chattering phenomenon can be avoided: hi(),ωti=ωtrue‖ωtrue‖+ϵeηti, where normaldtinormaldt=1+jνFaijsig12()titj is a finite‐time clock synchronization device, ϵ and η are positive constants, and t i is a local time of the local clock in the follower i . The related theoretical analysis can refer to the works of Zhao et alRemark This study achieves distributed finite‐time containment control for multiple EL systems with communication delays.…”
Section: Distributed Finite‐time Error Constrained Containment Contromentioning
confidence: 99%
See 2 more Smart Citations
“…The containment errors are bounded and the error variables in satisfy the requirement of error constraints.Remark For algorithms and , sign function is used to ensure that the related variables could reach the sliding surface in finite time. In order to eliminate the chattering phenomenon that the discontinuous functions may introduce, inspired by the works of Zhao et al and Zhao et al, we can use the following function h i (·) to replace sign function for follower i so that the chattering phenomenon can be avoided: hi(),ωti=ωtrue‖ωtrue‖+ϵeηti, where normaldtinormaldt=1+jνFaijsig12()titj is a finite‐time clock synchronization device, ϵ and η are positive constants, and t i is a local time of the local clock in the follower i . The related theoretical analysis can refer to the works of Zhao et alRemark This study achieves distributed finite‐time containment control for multiple EL systems with communication delays.…”
Section: Distributed Finite‐time Error Constrained Containment Contromentioning
confidence: 99%
“…For algorithms (14) and (44), sign function is used to ensure that the related variables could reach the sliding surface in finite time. In order to eliminate the chattering phenomenon that the discontinuous functions may introduce, inspired by the works of Zhao et al 52 and Zhao et al, 53 we can use the following function h i (·) to replace sign function for follower i so that the chattering phenomenon can be avoided:…”
Section: Theorem 2 For Multiple El Systems (1) With Model Uncertaintmentioning
confidence: 99%
See 1 more Smart Citation
“…Numerous multi-agent coordination and cooperation problems have been the subject of considerable attention from researchers over the past several years: aggregation, consensus, formation, social foraging, synchronization, containment, distributed averaging/optimization, etc. [11,[18][19][20]22,29,34,39,40]. In this paper, we are primarily concerned with the formation problem, which regards the situation where a desired geometric shape in space is assumed and maintained by a team of agents.…”
Section: Introductionmentioning
confidence: 99%
“…According to the number of leaders in the network, existing explorations about the consensus problem are classified into three subareas, i.e., leaderless consensus without leaders, consensus tracking with a single leader, and containment control with multiple leaders. For leaderless consensus, control strategies are proposed for first-order [5], second-order [6], fractional-order [7], linear [8,9] multi-agent systems, and for synchronization [10]. For consensus tracking, the aim is to drive the states of followers to reach the state of the leader.…”
Section: Introductionmentioning
confidence: 99%