A Graph-Theoretic Characterization of Controllability for Multi-agent Systems
|
|
- Hope Holt
- 6 years ago
- Views:
Transcription
1 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 system controllable. In particular such conditions are sought for networks in which a collection of the agents take on leader roles while the remaining agents execute local consensus-like control laws. Equitable partitions are introduced in order to improve on previous controllability results and the main contribution of this paper is a new necessary condition for controllability. Index Terms Multi-Agent systems Networked system Controllability Graph theory Equitable partitions. I. INTRODUCTION This paper explores the issue of providing a graphtheoretic characterization of the controllability of certain leader-based multi-agent systems. As such it constitutes a continuation of our previous work by considerably improving the necessary condition for controllability. The controllability issue in leader-follower multi-agent systems was first introduced by Tanner in where a necessary and sufficient condition for controllability was given based on the eigenvectors of the graph Laplacian. Although elegant this condition was not graph-theoretic in that controllability could not be directly decided from the graph topology itself. A more topological result was given by Mesbahi and Rahmani in which a sufficient condition for the network to be uncontrollable in the case of one anchored (leader) agent was given. Their result was related to the symmetry and automorphism group of the underlying graph. In this paper we further extend this notion and present a more general condition based on so-called equitable partitions of the underlying graph. Our result thus addresses a scenario where multiple leaders are possible and from an equitable partition point-of-view captures a larger set of graphs. II. NOTATION AND RELIMINARIES In this section we start with some basic notions in graph theory and recall some known results about controllability of multi-agent networks. (We refer the readers to 4 for more details about algebraic graph theory.) Graphs are broadly adopted in the multi-agent literature to encode the interactions in networked systems. An undirected graph G is defined by a set V G = {... n} of nodes and a set E G V G V G of edges. A cell C V G is a subset of the node set. Two nodes i and j are neighbors if (i j) E G and the neighboring relation is indicated with i j while * This work was supported by the U.S. Army Research Office through the grant # The authors are with the School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA {mengjimagnus}@ece.gatech.edu (i) = {j V G : j i} collects all neighbors to the node i. The degree of a node is given by the number of its neighbors and we say that a graph is regular if all nodes have the same degree. A path i i... i L is a finite sequence of nodes such that i k i k k =... L and a graph G is connected if there is a path between any pair of distinct nodes. A subgraph G is said to be induced from the original graph G if it is obtained by deleting a subset of nodes and the edges connected to those nodes. Let A R n n be the ( ) adjacency matrix and B R n m be the ( ) vertex-edge incidence matrix whose orientation is arbitrarily imposed on the graph. The graph Laplacian matrix is defined by L = BB T and it is easy to verify that L = D A where D is the diagonal degree matrix. In the context of multi-agent systems the nodes represent agents and the edges are communication links. In particular an agent i has access to the information pertaining to its neighbors and can use this piece of information to compute its control law. Let x i R d denote the state of node i whose dynamics is described by the single integer ẋ i = u i where u i is the control input. Rendezvous problem is one of the multi-agent control problems that has attracted considerable attentions from many researchers Some other problems e.g. formation control 8 9 consensus or agreement flocking 4 5 and etc. share the same distributive flavor with the rendezvous problem and thus adopt a similar methodology. In fact a widely adopted control method for multi-agent rendezvous is the Laplacianbased feedback on the form ẋ = Lx where x = x T x T... x T n T denotes the aggregated state vector of the multi-agent system and L = L I d is the augmented Laplacian matrix. Under some circumstances some agents are required to take leader roles while the others follow them. In this paper we use subscript l to denote the affiliation with leaders while f for the followers. For example a follower graph G f is the subgraph induced by the follower set V f. As the leader roles are designated the incidence matrix B can be partitioned as Bf B = B l where B f R n f m and B l R n l m. Here n f n l and m are the cardinalities of the follower group the leader group
2 and the edge set respectively. As a result the graph Laplacian L is given by Lf l L = fl lfl T L l where L f = B f B T f L l = B l B T l and l fl = B f B T l. As an example Figure shows a leader-follower network with V l = {5 6} and V f = { 4}. This gives B f = and L f = B l = 4 4 l fl = 5 6. Fig.. A leader-follower network with: V f = { 4} and V l = {5 6}. The system we are interested in is the leader-follower system where the followers are governed by the Laplacianbased feedback law given by ẋ f = L f x f + l fl x l () while the leaders s movements are dictated by some exogenous control signals. Under this setup a natural question is as follows: Can the leader(s) move the followers to any desired configuration? From a control theoretic point of view we ask following questions: ) Is this system controllable? ) If not what is the controllability (observability) decomposition? ) What is the controllable subspace? 4) What is the structural significance of the controllable or uncontrollable subspace? Before we answer these questions let us review some basic controllability results: roposition.: Given the system (L f l fl ) the following statements are equivalent: ) The system is completely controllable; ) None of the eigenvectors of L f is in the nullspace of lfl T i.e. v i such that L f v i = λv i for some λ R v i / N (lfl T ) where N ( ) denotes the nullspace; ) The controllability matrix C Lf l fl has full rank; 4) The matrix λi L f l fl has full rank for all λ R. Based on these standard controllability results together with some basic properties of the graph Laplacian we can derive the following lemma. Lemma.: Given a connected graph the system (L f l fl ) is controllable if and only if L and L f do not share any common eigenvalues. roof of Necessity: We can reformulate the lemma as stating that the system is uncontrollable if and only if there exists at least one common eigenvalue between L and L f. First we show the necessity. Suppose the system is uncontrollable. Then from Theorem.() there exists a vector v i R n f such that L f v i = λv i for some λ R with Now since Lf l fl l T fl L l vi l T flv i =. Lf v = i lfl T v i vi = λ λ is also an eigenvalue of L with eigenvector v T i T. III. INTERLACING AND EQUITABLE ARTITIONS Equitable partitions and interlacing theory play an important role for our main results. In this section we introduce some definitions and lemmas needed to support our main results. Definition.: A r-partition π of V(G) with cells C... C r is said to be equitable if each node in C j has the same number of neighbors in C i for all i j. We denote the cardinality of the partition π with r = π. Let b ij be the number of neighbors in C j of a node in C i. The directed graph with the r cells of π as its nodes and b ij edges from the ith to the jth cells of π is called the quotient of G over π and is denoted by G/π. An obvious trivial partition is the n-partition π = {{} {}... {n}}. If a partition contains at least one cell with more than one node we call it a nontrivial equitable partition (NE) and the adjacency matrix of a quotient is given by A(G/π) ij = b ij. Now the equitable partition can be derived from graph automorphisms. For example in the so-called eterson graph shown in Figure (a) one equitable partition π (Figure (b)) is given by the two orbit of the automorphism groups namely the 5 inner vertices and the 5 outer vertices. The adjacency matrix of the quotient is given by A(G/π ) = Since L f is symmetric its left eigenvectors are equal to the right ones. The sufficiency proof will be given after Lemma.8..
3 The equitable partition can also be introduced by the equal distance partition. Let C V (G) be a given cell and let C i V (G) be the set of vertices at distance i from C. C is said to be completely regular if its distance partition is equitable. For instance every vertex in the eterson graph is completely regular and introduces the partition π as shown in Figure (c). The adjacency matrix of this quotient is given by A(G/π ) = (a) C C Fig.. Example of equitable partitions on (a) the eterson graph G = J(5 ) and the quotients: (b) the NE introduced by the automorphism is π = {C C } C = { 4 5} C = { } and (c) the NE introduced by equal-distance partition is π = {C C C } C = {} C = { 5 6} C = { }. The adjacency matrix of the original graph and the quotient are closely related through the so-called interlacing theorem. But first we introduce the following lemma. Definition.: A characteristic vector p i R n of a nontrivial cell C i has s in the positions associated with C i and s elsewhere. A characteristic matrix R n r of a partition π of V (G) is a matrix with the characteristic vectors of the cells as its columns. For example the characteristic matrix of the equitable partition of the graph in Figure (a) is given by =. () Fig (a) (b) (b) C C (c) 4 The (a) equitable partition and (b) the quotient of a graph. Lemma.: (4 Lemma 9..) Let be the characteristic matrix of an equitable partition π of the graph G and let C  = A(G/π). Then A =  and  = + A where + = ( T ) T is the pseudo-inverse of. As an example the graph in Figure has a nontrivial cell ( ). The adjacency matrix of original graph is A = The adjacency matrix of the quotient is  = + A =. Lemma.4: (4 Lemma 9..) Let G be a graph with adjacency matrix A and let π be a partition of V(G) with characteristic matrix then π is equitable if and only if the column space of is A-invariant. Lemma.5: Given a symmetric matrix A R n n and let S be a subspace of R n. Then S is A-invariant if and only if S is A-invariant. The proof of this well-known fact can for example be found in 6. Remark.6: Let R( ) denote the range space. Suppose V(G) = n C i = n i and π = r then we can find an orthogonal decomposition for R n as R n = R( ) R(Q) () where the matrix Q satisfies R(Q) = R( ) such that its columns together with those of form a basis for R n. Following Lemma.5 R(Q) is also A invariant. Unlike matrix Q is derived from the nullspace of and can be constructed in different ways. One possible choice of such a Q is the n n r matrix with r column blocks Q = Q Q... Q r where Q i R n ni corresponds to C i. Moreover each column sums to zero in the positions associated with C i and has zeros in the other positions. In other words Q i = Q i n (n i ). In Q i the upper and lower parts are zero matrices with appropriate dimensions (possibly empty). One possible choice of Q i would be Q i = Ini T (4) n i (n i ) where R ni is a vector with ones in each position. Based on this method the Q matrix for the equitable
4 partition in Figure (a) can be given by Q = Q = T and thus Q = T. The other choice of Q matrix is using the orthonormal basis of R( ). We denote this matrix as Q. If we define = ( T ). (5) Note that the invertibility of T follows from the fact that the cells of the partition are nonempty. Moreover it satisfies that T Q = and QT Q = In r. In other words T = Q (6) is a matrix whose columns are defined on an orthonormal basis of R n based on the equitable partition π and and Q have the same column spaces as and Q respectively. Theorem.7: (4 Theorem 9..) If π is an equitable partition of a graph G then the characteristic polynomial of  = A(G/π) divides the characteristic polynomial of A(G). Lemma.8: (4 Theorem 9.5.) Let Φ R n n be a real symmetric matrix and let R R n m be such that R T R = I m. Set Ψ = R T ΦR and let v v... v m be an orthogonal set of eigenvectors for Ψ such that Ψv i = θ i (Ψ)v i where θ i (Ψ) R is an eigenvalue of Ψ. Then ) The eigenvalues of Ψ interlace the eigenvalues of Φ. ) If θ i (Ψ) = θ i (Φ) then there is an eigenvector v of Ψ with eigenvalue θ i (Ψ) such that Rv is an eigenvector of Φ with eigenvalue θ i (Φ). ) If θ i (Ψ) = θ i (Φ) for i = i... l then Rv i is an eigenvector for A with eigenvalue θ i (Φ) for i = i... l. 4) If the interlacing is tight then ΦR = RΨ. Now we are in the position to prove the sufficiency of Lemma. i.e. if L and L f share a common eigenvalue the system (L l fl ) is not completely controllable. roof of Sufficiency of Lemma.: Since L f is a principle sub-matrix of L it can be given by L f = R T LR where R = I nf T R n n f. Following Lemma.8() if L f and L share a common eigenvalue say λ then the corresponding eigenvector satisfies vf v = Rv f = where v is λ s eigenvector of L and v f is that of L f. Moreover we know that Lf l Lv = fl vf vf lfl T = λ L l which gives us l T fl v f = and thus the system is uncontrollable. In fact T is a diagonal matrix with ( T ) ii = C i. Now we have shown that the existence of a common eigenvalue shared by L and L f is a necessary and sufficient condition for the leader-follower network to be uncontrollable. IV. CONTROLLABILITY In this section we will utilize a graph theoretic approach to characterize the necessary condition for a multiple-leader networked system to be controllable. The way we approach this necessary condition is through Lemma.. In what follows we will show first that both L and L f are both similarity to some block diagonal matrices. Then we will furthermore show that under some circumstances the diagonal block matrices resulted from diagonalize L and L f have some diagonal block(s) in common. Lemma 4.: If a graph G has a nontrivial equitable partition (NE) π with characteristic matrix the adjacency matrix A(G) of the graph is similar to a diagonal matrix A Ā = A Q where A is similar to the adjacency matrix  = A(G/π) of the quotient. roof: Let the matrix T = Q be the orthonormal matrix with respect to π as what we have defined in (6). Now let Ā = T T AT = T A T A Q Q T A QT A Q. (7) Since and Q have the same column spaces as and Q respectively they inherit the A invariance property i.e. A = B and A Q = QC. for some matrices B and C. Since their column spaces are orthogonal complements to each other we get and T A Q = T QC = Q T A = Q T B =. In addition let D p = T we get T A = D T A D = D (D T A )D (8) = D ÂD and therefore the first diagonal block is similar to Â. Lemma 4.: Let be the characteristic matrix of a NE in G. R( ) is K-invariant where K is any diagonal block matrix of the form K = diag(k i I ni ) r i=
5 where k i R n i = C i is the cardinality of the cell and r = π is the cardinality of the partition. Consequently Q T K = where = ( T ) and Q is chosen in such a way that T = Q is a orthonormal matrix. roof: Since =. r = p p... p r where i R ni r is a row block which has s in column i and s elsewhere. On the other hand p i is a characteristic vector representing C i which has s in the positions associated with C i and zeros otherwise. Recall the example given in () = (9) and we can find = while p = T. With a little bit calculation we can find k k K =. = k p k p... k r p r = ˆK k r r where ˆK = diag(k i ) r i= which shows that R( ) is K- invariant. Since R( Q) = R( ) it is K-invariant as well by Lemma.5 and Q T K = Q T ˆK =. By the definition of the equitable partition the subgraph induced by a cell is regular and every node in the same cell has the same number of neighbors outside the cell. Therefore the nodes belonging to the same cell have the same degree and thus by Lemma 4. R( Q) and R( ) are D-invariant where D is the degree matrix given by D = diag(d i I ni ) r i= where d i R denotes the degree of each nodes in cell. Since the graph Laplacian satisfy L(G) = D(G) A(G) Lemma 4. and Lemma 4. together can show that R( Q) and R( ) are L-invariant and thus we have following corollary Corollary 4.: Given the same condition as in Lemma 4. L is similar to a diagonal block matrix L = T T L LT = () L Q where L = T L and L Q = Q T L Q and T = Q defines a orthonormal basis for R n with respect to π. As () defines a similarity transformation it follows that L and L Q carry all the spectrum information of L i.e. they share eigenvalues with L. Now that as we have show in Section II in a leaderfollower network the graph Laplacian can be partitioned as Lf l L = fl lfl T L l according to the leader assigning scheme. Transformations similar to () can be found for L f in the presence of NEs in the follower graph G f. Corollary 4.4: Let G f be a follower graph and let L f be the diagonal sub-matrix of L related to G f. If there is a NE π f in G f and a π in G such that all the nontrivial cells in π f are also cells in π there exists an orthonormal matrix T f such that L f = Tf T Lf L f T f =. () L fq roof: Let f = f (f T f ) where f is the characteristic matrix for π f and let Qf be defined on a orthonormal basis of R( f ). In the above way we have obtained an orthonormal basis for R n f with respect to π f. Moreover L f = D f +A f where A f denotes the adjacency matrix of G f while D f is the degree matrix corresponding to the original graph G. Since all the nontrivial cells in π f are also cells in π D f satisfies the condition in Lemma 4. i.e. nodes from an identical cell in π f have the same degree. Hence from Lemma 4. and Lemma 4. R( ) and R( Q) are L f - invariant and thus L f = Tf T Lf L f T f = () L fq where T f = f Qf L f = T f L f f and L fq = Q T f L f Q f. Again the diagonal blocks of L f share all the spectrum information with L f. Now we are in the position to prove our main result. Theorem 4.5: Given a connected graph G and the induced follower graph G f the system (L f l fl ) is not complete controllable if there exist NEs on G and G f say π and π f such that all the nontrivial cells of π are contained in π f i.e. π and π f such that C i = C i π\π f. roof: In Corollary 4. and Corollary 4.4 we have already shown that L and L f are both similar to some diagonal block matrices. Here we want to show the relation ship between these diagonal block matrices.
6 Assume π π f = {C C... C r }. According to the given condition C i i =... r. Without loss of generality we can index the nodes in such a way that the nontrivial cells comprise the first n nodes 4 such that n = r i= C i n f < n. Since all the nontrivial cells of π are in π f their characteristic matrices have similar structures = and I f = n n I nf n n r n f r f where is a n r matrix that contains the nontrivial part of the characteristic matrices. Since and f are only normalized and f respectively they have the same block structures. Consequently Q and Q f the matrices containing orthonormal basis of R( ) and R( f ) have following structures Q = Q n (n r ) and Q f = Q where Q is a n (n r ) matrix that satisfies Q T =. n f (n r ) As one can observe Qf is different from Q only by n n f rows of zeros. In other words the special structures of Q and Q f gives us the relationship Q f = R T Q where R = I nf T. Now recall the definition of L Q and L Qf from () and () which gives us L Q = Q T L Q = Q T f R T LR Q f = Q T f L f Qf = L fq. () Therefore L f and L share the same eigenvalues associated with L Q and by Lemma. the system is not completely controllable. In the situation described in Theorem 4.5 the system is not completely controllable. This theorem thus gives us a method to identify uncontrollable situations in a leaderfollower system. Intuitively speaking vertices in the same cell of a NE that satisfy the condition in Theorem 4.5 is not distinguishable from the leaders point of view. In other words if the agents belong to the same cell shared by π and π f and they start from the same point it is impossible for the leaders to pull them apart. Thus the controllable subspace can be obtained by collapsing all the nodes in the same cell into a single meta-node. However since the NEs may not be unique as we have seen in the case of the eterson graph more work is required before a complete understanding of this issue is obtained. Note that our sufficient condition for a graph to be uncontrollable immediately produces a necessary condition for a graph to be controllable and this states as a corollary. Corollary 4.6: Given a connected graph G with the induced follower graph G f a necessary for (L f l fl ) to be controllable is that no NEs π and π f on G and G f exist such that π and π f share all nontrivial cells. Corollary 4.7: If G is disconnected a necessary condition for (L f l fl ) to be controllable is that all of its connected components are controllable. V. EXAMLES AND DISCUSSIONS In this part we will show some uncontrollable situations that are identifiable by our method and discuss the relationship among some existing results our result and our ultimate goal. a) Single Leader with Symmetric Followers. In Figure if we choose node 5 as the leader the symmetric pair () in the follower graph renders the network uncontrollable as stated in. The dimension of the controllable subspace is three while there are four nodes in the follower group. This result can also be interpreted by Theorem 4.5 since all the automorphism groups introduce equitable partitions. b) Single Leader with Equal Distance artitions. We have shown in Figure that the eterson graph has two NEs. One is introduced by the automorphism groups and the other (π ) is introduced by the equal distance groups. Based on π if we choose node as the leader the leader-follower group ends up with a controllable subspace with dimension of two. Since there are four orbits 5 in the automorphism groups this dimension can only be interpreted by the twocell equal distance partitions 6. c) Multiple Leaders. The last example is a modified leader graph based on the peterson graph. In Figure 4 we add another node ( ) connected to { } as the second leader in addition to node. In this network there is an equal distance partition with four cells {} { 5 6} { } and {}. In this situation the dimension of the controllable subspace is still two which is consistent with example b). The examples above can be put into a graph described in Figure 5 which shows the relationship among previous theorems our theorem and the ultimate goal of this line of work. This paper provides a tool which can identify a subset of the uncontrollable follower graph represented by II which represents the graphs satisfy the condition described in Theorem 4.5. Since that condition is based on NEs and is able to deal with multiple leaders we can identify a larger set of graphs than the set of graphs in I which has been revealed by some previous works. Our ultimate goal is to achieve a necessary and sufficient condition which can gives us a topological insight of the network. This condition should 4 We introduce n for convenience. It is easy to verify that n r = n r = n f r f 5 They are { 5 6} {7 } {8 9} { 4} 6 They are { 5 6} and { }
7 Fig. 4. A -leader network based on the eterson graph. The second leader is connected to and. R. O. Saber and R. M. Murray Consensus problems in networks of agents with switching topology and time-delays IEEE Trans. Automat. Contr. vol. 49 pp. 5 5 Sept 4. M. Mesbahi State-dependent graphs in roceedings of the 4 nd IEEE Conference on Decision and Control Maui Hawaii USA Dec. pp R. O. Saber and R. M. Murray Agreement problems in networks with directed graphs and switching toplogy in roceedings of the 4 nd IEEE Conference on Decision and Control vol. 4 Maui Hawaii USA Dec. pp H. Tanner A. Jadbabaie and G. appas Stable flocking of mobile agents part II : Dynamic topology in roceedings of the 4 nd IEEE Conference on Decision and Control pp R. Olfati-Saber Flocking for multi-agent dynamic systems: Algorithms and theory IEEE Trans. Automat. Contr. vol. 5 no. pp. 4 4 March 6. 6 D. Luenberger Optimization by vector space methods. New York: Wiley 969. be able to identify all the uncontrollable follower graph in III. IV III II I c a b Fig. 5. The relationship among some previous work our theorem and the desired ultimate result: I. The follower graphs containing automorphism groups (single leader); II. The follower graphs identifiable by Theorem 4.5 of this paper; III. The follower graphs that are not completely controllable; IV. All the follower graphs. REFERENCES M. Ji A. Muhammad and M. Egerstedt Leader-based multi-agent coordination: Controllability and optimal control in roceedings of the American Control Conference 6 Minneapolis MN June 6 pp H. G. Tanner On the controllability of nearest neighbor interconnections in roceedings of the 4 rd IEEE Conference on Decision and Control Dec. 4 pp A. Rahmani and M. Mesbahi On the controlled agreement problem in roceedings of the American Control Conference 6 June 6 pp C. Godsil and G. Royle Algebraic graph theory. Springer. 5 A. Jadbabaie J. Lin and A. S. Morse Coordination of groups of mobile autonomous agents using nearest neighbor rules IEEE Trans. Automat. Contr. vol. 48 no. 6 pp. 988 June. 6 J. Cortés S. Martínez and F. Bullo Robust rendezvous for mobile autonomous agents via proximity graphs in d dimension IEEE Trans. Robot. Automat. vol. 5 no. 8 pp Z. Lin M. Broucke and B. Francis Local control strategies for groups of mobile autonomous agents IEEE Trans. Automat. Contr. vol. 49 no. 4 pp J. Fax and R. Murray Information flow and cooperative control of vehicle formations IEEE Trans. Automat. Contr. vol. 49 pp Sept 4. 9 R. W. Beard J. R. Lawton and F. Y. Hadaegh A coordination architecture for spacecraft formation control IEEE Trans. Contr. Syst. Technol. vol. 9 no. 6 pp Nov.. J. Desai J. Ostrowski and V. Kumar Controlling formations of multiple mobile robots in roc.ieee Int. Conf. Robot. Automat. Leuven Belgium May 998 pp
Observability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation
1 Observability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation Mauro Franceschelli, Simone Martini, Magnus Egerstedt, Antonio Bicchi, Alessandro
More informationObservability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation
Observability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation Mauro Franceschelli, Simone Martini, Magnus Egerstedt, Antonio Bicchi, Alessandro
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J. CONTROL OPTIM. Vol. 48 No. 1 pp. 162 186 c 2009 Society for Industrial and Applied Mathematics CONTROLLABILITY OF MULTI-AGENT SYSTEMS FROM A GRAPH-THEORETIC PERSPECTIVE AMIRREZA RAHMANI MENG JI
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 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 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 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 informationFormation Control of Nonholonomic Mobile Robots
Proceedings of the 6 American Control Conference Minneapolis, Minnesota, USA, June -6, 6 FrC Formation Control of Nonholonomic Mobile Robots WJ Dong, Yi Guo, and JA Farrell Abstract In this paper, formation
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 informationControllability analysis of multi-agent systems using relaxed equitable partitions
1 Int J Systems, Control and Communications, Vol 2, Nos 1/2/3, 21 Controllability analysis of multi-agent systems using relaxed equitable partitions Simone Martini* Interdepartmental Research Center, E
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 informationA Graph-Theoretic Characterization of Structural Controllability for Multi-Agent System with Switching Topology
Joint 48th IEEE Conference on Decision and Control and 28th Chinese Control Conference Shanghai, P.R. China, December 16-18, 29 FrAIn2.3 A Graph-Theoretic Characterization of Structural Controllability
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 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 informationarxiv: v1 [math.oc] 12 Feb 2018
Controllability Analysis of Threshold Graphs and Cographs Shima Sadat Mousavi Mohammad Haeri and Mehran Mesbahi arxiv:80204022v [mathoc] 2 Feb 208 Abstract In this paper we investigate the controllability
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 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 informationConsensus 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 informationOn Symmetry and Controllability of Multi-Agent Systems
53rd IEEE Conference on Decision and Control December 15-17, 2014. Los Angeles, California, USA On Symmetry and Controllability of Multi-Agent Systems Airlie Chapman and Mehran Mesbahi Abstract This paper
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 informationOn the reachability and observability. of path and cycle graphs
On the reachability and observability 1 of path and cycle graphs Gianfranco Parlangeli Giuseppe Notarstefano arxiv:1109.3556v1 [math.oc] 16 Sep 2011 Abstract In this paper we investigate the reachability
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 informationFormation Stabilization of Multiple Agents Using Decentralized Navigation Functions
Formation Stabilization of Multiple Agents Using Decentralized Navigation Functions Herbert G. Tanner and Amit Kumar Mechanical Engineering Department University of New Mexico Albuquerque, NM 873- Abstract
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 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 informationDistributed Formation Control While Preserving Connectedness
Proceedings of the 45th IEEE Conference on Decision & Control Manchester Grand Hyatt Hotel San Diego, CA, USA, December 13-15, 2006 Distributed Formation Control While Preserving Connectedness Meng Ji
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 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 informationNecessary and Sufficient Graphical Conditions for Formation Control of Unicycles
Necessary and Sufficient Graphical Conditions for Formation Control of Unicycles Zhiyun Lin, Bruce Francis, and Manfredi Maggiore Abstract The feasibility problem is studied of achieving a specified formation
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 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 informationOn almost equitable partitions and network controllability
2016 American Control Conference (ACC) Boston Marriott Copley Place July 6-8, 2016. Boston, MA, USA On almost equitable partitions and network controllability Cesar O. Aguilar 1 and Bahman Gharesifard
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 informationMax-Consensus in a Max-Plus Algebraic Setting: The Case of Fixed Communication Topologies
Max-Consensus in a Max-Plus Algebraic Setting: The Case of Fixed Communication Topologies Behrang Monajemi Nejad, Sid Ahmed Attia and Jörg Raisch Control Systems Group ( Fachgebiet Regelungssysteme ),
More informationDecentralized Formation Control and Connectivity Maintenance of Multi-Agent Systems using Navigation Functions
Decentralized Formation Control and Connectivity Maintenance of Multi-Agent Systems using Navigation Functions Alireza Ghaffarkhah, Yasamin Mostofi and Chaouki T. Abdallah Abstract In this paper we consider
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 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 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 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 information17.1 Directed Graphs, Undirected Graphs, Incidence Matrices, Adjacency Matrices, Weighted Graphs
Chapter 17 Graphs and Graph Laplacians 17.1 Directed Graphs, Undirected Graphs, Incidence Matrices, Adjacency Matrices, Weighted Graphs Definition 17.1. A directed graph isa pairg =(V,E), where V = {v
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 information1520 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 9, SEPTEMBER Reza Olfati-Saber, Member, IEEE, and Richard M. Murray, Member, IEEE
1520 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 9, SEPTEMBER 2004 Consensus Problems in Networks of Agents With Switching Topology and Time-Delays Reza Olfati-Saber, Member, IEEE, and Richard
More informationStability Analysis of Stochastically Varying Formations of Dynamic Agents
Stability Analysis of Stochastically Varying Formations of Dynamic Agents Vijay Gupta, Babak Hassibi and Richard M. Murray Division of Engineering and Applied Science California Institute of Technology
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 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 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 informationLecture 3: graph theory
CONTENTS 1 BASIC NOTIONS Lecture 3: graph theory Sonia Martínez October 15, 2014 Abstract The notion of graph is at the core of cooperative control. Essentially, it allows us to model the interaction topology
More informationApproximate Manipulability of Leader-Follower Networks
Approximate Manipulability of Leader-Follower Networks Hiroaki Kawashima and Magnus Egerstedt Abstract We introduce the notion of manipulability to leader-follower networks as a tool to analyze how effective
More informationSpectral Theory of Unsigned and Signed Graphs Applications to Graph Clustering. Some Slides
Spectral Theory of Unsigned and Signed Graphs Applications to Graph Clustering Some Slides Jean Gallier Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104,
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 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 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 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 informationDecentralized Estimation of Laplacian Eigenvalues in Multi-Agent Systems
Decentralized Estimation of Laplacian Eigenvalues in Multi-Agent Systems Mauro Franceschelli a, Andrea Gasparri b, Alessandro Giua a, Carla Seatzu a. a Department of Electrical and Electronic Engineering,
More informationZeno-free, distributed event-triggered communication and control for multi-agent average consensus
Zeno-free, distributed event-triggered communication and control for multi-agent average consensus Cameron Nowzari Jorge Cortés Abstract This paper studies a distributed event-triggered communication and
More informationON SEPARATION PRINCIPLE FOR THE DISTRIBUTED ESTIMATION AND CONTROL OF FORMATION FLYING SPACECRAFT
ON SEPARATION PRINCIPLE FOR THE DISTRIBUTED ESTIMATION AND CONTROL OF FORMATION FLYING SPACECRAFT Amir Rahmani (), Olivia Ching (2), and Luis A Rodriguez (3) ()(2)(3) University of Miami, Coral Gables,
More informationOn Graph Isomorphism Problem
On Graph Isomorphism Problem Wenxue Du School of Mathematical Science, Anhui University, Hefei, 30601, China E-mail: wenxuedu@gmail.com Abstract arxiv:1710.0956v1 [math.co 6 Oct 017 Let G and H be two
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 informationRobust Connectivity Analysis for Multi-Agent Systems
Robust Connectivity Analysis for Multi-Agent Systems Dimitris Boskos and Dimos V. Dimarogonas Abstract In this paper we provide a decentralized robust control approach, which guarantees that connectivity
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 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 informationLecture 4: Introduction to Graph Theory and Consensus. Cooperative Control Applications
Lecture 4: Introduction to Graph Theory and Consensus Richard M. Murray Caltech Control and Dynamical Systems 16 March 2009 Goals Introduce some motivating cooperative control problems Describe basic concepts
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 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 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 informationMATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.
MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators. Adjoint operator and adjoint matrix Given a linear operator L on an inner product space V, the adjoint of L is a transformation
More informationFurther Results on the Stability of Distance-Based Multi- Robot Formations
Further Results on the Stability of Distance-Based Multi- Robot Formations The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation
More informationSE(N) Invariance in Networked Systems
SE(N) Invariance in Networked Systems Cristian-Ioan Vasile 1 and Mac Schwager 2 and Calin Belta 3 Abstract In this paper, we study the translational and rotational (SE(N)) invariance properties of locally
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationMulti-Robotic Systems
CHAPTER 9 Multi-Robotic Systems The topic of multi-robotic systems is quite popular now. It is believed that such systems can have the following benefits: Improved performance ( winning by numbers ) Distributed
More informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationOn the Stability of Distance-based Formation Control
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 On the Stability of Distance-based Formation Control Dimos V. Dimarogonas and Karl H. Johansson Abstract
More informationStabilizing a Multi-Agent System to an Equilateral Polygon Formation
Stabilizing a Multi-Agent System to an Equilateral Polygon Formation Stephen L. Smith, Mireille E. Broucke, and Bruce A. Francis Abstract The problem of stabilizing a group of agents in the plane to a
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 informationDecentralized Formation of Random Regular Graphs for Robust Multi-Agent Networks
Decentralized Formation of Random Regular Graphs for Robust Multi-Agent Networks A. Yasin Yazıcıoğlu, Magnus Egerstedt, and Jeff S. Shamma Abstract Multi-agent networks are often modeled via interaction
More informationState Controllability, Output Controllability and Stabilizability of Networks: A Symmetry Perspective
State Controllability, Output Controllability and Stabilizability of Networks: A Symmetry Perspective Airlie Chapman and Mehran Mesbahi Robotics, Aerospace, and Information Networks Lab (RAIN) University
More informationConsensus Algorithms are Input-to-State Stable
05 American Control Conference June 8-10, 05. Portland, OR, USA WeC16.3 Consensus Algorithms are Input-to-State Stable Derek B. Kingston Wei Ren Randal W. Beard Department of Electrical and Computer Engineering
More informationOn Bifurcations in Nonlinear Consensus Networks
American Control Conference Marriott Waterfront, Baltimore, MD, USA June -July, WeC.4 On Bifurcations in Nonlinear Consensus Networks Vaibhav Srivastava Jeff Moehlis Francesco Bullo Abstract The theory
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 informationOn Eigenvalues of Laplacian Matrix for a Class of Directed Signed Graphs
On Eigenvalues of Laplacian Matrix for a Class of Directed Signed Graphs Saeed Ahmadizadeh a, Iman Shames a, Samuel Martin b, Dragan Nešić a a Department of Electrical and Electronic Engineering, Melbourne
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 informationDecentralized Stabilization of Heterogeneous Linear Multi-Agent Systems
1 Decentralized Stabilization of Heterogeneous Linear Multi-Agent Systems Mauro Franceschelli, Andrea Gasparri, Alessandro Giua, and Giovanni Ulivi Abstract In this paper the formation stabilization problem
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 informationDiscrete Double Integrator Consensus
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 28 Discrete Double Integrator Consensus David W. Casbeer, Randy Beard, and A. Lee Swindlehurst Abstract A distributed
More informationThe abundance of embedded computational
Information Consensus in Multivehicle Cooperative Control WEI REN, RANDAL W. BEARD, and ELLA M. ATKINS COLLECTIVE GROUP BEHAVIOR THROUGH LOCAL INTERACTION The abundance of embedded computational resources
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 informationAlmost Sure Convergence to Consensus in Markovian Random Graphs
Proceedings of the 47th IEEE Conference on Decision and Control Cancun, Mexico, Dec. 9-11, 2008 Almost Sure Convergence to Consensus in Markovian Random Graphs Ion Matei, Nuno Martins and John S. Baras
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 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 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 informationCoordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules
University of Pennsylvania ScholarlyCommons Departmental Papers (ESE) Department of Electrical & Systems Engineering June 2003 Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationStable Flocking Motion of Mobile Agents Following a Leader in Fixed and Switching Networks
International Journal of Automation and Computing 1 (2006) 8-16 Stable Flocking Motion of Mobile Agents Following a Leader in Fixed and Switching Networks Hui Yu, Yong-Ji Wang Department of control science
More informationScaling the Size of a Formation using Relative Position Feedback
Scaling the Size of a Formation using Relative Position Feedback Samuel Coogan a, Murat Arcak a a Department of Electrical Engineering and Computer Sciences, University of California, Berkeley Abstract
More informationFastest Distributed Consensus Averaging Problem on. Chain of Rhombus Networks
Fastest Distributed Consensus Averaging Problem on Chain of Rhombus Networks Saber Jafarizadeh Department of Electrical Engineering Sharif University of Technology, Azadi Ave, Tehran, Iran Email: jafarizadeh@ee.sharif.edu
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 informationOn Bifurcations. in Nonlinear Consensus Networks
On Bifurcations in Nonlinear Consensus Networks Vaibhav Srivastava Jeff Moehlis Francesco Bullo Abstract The theory of consensus dynamics is widely employed to study various linear behaviors in networked
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 informationQuadratic and Copositive Lyapunov Functions and the Stability of Positive Switched Linear Systems
Proceedings of the 2007 American Control Conference Marriott Marquis Hotel at Times Square New York City, USA, July 11-13, 2007 WeA20.1 Quadratic and Copositive Lyapunov Functions and the Stability of
More information