TL;DR
This paper proposes a control method for network systems that relies on local node information rather than global states, enabling scalable control with minimal performance loss in well-conditioned networks.
Contribution
It introduces a novel control approach using local information neighborhoods, analyzing the trade-off between control performance and neighborhood size based on the controllability Gramian.
Findings
Control performance remains high with small local neighborhoods in well-conditioned networks.
Simulations demonstrate effectiveness on regular and random networks.
Application to power-grid synchronization shows practical viability.
Abstract
In the classical control of network systems, the control actions on a node are determined as a function of the states of all nodes in the network. Motivated by applications where the global state cannot be reconstructed in real time due to limitations in the collection, communication, and processing of data, here we introduce a control approach in which the control actions can be computed as a function of the states of the nodes within a limited state information neighborhood. The trade-off between the control performance and the size of this neighborhood is primarily determined by the condition number of the controllability Gramian. Our theoretical results are supported by simulations on regular and random networks and are further illustrated by an application to the control of power-grid synchronization. We demonstrate that for well-conditioned Gramians, there is no significant loss…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
