On the factorization, observability, and identification of the agreement protocol

2008 Mediterranean Conference on Control and Automation - Conference Proceedings, MED'08

Volumn , Issue , 2008, Pages 1610-1615

  Mesbahi, Mehran ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Agreement protocol; Cartesian product of graphs; Graph factorization; Network identification; Network observability

Indexed keywords

AGREEMENT PROTOCOL; CARTESIAN PRODUCT OF GRAPHS; CONTROL AND AUTOMATION; DECOMPOSABILITY; GRAPH FACTORIZATION; INTRINSIC PROPERTIES; NETWORK IDENTIFICATION; NETWORK OBSERVABILITY; STRUCTURAL FEATURES; SYSTEM IDENTIFICATION PROBLEMS;

FACTORIZATION; IDENTIFICATION (CONTROL SYSTEMS); INDUSTRIAL ENGINEERING;

LAWS AND LEGISLATION;

EID: 52949134814     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MED.2008.4602238     Document Type: Conference Paper

References (25)

1. V. I. Arnold. Ordinary Differential Equations, MIT Press, 1978.
2. F. M. Atay and T. Biyikoglu. Graph operations and synchronization of complex networks, Physical Review E, 72: 016217, 2005.
3. F. Aurenhammer, J. Hagauer, and W. Imrich. f graph factorization. at logarithmic cost per edge, Computational Complexity, 2: 331-349, 1992.
4. D. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation, Prentice-Hall, 1989.
5. N. Biggs. Algebraic Graph Theory, Cambridge University Press, 1993.
6. B. Bollobás. Modern Graph Theory, Springer, 1998.
7. F. R. K. Chung. Spectral Graph Theory, American Mathematical Society, Providence, 1997.
8. R. Diestel. Graph Theory, Springer, 2000.
9. 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.
10. C. Godsil and G. Royle. Algebraic Graph Theory, Springer, 2001.
11. Y. Hatano and M. Mesbahi. Agreement over random networks, IEEE Transactions on Automatic Control, (50) 11: 1867-1872, 2005.
12. R. A. Horn and C. Johnson. Matrix Analysis, Cambridge University Press, 1985.
13. R. A Horn and C. Johnson. Topics in Matrix Analysis, Cambridge University Press, 1991.
14. W. Imrich and S. Klavzar. Product Graphs: Structure and Recognition, Wiley and Sons Inc., 2000.
15. 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.
16. T. Kailath. Linear Systems, Prentice-Hall, Englewood Cliffs, NJ, 1980.
17. J. Lauri and R. Scapellato. Topics in Graph Automorphisms and Reconstruction, Cambridge University Press, 2003.
18. R. Merris. Laplacian matrices of graphs: a survey, Linear Algebra and its Applications, 197,198: 143-176, 1994.
19. B. Mohar. Some application of Laplace eigenvalues of graph,in Graph Symmetry: Algebraic Methods and Applications, G. Hahn and G. Sabidussi (Editors), Kluwer, 1997.
20. R. M. Murray (Editor). Control in an Information Rich World: Report of the Panel on Future Directions in Control, Dynamics, and Systems, SIAM, 2003.
21. 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.
22. G. Sabidussi. Graph Multiplication. Mathematische Zeitschrift, 72:446-457, 1960.
23. D. Siljak. Large-scale Dynamic Systems: Stability and Structure, North-Holland, 1978.
24. P. M. Winkler. Factoring a graph in polynomial time, European Journal Columbin, 8: 209-212, 1987.
25. V. G. Vizing. The Cartesian product of graphs, English translation, Comp. El. System, 2: 352-365, 1966.