Abstract
The controllability of large-scale network systems has been extensively investigated in the past few years. In spite of the recent advances in this field, there are still a number of unsolved problems which are of critical importance to fully understand the practical limitations arising in the control of large-scale networks. These include the derivation of informative bounds and scaling laws for the control energy of networks controlled by a limited number of nodes. In this paper, we aim to fill this gap by establishing new numerically reliable bounds and asymptotic estimates on the worst-case control energy of continuous-time linear network systems controlled by a single node. Our results rely on a convenient reformulation of the controllability Gramian of a single-input linear system in terms of a Cauchy matrix. We illustrate and validate our theoretical findings through several examples, ranging from structured networks to random ones.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
