On the structural complexity of multi-agent robot formations

Proceedings of the American Control Conference

Volumn 6, Issue , 2004, Pages 4957-4962

  Muhammad, Abubakr ^a   Egerstedt, Magnus ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INFORMATION ANALYSIS; ROBOTICS; TELECOMMUNICATION LINKS;

CONNECTIVITY GRAPHS; INFORMATION STRUCTURE; MULTI-AGENT ROBOT FORMATIONS; STRUCTURAL COMPLEXITY;

MULTI AGENT SYSTEMS;

EID: 8744238178     PISSN: 07431619     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.23919/acc.2004.1384635     Document Type: Conference Paper

References (16)

1. H. Atlan, "Measures of Complexity," Lecture Notes in Physics, vol 314, pp 112-12, 1988.
2. S. H. Bertz, "Complexity: Introduction and Fundamentals," Mathematical Chemistry, vol. 7, pp 91-156, 2003.
3. D. Bonchev Information Theoretic Indices for Characterization of Chemical Structures, Research Studies Press, 1983.
4. M. Randic and D. Plavsic, "On the Concept of Molecular Complexity," Croatica Chemica ACTA, vol. 75, pp 107-116, 2002.
5. A. Muhammad and M. Egerstedt, "On the Structure of Connectivity Graphs of Robot Formations," Technical Report, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, 2003.
6. A. Muhammad A and M. Egerstedt, "Decentralized Coordination with Local Interactions: Some New Directions," in Proc. Workshop on Cooperative Control, Block Island, RI, 2003. (To appear)
7. A. Muhammad A and M. Egerstedt, "Connectivity Graphs as Models of Local Interactions," Control and Decision Conference, Bahamas, 2004. (Submitted)
8. A. Jadbabaie, J. Lin, and A. Morse, "Coordination of groups of mobile autonomous agents using nearest neighbor rules," IEEE Transactions on Automatic Control, Vol. 48, No. 6, pp. 988-1001, 2003.
9. R. Olfati-Saber and R. Murray R, "Agreement Problems in Networks with Directed Graphs and Switching Topology," in Proc. IEEE Conference on Decision and Control, Hawaii, 2003.
10. H. Tanner, G. Pappas and V. Kumar, "Input-to-state stability on formation graphs," in Proc. IEEE Conference on Decision and Control, vol. 3, pp 2439-2444, 2002.
11. M. Cover and J. Thomas, Elements of Information Theory, Wiley Series in Telecommunications, 1991.
12. C. E. Shannon, "A Mathematical Theory of Communications," Bell Systems Technical Journal, vol. 27, pp 379-423, 1948.
13. M. Egerstedt and R.W. Brockett, "Feedback Can Reduce the Specification Complexity of Motor Programs," IEEE Transactions on Automatic Control, Vol. 48, No. 2, pp. 213-223, Feb. 2003.
14. E. Klavins, "Communication Complexity of Multi-Robot Systems," in Proc. Fifth International Workshop on the Algorithmic Foundations of Robotics, Nice, France, 2002.
15. R. Diestel, Graph Theory, vol. 173 of Graduate Texts in Mathematics. Springer-Verlag, 2000.
16. J. Gross and T. Tucker, Topological Graph Theory, John Wiley, 1987.