On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian

Proceedings of the American Control Conference

Volumn 1, Issue , 2005, Pages 99-103

  Kim, Yoonsoo ^a   Mesbahi, Mehran ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Euclidean distance matrix; Graph Laplacian; Networked dynamic systems; Semidefinite programming

Indexed keywords

ALGEBRAIC GRAPH; CRITICAL PARAMETERS; VERTEX SETS; WEIGHTED GRAPHS;

GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY; SYSTEM STABILITY;

CONTROL SYSTEM ANALYSIS;

EID: 23944503840     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. http://fewcal.kub.nl/sturm/sofiware/sedumi.html
2. A. Berman and X-D. Zhang. Lower bounds for the eigenvalues of Laplacian matrices. Linear Algebra and its Applications, 316: 13-20, 2000.
3. S. Boyd and L. Vandenberghe. Convex Programming, Cambridge University Press, 2003.
4. F. R. K. Chung and K. Oden. Weighted graph Laplacians and isoperimetric inequalities. Pacific Journal of Mathematics, 192 (2): 257-273, 2000.
5. S. Fallat and S. Kirkland. Extremizing algebraic connectivity subject to graph theoretic constraints. The Electronic Journal of Linear Algebra, (3) 1: 48-74, 1998.
6. J. A. Fax and R. M. Murray. Information flow and cooperative control of vehicle formations, IEEE Transactions on Automatic Control, (49) 9: 1465-1476, 2004.
7. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its applications in graph theory. Czechoslovak Mathematical Journal, (26) 100: 619-633, 1975.
8. C. Godsil and G. Royle. Algebraic Graph Theory, Springer-Verlag, 2001.
9. J. Cower. Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra and its Applications, (67) 1: 81-97, 1985.
10. S. Guattery and G. L. Miller. On the quality of spectral separators, SIAM Journal on Matrix Analysis and Applications, 19 (3): 701-719, 1998.
11. A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Transactions on Automatic Control. (48) 6: 988-1001. 2003.
12. Y. Kim and M. Mesbahi. Quadratically constrained attitude control via semidefi nite programming, IEEE Transaction on Automatic Control (49) 5: 731-735, 2004.
13. R. Merris. Laplacian matrices of graphs: a survey. Linear Algebra and its Applications, 197(1): 143-176, 1994.
14. M. Mesbahi. State-dependent graphs and their controllability properties, IEEE Transaction on Automatic Control (to appear).
15. H. Q. Ngo and D.-Z. Du. Notes on the complexity of switching networks, in Advances in Switching Networks, H. Q. Ngo and D.-Z. Du (Editors), Kluwer Academic Publishers, pp. 307-357, 2000.
16. R. Olfati-Saber and R. M. Murray. Consensus problems in networks of agents with switching topology and time-delays, IEEE Transactions on Automatic Control, (49) 9: 1520- 1533, 2004.
17. K. Pahlavan and A. H. Levesque. Wireless Information Networks, John Wiley and Sons, Inc., New York, 1995.
18. H. Tanner, A. Jadbabaie. and G. Pappas. "Rocking in fixed and switching networks," Automatica (submitted).
19. L. Xiao and S. Boyd. Fast linear iterations for distributed averaging, Systems and Control Letters, 53: 65-78, 2004.