State-Dependent Graphs

Proceedings of the IEEE Conference on Decision and Control

Volumn 3, Issue , 2003, Pages 3058-3063

  Mesbahi, Mehran ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); CONTROL SYSTEM ANALYSIS; GRAPH THEORY; INFORMATION THEORY; PROCESS CONTROL; SET THEORY; THEOREM PROVING;

INFORMATION EXCHANGE; STATE-DEPENDENT DYNAMIC GRAPHS;

DISTRIBUTED PARAMETER CONTROL SYSTEMS;

EID: 1542378371     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. N. Alon. Problems and results in extremal combinatorics, Part I, Discrete Mathematics (to appear).
2. J. P. Aubin and C. Cellina. Differential Inclusions, Springer-Verlag, 1984.
3. J. P. Aubin. Viability Theory, Birkhäuser, 1991.
4. R. W. Beard, J. Lawton, and F. Y. Hadaegh. A coordination architecture for spacecraft formation control, IEEE Transactions on Control Systems Technology, (9) 6: 777-790.
5. B. Bollobás. Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability, Cambridge, 1986.
6. B. Bollobás. Modern Graph Theory. Springer-Verlag, 1998.
7. F. H. Clarke, Yu. S. Ledyaev, R. J. Stern, and P. R. Wolenski. Nonsmooth Analysis and Control Theory. Springer-Verlag, 1998.
8. R. Diestel. Graph Theory. Springer-Verlag, 2000.
9. J. A. Fax and R. M. Murray. Information flow and cooperative control of vehicle formations. IFAC World Congress, 2002.
10. C. Godsil and G. Royle. Algebraic Graph Theory, Springer-Verlag, 2001.
11. M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, (23) 98: 298-305, 1973.
12. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its applications in graph theory. Czechoslovak Mathematical Journal, (25) 100: 619-633, 1975.
13. R. L. Graham, M. Grötschel, and L. Lovász. Handbook of Combinatorics, The MIT Press/North-Holland, 1995.
14. 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.
15. S. Janson, T. Luczak, A. Rucinski. Random Graphs, Wiley, 2000.
16. J. Komlós and M. Simonovits. Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics: Paul Erdos is Eighty, vol. 2, Bolyai Society Mathematical Studies, 2, Budapest, 295-352, 1996.
17. J. Komlós, G. N. Sárközy, and E. Szemerédi. An algorithmic version of the blow-up lemma, Random Structures and Algorithms, 12, 297-312, 1998.
18. R. Merris. Laplacian matrices of graphs: a survey, Linear Algebra and its Applications, 197,198: 143-176, 1994.
19. 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.
20. M. Mesbahi. On a dynamic extension of the theory of graphs. American Control Conference, June 2002.
21. R. Olfati-Saber and R. M. Murray. Consensus protocols for networks of dynamic agents. American Control Conference, June 2003.
22. http://planetquest.jpl.nasa.gov/TPF/tpf_index.html