Edge Agreement: Graph-Theoretic Performance Bounds and Passivity Analysis

This work explores the properties of the edge variant of the graph Laplacian in the context of the edge agreement problem. We show that the edge Laplacian, and its corresponding agreement protocol, provides a useful perspective on the well-known node agreement, or the consensus algorithm. Specifically, the dynamics induced by the edge Laplacian facilitates a better understanding of the role of certain subgraphs, e.g., cycles and spanning trees, in the original agreement problem. Using the edge Laplacian, we proceed to examine graph-theoretic characterizations of the H2 and H∞ performance for the agreement protocol. These results are subsequently applied in the contexts of optimal sensor placement for consensus-based applications. Finally, the edge Laplacian is employed to provide new insights into the nonlinear extension of linear agreement to agents with passive dynamics.

[1]  Magnus Egerstedt,et al.  Control Using Higher Order Laplacians in Network Topologies , 2006 .

[2]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[3]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[4]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[5]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[6]  Richard M. Murray,et al.  INFORMATION FLOW AND COOPERATIVE CONTROL OF VEHICLE FORMATIONS , 2002 .

[7]  Ivan Gutman,et al.  THE PATH IS THE TREE WITH SMALLEST GREATEST LAPLACIAN EIGENVALUE , 2002 .

[8]  Karl Henrik Johansson,et al.  On the stability of distance-based formation control , 2008, 2008 47th IEEE Conference on Decision and Control.

[9]  Fernando Paganini,et al.  A Course in Robust Control Theory , 2000 .

[10]  Sanjay Lall,et al.  Dissipation inequalities for distributed systems on graphs , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[11]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[12]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[13]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[14]  Francesco Bullo,et al.  Coordination and Geometric Optimization via Distributed Dynamical Systems , 2003, SIAM J. Control. Optim..

[15]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[16]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[17]  M. Mesbahi,et al.  Formation flying control of multiple spacecraft via graphs, matrix inequalities, and switching , 1999, Proceedings of the 1999 IEEE International Conference on Control Applications (Cat. No.99CH36328).

[18]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[19]  Fernando Paganini,et al.  Distributed control of spatially invariant systems , 2002, IEEE Trans. Autom. Control..

[20]  M. Mesbahi,et al.  Relative Sensing Networks: Observability, Estimation, and the Control Structure , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[21]  Alireza Tahbaz-Salehi,et al.  Distributed computation of a sparse cover in sensor networks without location information , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[22]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[23]  M. Mesbahi,et al.  Cuts and cycles in relative sensing and control of spatially distributed systems , 2005, Proceedings of the 2005, American Control Conference, 2005..

[24]  Yingmin Jia,et al.  Distributed robust Hinfinity consensus control in directed networks of agents with time-delay , 2008, Syst. Control. Lett..

[25]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[26]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[27]  Mehran Mesbahi,et al.  Agreement via the edge laplacian , 2007, 2007 46th IEEE Conference on Decision and Control.

[28]  Geir E. Dullerud,et al.  Distributed control design for spatially interconnected systems , 2003, IEEE Trans. Autom. Control..

[29]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[30]  M. Areak,et al.  Passivity as a design tool for group coordination , 2006, 2006 American Control Conference.

[31]  P. Olver.  Nonlinear Systems , 2013 .

[32]  Mehran Mesbahi,et al.  Formation flying control of multiple spacecraft via graphs , 2001 .

[33]  Mehran Mesbahi,et al.  Agreement over random networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).