Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis
|
|
- Suzan Octavia Hudson
- 5 years ago
- Views:
Transcription
1 Cent Eur J Phys 11(6) DOI: 10478/s Central European Journal of Physics Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis Research Article Mojtaba Naderi Soorki 1,, Mohammad Saleh Tavazoei 1, 1 Electrical Engineering Department, Sharif University of Technology, Azadi Avenue, Tehran, Iran Received 7 February 013; accepted 6 June 013 Abstract: PACS (008): 4530+s Keywords: This paper deals with fractional-order linear time invariant swarm systems Necessary and sufficient conditions for asymptotic swarm stability of these systems are presented Also, based on a time response analysis the speed of convergence in an asymptotically swarm stable fractional-order linear time invariant swarm system is investigated and compared with that of its integer-order counterpart Numerical simulation results are presented to show the effectiveness of the paper results fractional-order linear time invariant swarm systems asymptotic swarm stability time response analysis Versita sp z oo 1 Introduction In recent years, multi-agent autonomous systems imitating natural swarms have attracted much interests [1, ] Some real-world examples of swarms include mass movement of birds, schools of fish, and crowds of people [3] Swarm systems have many applications in various areas, such as physics, biology, robotic and engineering [4 6] Recently emerging applications such as formation control and distributed coordination of multi robot systems have increased the interest of engineers in swarms The stability analysis of swarm systems is more challenging due to the difference between these systems and isolated systems Paper [7] has investigated the consensus for first- mojtabanaderi@eesharifedu tavazoei@sharifedu (Corresponding author) order continuous-time swarm systems In paper [8], it has been shown that the existence of an interaction graph including a spanning tree is necessary for asymptotic swarm stability Besides these, there are also many studies related to the stability of swarm systems [9, 10] Paper [11] has presented sufficient conditions for consensus of highorder linear time-invariant swarm systems Linear time invariant swarm systems with specific structures have been studied in [1] and [13] Recently, paper [14] has presented necessary and sufficient conditions for swarm stability of high-order linear time invariant swarm systems The most of these stability studies of swarm systems have been limited to integer-order cases, even though fractional order control systems have attracted increasing attention in the past few decades [15 18] As a related work, the distributed coordination of networked fractional-order systems over a directed interaction graph has been studied in [19] In paper [19], sufficient conditions on the interac- 845
2 Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis tion graph and the fractional order have been found such that the coordination is achieved This paper presents necessary and sufficient conditions for asymptotic swarm stability of fractional-order linear time invariant swarm systems Also, the time response of an asymptotically swarm stable fractional-order linear time invariant swarm system is investigated and compared with that of its integer-order counterpart To the best of the authors knowledge, this paper is the first research work that introduces fractional-order linear time invariant swarm systems and investigates the properties of these systems In fact, the study of swarm stability and time response analysis are new challenges in the field of swarm systems which are addressed in this paper for fractionalorder linear time invariant swarm systems This paper is organized as follows A model for a fractional-order linear time invariant swarm system is presented in Section Moreover, the asymptotic swarm stability of such a model is investigated in this section Section 3 is devoted to the time response analysis of asymptotically swarm stable fractional-order linear time invariant swarm systems Also, numerical simulation results are presented in Section 4 Finally, conclusions are given in Section 5 Fractional-order swarm systems and their stability analysis Fractional-order linear time invariant swarm systems and their stability analysis are addressed in this section These systems are modelled as having N agents whose dynamics are described by pseudo state space models having inner dimension d It is assumed that the pseudo state of the ith agent is denoted by x i = [x i1,, x id ] T R d The communication among agents is specified by a weighted directed graph G of order N such that each agent corresponds to a vertex Also, the arc weight of graph G between ith and jth agents is specified by the value w ij 0 This value can be considered as a measure for the strength of the information link [14] Graph G is specified by its adjacency matrix which is denoted by W w 11 w 1N G : W = w N1 w NN Let the dynamics of each agent be described by pseudo state space models D α t x i = Ax i + F N w ij (x j x i ), i {1,,, N} (1) j=1 where A R d d, F R d d, and Dt α denotes the Caputo fractional derivative operator defined as follows [1] D α t f(t) = { 1 t Γ(n α) 0 f (n) (τ) dτ, n 1 < α < n N (t τ) α n+1 f (n) (t), α = n N In the above definition, n is the first integer larger than or equal to α It is worth mentioning that the considered swarm system is the fractionalized version of that introduced in [14] Now, consider the following definition Definition 1 Asymptotic swarm stability [14]: A linear time invariant swarm system is said to be asymptotically swarm stable if it achieves the full state consensus, ie for each ε > 0 there is t > 0 such that x i (t) x j (t) < ε for t > t (i, j {1,,, N}) If the pseudo state vector of agents is defined by x = [x T 1,, xt N ]T, the system dynamics in (1) can be expressed as D α t x = (I N A L F)x () where L = L(G) is the Laplacian matrix of the graph G [0] The following lemma reveals a property of the Laplacian matrix of a graph Lemma 1 The Laplacian matrix of any graph always has a zero eigenvalue Also, the Laplacian matrix of a directed graph has exactly one zero eigenvalue λ 1 = 0 with the corresponding eigenvector [1, 1,, 1] T if and only if this graph includes a spanning tree In such a case, all of the other eigenvalues λ,, λ N are placed in the open right half plane [7, 8] By considering the eigenvalues of L as λ 1 = 0, λ,, λ N C, the Jordan canonical form of L can be written as λ 0 J = λ N where may either be 1 or 0 By assuming T LT 1 = J and defining x = (T I d )x, () is rewritten as D α t x = (I N A J F) x (3) 846
3 Mojtaba Naderi Soorki, Mohammad Saleh Tavazoei where matrix (I N A J F) is in the form A A λ F 0 (I N A J F) = A λ N F (4) In (4), each represents a matrix in R d d that may either equal F or 0 (For more details, see [14]) According to (4), (3) can be decoupled into pseudo state space equations having one of the following forms or D α t x i = (A λ i F) x i (5) D α t x i = (A λ i F) x i F x i+1 (6) Before deriving the main result, we need the following two lemmas that are similar to what was expressed in [19] (In fact, Lemmas and 3 are vector forms of Lemmas and 3 of [19], which investigate the time response properties of systems (5) and (6) in the scalar case) Lemma Let x i (t) be the solution of (5) following properties: This solution has the 1 If α (0, θ i π ), where θ i = min arg(eig(a λ i F)) then lim t x i (t) = 0 If α (0, 1] and λ i = 0, then x i (t) = E α,1 (At α ) x i (0) 1 3 If α (1, ) and λ i = 0, then x i (t) = E α,1 (At α ) x i (0) + te α, (At α ) x i (0) Proof By the stability theorem of fractional-order systems described by pseudo state space models [3], it can be easily shown that if α (0, θ i ), where θ π i = min arg(eig(a λ i F)), then system (5) will be an asymptotically stable system, and consequently lim t x i (t) = 0 Also, properties and 3 can be respectively concluded from [[4]: Eq (347)] and [[5]: Eq (16)] 1 E α,β () denotes the two-parameter Mittag-Leffler function [1] Lemma 3 Let x i+1 (t) be a continuous function satisfying condition lim t x i+1 (t) = 0 In this case, (6) yields in lim t x i (t) = 0, provided that α (0, θ i ), where θ π i = min arg(eig(a λ i F)) Proof By taking the Laplace transform from the both sides of (5), it is deduced that L{ x i (t)} = [s α I A+λ i F] 1 (s α 1 x i (0) FL{ x i+1 }), α (0, 1] (7) L{ x i (t)} =[s α I A + λ i F] 1 (s α 1 x i (0) + s α 1 xi (0) FL{ x i+1 }), α (1, ) (8) If α (0, θ i ), where θ π i = min arg(eig(a λ i F)), the roots of equation det(s α I A + λ i F) = 0 are placed in the left half plane Therefore, in such a case the final value theorem can be used to obtain lim t x i (t) from equalities (7) and (8) By applying this theorem, we have lim x i(t) = lim s[s α I A + λ i F] 1 (s α 1 x i (0) FL{ x i+1 }) t s 0 lim x i(t) = lim s[s α I A + λ i F] 1 (s α 1 x i (0) + s α 1 x i (0) t s 0 FL{ x i+1 }) (10) By considering (9), (10), and assumption lim t x i+1 (t) = 0 which results in lim t L{ x i+1 (t)} = 0, it is concluded that lim t x i (t) = 0 Now, consider the following theorem as the main result of this section Theorem Let α (0, θ ) where θ = min π i=1,,n θ i, θ i = min arg(eig(a λ i F)), and λ 1 = 0,and λ,, λ N C are eigenvalue of the Laplacian matrix L with the Jordan form J = T LT 1 In this case, the swarm system (1) which does not satisfy condition arg(eiga) > α π is asymptotically swarm stable if and only if the graph topology G has a spanning tree In addition, in the steady state the pseudo states of the agents of the asymptotically swarm stable system are obtained as follows x(t) = (T I d ) 1 x(t) lim x(t) = [E α,1(at α ) x 1 (0), 0,, 0] T, α (0, 1] t (9) lim x(t) = [E α,1(at α ) x 1 (0) + te α, (At α ) x 1 (0), 0,, 0] T, t α (1, θ π ) (11) 847
4 Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis Proof If graph G has a directed spanning tree, from Lemma 1 it deduced that L has a simple zero eigenvalue, and other eigenvalues L of have positive real parts Since λ 1 = 0 is a simple zero eigenvalue for L, from Properties and 3 of Lemma it is concluded that x 1 (t) = E α,1 (At α ) x 1 (0) for the case α (0, 1] and x 1 (t) = E α,1 (At α ) x 1 (0) + te α, (At α ) x 1 (0) for the case α (1, ) On the other hand, if condition α (0, θ ) is satisfied, Property 1 of Lemma and Lemma 3 yield in π lim 0 x i (t) = 0 for i 1 Considering these points, the asymptotic relations (11) are derived Hence, if graph G has a directed spanning tree and α (0, θ ), we have π E α,1 (At α ) x 1 (0) lim x(t) = (T I d) 1 x(t) 0 = (T 1 I d ) t 0 ˆt 11 I d E α,1 (At α ) x 1 (0) = (1) ˆt 11 I d E α,1 (At α ) x 1 (0) for the case α (0, 1], and lim x(t) = (T I d) 1 x(t) t E α,1 (At α ) x 1 (0) + te α, (At α ) x 1 (0) 0 = (T 1 I d ) 0 ˆt 11 I d E α,1 (At α ) x 1 (0) + te α, (At α ) x 1 (0) = ˆt 11 I d E α,1 (At α ) x 1 (0) + te α, (At α ) x 1 (0) (13) for the case α (0, θ ), where [ˆt π 11,,ˆt 11 ] T is the first column of matrix T 1 (Note that from Lemma 1 we know that this vector is a coefficient of [1, 1,, 1] T ) According to (1) and (13), x 1 (t) = = x N (t) when t which results in the asymptotic swarm stability of the considered swarm system If the interaction graph G does not include a spanning tree and condition arg(eiga) > α π is not satisfied, by the same approach presented in the proof of Theorem 1 in [14], it can be shown that the considered swarm system cannot be asymptotically swarm stable For the case α = 1 (integer-order case), similar that presented in Theorem of [14], Theorem 1 reveals that the considered swarm system with non-hurwitz matrix A is asymptotically swarm stable if and only if matrices A λ i F for i =,, N are Hurwitz and the graph topology G has a spanning tree 3 Time response analysis Theorem 1 in the previous section has specified the pseudo states of agents in the steady state Based on this theorem, in this section some analyses are presented on the time response of an asymptotically swarm stable fractional-order linear time invariant swarm system with an order in the range (0, 1) Also, the obtained results are compared with the results of the integer-order case, ie the case α = 1 Note that the Jordan canonical form of structure (I N A J F) in (3) can be expressed as follows: γ γ 0 φ B 1 (I N A J F)B = (14) In (14), γ i (i = 1,, Nd) denotes the eigenvalues of the matrices A λ i F where λ 1 = 0, and λ,, λ N C are eigenvalues of the Laplacian matrix L and each may either be 0 or 1 For simplicity, in the rest of this section we assume that the eigenvalues γ i (i = 1,, Nd) are distinct and nonzero According to the structure of (I N A J F), matrix B has the following form S d d 0 B = d d 0 d d (15) where S d d is the similarity transformation matrix used to diagonalize matrix A According to Theorem 1, for an asymptotically swarm stable fractional-order linear time invariant swarm system the eigenvalues of matrices A λ i F for i =,, N are in the stable region, ie arg(eig(a λ i F)) > α π By transformation z = B 1 x, equation (3) can be rewritten as D α t z(t) = φz(t) (16) Since it is assumed that the eigenvalues γ i (i = 1,, Nd) are distinct, the solution of (16) is obtained as [] z(t) ={c 1 Í 1 E α,1 (γ 1 t α ) + c Í E α,1 (γ t α ) + + c Nd INd E α,1 ( t α )} (17) where Íi(i = 1,, Nd) are Nd 1 vectors in which the ith element is 1 and the other elements are zero Also, c i (i = 848
5 Mojtaba Naderi Soorki, Mohammad Saleh Tavazoei 1,, Nd) are fixed values obtained based on the initial conditions Finally, according to relations x = (T I d )x and x = Bz(t), agents responses are obtained as follows By defining M = (T 1 I d )B R Nd Nd and considering the structure of matrix B in (15), x(t) = (T I d ) 1 x = (T 1 I d )Bz(t) (18) ˆt 11 I d Ŝ d d ˆm d d M = (T 1 ˆt I d )B = 11 I d 0 d d ˆm = d d ˆt 11 I d 0 d d ˆm d d (19) where ˆm d d = ˆt 11 I d S d d (19) can be expressed as follows x 1 (t) m 11 m 1Nd c 1 E α,1 (γ 1 t α ) x(t) = = x N (t) m Nd1 m NdNd c Nd E α,1 ( t α ) m 11 c 1 E α,1 (γ 1 t α ) + + m 1,Nd c Nd E α,1 ( t α ) m d1 c 1 E α,1 (γ 1 t α ) + + m d,nd c Nd E α,1 ( t α ) = m Nd d+1,1 c 1 E α,1 (γ 1 t α ) + + m Nd d+1,nd c Nd E α,1 ( t α ) m Nd,1 c 1 E α,1 (γ 1 t α ) + + m Nd,Nd c Nd E α,1 ( t α ) (0) As equation (0) shows, the time response of each agent can be stated in terms of Mittag-Leffler functions Some parts of the solution related to the eigenvalues of matrices A λ i F(i =,, N) tend to zero as t (These eigenvalues satisfy condition arg(γ i ) > α π ) Also, the terms related to the eigenvalues of matrix A not satisfying condition arg(γ i ) > α π do not converge to zero Now, using Theorem 3 of [19], in the following theorem the speed of convergence in an asymptotically swarm stable fractional-order swarm system is compared with that of its integer-order counterpart for sufficiently small times Theorem 31 There is T > 0 such that the elements of difference vector between pseudo states of the ith agent and the jth agent (ie vector x i (t) x j (t)) in an asymptotically swarm stable fractional-order swarm system with an order between 0 and 1 (ie 0 < α < 1 ) decrease faster than those of its integer-order counterpart for t (0, T ) Proof Suppose that γ l for l = 1,, d are the eigenvalues of matrix A, and γ l for l = d+1,, Nd are eigenvalues of matrices A λ i F(i =,, N) In an asymptotically swarm stable fractional-order swarm system, we know that arg(γ l ) > α π for l = d + 1,, Nd (Theorem 1) According to (0), the difference of vectors x i (t) and x j (t) can be expressed as follow 849
6 Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis m id d+1,1 c 1 E α,1 (γ 1 t α ) + + m id d+1,nd c Nd E α,1 ( t α ) x i (t) x j (t) = m id,1 c 1 E α,1 (γ 1 t α ) + + m id,nd c Nd E α,1 ( t α ) m jd d+1,1 c 1 E α,1 (γ 1 t α ) + + m jd d+1,nd c Nd E α,1 ( t α ) m jd,1 c 1 E α,1 (γ 1 t α ) + + m jd,nd c Nd E α,1 ( t α ) m id d+1,1 m jd d+1,1 m id d+1,d m jd d+1,d c 1 E α,1 (γ 1 t α ) = m id,1 m jd,1 m id,d m jd,d c d E α,1 (γ d t α ) m id d+1,d+1 m jd d+1,d+1 m id d+1,nd m jd d+1,nd c d+1 E α,1 ( t α ) + m id,d+1 m jd,d+1 m id,nd m jd,nd c Nd E α,1 ( t α ) (1) According to (19), m id d+1,1 m id d+1,d = m id,1 m id,d m jd d+1,1 m jd d+1,d = ˆm d d () m jd,1 m jd,d Hence, (1) can be written as m id d+1,d+1 m jd d+1,d+1 m id d+1,nd m jd d+1,nd c d+1 E α,1 ( t α ) x i (t) x j (t) = (3) m id,d+1 m jd,d+1 m id,nd m jd,nd c Nd E α,1 ( t α ) If α = 1 (the integer-order case), (3) results in m id d+1,d+1 m jd d+1,d+1 m id d+1,nd m jd d+1,nd c d+1 e t x i (t) x j (t) = (4) m id,d+1 m jd,d+1 m id,nd m jd,nd c Nd e t By comparison the convergence rate of functions E α,1 (γ i t α ) and e γ it for sufficiently small t (See Theorem 3 of [19]), from (3) and (4) one can conclude that there exists T > 0 such that the elements of difference vector x i (t) x j (t) in an asymptotically swarm stable fractional-order swarm system with 0 < α < 1 decrease faster than those of its integer-order counterpart for t (0, T ) As an important result, Theorem reveals that in asymptotically swarm stable fractional-order swarm systems the convergence rate of agents in the initial moments of motion is higher than that of their integer-order counterparts This means that in the fractional-order case the convergence speed is fast in the beginning of motion, ie when the initial distance between agents may be large Now, we want to study the speed of convergence for the sufficiently large times To achieve this goal, first consider the following lemma from [1] Lemma 31 If 0 < α < and µ is an arbitrary real number such that πα < µ < min{π, πα}, then for each γ i C satisfying condition µ arg(γ i t α ) π, we have E α,1 (γ i t α ) ( t α ) (γ i Γ(1 α)) (5) 850
7 Mojtaba Naderi Soorki, Mohammad Saleh Tavazoei as t The following theorem reveals the convergence rate in an asymptotically swarm stable fractional-order swarm system for sufficiently large times Theorem 3 In an asymptotically swarm stable fractional-order swarm system in the form (1) with the order α (0, 1), the average distance between agents decreases like as t α when t if the eigenvalues of matrices A λ i F for i = 1,, N are different and nonzero Proof Let γ 1,, γ d be the eigenvalues of matrix A and,, be the eigenvalues of matrices A λ i F for i = d + 1,, Nd In an asymptotically swarm stable fractional-order swarm system, arg(γ i ) > α π for i = d + 1,, Nd Hence, according to (1) and Lemma 31 one can concluded that m 11 c 1 E α,1 (γ 1 t α ) + + m 1,d c d E α,1 (γ d t α ) x(t) m Nd,1 c 1 E α,1 (γ 1 t α ) + + m Nd,d c d E α,1 (γ d t α ) m 1,d+1 c d m 1,Ndc Nd + t α Γ(1 α) m Nd,d+1 c d m Nd,Ndc Nd (6) when t Vector x(t) R Nd in (6) can be expressed as x1 1 (t) m 11 c 1 E α,1 (γ 1 t α ) + + m 1,d c d E α,1 (γ d t α ) x 1 (t) x x(t) = d 1 m d1 c 1 E α,1 (γ 1 t α ) + + m d,d c d E α,1 (γ d t α ) = x N (t) x1 N m Nd d+1,1 c 1 E α,1 (γ 1 t α ) + + m Nd d+1,d c d E α,1 (γ d t α ) xd N m Nd,1 c 1 E α,1 (γ 1 t α ) + + m Nd,d c d E α,1 (γ d t α ) m 1,d+1 c d m 1,Ndc Nd + t α Γ(1 α) m d,d+1 c d+1 m Nd d+1,d+1 c d+1 m Nd,d+1 c d m d,ndc Nd + + m Nd d+1,ndc Nd + + m Nd,Ndc Nd (7) Let the average distance between agents be defined by h(t) = N 1 (N (N 1)) N k=1 i=k+1 (x k 1 (t) xi 1 (t)) + + (x k d (t) xi d (t)) (8) From (19), m 11 m 1,d ˆm d d = = = m d,1 m d,d m Nd d+1,1 m Nd d+1,d (9) m Nd,1 m Nd,d According to (7) (9), h(t) pt α Γ(1 α)n (N 1) (30) 851
8 Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis where the constant p is given by p = N k=1 i=k+1 N Nd j=d+1 c j γ j (m dk (d 1),j m di (d 1),j )) + + ( Nd j=d+1 c j (m dk,j m di,j ) γ j (31) Theorem 3 reveals that for sufficiently large times the speed of convergence in an asymptotically swarm stable fractional-order swarm system is less than that of its integer-order counterpart 4 Numerical simulations In this section, the effectiveness of the presented analysis is shown by a numerical example (Numerical simulations of this section have been carried out by using the Adams-type predictor-corrector method which has been introduced in [6] for solving fractional-order differential equations) To this end, consider the following fractionalorder linear time invariant swarm system D α t x i = Ax i + F 5 w ij (x j x i ), i {1,, 5} (3) j=1 which has 5 agents and the pseudo state vector of each agent is denoted by x i = [x i1, x i ] T R Graph G a shown in Figure 1 is used to express the communication among agents with W = The eigenvalues of the Laplacian matrix for this graph are λ(g a ) = {0, 1, 03, 07 ± 0374i} Assume that α = 08 and matrices A and F are given by [ ] [ ] A =, A = In this case, the eigenvalues of matrix A are 1 ± 071i that are not in the stable region {s C arg(eig(s)) > Figure 1 Graph G a which includes a spanning tree α π }, whereas the eigenvalues of A λ if(i =,, 5) are 095 ± 457i, 686 ± 588i, 04 ± 1074i and 68 ± 163i are in the aforementioned stable region According to Theorem 1, the swarm system in question is asymptotically swarm stable Figure shows the trajectories of the agents which confirms the consensus Also, Figure 3 shows the average distance between agents, ie function h(t) = k=1 i=k+1 (xk1 (t) x i1 (t)) + (x k (t) x i (t)) To verify the results of Theorem 3, the diagram log(h(t)) versus log(t) has been plotted in Figure 4 For large enough times, this diagram specifies a line with slope α = 08 which confirms the results of Theorem 3 5 Conclusion In this paper, fractional-order linear time invariant swarm systems were introduced and studied in the aspect of swarm stability and time response analysis The main contributions of the paper can be summarized as follows: Finding a closed-form expression for time response of fractional-order linear time invariant swarm systems (Equation (0)) Providing an asymptotic swarm stability analysis for fractional-order linear time invariant swarm systems (Theorem 1) 85
9 Figure 1 Graph which includes a spanning tree Mojtaba Naderi Soorki, Mohammad Saleh Tavazoei trajectory of agents 10 0 y x Figure 4 log(h) versus log(t) Figure Trajectories Figure Trajectories of agents in the swarm system considered in of agents in the swarm system considered in Section 4 ( [0,7] ) Section 4 (t [0, 7]) Acknowledgments The authors thank the Research Council of Sharif University of Technology for supporting this work References Figure 3 Average distance between agents Comparing the speed of convergence in an asymptotically swarm stable fractional-order linear time invariant swarm system with that of its integerorder counterpart for sufficiently small and large times (Theorems 31 and 3) The obtained results in this paper can be considered as a basis for further research works on fractional-order swarm systems [1] J K Parrish, Science 84, 99 (1999) [] J Buhl, et al, Science 31, 140 (006) [3] D Helbing, I Farkas, T Vicsek, Nature 407, 487 (000) [4] T Vicsek, A Czirok, E Ben-Jacob, I Cohen, O Shochet, Phys Rev Lett 75, 16 (1995) [5] R Olfati-Saber, IEEE T Automat Contr 51, 401 (006) [6] F Xiao, L Wang, J Chen, Y Gao, Automatica 45, 605 (009) [7] R Olfati-Saber, RM Murray, IEEE T Automat Contr 49, 150 (004) [8] W Ren, RW Beard, IEEE T Automat Contr 50, 655 (005) [9] W Li, IEEE T Syst Man Cy B 38, 1084 (008) [10] A Pant, P Seiler, JK Hedrick, IEEE T Automat Contr 47, 403 (00) [11] J Wang, D Cheng, X Hu, Asian J Control 10, 144 (008) [1] W Ren, KL Moore, Y Chen, J Dyn Systy T ASME 19, 678 (007) [13] P Wieland, J Kim, H Scheu, F Allgower, On consensus in multi-agent systems with linear high-order agents Proc IFAC World Congress, Seoul, Korea 17, 1541 (008) 853
10 Fractional-order linear time invariant swarm systems: asymptotic swarm stability and time response analysis [14] N Cai, JX Xi, YS Zhong, IET Control Theory A 5, 40 (009) [15] H F Raynaud, A Zergainoh, Automatica 36, 1017 (000) [16] B M Vinagre, C A Monje, A J Calderon, J I Suarez, J Vib Control 13, 1419 (007) [17] A Oustaloup, B Mathieu, P Lanusse, Eur J Control 1, 113 (1995) [18] I Podlubny, IEEE T Automat Contr 44, 08 (1999) [19] Y Cao,, W Ren, Y Chen, IEEE T Syst Man Cy B 40, 36 (010) [0] C Godsil, G Royle, Algebraic graph theory (Springer, 000) [1] I Podlubny, Fractional differential equations, Mathematics in Science and Engineering (Academic press, 1999) [] K Diethelm, The Analysis of Fractional Differential Equations (Springer, 010) [3] I Petras, Fractional Calculus Applied Analysis 1, 69 (009) [4] CA Monje, Y Chen, B Vinagre, D Xue V Feliu, Fractional-order Systems and Controls Fundamentals and Applications (Springer, 010) [5] L Chen, Y Chai, R Wu, J Yang, IEEE T Circuits S 59, 60 (01) [6] K Diethelm, N J Ford, A D Freed, Nonlinear Dynam 9, 3 (00) 854
Consensus of Information Under Dynamically Changing Interaction Topologies
Consensus of Information Under Dynamically Changing Interaction Topologies Wei Ren and Randal W. Beard Abstract This paper considers the problem of information consensus among multiple agents in the presence
More informationDistributed Coordination Algorithms for Multiple Fractional-Order Systems
Proceedings of the 47th IEEE onference on Decision and ontrol ancun, Mexico, Dec. 9-, 8 Distributed oordination Algorithms for Multiple Fractional-Order Systems Yongcan ao, Yan Li, Wei Ren, YangQuan hen
More informationResearch Article H Consensus for Discrete-Time Multiagent Systems
Discrete Dynamics in Nature and Society Volume 05, Article ID 8084, 6 pages http://dx.doi.org/0.55/05/8084 Research Article H Consensus for Discrete- Multiagent Systems Xiaoping Wang and Jinliang Shao
More informationConsensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED FOR PUBLICATION AS A TECHNICAL NOTE. 1 Consensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies Wei Ren, Student Member,
More informationConsensus Tracking for Multi-Agent Systems with Nonlinear Dynamics under Fixed Communication Topologies
Proceedings of the World Congress on Engineering and Computer Science Vol I WCECS, October 9-,, San Francisco, USA Consensus Tracking for Multi-Agent Systems with Nonlinear Dynamics under Fixed Communication
More informationComplex Laplacians and Applications in Multi-Agent Systems
1 Complex Laplacians and Applications in Multi-Agent Systems Jiu-Gang Dong, and Li Qiu, Fellow, IEEE arxiv:1406.186v [math.oc] 14 Apr 015 Abstract Complex-valued Laplacians have been shown to be powerful
More informationOn non-consensus motions of dynamical linear multiagent systems
Pramana J Phys (218) 91:16 https://doiorg/117/s1243-18-159-5 Indian Academy of Sciences On non-consensus motions of dynamical linear multiagent systems NING CAI 1,2,4, CHUN-LIN DENG 1,3, and QIU-XUAN WU
More informationConsensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, SUBMITTED FOR PUBLICATION AS A TECHNICAL NOTE. Consensus Seeking in Multi-agent Systems Under Dynamically Changing Interaction Topologies Wei Ren, Student Member,
More informationConsensus Problem in Multi-Agent Systems with Communication Channel Constraint on Signal Amplitude
SICE Journal of Control, Measurement, and System Integration, Vol 6, No 1, pp 007 013, January 2013 Consensus Problem in Multi-Agent Systems with Communication Channel Constraint on Signal Amplitude MingHui
More informationTracking control for multi-agent consensus with an active leader and variable topology
Automatica 42 (2006) 1177 1182 wwwelseviercom/locate/automatica Brief paper Tracking control for multi-agent consensus with an active leader and variable topology Yiguang Hong a,, Jiangping Hu a, Linxin
More informationGraph Theoretic Methods in the Stability of Vehicle Formations
Graph Theoretic Methods in the Stability of Vehicle Formations G. Lafferriere, J. Caughman, A. Williams gerardol@pd.edu, caughman@pd.edu, ancaw@pd.edu Abstract This paper investigates the stabilization
More informationConsensus Stabilizability and Exact Consensus Controllability of Multi-agent Linear Systems
Consensus Stabilizability and Exact Consensus Controllability of Multi-agent Linear Systems M. ISABEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3,
More informationConsensus of Hybrid Multi-agent Systems
Consensus of Hybrid Multi-agent Systems Yuanshi Zheng, Jingying Ma, and Long Wang arxiv:52.0389v [cs.sy] 0 Dec 205 Abstract In this paper, we consider the consensus problem of hybrid multi-agent system.
More informationConstruction of a New Fractional Chaotic System and Generalized Synchronization
Commun. Theor. Phys. (Beijing, China) 5 (2010) pp. 1105 1110 c Chinese Physical Society and IOP Publishing Ltd Vol. 5, No. 6, June 15, 2010 Construction of a New Fractional Chaotic System and Generalized
More informationAverage-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control
Outline Background Preliminaries Consensus Numerical simulations Conclusions Average-Consensus of Multi-Agent Systems with Direct Topology Based on Event-Triggered Control Email: lzhx@nankai.edu.cn, chenzq@nankai.edu.cn
More informationDiscrete-time Consensus Filters on Directed Switching Graphs
214 11th IEEE International Conference on Control & Automation (ICCA) June 18-2, 214. Taichung, Taiwan Discrete-time Consensus Filters on Directed Switching Graphs Shuai Li and Yi Guo Abstract We consider
More informationExact Consensus Controllability of Multi-agent Linear Systems
Exact Consensus Controllability of Multi-agent Linear Systems M. ISAEL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, Esc. C, 1-3, 08038 arcelona SPAIN maria.isabel.garcia@upc.edu
More informationEquilibrium points, stability and numerical solutions of fractional-order predator prey and rabies models
J. Math. Anal. Appl. 325 (2007) 542 553 www.elsevier.com/locate/jmaa Equilibrium points, stability and numerical solutions of fractional-order predator prey and rabies models E. Ahmed a, A.M.A. El-Sayed
More informationMULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY
Jrl Syst Sci & Complexity (2009) 22: 722 731 MULTI-AGENT TRACKING OF A HIGH-DIMENSIONAL ACTIVE LEADER WITH SWITCHING TOPOLOGY Yiguang HONG Xiaoli WANG Received: 11 May 2009 / Revised: 16 June 2009 c 2009
More informationStructural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems
Structural Consensus Controllability of Singular Multi-agent Linear Dynamic Systems M. ISAL GARCÍA-PLANAS Universitat Politècnica de Catalunya Departament de Matèmatiques Minería 1, sc. C, 1-3, 08038 arcelona
More informationComparing Numerical Methods for Solving Nonlinear Fractional Order Differential Equations
Comparing Numerical Methods for Solving Nonlinear Fractional Order Differential Equations Farhad Farokhi, Mohammad Haeri, and Mohammad Saleh Tavazoei Abstract This paper is a result of comparison of some
More informationConsensus seeking on moving neighborhood model of random sector graphs
Consensus seeking on moving neighborhood model of random sector graphs Mitra Ganguly School of Physical Sciences, Jawaharlal Nehru University, New Delhi, India Email: gangulyma@rediffmail.com Timothy Eller
More informationConsensus Protocols for Networks of Dynamic Agents
Consensus Protocols for Networks of Dynamic Agents Reza Olfati Saber Richard M. Murray Control and Dynamical Systems California Institute of Technology Pasadena, CA 91125 e-mail: {olfati,murray}@cds.caltech.edu
More informationAutomatica. Distributed discrete-time coordinated tracking with a time-varying reference state and limited communication
Automatica 45 (2009 1299 1305 Contents lists available at ScienceDirect Automatica journal homepage: www.elsevier.com/locate/automatica Brief paper Distributed discrete-time coordinated tracking with a
More informationConsensus Analysis of Networked Multi-agent Systems
Physics Procedia Physics Procedia 1 1 11 Physics Procedia 3 1 191 1931 www.elsevier.com/locate/procedia Consensus Analysis of Networked Multi-agent Systems Qi-Di Wu, Dong Xue, Jing Yao The Department of
More informationActive Passive Networked Multiagent Systems
Active Passive Networked Multiagent Systems Tansel Yucelen and John Daniel Peterson Abstract This paper introduces an active passive networked multiagent system framework, which consists of agents subject
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (9) 71 715 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On the general consensus protocol
More informationApplied Mathematics Letters
Applied Mathematics Letters 24 (211) 219 223 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Laplace transform and fractional differential
More informationA computationally effective predictor-corrector method for simulating fractional order dynamical control system
ANZIAM J. 47 (EMA25) pp.168 184, 26 168 A computationally effective predictor-corrector method for simulating fractional order dynamical control system. Yang F. Liu (Received 14 October 25; revised 24
More informationObtaining Consensus of Multi-agent Linear Dynamic Systems
Obtaining Consensus of Multi-agent Linear Dynamic Systems M I GRCÍ-PLNS Universitat Politècnica de Catalunya Departament de Matemàtica plicada Mineria 1, 08038 arcelona SPIN mariaisabelgarcia@upcedu bstract:
More informationAgreement Problems in Networks with Directed Graphs and Switching Topology
Technical Report CIT-CDS 3 5 Agreement Problems in Networks with Directed Graphs and Switching Topology Reza Olfati Saber Richard M. Murray Control and Dynamical Systems California Institute of Technology
More informationStabilization of fractional positive continuous-time linear systems with delays in sectors of left half complex plane by state-feedbacks
Control and Cybernetics vol. 39 (2010) No. 3 Stabilization of fractional positive continuous-time linear systems with delays in sectors of left half complex plane by state-feedbacks by Tadeusz Kaczorek
More informationMulti-Hop Relay Protocols for Fast Consensus Seeking
Multi-Hop Relay Protocols for Fast Consensus Seeking Zhipu Jin and Richard M Murray Abstract Consensus protocols in coordinated multi-agent systems are distributed algorithms Just using local information
More informationConsensus in the network with uniform constant communication delay
Consensus in the network with uniform constant communication delay Xu Wang 1 Ali Saberi 1 Anton A. Stoorvogel Håvard Fjær Grip 1 Tao Yang 3 Abstract This paper studies the consensus among identical agents
More informationDistributed Robust Consensus of Heterogeneous Uncertain Multi-agent Systems
Distributed Robust Consensus of Heterogeneous Uncertain Multi-agent Systems Zhongkui Li, Zhisheng Duan, Frank L. Lewis. State Key Laboratory for Turbulence and Complex Systems, Department of Mechanics
More informationConsensus, Flocking and Opinion Dynamics
Consensus, Flocking and Opinion Dynamics Antoine Girard Laboratoire Jean Kuntzmann, Université de Grenoble antoine.girard@imag.fr International Summer School of Automatic Control GIPSA Lab, Grenoble, France,
More informationarxiv:quant-ph/ v1 22 Aug 2005
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices arxiv:quant-ph/58163v1 22 Aug 25 Abstract Chai Wah Wu IBM Research Division, Thomas J. Watson
More informationDecentralized Control of Vehicle Formations
Portland State University PDXScholar Mathematics and Statistics Faculty Publications and Presentations Fariborz Maseeh Department of Mathematics and Statistics Decentralized Control of Vehicle Formations
More informationNumerical Detection of the Lowest Efficient Dimensions for Chaotic Fractional Differential Systems
The Open Mathematics Journal, 8, 1, 11-18 11 Open Access Numerical Detection of the Lowest Efficient Dimensions for Chaotic Fractional Differential Systems Tongchun Hu a, b, and Yihong Wang a, c a Department
More informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationA Graph-Theoretic Characterization of Controllability for Multi-agent Systems
A Graph-Theoretic Characterization of Controllability for Multi-agent Systems Meng Ji and Magnus Egerstedt Abstract In this paper we continue our pursuit of conditions that render a multi-agent networked
More informationRECENTLY, the study of cooperative control of multiagent
24 IEEE/CAA JOURNAL OF AUTOMATICA SINICA, VOL., NO. 2, APRIL 24 Consensus Robust Output Regulation of Discrete-time Linear Multi-agent Systems Hongjing Liang Huaguang Zhang Zhanshan Wang Junyi Wang Abstract
More informationConsensus Control of Multi-agent Systems with Optimal Performance
1 Consensus Control of Multi-agent Systems with Optimal Performance Juanjuan Xu, Huanshui Zhang arxiv:183.941v1 [math.oc 6 Mar 18 Abstract The consensus control with optimal cost remains major challenging
More informationRecent Advances in Consensus of Multi-Agent Systems
Int. Workshop on Complex Eng. Systems and Design, Hong Kong, 22 May 2009 Recent Advances in Consensus of Multi-Agent Systems Jinhu Lü Academy of Mathematics and Systems Science Chinese Academy of Sciences
More informationDistributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach Yongcan Cao, Member, IEEE, and Wei Ren, Member, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 57, NO. 1, JANUARY 2012 33 Distributed Coordinated Tracking With Reduced Interaction via a Variable Structure Approach Yongcan Cao, Member, IEEE, and Wei Ren,
More informationConsensus Problems on Small World Graphs: A Structural Study
Consensus Problems on Small World Graphs: A Structural Study Pedram Hovareshti and John S. Baras 1 Department of Electrical and Computer Engineering and the Institute for Systems Research, University of
More informationFast Linear Iterations for Distributed Averaging 1
Fast Linear Iterations for Distributed Averaging 1 Lin Xiao Stephen Boyd Information Systems Laboratory, Stanford University Stanford, CA 943-91 lxiao@stanford.edu, boyd@stanford.edu Abstract We consider
More informationTime-delay feedback control in a delayed dynamical chaos system and its applications
Time-delay feedback control in a delayed dynamical chaos system and its applications Ye Zhi-Yong( ), Yang Guang( ), and Deng Cun-Bing( ) School of Mathematics and Physics, Chongqing University of Technology,
More informationOUTPUT CONSENSUS OF HETEROGENEOUS LINEAR MULTI-AGENT SYSTEMS BY EVENT-TRIGGERED CONTROL
OUTPUT CONSENSUS OF HETEROGENEOUS LINEAR MULTI-AGENT SYSTEMS BY EVENT-TRIGGERED CONTROL Gang FENG Department of Mechanical and Biomedical Engineering City University of Hong Kong July 25, 2014 Department
More informationCombining distance-based formation shape control with formation translation
Combining distance-based formation shape control with formation translation Brian D O Anderson, Zhiyun Lin and Mohammad Deghat Abstract Steepest descent control laws can be used for formation shape control
More informationRobust PID and Fractional PI Controllers Tuning for General Plant Model
2 مجلة البصرة للعلوم الهندسية-المجلد 5 العدد 25 Robust PID and Fractional PI Controllers Tuning for General Plant Model Dr. Basil H. Jasim. Department of electrical Engineering University of Basrah College
More informationTheory and Applications of Matrix-Weighted Consensus
TECHNICAL REPORT 1 Theory and Applications of Matrix-Weighted Consensus Minh Hoang Trinh and Hyo-Sung Ahn arxiv:1703.00129v3 [math.oc] 6 Jan 2018 Abstract This paper proposes the matrix-weighted consensus
More informationConsensus Seeking Using Multi-Hop Relay Protocol
1 Consensus Seeking Using Multi-Hop Relay Protocol Zhipu Jin and Richard M. Murray Abstract We consider the problem of average consensus seeking in networked multi-agent systems. Based on local information
More informationGeneralized Function Projective Lag Synchronization in Fractional-Order Chaotic Systems
Generalized Function Projective Lag Synchronization in Fractional-Order Chaotic Systems Yancheng Ma Guoan Wu and Lan Jiang denotes fractional order of drive system Abstract In this paper a new synchronization
More informationFinite-Time Consensus based Clock Synchronization by Discontinuous Control
Finite- Consensus based Clock Synchronization by Discontinuous Control Mauro Franceschelli, Alessandro Pisano, Alessandro Giua, Elio Usai Dept. of Electrical and Electronic Engineering, Univ. of Cagliari,
More informationMulti-Hop Relay Protocols for Fast Consensus Seeking
Proceedings of the 5th IEEE Conference on Decision & Control Manchester Grand Hyatt Hotel San Diego, CA, USA, December 13-15, 6 WeB111 Multi-Hop Relay Protocols for Fast Consensus Seeking Zhipu Jin and
More informationFormation Control and Network Localization via Distributed Global Orientation Estimation in 3-D
Formation Control and Network Localization via Distributed Global Orientation Estimation in 3-D Byung-Hun Lee and Hyo-Sung Ahn arxiv:1783591v1 [cssy] 1 Aug 17 Abstract In this paper, we propose a novel
More informationAgent-Based Model for Rural-Urban Migration: A Dynamic Consideration
Agent-Based Model for Rural-Urban Migration: A Dynamic Consideration Cai, ing 1 Ma, Hai-Ying 2 Khan, M. Junaid 3 1 College of Electrical Engineering, orthwest University for ationalities, Lanzhou, China
More informationConsensus of Multi-Agent Systems with
Consensus of Multi-Agent Systems with 1 General Linear and Lipschitz Nonlinear Dynamics Using Distributed Adaptive Protocols arxiv:1109.3799v1 [cs.sy] 17 Sep 2011 Zhongkui Li, Wei Ren, Member, IEEE, Xiangdong
More informationFinite-Time Distributed Consensus in Graphs with Time-Invariant Topologies
Finite-Time Distributed Consensus in Graphs with Time-Invariant Topologies Shreyas Sundaram and Christoforos N Hadjicostis Abstract We present a method for achieving consensus in distributed systems in
More informationA Note to Robustness Analysis of the Hybrid Consensus Protocols
American Control Conference on O'Farrell Street, San Francisco, CA, USA June 9 - July, A Note to Robustness Analysis of the Hybrid Consensus Protocols Haopeng Zhang, Sean R Mullen, and Qing Hui Abstract
More informationResearch Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
Applied Mathematics Volume 202, Article ID 689820, 3 pages doi:0.55/202/689820 Research Article Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components
More informationFlocking while Preserving Network Connectivity
Flocking while Preserving Network Connectivity Michael M Zavlanos, Ali Jadbabaie and George J Pappas Abstract Coordinated motion of multiple agents raises fundamental and novel problems in control theory
More informationOn consensus in multi-agent systems with linear high-order agents
Proceedings of the 7th World Congress he International Federation of Automatic Control On consensus in multi-agent systems with linear high-order agents Peter Wieland, Jung-Su Kim, Holger Scheu, and Frank
More informationControl and synchronization in systems coupled via a complex network
Control and synchronization in systems coupled via a complex network Chai Wah Wu May 29, 2009 2009 IBM Corporation Synchronization in nonlinear dynamical systems Synchronization in groups of nonlinear
More informationarxiv: v1 [math.oc] 22 Jan 2008
arxiv:0801.3390v1 [math.oc] 22 Jan 2008 LQR-based coupling gain for synchronization of linear systems S. Emre Tuna tuna@eee.metu.edu.tr May 28, 2018 Abstract Synchronization control of coupled continuous-time
More informationScaling the Size of a Multiagent Formation via Distributed Feedback
Scaling the Size of a Multiagent Formation via Distributed Feedback Samuel Coogan, Murat Arcak, Magnus Egerstedt Abstract We consider a multiagent coordination problem where the objective is to steer a
More informationDistributed Adaptive Consensus Protocol with Decaying Gains on Directed Graphs
Distributed Adaptive Consensus Protocol with Decaying Gains on Directed Graphs Štefan Knotek, Kristian Hengster-Movric and Michael Šebek Department of Control Engineering, Czech Technical University, Prague,
More informationOptimal Network Topology Design in Multi-Agent Systems for Efficient Average Consensus
49th IEEE Conference on Decision and Control December 15-17, 010 Hilton Atlanta Hotel, Atlanta, GA, USA Optimal Network Topology Design in Multi-Agent Systems for Efficient Average Consensus Mohammad Rafiee
More informationNCS Lecture 8 A Primer on Graph Theory. Cooperative Control Applications
NCS Lecture 8 A Primer on Graph Theory Richard M. Murray Control and Dynamical Systems California Institute of Technology Goals Introduce some motivating cooperative control problems Describe basic concepts
More informationOn the Scalability in Cooperative Control. Zhongkui Li. Peking University
On the Scalability in Cooperative Control Zhongkui Li Email: zhongkli@pku.edu.cn Peking University June 25, 2016 Zhongkui Li (PKU) Scalability June 25, 2016 1 / 28 Background Cooperative control is to
More informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationStability Theory for Nonnegative and Compartmental Dynamical Systems with Time Delay
1 Stability Theory for Nonnegative and Compartmental Dynamical Systems with Time Delay Wassim M. Haddad and VijaySekhar Chellaboina School of Aerospace Engineering, Georgia Institute of Technology, Atlanta,
More informationAccelerated Consensus for Multi-Agent Networks through Delayed Self Reinforcement
Accelerated Consensus for Multi-Agent Networks through Delayed Self Reinforcement Santosh Devasia Department of Mechanical Engineering University of Washington Seattle, USA devasia@uw.edu arxiv:181.11536v1
More informationGuaranteed-Cost Consensus for Singular Multi-Agent Systems With Switching Topologies
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL 61, NO 5, MAY 2014 1531 Guaranteed-Cost Consensus for Singular Multi-Agent Systems With Switching Topologies Jianxiang Xi, Yao Yu, Guangbin
More informationResearch on Consistency Problem of Network Multi-agent Car System with State Predictor
International Core Journal of Engineering Vol. No.9 06 ISSN: 44-895 Research on Consistency Problem of Network Multi-agent Car System with State Predictor Yue Duan a, Linli Zhou b and Yue Wu c Institute
More informationAdaptive Fuzzy Output Regulation for Formation Control of Unmanned Surface Vehicles
Aalborg Universitet Adaptive Fuzzy Output Regulation for Formation Control of Unmanned Surface Vehicles Li, Shaobao; Er, Meng Joo ; Wang, Ning ; Chien, Chiang-Ju ; Yang, Zhenyu Published in: Procedings
More informationOutput Consensus for Networks of Non-identical Introspective Agents
2011 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 12-15, 2011 Output Consensus for Networks of Non-identical Introspective Agents Tao
More informationOn the fractional-order logistic equation
Applied Mathematics Letters 20 (2007) 817 823 www.elsevier.com/locate/aml On the fractional-order logistic equation A.M.A. El-Sayed a, A.E.M. El-Mesiry b, H.A.A. El-Saka b, a Faculty of Science, Alexandria
More informationDistributed Tracking ControlforLinearMultiagent Systems With a Leader of Bounded Unknown Input
518 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 58, NO. 2, FEBRUARY 2013 Distributed Tracking ControlforLinearMultiagent Systems With a Leader of Bounded Unknown Input Zhongkui Li, Member,IEEE, Xiangdong
More informationProjective synchronization of a complex network with different fractional order chaos nodes
Projective synchronization of a complex network with different fractional order chaos nodes Wang Ming-Jun( ) a)b), Wang Xing-Yuan( ) a), and Niu Yu-Jun( ) a) a) School of Electronic and Information Engineering,
More informationOutline. Conservation laws and invariance principles in networked control systems. ANU Workshop on Systems and Control
Outline ANU Workshop on Systems and Control Conservation laws and invariance principles in networked control systems Zhiyong Sun The Australian National University, Canberra, Australia 1 Content 1. Background
More informationStable Flocking of Mobile Agents, Part I: Fixed Topology
Stable Flocking of Mobile Agents, Part I: Fixed Topology Herbert G Tanner Mechanical Engineering Dept University of New Mexico Ali Jadbabaie and George J Pappas Electrical and Systems Engineering Dept
More informationStable Flocking of Mobile Agents, Part I: Fixed Topology
1 Stable Flocking of Mobile Agents, Part I: Fixed Topology Herbert G. Tanner, Ali Jadbabaie and George J. Pappas Department of Electrical and Systems Enginnering University of Pennsylvania Abstract This
More informationMath Ordinary Differential Equations
Math 411 - Ordinary Differential Equations Review Notes - 1 1 - Basic Theory A first order ordinary differential equation has the form x = f(t, x) (11) Here x = dx/dt Given an initial data x(t 0 ) = x
More informationPeriodic Behaviors in Multi-agent Systems with Input Saturation Constraints
5nd IEEE Conference on Decision and Control December 10-13, 013. Florence, Italy Periodic Behaviors in Multi-agent Systems with Input Saturation Constraints Tao Yang, Ziyang Meng, Dimos V. Dimarogonas,
More informationAsymptotically Unbiased Average Consensus Under Measurement Noises and Fixed Topologies
Proceedings of the 17th World Congress The International Federation of Automatic Control Seoul, Korea, July 6-11, 8 Asymptotically Unbiased Average Consensus Under Measurement Noises and Fixed Topologies
More informationSJÄLVSTÄNDIGA ARBETEN I MATEMATIK
SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Consensus problems for multi-agent systems av Hongmei Zhao 2010 - No 2 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET,
More informationOn the Controllability of Nearest Neighbor Interconnections
On the Controllability of Nearest Neighbor Interconnections Herbert G. Tanner Mechanical Engineering Department University of New Mexico Albuquerque, NM 87 Abstract In this paper we derive necessary and
More informationEXPONENTIAL STABILITY OF SWITCHED LINEAR SYSTEMS WITH TIME-VARYING DELAY
Electronic Journal of Differential Equations, Vol. 2007(2007), No. 159, pp. 1 10. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp) EXPONENTIAL
More informationConsensus Problems in Complex-Weighted Networks
Consensus Problems in Complex-Weighted Networks arxiv:1406.1862v1 [math.oc] 7 Jun 2014 Jiu-Gang Dong, Li Qiu Abstract Consensus problems for multi-agent systems in the literature have been studied under
More informationNotes on averaging over acyclic digraphs and discrete coverage control
Notes on averaging over acyclic digraphs and discrete coverage control Chunkai Gao Francesco Bullo Jorge Cortés Ali Jadbabaie Abstract In this paper, we show the relationship between two algorithms and
More informationarxiv: v1 [cs.sy] 6 Jun 2016
Distance-based Control of K Formation with Almost Global Convergence Myoung-Chul Park, Zhiyong Sun, Minh Hoang Trinh, Brian D. O. Anderson, and Hyo-Sung Ahn arxiv:66.68v [cs.sy] 6 Jun 6 Abstract In this
More informationFORMATIONS OF FORMATIONS: HIERARCHY AND STABILITY
FORMATIONS OF FORMATIONS: HIERARCHY AND STABILITY Anca Williams, Sonja lavaški, Tariq Samad ancaw@pdxedu, sonjaglavaski@honeywellcom Abstract In this paper we will consider a hierarchy of vehicle formations
More informationConsensus Based Formation Control Strategies for Multi-vehicle Systems
Proceedings of the 6 American Control Conference Minneapolis, Minnesota, USA, June 14-16, 6 FrA1.5 Consensus Based Formation Control Strategies for Multi-vehicle Systems Wei Ren Abstract In this paper
More informationReaching a Consensus in a Dynamically Changing Environment A Graphical Approach
Reaching a Consensus in a Dynamically Changing Environment A Graphical Approach M. Cao Yale Univesity A. S. Morse Yale University B. D. O. Anderson Australia National University and National ICT Australia
More informationConsensus Problems in Networks of Agents with Switching Topology and Time-Delays
Consensus Problems in Networks of Agents with Switching Topology and Time-Delays Reza Olfati Saber Richard M. Murray Control and Dynamical Systems California Institute of Technology e-mails: {olfati,murray}@cds.caltech.edu
More informationStability and Disturbance Propagation in Autonomous Vehicle Formations : A Graph Laplacian Approach
Stability and Disturbance Propagation in Autonomous Vehicle Formations : A Graph Laplacian Approach Francesco Borrelli*, Kingsley Fregene, Datta Godbole, Gary Balas* *Department of Aerospace Engineering
More informationDecentralized control synthesis for bilinear systems using orthogonal functions
Cent Eur J Eng 41 214 47-53 DOI: 12478/s13531-13-146-1 Central European Journal of Engineering Decentralized control synthesis for bilinear systems using orthogonal functions Research Article Mohamed Sadok
More informationH CONTROL OF NETWORKED MULTI-AGENT SYSTEMS
Jrl Syst Sci & Complexity (2009) 22: 35 48 H CONTROL OF NETWORKED MULTI-AGENT SYSTEMS Zhongkui LI Zhisheng DUAN Lin HUANG Received: 17 April 2008 c 2009 Springer Science Business Media, LLC Abstract This
More information