Robust graph topologies for networked systems

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 45, Issue 26, 2012, Pages 85-90

  Abbas, Waseem ^a   Egerstedt, Magnus ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Graph theoretic models; Linear consensus; Networked systems; Robustness

Indexed keywords

GRAPH THEORY; ROBUSTNESS (CONTROL SYSTEMS);

GRAPH STRUCTURES; GRAPH-THEORETIC MODELS; LINEAR CONSENSUS; NETWORKED SYSTEMS; NOISE CORRUPTION; RELIABLE PERFORMANCE; STRUCTURAL ROBUSTNESS; UNDERLYING NETWORKS;

NETWORKED CONTROL SYSTEMS;

EID: 84880969812     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20120914-2-US-4030.00052     Document Type: Conference Paper

References (12)

1. M. Fiedler. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305, 1973.
2. L.C. Freeman. A set of mesures of centrality based on betweenness. Sociometry, 23:35-41, 1977.
3. W. Ellens, F.M. Spieksma, P. Van Mieghem, A. Jamakovic, and R.E. Kooij. Effective graph resistance. Linear Algebra Appl., 435:2491-2506, 2011.
4. G. Young, L. Scardovi, and N. Leonard. Robustness of noisy consensus dynamics with directed communication. In Proc. American Control Conf., Baltimore, MD, 6312-6317, 2010.
5. A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times. Comput. Compl., 6:312-340, 1996.
6. D.J. Klein, and M. Randić. Resistance distance. J. Math. Chem., 12:81-95, 1993.
7. J. Wang, Y. Tan, and I. Mareels. Robustness Analysis of leader follower consensus. J. Syst. Sci. Compl., 22:186-206, 2009.
8. L. Xiao, S. Boyd, and S. Kim. Distributed average consensus with least-mean-square deviation. J. Parallel and Distributed Computing, 67:33-46, 2007.
9. G. Young, L. Scardovi, and N. Leonard. Rearranging trees for robust consensus. In Proc. IEEE Conf. Decision and Control, Orlando, FL, 1000-1005, 2011.
10. J. Wu, M. Barahona, Y.J. Tan, and H.Z. Deng. Spectral measure of structural robustness in complex networks. IEEE Trans. Systems, Man and Cybernetics, Part A: Systems and Humans, 6:1244-1252, 2011.
11. W. Abbas, and M. Egerstedt. Robust graph topologies for networked systems. Tech. rep, Georgia Tech., 2012. Available from: www.prism.gatech.edu/\ %7Ewabbas3/index-files/tech-report-2012.pdf
12. M. Mesbahi and M. Egerstedt. Graph Theoretic Methods in Multiagent Networks. Princeton University. Press, 2010.