Graph theoretic methods in multiagent networks

Graph Theoretic Methods in Multiagent Networks

Volumn , Issue , 2010, Pages

  Mesbahi, Mehran ^a   Egerstedt, Magnus ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84883932589     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Book

References (255)

1. http://www.esa.int
2. http://fewcal.kub.nl/sturm/software/sedumi.html
3. http://planetquest.jpl.nasa.gov/TPF/
4. R. Agaev and P. Chebotarev. On the spectra of nonsymmetric Laplacian matrices. Linear Algebra and its Applications, 399: 157-168, 2005.
5. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993.
6. M. A. Aizerman, L. A. Gusev, S. V. Petrov, I. M. Smirnova, and L. A. Tenenbaum. Dynamic approach to analysis of structures described by graphs (foundations of graph-dynamics). In Topics in the General Theory of Structures, edited by E. R. Caianiello and M. A. Aizerman. Reidel, 1987.
7. P. Alriksson and A. Rantzer. Distributed Kalman filtering using weighted averaging, Proceedings of the 17th International Symposium on Mathematical Theory of Networks and Systems, July 2006.
8. B. D. O. Anderson and J. B. Moore. Optimal Filtering. Dover, 2005.
9. H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation, 15 (5): 818-828, 1999.
10. M. Arcak. Passivity as a design tool for group coordination. IEEE Transactions on Automatic Control, 52 (8): 1380-1390, 2007.
11. M. Armstrong. Basic Topology. Springer, 1997.
12. L. Arnold. On the asymptotic distribution of the eigenvalues of random matrices. Journal of Mathematical Analysis and Applications, 20: 262-268, 1967.
13. R. J. Aumann. Agreeing to disagree. Annals of Statistics, 4 (6): 1236-1239, 1976.
14. T. Balch and R. C. Arkin. Behavior-based formation control for multi-robot teams. IEEE Transactions on Robotics and Automation, 14 (6): 926-939, 1998.
15. B. Bamieh, F. Paganini, and M. Dahleh. Distributed control of spatially-invariant systems. IEEE Transactions on Automatic Control, 47 (7): 1091-1107, 2002.
16. A-L. Barabási and A. Réka. Emergence of scaling in random networks. Science, 286: 509-512, 1999.
17. R. W. Beard, J. R. Lawton, and F. Y. Hadaegh. A coordination architecture for spacecraft formation control. IEEE Transactions on Control Systems Technology, 9 (6): 777-790, 2001.
18. A. Bensoussan and J. L. Menaldi. Difference equations on weighted graphs. Journal of Convex Analysis, 12 (1): 13-44, 2005.
19. C. Berge. Hypergraphs. North-Holland, 1989.
20. A. Berman and R. Plemmons. Nonnegative Matrices in the Mathematical Sciences. SIAM, 1994.
21. A. Berman and X-D. Zhang. Lower bounds for the eigenvalues of Laplacian matrices. Linear Algebra and its Applications, 316: 13-20, 2000.
22. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation. Prentice-Hall, 1989.
23. N. L. Biggs, E. K. Lloyd, and R. J. Wilson. Graph Theory: 1736-1936. Oxford University Press, 1998.
24. N. Biggs. Algebraic Graph Theory. Cambridge University Press, 1993.
25. V. Blondel, J. M. Hendrickx, and J. Tsitsiklis. On Krause's consensus formation model with state-dependent connectivity. arXiv:0807.2028v1, 2008.
26. B. Bollobás. Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability. Cambridge University Press, 1986.
27. B. Bollobás. Random Graphs. Cambridge University Press, 2001.
28. B. Bollobás. Modern Graph Theory. Springer, 2002.
29. B. Bollobás. Extremal Graph Theory. Dover, 2004.
30. J. A. Bondy and U.S.R. Murty. Graph Theory. Springer, 2008.
31. S. Björkenstam, M. Ji, M. Egerstedt, and C. Martin. Leader-Based Multi-Agent Coordination Through Hybrid Optimal Control. Allerton Conference on Communication, Control, and Computing, 2006.
32. M. Born and E.Wolf. Principles of Optics (sixth edition). Cambridge University Press, 1997.
33. S. P. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory. SIAM, 1994.
34. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. IEEE Transactions on Information Theory, 52 (6): 2508-2530, 2006.
35. B. Brogliato, R. Lozano, B. Maschke, and O. Egeland. Dissipative Systems Analysis and Control: Theory and Applications. Springer, 2006.
36. M. E. Broucke. Disjoint path algorithms for planar reconfiguration of identical vehicles. Proceedings of the American Control Conference, June 2003.
37. M. E. Broucke. Reconfiguration of identical vehicles in 3D. Proceedings of the IEEE Conference on Decision and Control, December 2003.
38. R. Bru, L. Elsner, and M. Neumann. Models of parallel chaotic iteration methods. Linear Algebra and its Applications, 103: 175-192, 1988.
39. L. Bruneau, A. Joye, and M. Merkli, Infinite products of random matrices and repeated interaction dynamics. arXiv:math/0703675v2, Feburary 2008.
40. A. E. Bryson, Jr. and Y-C. Ho. Applied Optimal Control. Taylor and Francis, 1975.
41. F. Bullo, J. Cortés, and S. Martínez. Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms. Princeton University Press, 2009.
42. R. E. Burkard. Selected topics in assignment problems. Discrete Applied Mathematics, 123: 257-302, 2002.
43. R. Carli, F. Fagnani, A. Speranzon, and S. Zampieri. Communication constraints in coordinated consensus problem. Proceedings of the American Control Conference, June 2006.
44. S. Chatterjee and E. Seneta. Towards consensus: some convergence theorems on repeated averaging. Journal of Applied Probability, 14: 89-97, 1977.
45. D. Chazan and W. L. Miranker. Chaotic relaxation. Linear Algebra and its Applications, 2: 199-222, 1969.
46. B-D. Chen and S. Lall. Dissipation inequalities for distributed systems on graphs. Proceedings of the IEEE Conference on Decision and Control, December 2003.
47. F. Chung, L. Lu, and V. Vu. The spectra of random graphs with given expected degrees. Proceedings of the National Academy of Sciences, 100 (11): 6313-6318, 2003.
48. F. Chung and L. Lu. Complex Graphs and Networks. American Mathematical Society, 2006.
49. F. R. K. Chung and K. Oden. Weighted graph Laplacians and isoperimetric inequalities. Pacific Journal of Mathematics, 192 (2): 257-273, 2000.
50. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
51. R. Cogburn. On products of random stochastic matrices. Random Matrices and Their Applications: Proceedings of the AMS-IMSSIAM Joint Summer Research Conference. J. E. Cohen, H. Kesten, C. M. Newman (editors). American Mathematical Society, 1984.
52. R. Conner, M. Heithaus, and L. Barre. Complex social structure, alliance stability and mating access in a bottlenose dolphin "super alliance." Proceedings of the National Academy of Sciences: 987-990, 1992.
53. J. Cortés. Distributed algorithms for reaching consensus on general functions. Automatica, 44 (3): 726-737, 2008.
54. J. Cortés and F. Bullo. Coordination and geometric optimization via distributed dynamical systems. SIAM Journal of Control and Optimization, 45 (5): 1543-1574, 2005.
55. J. Cortés, S. Martínez, and F. Bullo. Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions. IEEE Transactions on Automatic Control, 51 (8): 1289-1298, 2006.
56. I. D. Couzin, Behavioral ecology: social organization in fissionfusion societies. Current Biology, 16: 169-171, 2006.
57. I. D. Couzin and N. R. Franks, Self-organized lane formation and optimized traffic flow in army ants. Proceedings of the Royal Society of London, 270: 139-146, 2003.
58. H. S. M. Coxeter and S. L. Greitzer. Geometry Revisited. Mathematical Association of America, 1967.
59. J. L. Crassidis and J. L. Junkins. Optimal Estimation of Dynamic Systems. Chapman and Hall/CRC, 2004.
60. C. H. Caicedo-Nunez and M. Zefran. Rendezvous under noisy measurements. Proceedings of the IEEE Conference on Decision and Control, December 2008.
61. R. D'Andrea and G. E. Dullerud. Distributed control design for spatially interconnected systems. IEEE Transactions on Automatic Control, 48 (9): 1478-1495, 2003.
62. A. Das and M. Mesbahi. Distributed parameter estimation over sensor networks. IEEE Transactions on Aerospace Systems and Electronics, 45 (4): 1293-1306, 2009.
63. P. Dayawansa and C. F. Martin. A converse Lyapunov theorem for a class of dynamical systems which undergo switching, IEEE Transactions on Automatic Control, 44 (4): 751-760, 1999.
64. M. H. DeGroot. Reaching a consensus. Journal of the American Statistical Association, 69: 118-121, 1974.
65. J. Desai, J. Ostrowski, and V. Kumar. Modeling and control of formations of nonholonomic mobile robots. IEEE Transactions on Robotics and Automation, (17) 6: 905-908, 2001.
66. Desai, J. Ostrowski, and V. Kumar. Controlling formations of multiple mobile robots. Proceedings of IEEE International Conference Robotics and Automation, May 1998.
67. M. Desbrun, A. Hirani, and J. Marsden. Discrete exterior calculus for variational problems in computer graphics and vision. Proceedings of the IEEE Conference on Decision and Control, December 2003.
68. V. de Silva, R. Ghrist, and A. Muhammad. Blind Swarms for Coverage in 2-D. Robotics: Science and Systems, MIT Press, 2005.
69. V. de Silva and R. Ghrist. Coordinate-free coverage in sensor networks with controlled boundaries via homology. International Journal of Robotics Research, 25 (12): 1205-1222, 2006.
70. V. de Silva and R. Ghrist. Coverage in sensor networks via persistent homology. Algebraic and Geometric Topology, 7: 339-358, 2007.
71. R. Diestel. Graph Theory. Springer, 2000.
72. W. B. Dunbar and R. M. Murray. Receding horizon control of multivehicle formations: a distributed implementation. Proceedings of the IEEE Conference on Decision and Control, December 2004.
73. M. Egerstedt, X. Hu, and A. Stotsky. Control of mobile platforms using a virtual vehicle approach. IEEE Transactions on Automatic Control, 46 (11): 1777-1782, 2001.
74. M. Egerstedt and X. Hu. Formation constrained multi-agent control. IEEE Transactions on Robotics and Automation, (17) 6: 947-951, 2001.
75. L. Elsner, I. Koltracht, and M. Neumann. Convergence of sequential and asynchronous nonlinear paracontractions. Numerische Mathematik, 62 (1): 305-319, 1992.
76. P. Erdó́s and A. Rényi. On the evolution of random graphs. Publication of the Mathematical Institute of the Hungarian Academy of Sciences, 5: 17-61, 1960.
77. T. Eren, P.N. Belhumeur, B. D. O. Anderson, and A.S. Morse. A framework for maintaining formations based on rigidity. Proceedings of the 15th IFAC World Congress, 2002.
78. T. Eren, W. Whiteley, B. D. O. Anderson, A. S. Morse, and P. N. Belhumeur. Information structures to secure control of rigid formations with leader-follower architecture. Proceedings of the American Control Conference, June 2005.
79. L. C. Evans. Applied Optimal Control. American Mathematical Society, 1998.
80. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. Shenker. On a network creation game. ACM Symposium on Principles of Distributed Computing, 2003.
81. F. Fagnani and S. Zampieri. Randomized consensus algorithms over large scale networks. IEEE Journal on Selected Areas in Communications, 26 (4): 634-649, 2008.
82. A. Fagiolini, E. M. Visibelli, and A. Bicchi. Logical consensus for distributed network agreement. Proceedings of the IEEE Conference on Decision and Control, December 2008.
83. C. Fall, E. Marland, J.Wagner, and J. Tyson (Editors). Computational Cell Biology. Springer, 2005.
84. S. Fallat and S. Kirkland. Extremizing algebraic connectivity subject to graph theoretic constraints. The Electronic Journal of Linear Algebra, 3 (1): 48-74, 1998.
85. A. Fax and R. M. Murray. Graph Laplacian and stabilization of vehicle formations. Proceedings of the 15th IFAC World Congress, 2002.
86. A. Fax and R. M. Murray. Information flow and cooperative control of vehicle formations. IEEE Transactions on Automatic Control, 49 (9): 1465-1476, 2004.
87. M. Feinberg. Lectures on Chemical Reaction Networks. Notes of lectures given at the Mathematics Research Centre. University of Wisconsin, 1979.
88. G. Ferrari-Trecate, A. Buffa, and M. Gati. Analysis of coordination in multi-agent systems through partial difference equations. Part I: The Laplacian control. Proceedings of the 16th IFAC World Congress, 2005.
89. G. Ferrari-Trecate, M. Egerstedt, A. Buffa, and M. Ji. Laplacian sheep: a hybrid, stop-go policy for leader-based containment control. Hybrid Systems: Computation and Control, Springer, 2006.
90. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23 (98): 298-305, 1973.
91. M. Franceschelli, M. Egerstedt, A. Giua, and C. Mahulea. Constrained invariant motions for networked multi-agent systems. Proceedings of the American Control Conference, June 2009.
92. D. Freedman. Markov Chains. Springer, 1983.
93. R. A. Freeman, P. Yang, and K. M. Lynch. Stability and convergence properties of dynamic average consensus estimators, Proceedings of the IEEE Conference on Decision and Control, December 2006.
94. Z. Füredi and J. Komlós. The eigenvalues of random symmetric matrices. Combinatorica, 1 (3): 233-241, 1981.
95. V. Gazi and K. M. Passino. A class of attraction/repulsion functions for stable swarm aggregations. International Journal of Control, 77: 1567-1579, 2004.
96. A. Gelb (Editor). Applied Optimal Estimation. MIT Press, 1974.
97. A. Ghosh and S. Boyd. Growing well-connected graphs. Proceedings of the IEEE Conference on Decision and Control, December 2006.
98. A. M. Gibbons. Topological Graph Theory. Cambridge University Press, 1985.
99. E. N. Gilbert. Random graphs. Annals of Mathematical Statistics, 30: 1141-1144, 1959.
100. H. Gluck. Almost all simply connected closed surfaces are rigid. Geometric Topology. Lecture Notes in Mathematics, 438: 225-239, Springer, 1975.
101. C. Godsil and G. Royle. Algebraic Graph Theory. Springer, 2001.
102. R. L. Graham, M. Grötschel, and L. Lovász. Handbook of Combinatorics. MIT Press/North-Holland, 1995.
103. J. L. Gross and T. W. Tucker. Topological Graph Theory. Dover, 2001.
104. J. Gower. Properties of Euclidean and non-Euclidean distance matrices. Linear Algebra and its Applications, (67) 1: 81-97, 1985.
105. S. Goyal. Connections: An Introduction to the Economics of Networks. Princeton University Press, 2007.
106. M. Grant and S. Boyd. CVX: Matlab Software for Disciplined Convex Programming. www.stanford.edu/boyd/cvx/
107. D. Grünbaum, S. Viscido and J. K. Parrish. Extracting interactive control algorithms from group dynamics of schooling fish. Proceedings of the Block Island Workshop on Cooperative Control, V. Kumar, N. E. Leonard and A. S. Morse (editors). Springer, 2004.
108. S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19 (3): 701-719, 1998.
109. H. Guo, M.Y. Li, and Z. Shuai. A graph-theoretical approach to the method of global Lyapunov functions. Proceedings of the American Mathematical Society, 136: 2793-2802, 2008.
110. T. Gustavi, D.V. Dimarogonas, M. Egerstedt, and X. Hu. On the number of leaders needed to ensure network connectivity in arbitrary dimensions. Proceedings of the Mediterranean Conference on Control and Automation, June 2009.
111. M. Haque and M. Egerstedt. Decentralized formation selection mechanisms inspired by foraging bottlenose dolphins. Mathematical Theory of Networks and Systems, July 2008.
112. H. R. Hashemipour, S. Roy, and A. J. Laub. Decentralized structures for parallel Kalman filtering. IEEE Transactions on Automatic Control, 33 (1): 88-94, 1988.
113. Y. Hatano and M. Mesbahi. Agreement over random networks. IEEE Transactions on Automatic Control, 50 (11): 1867-1872, 2005. \
114. Y. Hatano, A. Das, and M. Mesbahi. Agreement in presence of noise: pseudogradients on random geometric networks. Proceedings of the IEEE Conference on Decision and Control and European Control Conference, December 2005.
115. J. M. Hendrickx, B. D. O. Anderson, J-C. Delvenne, and V. D. Blondel. Directed graphs for the analysis of rigidity and persistence in autonomous agent systems. International Journal of Robust and Nonlinear Control, 17: 960-981, 2000.
116. D. Henrion and A. Garulli (Editors). Positive Polynomials in Control. Springer, 2005.
117. J. Hespanha. Uniform stability of switched linear systems: extensions of LaSalle's invariance principle. IEEE Transactions on Automatic Control, 49 (4): 470-482, 2004.
118. D. J. Hoare, I. D. Couzin, J-G. Godin, and J. Krause. Contextdependent group size choice in fish. Animal Behaviour, 67: 155-164, 2004.
119. J. Hofbauer and K. Sigmund. Evolutionary games and population dynamics. Cambridge University Press, 1998.
120. R. A. Horn and C. Johnson. Matrix Analysis. Cambridge University Press, 1985.
121. W. Imrich and S. Klavar. Product Graphs: Structure and Recognition. Wiley, 2000.
122. M. O. Jackson. Social and Economic Networks. Princeton University Press, 2008.
123. D. J. Jacobs and B. Hendrickson. An algorithm for two-dimensional rigidity percolation: the pebble game, Journal of Computational Physics, 137 (2): 346-365, 1997.
124. 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.
125. S. Janson, T. Luczak, and A. Rucinski. Random Graphs. Wiley, 2000.
126. M. Ji and M. Egerstedt. Distributed coordination control of multiagent systems while preserving connectedness. IEEE Transactions on Robotics, 23 (4): 693-703, 2007.
127. M. Ji, A. Muhammad, and M. Egerstedt. Leader-based multi-agent coordination: controllability and optimal control. Proceedings of the American Control Conference, June 2006.
128. F. Juhász. On the spectrum of a random graph. Colloquia Mathematica Societatis János Bolyai. Algebraic Methods in Graph Theory, Szeged (Hungary), V. Sós and L. Lovász (editors). North- Holland, 1978.
129. M. Juvan and B. Mohar. Laplacian eigenvalues and bandwidth-type invariants of graphs. Journal of Graph Theory, (17): 393-407, 1993.
130. T. Kailath. Linear Systems. Prentice-Hall, 1980.
131. H. K. KhalilNonlinear Systems. Prentice-Hall, 2001.
132. U. A. Khan and J. M. F. Moura. Distributing the Kalman filter for large-scale systems. IEEE Transactions on Signal Processing, 56 (10): 4919-4935, 2008.
133. Y. Kim, M. Mesbahi, and F. Y. Hadaegh. Multiple-spacecraft reconfigurations through collision avoidance, bouncing, and stalemates. Journal of Optimization Theory and Applications, 122 (2): 323-343, 2004.
134. Y. Kim and M. Mesbahi. On maximizing the second smallest eigenvalue of a state-dependent graph Laplacian, IEEE Transactions on Automatic Control, (51) 1: 116-120, 2006.
135. J. Komlós and M. Simonovits. Szemerédi's regularity lemma and its applications in graph theory. Combinatorics: Paul Erdó́s is Eighty, vol. 2. Bolyai Society Mathematical Studies 2, Budapest, 1996.
136. S. Kirti and A. Scaglione. Scalable distributed Kalman filtering through consensus. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, April 2008.
137. H. W. Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2: 83-97, 1955.
138. H. J. Kushner. Stochastic Stability and Control. Academic Press, 1967.
139. H. J. Kushner. Introduction to Stochastic Control. Holt, Reinhart, and Winston, 1971.
140. G. Lafferriere, A. Williams, J. Caughman, and J. J. P. Veerman. Decentralized control of vehicle formations. System and Control Letters, 54: 899-910, 2005.
141. G. Laman. On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4 (4): 331-340, 1970.
142. A. N. Langville and C. D. Meyer. Google's PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, 2006.
143. J. Lauri and R. Scapellato. Topics in Graph Automorphism and Reconstruction. Cambridge University Press, 2003.
144. J. Lawton, R. Beard, and B. Young. A decentralized approach to formation maneuvers. IEEE Transactions on Robotics and Automation, 19 (6): 933-941, 2003.
145. N. E. Leonard and E. Fiorelli. Virtual leaders, artificial potentials and coordinated control of groups. Proceedings of the IEEE Conference on Decision Control, December 2001.
146. P. Liljeroth, J. Repp, and G. Meyer. Current-induced hydorgen tautomerization and conductance switching of naphthalocyanine molecules. Science, 317: 1203-1206.
147. Z. Lin, M. Broucke, and B. Francis. Local control strategies for groups of mobile autonomous agents. IEEE Transactions on Automatic Control, 49 (4): 622-629, 2004.
148. L. Lovász. Combinatorial Problems and Exercises. American Mathematical Society, 2007.
149. D. Luenberger. Optimization by Vector Space Methods. Wiley, 1969.
150. J. Mann, R. Connor, P. Tyack, and H. Whitehead. Cetacean Societies. University of Chicago Press, 2000.
151. S. Martínez, J. Cortés, and F. Bullo. Motion coordination with distributed information. IEEE Control Systems Magazine, 27 (4): 75-88, 2007.
152. J. M. McNew and E. Klavins. Locally interacting hybrid systems with embedded graph grammars. Proceedings of the IEEE Conference on Decision and Control, December 2006.
153. J. M. McNew, E. Klavins, and M. Egerstedt. Solving coverage problems with embedded graph grammars. Hybrid Systems: Computation and Control. Springer, 2007.
154. R. Merris. Laplacian matrices of graphs: a survey. Linear Algebra and its Applications, 197,198: 143-176, 1994.
155. M. Mesbahi. On a dynamic extension of the theory of graphs. Proceedings of the American Control Conference, May 2002.
156. M. Mesbahi. State-dependent graphs. Proceedings of the IEEE Conference on Decision and Control, December 2003.
157. M. Mesbahi. State-dependent graphs and their controllability properties. IEEE Transactions on Automatic Control, 50 (3): 387-392, 2005.
158. M. Mesbahi and F. Y. Hadaegh. Formation flying control of multiple spacecraft via graphs, matrix inequalities, and switching. AIAA Journal of Guidance, Control, and Dynamics, 24 (2): 369-377, 2001.
159. C. D. Meyer. Matrix Analysis and Applied Linear Algebra. SIAM, 2001.
160. R. E. Mirollo and S. H. Strogatz. Synchronization of pulse-coupled biological oscillators. SIAM Journal on Applied Mathematics, 50: 1645-1662, 1990.
161. B. Mohar. Eigenvalues in combinatorial optimization. In Combinatorial and Graph-Theoretical Problems in Linear Algebra, R. A. Brualdi, S. Friedland, and V. Klee (editors). Springer-Verlag, 1993.
162. L. Moreau. Stability of multiagent systems with time-dependent communication links. IEEE Transactions on Automatic Control, 50 (2): 169-182, 2005.
163. A. Muhammad and M. Egerstedt. Connectivity graphs as models of local interactions. Journal of Applied Mathematics and Computation, 168 (1): 243-269, 2005.
164. A. Muhammad and M. Egerstedt. Positivstellensatz certificates for non-feasibility of connectivity graphs in multi-agent coordination. Proceedings of the IFAC World Congress, July 2005.
165. A. Muhammad and M. Egerstedt. On the structural complexity of multi-agent robot formations. Proceedings of the American Control Conference, June 2004.
166. A. Muhammad and M. Egerstedt. Control using higher order Laplacians in network topologies. Proceedings of the Mathematical Theory of Networks and Systems, July, 2006.
167. A. Muhammad and A. Jadbabaie. Dynamic coverage verification in mobile sensor networks via switched higher order Laplacians. In Robotics: Science and Systems, O. Broch (editor). MIT Press, 2007.
168. A. Muhammad and A. Jadbabaie. Asymptotic stability of switched higher order Laplacians and dynamic coverage. In Hybrid Systems: Computation and Control, A. Bemporad, A. Bicchi, and G. Buttazzo (editors). Lecture Notes in Computer Science, Springer, 2007.
169. J. Munkres. Elements of Algebraic Topology. Addison-Wesley, 1993.
170. J. D. Murray. Mathematical Biology (vols. 1 and 2). Springer, 2008.
171. M. Nabi, M. Mesbahi, N. Fathpour, and F. Y. Hadaegh. Local estimators for multiple spacecraft formation flying. Proceedings of the AIAA Guidance, Navigation, and Control Conference, August 2008.
172. H. S. Nalwa. Encyclopedia of Nanoscience and Nanotechnology. American Scientific Publishers, 2004.
173. A. Nedić, A. Ozdaglar, and P. A. Parrilo. Constrained consensus and optimization in multi-agent network. IEEE Transactions on Automatic Control, 55 (4): 922-938, 2010.
174. M. E. J. Newman. Spread of epidemic disease on networks. Physical Review E, 66 (1): 1-11, 2002.
175. M. Newman, A. Barabási, and D. J. Watts. The Structure and Dynamics of Networks. Princeton, University Press, 2006.
176. N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.
177. 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, 307-357, 2000.
178. M. A. Nowak. Evolutionary Dynamics. Harvard University Press, 2006.
179. A. Nguyen and M. Mesbahi. A factorization lemma for the agreement dynamics. Proceedings of the IEEE Conference on Decision and Control, December 2007.
180. P. Ö gren, M. Egerstedt, and X. Hu. A control Lyapunov function approach to multi-agent coordination. IEEE Transactions on Robotics and Automation, 18 (5): 847-851, 2002.
181. R. Olfati-Saber and R.M. Murray. Agreement problems in networks with directed graphs and switching topology, Proceedings of the IEEE Conference on Decision and Control, December 2003.
182. 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.
183. R. Olfati-Saber. Ultrafast consensus in small-world networks. Proceedings of the American Control Conference, June 2005.
184. R. Olfati-Saber and J. S. Shamma. Consensus filters for sensor networks and distributed sensor fusion. Proceedings of the IEEE Conference on Decision and Control, December 2005.
185. R. Olfati-Saber. Flocking for multi-agent dynamic systems: algorithms and theory. IEEE Transactions on Automatic Control, 51 (3): 401-420, 2006.
186. R. Olfati-Saber and N. F. Sandell. Distributed tracking in sensor networks with limited sensing range. Proceedings of the American Control Conference, June 2008.
187. A. Olshevsky and J. N. Tsitsiklis. Convergence rates in distributed consensus and averaging. Proceedings of the IEEE Conference on Decision and Control, December 2006.
188. J. G. Oxley. Matroid Theory. Oxford University Press, 2006.
189. D. A. Paley, N. E. Leonard, R. Sepulchre, D. Grünbaum, and J. K. Parrish. Oscillator models and collective motion: spatial patterns in the dynamics of engineered and biological networks. IEEE Control System Magazine, 27 (4): 89-105, 2007.
190. P. A. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Mathematical Programming, Ser. B, 96 (2): 293-320, 2003.
191. M. Penrose. Random Geometric Graphs. Oxford University Press, 2003.
192. S. V. Petrov. Graph grammars and graphodynamics problem. Automation and Remote Control, 10: 133-138, 1977.
193. B. T. Polyak. Introduction to Optimization, Optimization Software, 1987.
194. M. Porfiri and D. J. Stilwell. Consensus seeking over random weighted directed graphs. IEEE Transactions on Automatic Control, 52 (9): 1767-1773, 2007.
195. V. V. Prasolov. Elements of Combinatorial And Differential Topology. American Mathematical Society, 2006.
196. E. Prisner. Graph Dynamics. Longman House, 1995.
197. K. Pryor and K. Norris. Dolphin Societies. University of California Press, 1998.
198. R. Radner. Team decision problems. Annals of Mathematical Statistics, 33 (3): 857-881, 1962.
199. A. Rahmani and M. Mesbahi. On the controlled agreement problem, Proceedings of the American Control Conference, June 2006.
200. A. Rahmani, M. Ji, M. Mesbahi, and M. Egerstedt. Controllability of multi-agent systems from a graph-theoretic perspective. SIAM Journal on Control and Optimization, 48 (1): 162-186, 2009.
201. B. S. Rao and H. F. Durrant-Whyte. Fully decentralized algorithms for multisensor Kalman filtering. IEE Proceedings-D, 138 (5): 413-420, 1991.
202. W. Ren and R. Beard, Consensus of information under dynamically changing interaction topologies. Proceedings of the American Control Conference, June 2004.
203. W. Ren and R. Beard. Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control, 50 (5): 655-661, 2005.
204. W. Ren and R. Beard. Distributed Consensus in Multi-vehicle Cooperative Control. Springer, 2008.
205. C. Reynolds. Flocks, herds and schools: a distributed behavioral model. Proceedings of ACM SIGGRAPH Conference, 1987.
206. M. Rieth and W. Schommers. Handbook of Theoretical and Computational Nanotechnology. American Scientific, 2006.
207. S. Rosenberg. The Laplacian on a Riemannian Manifold. London Mathematical Society Student Texts, 31. Cambridge University Press, 1997.
208. B. Roth. Rigid and flexible frameworks. The American Mathematical Monthly, 88 (1): 6-21, 1981.
209. G. Rozenberg (Editor). Handbook of Graph Grammars and Computing by Graph Transformation. World Scientific, 1997.
210. S. Salsa. Partial Differential Equations in Action: From Modelling to Theory. Springer, 2010.
211. J. Sandhu, M. Mesbahi, and T. Tsukamaki. Cuts and flows in relative sensing and control of spatially distributed systems. Proceedings of the American Control Conference, June 2005.
212. J. Sandhu, M. Mesbahi, and T. Tsukamaki. Relative sensing networks: observability, estimation, and the control structure. Proceedings of the IEEE Conference on Decision and Control, December 2005.
213. E. Seneta. Non-negative Matrices and Markov Chains. Springer, 2006.
214. R. Sepulchre, D. A. Paley, and N. E. Leonard. Stabilization of planar collective motion with limited communication. IEEE Transactions on Automatic Control, 53 (3): 706-719, 2008.
215. L. Shi, K. H. Johansson, and R. M. Murray. Estimation over wireless sensor networks: tradeoff between communication, computation, and estimation qualities. Proceedings of the 17th IFAC World Congress, July 2008.
216. A. N. Shiryaev. Probability. Springer, 1995.
217. B. Shucker, T. Murphey, and J. Bennett. A method of cooperative control using occasional non-local interactions. Proceedings of the American Control Conference, June 2006.
218. E. Slijper. Whales and Dolphins. University of Michigan Press, 1976.
219. J. J. E. Slotine and W. Wang. A study of synchronization and group cooperation using partial contraction theory. In Cooperative Control: The 2003 Block Island Workshop on Cooperative Control. V. Kumar, N. Leonard, and A. S. More (editors). Springer, 2004.
220. B. Smith, M. Egerstedt, and A. Howard. Automatic generation of persistent formations for multi-agent networks under range constraints. ACM/Springer Mobile Networks and Applications Journal (MONET), 14 (3): 322-335, June 2009.
221. D. P. Spanos, R. Olfati-Saber, and R. M. Murray. Distributed Kalman filtering in sensor networks with quantifiable performance. International Symposium on Information Processing in Sensor Networks, 2005.
222. D. Spielman. Spectral Graph Theory and its Applications. http://www.cs.yale.edu/homes/spielman/eigs/
223. J. L. Speyer. Computation and transmission requirements for decentralized linear-quadratic-Gaussian control problem. IEEE Transactions on Automatic Control, 24 (2): 266-269, 1979.
224. R. Stachnik, K. Ashlin, and K. Hamilton. Space-Station-SAMSI: A spacecraft array for Michelson spatial interferometry. Bulletin of the American Astronomical Society, 16: 818-827, 1984.
225. S. S. Stanković, M. S. Stanković, and D. M. Stipanović. A consensusbased overlapping decentralized estimator in lossy networks: stability and denoising effects. Proceedings of the American Control Conference, June 2008.
226. D. Swaroop and J. K. Hedrick. String stability of interconnected systems. IEEE Transactions on Automatic Control, 41 (33): 349-357, 1996.
227. A. Tahbaz-Salehi and A. Jadbabaie. A necessary and sufficient condition for consensus over random networks. IEEE Transactions on Automatic Control, 53 (3): 791-795, 2008.
228. H. G. Tanner, A. Jadbabaie, and G. J. Pappas. Flocking in fixed and switching networks. IEEE Transactions on Automatic Control, 52 (5): 863-868, 2007.
229. H. G. Tanner. On the controllability of nearest neighbor interconnections. Proceedings of the IEEE Conference on Decision and Control, December 2004.
230. H. G. Tanner, A. Jadbabaie, and G. Pappas. Stable flocking of mobile agents. Part II: Dynamic topology. Proceedings of the IEEE Conference on Decision and Control, December 2003.
231. H. G. Tanner, G. J. Pappas and V. Kumar. Leader-to-formation stability. IEEE Transactions on Robotics and Automation, 20 (3): 433-455, 2004.
232. É. Tardos and T.Wexler. Network formation games and the potential function method. In Algorithmic Game Theory. Cambridge University Press, 2007.
233. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, 1987.
234. T. Tay and W. Whiteley. Generating isostatic frameworks, Structural Topology, 11: 21-69, 1985.
235. O. N. Temkin, A. V. Zeigarnik, and D. G. Bonchev. Chemical Reaction Networks: A Graph-Theoretical Approach. CRC Press, 1996.
236. W. T. Tutte. Graph Theory. Cambridge University Press, 2001.
237. S. Utete and H. F. Durrant-Whyte. Routing for reliability in decentralized sensing networks. Proceedings of the American Control Conference, June 1994.
238. T. Vicsek, A. Czirók, E. Ben-Jacob, I. Cohen, and O. Shochet. Novel type of phase transition in a system of self-driven particles. Physical Review Letters, 75 (6): 1226-1229, 1995.
239. G. Walsh, H. Ye, and L. Bushnell. Stability analysis of networked control systems. Proceedings of the American Control Conference, June 1999.
240. P. K. C.Wang and F. Y. Hadaegh. Coordination and control of multiple microspacecraft moving in formation. Journal of the Astronautical Sciences, 44: 315-355, 1996.
241. S.Wasserman and K. Faust. Social Networks Analysis: Methods and Applications. Cambridge University Press, 2004.
242. D. J.Watts and S. H. Strogatz. Collective dynamics of "small-world" networks, Nature, 393: 440-442, June 1998.
243. D. B. West. Introduction to Graph Theory. Prentice-Hall, 2001.
244. H. Whitney. Congruent graphs and the connectivity of graphs. American Journal of Mathematics, 54: 150-168, 1932.
245. E. P. Wigner. On the distribution of the roots of certain symmetric matrices. Annals of Mathematics, 67: 325-327, 1958.
246. A. S. Willsky, M. G. Bello, D. A. Castanon, B. C. Levy, and G. C. Verghese. Combing and updating of local estimates and regional maps along sets of one-dimensional tracks. IEEE Transactions on Automatic Control, 27 (4): 799-813, 1982.
247. R. J. Wilson. Introduction to Graph Theory. Prentice-Hall, 1996.
248. W.Woess. Random Walks on Infinite Graphs and Groups. Cambridge University Press, 2000.
249. J. Wolfowitz. Products of indecomposable, aperiodic, stochastic matrices. Proceedings of the American Mathematical Society, 4: 733-737, 1963.
250. C. W. Wu. Synchronization and convergence of linear dynamics in random directed networks. IEEE Transactions on Automatic Control, 51 (7): 1207-1210, 2006.
251. C. W. Wu. Synchronization in Complex Networks of Nonlinear Dynamical Systems. World Scientific, 2007.
252. L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. Systems and Control Letters, 53: 65-78, 2004.
253. L. Xiao, S. Boyd, and S. Lall. A space-time diffusion scheme for peer-to-peer least squares estimation. Proceedings of the International Conference on Information Processing in Sensor Networks, 2006.
254. F. Xue and P. R. Kumar. The number of neighbors needed for connectivity of wireless networks. Wireless Networks, 10: 169-181, 2004.
255. D. Zelazo, A. Rahmani, and M. Mesbahi. Agreement via the Edge Laplacian. Proceedings of the IEEE Conference on Decision and Control, December 2007.