Network Entropy and Data Rates Required for Networked Control

From MaRDI portal
Publication:5358484

DOI10.1109/TCNS.2015.2440551zbMATH Open1370.93162arXiv1409.6037OpenAlexW2243309170MaRDI QIDQ5358484FDOQ5358484


Authors: Christoph Kawan, Jean-Charles Delvenne Edit this on Wikidata


Publication date: 21 September 2017

Published in: IEEE Transactions on Control of Network Systems (Search for Journal in Brave)

Abstract: We consider the problem of making a set of states invariant for a network of controlled systems. We assume that the subsystems, initially uncoupled, must be interconnected through controllers to be designed with a constraint on the data rate obtained by every subsystem from all the other subsystems. We introduce the notion of subsystem invariance entropy, which is a measure for the smallest data rate arriving at a fixed subsystem, above which the overall system is able to achieve the control goal. Moreover, we associate to a network of n subsystems a closed convex set of R^n encompassing all possible combinations of data rates within the network that guarantee the existence of corresponding feedback strategies for making a given set invariant. The extremal points of this convex set can be regarded as Pareto-optimal data rates for the control problem, expressing a trade-off between the data rates required by different systems. We characterize these quantities for linear systems, and for synchronization of chaos.


Full work available at URL: https://arxiv.org/abs/1409.6037







Cited In (5)





This page was built for publication: Network Entropy and Data Rates Required for Networked Control

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5358484)