On the Controllability Properties of Circulant Networks
Lists
Only you see this
Abstract
This paper examines the controllability of a group of first order agents, adopting a weighted consensus-type coordination protocol over a circulant network. Specifically, it is shown that a circulant network with Laplacian eigenvalues of maximum algebraic multiplicity <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$q$</tex></formula> is controllable from <formula formulatype="inline" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex Notation="TeX">$q$</tex></formula> nodes. Our approach leverages on the Cauchy–Binet formula, which in conjunction with the Popov–Belevitch–Hautus test, leads to new insights on structural aspects of network controllability.
BibTeX
@article{nabiabdolyousefi2013controllability,
author = {Marzieh Nabi-Abdolyousefi and Mehran Mesbahi},
title = {{On the Controllability Properties of Circulant Networks}},
journal = {IEEE Trans. Automatic Control},
year = {2013},
url = {https://openreview.net/forum?id=1Up8fppf2es},
}Loading related content...