Controllability of homogeneous single-leader networks

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2010, Pages 5869-5874

  Twu, Philip ^a   Egerstedt, Magnus ^a   Martini, Simone ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROLLABILITY;

CLUSTER SIZES; INDIVIDUAL AGENT; MINIMUM SUM-OF-SQUARES CLUSTERING; OPTIMAL TARGET; POINT TO POINT; REACHABLE SUBSPACES; TARGET POINT;

OPTIMIZATION;

EID: 79953144463     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2010.5718103     Document Type: Conference Paper

References (17)

1. R. Olfati-Saber, J. A. Fax, and R. M. Murray, "Consensus and cooperation in networked multi-agent systems," IEEE Proceedings, vol. 95, no. 1, pp. 215-233, Jan. 2007.
2. H. G. Tanner, A. Jadbabaie, and G. J. Pappas, "Flocking in fixed and switching networks," IEEE Trans. Autom. Control, vol. 52, no. 5, pp. 863-868, May 2007.
3. 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. 6, pp. 988-1001, Jun. 2003.
4. W. Ren and R. W. Beard, "Consensus seeking in multiagent systems under dynamically changing interaction topologies," IEEE Trans. Autom. Control, vol. 50, no. 5, pp. 655-661, May 2005.
5. M. Ji and M. Egerstedt, "Distributed coordination control of multi-agent systems while preserving connectedness," IEEE Trans. Robot. Autom., vol. 23, no. 4, pp. 693-703, Aug. 2007.
6. H. G. Tanner, G. J. Pappas, and V. Kumar, "Leader-to-formation stability," IEEE Trans. Robot. Autom., vol. 20, no. 3, pp. 443-455, Jun. 2004.
7. E. W. Justh and P. S. Krishnaprasad, "Equilibria and steering laws for planar formations," Syst. Control Lett., vol. 52, no. 1, pp. 25-38, May 2004.
8. H. G. Tanner, "On the controllability of nearest neighbor interconnections," in Proc. 43rd IEEE Conf. on Decision and Control, 2004, pp. 2467-2472.
9. A. Rahmani, M. Ji, M. Mesbahi, and M. Egerstedt, "Controllability of multi-agent systems from a graph-theoretic perspective," SIAM J. Control Optim., vol. 48, no. 1, pp. 162-186, Feb. 2009.
10. S. Martini, M. Egerstedt, and A. Bicchi, "Controllability analysis of networked systems using equitable partitions," International Journal of Systems, Control, and Communications, vol. 2, no. 1/2/3, pp. 100-121, Jan. 2010.
11. X. Liu, H. Lin, and B. M. Chen, "A graph-theoretic characterization of structural controllability for multi-agent system with switching topology," in Proc. 48th IEEE Conf. on Decision and Control, 2009, pp. 7012-7017.
12. C. D. Godsil and G. F. Royle, Algebraic Graph Theory, vol. 207 of Graduate Texts in Mathematics, Springer Verlag, New York, 2001.
13. M. Mesbahi and M. Egerstedt, Graph Theoretic Methods for Multiagent Networks, Princeton University Press, Princeton, NJ, Sept. 2010.
14. D. Aloise, A. Deshpande, P. Hasen, and P. Popat, "Np-hardness of euclidean sum-of-squares clustering," Machine Learning, vol. 75, no. 2, pp. 245-248, May 2009.
15. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1995.
16. S. P. Lloyd, "Least squares quantization in PCM," IEEE Trans. Information Theory, vol. 28, no. 2, pp. 129-137, Mar. 1982.
17. P. S. Bradley, K. P. Bennett, and A. Demiriz, "Constrained k-means clustering," Tech. Rep. MSR-TR-2000-65, Microsoft Research, May 2000.