Graph Distances and Controllability of Networks


In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders. Our main result relates the controllability of such systems to the graph distances between the agents… (More)
DOI: 10.1109/TAC.2016.2546180


4 Figures and Tables

Cite this paper

@article{Yazicioglu2016GraphDA, title={Graph Distances and Controllability of Networks}, author={Ahmet Yasin Yazicioglu and Waseem Abbas and Magnus Egerstedt}, journal={IEEE Transactions on Automatic Control}, year={2016}, volume={61}, pages={4125-4130} }