Lecture 4: Introduction to Graph Theory and Consensus. Cooperative Control Applications
|
|
- Poppy Doyle
- 6 years ago
- Views:
Transcription
1 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 in graph theory (review) Introduce matrices associated with graphs and related properties (spectra) Based on CDS 270 notes by Reza Olfati-Saber (Dartmouth) and PhD thesis of Alex Fax (Northrop Grumman). References R. Diestel, Graph Theory. Springer-Verlag, C. Godsil and G. Royle, Algebraic Graph Theory. Springer, R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge Univ Press,1987. R. Olfati-Saber and M, Consensus Problems in Networks of Agents, IEEE Transactions on Automatic Control, Cooperative Control Applications Transportation Air traffic control Intelligent transportation systems (ala California PATH project) Military Distributed aperture imaging Battlespace management Scientific Distributed aperture imaging Adaptive sensor networks (eg, Adaptive Ocean Sampling Network) Commercial Building sensor networks (related) Non-vehicle based applications Communication networks (routing,...) Power grid, supply chain mgmt EECI, Mar 09 Richard M. Murray, Caltech CDS 2
2 Cooperative Control Systems Framework M JGCD, 2007 Agent dynamics ẋ i = f i (x i,u i ) y i = h i (x i ) x i R n,u i R m y i R q Vehicle role α A encodes internal state + relationship to current task Transition α = r(x, α) Communications graph G Encodes the system information flow Neighbor set N i (x, α) Communications channel Communicated information can be lost, delayed, reordered; rate constraints y i j[k] =γy i (t k τ j ) t k+1 t k >T r! = binary random process (packet loss) Task Encode as finite horizon optimal control J = T 0 Assume task is coupled, env t estimated Decentralized strategy L(x, α, E(t),u) dt + V (x(t ), α(t )), Strategy Control action for individual agents u i = k i (x, α) {gj(x, i α) : rj(x, i α)} { α i rj i (x, α) g(x, α) = true = unchanged otherwise. u i (x, α) =u i (x i, α i,y i, α i, Ê) y i = {y j 1,..., y j m i } j k N i m i = N i Similar structure for role update ISAT, Feb 09 Richard M. Murray, Caltech CDS 3 Information Flow in Vehicle Formations Sensed information Local sensors can see some subset of nearby vehicles Assume small time delays, pos n/vel info only Communicated information Point to point communications (routing OK) Assume limited bandwidth, some time delay Advantage: can send more complex information Example: satellite formation Blue links represent sensed information Green links represent communicated information Topological features Information flow (sensed or communicated) represents a directed graph Cycles in graph! information feedback loops Question: How does topological structure of information flow affect stability of the overall formation? EECI, Mar 09 Richard M. Murray, Caltech CDS 4
3 A Primer on Graph Theory Richard M. Murray Control and Dynamical Systems California Institute of Technology December 2007 Goals: Describe basic concepts in graph theory (review) Introduce matrices associated with graphs and related properties (spectra) Example: asymptotic concensus Based on CDS 270 notes by Reza Olfati-Saber (Dartmouth) and PhD thesis of Alex Fax (Northrop Grumman). References: 1. R. Diestel, Graph Theory. Springer-Verlag, C. Godsil and G. Royle, Algebraic Graph Theory. Springer, R. A. Horn and C. R. Johnson, Matrix Analysis. Cambridge Univ Press, Basic Definitions Definition. A graph is a pair G =(V, E) that consists of a set of vertices V and a set of edges E V V: Vertices: v i V Edges: e ij =(v i,v j ) E 1
4 Example: V = {1, 2, 3, 4, 5, 6} E = {(1, 6), (2, 1), (2, 3), (2, 6), (6, 2), (3, 4), Notation: (3, 6), (4, 3), (4, 5), (5, 1), (6, 1), (6, 2), (6, 4)} Order of a graph = number of nodes: V v i and v j are adjacent if there exists e =(v i,v j ) An adjacent node v j for a node v i is called a neighbor of v i N i = set of all neighbors of v i Gis complete if all nodes are adjacent Undirected graphs A graph is undirected if e ij E = e ji E Degree of a node: deg(v i ) := N i A graph is regular (or k-regular) if all vertices of a graph have the same degree k Directed graphs (digraph) Out-degree of v i : deg out = number of edges e ij =(v i,v j ) In-degree of v i : deg in = number of edges e ki =(v k,v i ) Balanced graphs A graph is balanced if out-degree = in-degree at each node 2. Connectedness of Graphs Paths A path is a subgraph π = (V, E π ) G with distinct nodes V = {v 1,v 2,..., v m } and E π := {(v 1,v 2 ), (v 2,v 3 ),..., (v m 1,v m )}. The length of π is defined as E π = m 1. 2
5 A cycle (or m-cycle) C =(V, E C ) is a path (of length m) with an extra edge (v m,v 1 ) E. The distance between two nodes v and w is the length of the shortest path between them. Connectivity of undirected graphs An undirected graph G is called connected if there exists a path π between any two distinct nodes of G. For a connected graph G, the length of the maximum distance between two vertices is called the diameter of G. A graph with no cycles is called acyclic A tree is a connected acyclic graph Connectivity of directed graphs A digraph is called strongly connected if there exists a directed path π between any two distinct nodes of G. A digraph is called weakly connected if there exists an undirected path between any two distinct nodes of G. 3. Matrices Associated with a Graph The adjacency matrix A =[a ij ] R n n of a graph G of order n is given by: { 1 if (v i,v j ) E a ij := 0 otherwise The degree matrix of a graph as a diagonal n n (n = V ) matrix = diag{deg out (v i )} with diagonal elements equal to the out-degree of each node and zero everywhere else. The Laplacian matrix L of a graph is defined as L = A. The row sums of the Laplacian are all A = L =
6 4. Periodic Graphics and Weighted Graphs Periodic and acyclic graphs A graph with the property that the set of all cycle lengths has a common divisor k>1 is called k-periodic. A graph without cycles is said to be acyclic. Weighted graphs A weighted graph is graph (V, E) together with a map ϕ : E R that assigns a real number w ij = ϕ(e ij ) called a weight to an edge e ij =(v i,v j ) E. The set of all weights associated with E is denoted by W. A weighted graph can be represented as a triplet G =(V, E, W). Weighted Laplacian In some applications it is natural to normalize the Laplacian by the outdegree L := 1 L = I Ã, where à = 1 A (weighted adjacency matrix). 5. Consensus protocols Consider a collection of N agents that communicate along a set of undirected links described by a graph G. Each agent has a state x i with initial value x i (0) and together they wish to determine the average of the initial states Ave(x(0)) = 1/N x i (0). The agents implement the following consensus protocol: ẋ i = j N i (x j x i )= N i (x i Ave(x Ni )) which is equivalent to the dynamical system ẋ = u u = Lx. Proposition 1. If the graph is connected, the state of the agents converges to x i = Ave(x(0)) exponentially fast. Proposition 1 implies that the spectra of L controls the stability (and convergence) of the consensus protocol. To (partially) prove this theorem, we need to show that the eigenvalues of L are all positive. 4
7 6. Gershgorin Disk Theorem Theorem 2 (Gershgorin Disk Theorem). Let A =[a ij ] R n n and define the deleted absolute row sums of A as r i := n j=1,j i a ij (1) Then all the eigenvalues of A are located in the union of n disks G(A) := n G i (A), with G i (A) := {z C : z a ii r i } (2) i=1 Furthermore, if a union of k of these n disks forms a connected region that is disjoint from all the remaining n k disks, then there are precisely k eigenvalues of A in this region. Sketch of proof Let λ be an eigenvalue of A and let v be a corresponding eigenvector. Choose i such that v i = max j v j > 0. Since v is an eigenvector, λv i = i A ij v j = (λ a ii )v i = i j A ij v j Now divide by v i 0 and take the absolute value to obtain λ a ii = a ij v j a ij = r i j i j i 7. Properties of the Laplacian (1) Proposition 3. Let L be the Laplacian matrix of a digraph G with maximum node out degree of d max > 0. Then all the eigenvalues of A = L are located in a disk B(G) := {s C : s + d max d max } (3) that is located in the closed LHP of s-plane and is tangent to the imaginary axis at s =0. Proposition 4. Let L be the weighted Laplacian matrix of a digraph G. Then all the eigenvalues of A = L are located inside a disk of radius 1 that is located in the closed LHP of s-plane and is tangent to the imaginary axis at s =0. 5
8 Theorem 5 (Olfati-Saber). Let G =(V, E, W) be a weighted digraph of order n with Laplacian L. If G is strongly connected, then rank(l) =n 1. Remarks: Proof for the directed case is standard Proof for undirected case is available in Olfati-Saber & M, 2004 (IEEE TAC) For directed graphs, need G to be strongly connected and converse is not true. 8. Proof of Consensus Protocol ẋ = Lx L = A Note first that the subspaced spanned by 1 = (1, 1,..., 1) T is an invariant subspace since L 1 = 0 Assume that there are no other eigenvectors with eigenvalue 0. Hence it suffices to look at the convergence on the complementary subspace 1. Let δ be the disagreement vector δ = x Ave(x(0)) 1 and take the square of the norm of δ as a Lyapunov function candidate, i.e. define V (δ) = δ 2 = δ T δ (4) Differentiating V (δ) along the solution of δ = Lδ, we obtain V (δ) = 2δ T Lδ < 0, δ 0, (5) where we have used the fact that G is connected and hence has only 1 zero eigenvalue (along 1). Thus, δ = 0 is globally asymptotically stable and δ 0 as t +, i.e. x = lim t + x(t) =α 0 1 because α(t) = α 0 = Ave(x(0)), t >0. In other words, the average consensus is globally asymptotically achieved. 9. Perron-Frobenius Theory Spectral radius: spec(l) ={λ 1,..., λ n } is called the spectrum of L. ρ(l) = λ n = max k λ k is called the spectral radius of L 6
9 Theorem 6 (Perron s Theorem, 1907). If A R n n is a positive matrix (A >0), then 1. ρ(a) > 0; 2. r = ρ(a) is an eigenvalue of A; 3. There exists a positive vector x>0 such that Ax = ρ(a)x; 4. λ <ρ(a) for every eigenvalue λ ρ(a) of A, i.e. ρ(a) is the unique eigenvalue of maximum modulus; and 5. [ρ(a) 1 A] m R as m + where R = xy T, Ax = ρ(a)x, A T y = ρ(a)y, x>0, y>0, and x T y =1. Theorem 7 (Perron s Theorem for Non Negative Matrices). If A R n n is a non-negative matrix (A 0), then ρ(a) is an eigenvalue of A and there is a non negative vector x 0, x 0, such that Ax = ρ(a)x. 10. Irreducible Graphs and Matrices Irreducibility A directed graph is irreducible if, given any two vertices, there exists a path from the first vertex to the second. (Irreducible = strongly connected) A matrix is irreducible if it is not similar to a block upper triangular matrix via a permutation. A digraph is irreducible if and only if its adjacency matrix is irreducible. Theorem 8 (Frobenius). Let A R n n and suppose that A is irreducible and non-negative. Then 1. ρ(a) > 0; 2. r = ρ(a) is an eigenvalue of A; 3. There is a positive vector x>0 such that Ax = ρ(a)x; 4. r = ρ(a) is an algebraically simple eigenvalue of A; and 5. If A has h eigenvalues of modulus r, then these eigenvalues are all distinct roots of λ h r h =0. 7
10 11. Spectra of the Laplacian Properties of L If G is strongly connected, the zero eigenvalue of L is simple. If G is aperiodic, all nonzero eigenvalues lie in the interior of the Gershgorin disk. If G is k-periodic, L has k evenly spaced eigenvalues on the boundary of the Gershgorin disk. 12. Algebraic Connectivity Theorem 9 (Variant of Courant-Fischer). Let A R n n be a Hermitian matrix with eigenvalues λ 1 λ 2 λ n and let w 1 be the eigenvector of A associated with the eigenvalue λ 1. Then λ 2 = min x 0,x C n, x w 1 x Ax x x = min x x =1, x w 1 x Ax (6) Remarks: λ 2 is called the algebraic connectivity of L For an undirected graph with Laplacian L, the rate of convergence for the consensus protocol is bounded by the second smallest eigenvalue λ Cyclically Separable Graphs Definition (Cyclic separability). A digraph G =(V, E) is cyclically separable if and only if there exists a partition of the set of edges E = nc k=1 E k such that each partition E k corresponds to either the edges of a cycle of the graph, or a pair of directed edges ij and ji that constitute an undirected edge. A graph that is not cyclically separable is called cyclically inseparable. Lemma 10. Let L be the Laplacian matrix of a cyclically separable digraph G and set u = Lx, x R n. Then n i=1 u i =0, x R n and 1 = (1,..., 1) T is the left eigenvector of L. 8
11 Proof. The proof follows from the fact that by definition of cyclic separability. We have n i=1 u i = ij E (x j x i )= n c k=1 ij E k (x j x i )=0 because the inner sum is zero over the edges of cycles and undirected edges of the graph. Provides a conservation principle for average consensus 14. Consensus on Balanced Graphs Let G =(V, E) be a digraph. We say G is balanced if and only if the in degree and out degree of all nodes of G are equal, i.e. deg out (v i ) = deg in (v i ), v i V (7) Theorem 11. A digraph is cyclically separable if and only if it is balanced. Corollary Consider a network of integrators with a directed information flow G and nodes that apply the consensus protocol. Then, α = Ave(x) is an invariant quantity if and only if G is balanced. Remarks Balanced graphs generalized undirected graphs and retain many key properties 9
12 Consensus Protocols for Balanced Graphs (a) (b) Algebraic Connectivity= Algebraic Connectivity=0.205 node value 0!10 node value 0!10! time( sec) 300! time( sec) 300 disagreement disagreement time( sec) (a) time( sec) (b) EECI, Mar 09 Richard M. Murray, Caltech CDS 5 Other Uses of Consensus Protocols Computation of other functions besides the average Can adopt the basic approach to compute max, min, etc Chandy/Charpentier: can compute superidempotent functions: f(x Y )=f(f(x) Y ) Basic idea: local conservation implies global conservation Can extend these cases to handle splitting and rejoining as well Distributed Kalman filtering Maintain local estimates of global average and covariance Need to be careful about choosing rates of convergence Node i Node i Sensor Data Covariance Data Low-Pass Consensus Filter Band-Pass Consensus Filter Micro Kalman Filter (µkf) ˆx Sensor Data Covariance Data Low-Pass Consensus Filter Band-Pass Consensus Filter Micro Kalman Filter (µkf) ˆx EECI, Mar 09 Richard M. Murray, Caltech CDS 6 (a) (b) Fig. 2. Node and network architecture for distributed Kalman filtering: (a) archi-
13 Robustness Gupta, Langbort and M CDC 06 What happens if a single node locks up x 2 (0) = 9 x 1 (0) = 4 x 6 (t) = 5 X 5 (t) = 6 Single node can change entire value of the consenus Desired effect for robust behavior: "x I = #/N x 3 (0) = 6 x 4 (t) = 0 Different types of robustness (Gupta, Langbort & M) Type I - node stops communicating (stopping failure) Type II - node communicates constant value Type III - node computes incorrect function (Byzantine failure) Related ideas: delay margin for multi-hop models (Jin and M) Improve consensus rate through multi-hop, but create sensitivity to communcations delay EECI, Mar 09 Richard M. Murray, Caltech CDS 7 Summary Graphs Directed, undirected, connected, strongly complete Cyclic versus acyclic; irreducible, balanced Graph Laplacian L =! - A Spectral properties related to connectivity of graph # zero eigenvalues = # strongly connected components Second largest nonzero eigenvalue ~ weak links Spectral Properties of Graphs Gershgorin s disk theorem Perron-Frobenius theory Examples Consensus problems, distributed computing Distributed control (coming up next...) EECI, Mar 09 Richard M. Murray, Caltech CDS 8
NCS 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 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 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 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 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 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 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 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 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 the convergence of weighted-average consensus
On the convergence of weighted-average consensus Francisco Pedroche Miguel Rebollo Carlos Carrascosa Alberto Palomares arxiv:307.7562v [math.oc] 29 Jul 203 Abstract In this note we give sufficient conditions
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 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 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 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 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 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 informationConvergence Properties of Dynamic Agents Consensus Networks with Broken Links
2008 American Control Conference (to appear) http://wwwcdscaltechedu/~murray/papers/dpbm08-acchtml Convergence Properties of Dynamic Agents Consensus Networks with Broken Links S Di Cairano, A Pasini,
More informationLecture 1 and 2: Introduction and Graph theory basics. Spring EE 194, Networked estimation and control (Prof. Khan) January 23, 2012
Lecture 1 and 2: Introduction and Graph theory basics Spring 2012 - EE 194, Networked estimation and control (Prof. Khan) January 23, 2012 Spring 2012: EE-194-02 Networked estimation and control Schedule
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 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 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 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 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 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 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 informationScientific Computing WS 2018/2019. Lecture 9. Jürgen Fuhrmann Lecture 9 Slide 1
Scientific Computing WS 2018/2019 Lecture 9 Jürgen Fuhrmann juergen.fuhrmann@wias-berlin.de Lecture 9 Slide 1 Lecture 9 Slide 2 Simple iteration with preconditioning Idea: Aû = b iterative scheme û = û
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 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 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 informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationPerron Frobenius Theory
Perron Frobenius Theory Oskar Perron Georg Frobenius (1880 1975) (1849 1917) Stefan Güttel Perron Frobenius Theory 1 / 10 Positive and Nonnegative Matrices Let A, B R m n. A B if a ij b ij i, j, A > B
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 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 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 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 informationNOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES
NOTES ON THE PERRON-FROBENIUS THEORY OF NONNEGATIVE MATRICES MIKE BOYLE. Introduction By a nonnegative matrix we mean a matrix whose entries are nonnegative real numbers. By positive matrix we mean a matrix
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 informationInvertibility and stability. Irreducibly diagonally dominant. Invertibility and stability, stronger result. Reducible matrices
Geršgorin circles Lecture 8: Outline Chapter 6 + Appendix D: Location and perturbation of eigenvalues Some other results on perturbed eigenvalue problems Chapter 8: Nonnegative matrices Geršgorin s Thm:
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 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 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 informationInformation Flow and Cooperative Control of Vehicle Formations
Information Flow and Cooperative Control of Vehicle Formations J. Alexander Fax Richard M. Murray 5 April 23 Submitted, IEEE T. Automatic Control Abstract We consider the problem of cooperation among a
More informationA Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology
A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology Amir Amini, Amir Asif, Arash Mohammadi Electrical and Computer Engineering,, Montreal, Canada.
More informationMarkov Chains, Random Walks on Graphs, and the Laplacian
Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer
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 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 informationAn Event-Triggered Consensus Control with Sampled-Data Mechanism for Multi-agent Systems
Preprints of the 19th World Congress The International Federation of Automatic Control An Event-Triggered Consensus Control with Sampled-Data Mechanism for Multi-agent Systems Feng Zhou, Zhiwu Huang, Weirong
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 informationDefinition A finite Markov chain is a memoryless homogeneous discrete stochastic process with a finite number of states.
Chapter 8 Finite Markov Chains A discrete system is characterized by a set V of states and transitions between the states. V is referred to as the state space. We think of the transitions as occurring
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 informationOn Distributed Coordination of Mobile Agents with Changing Nearest Neighbors
On Distributed Coordination of Mobile Agents with Changing Nearest Neighbors Ali Jadbabaie Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 19104 jadbabai@seas.upenn.edu
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 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 informationNote on deleting a vertex and weak interlacing of the Laplacian spectrum
Electronic Journal of Linear Algebra Volume 16 Article 6 2007 Note on deleting a vertex and weak interlacing of the Laplacian spectrum Zvi Lotker zvilo@cse.bgu.ac.il Follow this and additional works at:
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A. Spielman September 19, 2018 7.1 Overview In today s lecture we will justify some of the behavior we observed when using eigenvectors
More informationarxiv: v1 [cs.ro] 8 Aug 2016
Enforcing Biconnectivity in Multi-robot Systems Mehran Zareh, Lorenzo Sabattini, and Cristian Secchi arxiv:1608.02286v1 [cs.ro] 8 Aug 2016 Abstract Connectivity maintenance is an essential task in multi-robot
More informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A Spielman September 9, 202 7 About these notes These notes are not necessarily an accurate representation of what happened in
More informationPortland State Univ., Feb Diffusion and Consensus on Digraphs
Portland State Univ., Feb 209 Diffusion and Consensus on Digraphs Based on: []: J. S. Caughman, J. J. P. Veerman, Kernels of Directed Graph Laplacians, Electronic Journal of Combinatorics,, No, 2006. [2]:
More informationAn Unbiased Kalman Consensus Algorithm
Proceedings of the 2006 American Control Conference Minneapolis, Minnesota, USA, June 14-16, 2006 ThC01.1 An Unbiased Kalman Consensus Algorithm Mehdi Alighanbari and Jonathan P. How Aerospace Controls
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 informationNonnegative Matrices I
Nonnegative Matrices I Daisuke Oyama Topics in Economic Theory September 26, 2017 References J. L. Stuart, Digraphs and Matrices, in Handbook of Linear Algebra, Chapter 29, 2006. R. A. Brualdi and H. J.
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 informationMajorizations for the Eigenvectors of Graph-Adjacency Matrices: A Tool for Complex Network Design
Majorizations for the Eigenvectors of Graph-Adjacency Matrices: A Tool for Complex Network Design Rahul Dhal Electrical Engineering and Computer Science Washington State University Pullman, WA rdhal@eecs.wsu.edu
More informationMarkov Chains and Spectral Clustering
Markov Chains and Spectral Clustering Ning Liu 1,2 and William J. Stewart 1,3 1 Department of Computer Science North Carolina State University, Raleigh, NC 27695-8206, USA. 2 nliu@ncsu.edu, 3 billy@ncsu.edu
More informationOn the Quality of Wireless Network Connectivity
Globecom 2012 - Ad Hoc and Sensor Networking Symposium On the Quality of Wireless Network Connectivity Soura Dasgupta Department of Electrical and Computer Engineering The University of Iowa Guoqiang Mao
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 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 information18.312: Algebraic Combinatorics Lionel Levine. Lecture (u, v) is a horizontal edge K u,v = i (u, v) is a vertical edge 0 else
18.312: Algebraic Combinatorics Lionel Levine Lecture date: Apr 14, 2011 Lecture 18 Notes by: Taoran Chen 1 Kasteleyn s theorem Theorem 1 (Kasteleyn) Let G be a finite induced subgraph of Z 2. Define the
More informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
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 informationEigenvectors Via Graph Theory
Eigenvectors Via Graph Theory Jennifer Harris Advisor: Dr. David Garth October 3, 2009 Introduction There is no problem in all mathematics that cannot be solved by direct counting. -Ernst Mach The goal
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 informationSpectral Clustering on Handwritten Digits Database
University of Maryland-College Park Advance Scientific Computing I,II Spectral Clustering on Handwritten Digits Database Author: Danielle Middlebrooks Dmiddle1@math.umd.edu Second year AMSC Student Advisor:
More informationMath 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank
Math 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank David Glickenstein November 3, 4 Representing graphs as matrices It will sometimes be useful to represent graphs
More informationAgreement algorithms for synchronization of clocks in nodes of stochastic networks
UDC 519.248: 62 192 Agreement algorithms for synchronization of clocks in nodes of stochastic networks L. Manita, A. Manita National Research University Higher School of Economics, Moscow Institute of
More informationConsensus-Based Distributed Optimization with Malicious Nodes
Consensus-Based Distributed Optimization with Malicious Nodes Shreyas Sundaram Bahman Gharesifard Abstract We investigate the vulnerabilities of consensusbased distributed optimization protocols to nodes
More informationDistributed Optimization over Networks Gossip-Based Algorithms
Distributed Optimization over Networks Gossip-Based Algorithms Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Random
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 information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationAffine iterations on nonnegative vectors
Affine iterations on nonnegative vectors V. Blondel L. Ninove P. Van Dooren CESAME Université catholique de Louvain Av. G. Lemaître 4 B-348 Louvain-la-Neuve Belgium Introduction In this paper 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 informationStability of Dynamical Systems on a Graph
Stability of Dynamical Systems on a Graph Mohammad Pirani, Thilan Costa and Shreyas Sundaram Abstract We study the stability of largescale discretetime dynamical systems that are composed of interconnected
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
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 informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
More informationStability and Performance of Non-Homogeneous Multi-Agent Systems on a Graph
Stability and Performance of Non-Homogeneous Multi-Agent Systems on a Graph Stefania Tonetti Richard M. Murray Department of Aerospace Engineering, Politecnico di Milano, Milano, Italy e-mail: tonetti@aero.polimi.it).
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 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 informationFinite-Time Consensus Problems for Networks of Dynamic Agents
Finite- Consensus Problems for Networks of Dynamic Agents arxiv:math/774v [math.ds] 5 Jan 7 Long Wang and Feng Xiao Abstract In this paper, finite-time state consensus problems for continuous-time multi-agent
More informationTo appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? 1.
To appear in Monatsh. Math. WHEN IS THE UNION OF TWO UNIT INTERVALS A SELF-SIMILAR SET SATISFYING THE OPEN SET CONDITION? DE-JUN FENG, SU HUA, AND YUAN JI Abstract. Let U λ be the union of two unit intervals
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 informationDetailed Proof of The PerronFrobenius Theorem
Detailed Proof of The PerronFrobenius Theorem Arseny M Shur Ural Federal University October 30, 2016 1 Introduction This famous theorem has numerous applications, but to apply it you should understand
More informationCombinatorial semigroups and induced/deduced operators
Combinatorial semigroups and induced/deduced operators G. Stacey Staples Department of Mathematics and Statistics Southern Illinois University Edwardsville Modified Hypercubes Particular groups & semigroups
More informationDistributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 55, NO. 9, SEPTEMBER 2010 1987 Distributed Randomized Algorithms for the PageRank Computation Hideaki Ishii, Member, IEEE, and Roberto Tempo, Fellow, IEEE Abstract
More informationMathematical Relationships Between Representations of Structure in Linear Interconnected Dynamical Systems
American Control Conference on O'Farrell Street, San Francisco, CA, USA June 9 - July, Mathematical Relationships Between Representations of Structure in Linear Interconnected Dynamical Systems E. Yeung,
More informationANALYSIS OF CONSENSUS AND COLLISION AVOIDANCE USING THE COLLISION CONE APPROACH IN THE PRESENCE OF TIME DELAYS. A Thesis by. Dipendra Khatiwada
ANALYSIS OF CONSENSUS AND COLLISION AVOIDANCE USING THE COLLISION CONE APPROACH IN THE PRESENCE OF TIME DELAYS A Thesis by Dipendra Khatiwada Bachelor of Science, Wichita State University, 2013 Submitted
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 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 information