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

IEEE Transactions on Automatic Control

Volumn 51, Issue 1, 2006, Pages 116-120

  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

ALGORITHMS; EIGENVALUES AND EIGENFUNCTIONS; MATRIX ALGEBRA; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); SET THEORY; SYSTEM STABILITY;

ALGEBRAIC GRAPH THEORY; EUCLIDEAN DISTANCE MATRIX; GRAPH LAPLACIAN; NETWORKED DYNAMIC SYSTEMS; SEMIDEFINITE PROGRAMMING; VERTEX POSITIONAL CONFIGURATION;

GRAPH THEORY;

EID: 31344434725     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2005.861710     Document Type: Article

References (20)

1. SeDuMi. McMaster Univ. [Online]. Available: http://sedumi.mcmaster.ca
2. A. Berman and X.-D. Zhang, "Lower bounds for the eigenvalues of Laplacian matrices," Linear Alg. Appl., vol. 316, pp. 13-20, 2000.
3. S. Boyd and L. Vandenberghe, Convex Programming. Cambridge, U.K.: Cambridge Univ. Press, 2003.
4. F. R. K. Chung, Spectral Graph Theory. Providence, RI: AMS, 1997.
5. F. R. K. Chung and K. Oden, "Weighted graph Laplacians and isoperimetric inequalities," Pacific J. Math., vol. 192, no. 2, pp. 257-273, 2000.
6. S. Fallat and S. Kirkland, "Extremizing algebraic connectivity subject to graph theoretic constraints," Elect. J. Linear Alg., vol. 1, no. 3, pp. 48-74, 1998.
7. J. A. Fax and R. M. Murray, "Information flow and cooperative control of vehicle formations," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1465-1476, Sep. 2004.
8. M. Fiedler, "A property of eigenvectors of nonnegative symmetric matrices and its applications in graph theory" Czech. Math. J., vol. 100, no. 26, pp. 619-633, 1975.
9. C. Godsil and G. Royle, Algebraic Graph Theory. New York: Springer-Verlag, 2001.
10. J. Gower, "Properties of Euclidean and non-Euclidean distance matrices," Linear Alg. Appl., vol. 1, no. 67, pp. 81-97, 1985.
11. S. Guattery and G. L. Miller, "On the quality of spectral separators," SIAM J. Matrix Anal. Appl., vol. 19, no. 3, pp. 701-719, 1998.
12. A. Jadbabaie, J. Lin, and A. S. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Trans. Autom. Control, vol. 48, no. 9, pp. 988-1001, Sep. 2003.
13. Y. Kim and M. Mesbahi, "Quadratically constrained attitude control via semidefinite programming," IEEE Trans. Autom. Control, vol. 49, no. 5, pp. 731-735, May 2004.
14. R. Merris, "Laplacian matrices of graphs: A survey," Linear Alg. Appl., vol. 197, no. 1, pp. 143-176, 1994.
15. M. Mesbahi, "On state-dependent dynamic graphs and their controllability properties," IEEE Trans. Autom. Control, vol. 50, no. 3, pp. 387-392, Mar. 2005.
16. 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, Eds. Norwell, MA: Kluwer, 2000, pp. 307-357.
17. R. Olfati-Saber and R. M. Murray, "Consensus problems in networks of agents with switching topology and time-delays," IEEE Trans. Autom. Control, vol. 49, no. 9, pp. 1520-1533, Sep. 2004.
18. K. Pahlavan and A. H. Levesque, Wireless Information Networks. New York: Wiley, 1995.
19. H. Tanner, A. Jadbabaie, and G. Pappas, "Flocking in fixed and switching networks," Automatica, submitted for publication.
20. L. Xiao and S. Boyd, "Fast linear iterations for distributed averaging," Syst. Control Lett., vol. 53, pp. 65-78, 2004.