2012
DOI: 10.1016/j.nonrwa.2012.01.022
|View full text |Cite
|
Sign up to set email alerts
|

Leader-following finite-time consensus for multi-agent systems with jointly-reachable leader

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
24
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
4
2
2

Relationship

1
7

Authors

Journals

citations
Cited by 60 publications
(24 citation statements)
references
References 26 publications
0
24
0
Order By: Relevance
“…The multi-agent system (3) with protocol(9) achieves multi-tracking consensus if and only ifρ(H ) < 1Proof: It is easy to obtain the conclusion by the stability theory of discrete-time systems.Theorem 3: Suppose that Assumption 1 is satisfied. The multi-tracking of multi-agent systems (3) is said to achieved under protocol (9) if and only if the gains α, β and sampling period h satisfy the following conditions: (see equation at the bottom of the page) where λ i (i = 1, .…”
mentioning
confidence: 94%
“…The multi-agent system (3) with protocol(9) achieves multi-tracking consensus if and only ifρ(H ) < 1Proof: It is easy to obtain the conclusion by the stability theory of discrete-time systems.Theorem 3: Suppose that Assumption 1 is satisfied. The multi-tracking of multi-agent systems (3) is said to achieved under protocol (9) if and only if the gains α, β and sampling period h satisfy the following conditions: (see equation at the bottom of the page) where λ i (i = 1, .…”
mentioning
confidence: 94%
“…Moreover, authors in [8] extended the results under the fixed topology to that under switching topologies. In jointly connected topologies, nonlinear consensus algorithms for leader-following consensus problems for multi-agent systems were proposed in [9], where finite-time consensus conditions were given by applying LaSalle's invariance principle. Finite-time consensus problem was extended the results of the first-order multi-agent systems in [10] to that of the second-order multi-agent systems in [9], where the leader was jointly reachable under switching topologies.…”
Section: Introductionmentioning
confidence: 99%
“…In jointly connected topologies, nonlinear consensus algorithms for leader-following consensus problems for multi-agent systems were proposed in [9], where finite-time consensus conditions were given by applying LaSalle's invariance principle. Finite-time consensus problem was extended the results of the first-order multi-agent systems in [10] to that of the second-order multi-agent systems in [9], where the leader was jointly reachable under switching topologies. Based on algebraic Riccati equality and Lyapunov function, semi-global consensus problem for the high-order multi-agent system with input saturation was investigated in [11], where small gains were introduced.…”
Section: Introductionmentioning
confidence: 99%
“…Thus, it is necessary to study the network with switching and time-varying topologies. Sun et al [18] investigated the finite-time consensus problems of leader-follower multi-agent systems with jointly-reachable leader and switching jointlyreachable leader. Two kinds of finite-time consensus protocols were presented for first-order and second-order systems, respectively.…”
Section: Introductionmentioning
confidence: 99%