Numerical over-approximation of invariance entropy via finite abstractions
From MaRDI portal
Publication:2107631
DOI10.1016/J.SYSCONLE.2022.105395zbMATH Open1505.93085arXiv2011.02916OpenAlexW4307408822MaRDI QIDQ2107631FDOQ2107631
Authors: M. S. Tomar, Christoph Kawan, Majid Zamani 
Publication date: 2 December 2022
Published in: Systems \& Control Letters (Search for Journal in Brave)
Abstract: For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information above which a given compact subset of the state space can be made invariant. There exist different versions of this quantity for deterministic and uncertain systems, which are equivalent in the deterministic case. In this work, we present algorithms for the numerical computation of these two quantities. In particular, given a subset of the state set, we first partition it. Then a controller, in the form of a lookup table that assigns a set of control values to each cell of the partition, is computed to enforce invariance of . After determinizing the controller, a weighted directed graph is constructed. For deterministic systems, the logarithm of the spectral radius of a transition matrix obtained from the graph gives an upper bound of the entropy. For uncertain systems, the maximum mean cycle weight of the graph upper bounds the entropy. With three deterministic examples, for which the exact value of the invariance entropy is known or can be estimated by other means, we demonstrate that the upper bound obtained by our algorithm is of the same order of magnitude as the actual value. Additionally, our algorithm provides a static coder-controller scheme corresponding to the obtained data-rate bound. Finally, we present the computed upper bounds of invariance entropy for an uncertain linear control system as well.
Full work available at URL: https://arxiv.org/abs/2011.02916
Recommendations
Measures of information, entropy (94A17) Linear systems in control theory (93C05) Discrete-time control/observation systems (93C55) Networked control (93B70) Computational methods for problems pertaining to systems and control theory (93-08)
Cites Work
- dtControl
- Control and estimation under information constraints: toward a unified theory of control, computation and communications
- Invariance entropy for deterministic control systems. An introduction
- Fifty years of entropy in dynamics: 1958 -- 2007
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms
- Estimation and control over communication networks
- Stochastic networked control systems. Stabilization and optimization under information constraints
- Analysis and synthesis of networked control systems: topological entropy, observability, robustness and optimal control
- Observation of nonlinear systems via finite capacity channels: constructive data rate limits
- Invariance Entropy for Control Systems
- A note on topological feedback entropy and invariance entropy
- Topological Feedback Entropy and Nonlinear Stabilization
- Using Ulam's method to calculate entropy and other dynamical invariants
- Minimal bit rates and entropy for exponential stabilization
- Measure-Theoretic Invariance Entropy for Control Systems
- Rigorous computation of topological entropy with respect to a finite partition
- Metric invariance entropy and conditionally invariant measures
- SCOTS: a tool for the synthesis of symbolic controllers
- Elements of information theory for networked control systems
- Entropy and Minimal Bit Rates for State Estimation and Model Detection
- Observation of nonlinear systems via finite capacity channels. II: Restoration entropy and its estimates
- Optimal data rate for state estimation of switched nonlinear systems
- Network Entropy and Data Rates Required for Networked Control
- Numerical approximation of the data-rate limit for state estimation under communication constraints
- An Introduction to Symbolic Dynamics and Coding
- Numerical over-approximation of invariance entropy via finite abstractions
- Invariant cover: existence, cardinality bounds, and computation
- On Optimal Coding of Non-Linear Dynamical Systems
- Invariance Properties of Controlled Stochastic Nonlinear Systems Under Information Constraints
- Invariance feedback entropy of nondeterministic control systems
- On an asymptotic optimization problem in finite, directed, weighted graphs
- A Subgradient Algorithm for Data-Rate Optimization in the Remote State Estimation Problem
Cited In (4)
Uses Software
This page was built for publication: Numerical over-approximation of invariance entropy via finite abstractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107631)
