We study the stabilization of an unpredictable linear control system where the controller must act based on a rate-limited observation of the state. More precisely, we consider the system @math , where the @math 's are drawn independently at random at each time @math from a known distribution with unbounded support, and where the controller receives at most @math bits about the system state at each time from an encoder. We provide a time-varying achievable strategy to stabilize the system in a second-moment sense with fixed, finite @math . While our previous result provided a strategy to stabilize this system using a variable-rate code, this work provides an achievable strategy using a fixed-rate code. The strategy we employ to achieve this is time-varying and takes different actions depending on the value of the state. It proceeds in two modes: a normal mode (or zoom-in), where the realization of @math is typical, and an emergency mode (or zoom-out), where the realization of @math is exceptionally large.
@cite_11 were the first to consider the rate-limited control of a system with uncertain growth. Their achievable scheme is quantization-based and assumes that the uncertainty on the system growth is bounded above. Phat et al. @cite_21 also consider rate-limited control with uncertain parameters from a robust control perspective. Their setup differs from ours in that it is not stochastic, and only considers bounded support for the uncertainty on the parameters. They provide a uniform quantization scheme that can stabilize their system.
@cite_21 @cite_11
2077227429 2019116530 2588872972 1978848993
Control strategies for systems with information bottlenecks often follow an estimate-then-control paradigm. This paper presents a “non-coherent” system where this strategy cannot work and provides an alternative. The paper considers the estimation and control of a discrete-time linear system with continuous random observation gain, i.e. through a non-coherent channel. It is shown that such an unstable system is not mean-squared observable regardless of the density of the random observation gain: the mean-squared estimation error for any estimator must go to infinity. This is surprising in the context of threshold results for rate-limited estimation. In contrast to other results with rate-limited feedback, the paper shows that the system can be closed-loop mean-square stabilized in a certain parameter regime even though its open-loop counterpart is not mean-square observable. Finally, carry-free models (generalized deterministic models) provide an intuitive interpretation for the results. Abstract This paper investigates the stabilizability of a linear, discrete-time plant with a real-valued output when the controller, which may be nonlinear, receives observation data at a known rate. It is first shown that, under a finite horizon cost equal to the m th output moment, the problem reduces to quantizing the initial output. Asymptotic quantization theory is then applied to directly obtain the limiting coding and control scheme as the horizon approaches infinity. This is proven to minimize a particular infinite horizon cost, the value of which is derived. A necessary and sufficient condition then follows for there to exist a coding and control scheme with the specified data rate that takes the m th output moment to zero asymptotically with time. If the open-loop plant is finite-dimensional and time-invariant, this condition simplifies to an inequality involving the data rate and the unstable plant pole with greatest magnitude. Analagous results automatically hold for the related problem of state estimation with a finite data rate. Consider a control problem with a communication channel connecting the observer of a linear stochastic system to the controller. The goal of the controller is to minimize a quadratic cost function in the state variables and control signal, known as the linear quadratic regulator (LQR). We study the fundamental tradeoff between the communication rate @math bits sec and the expected cost @math . We obtain a lower bound on a certain rate-cost function, which quantifies the minimum directed mutual information between the channel input and output that is compatible with a target LQR cost. The rate-cost function has operational significance in multiple scenarios of interest: among others, it allows us to lower-bound the minimum communication rate for fixed and variable length quantization, and for control over noisy channels. We derive an explicit lower bound to the rate-cost function, which applies to the vector, non-Gaussian, and partially observed systems, thereby extending and generalizing an earlier explicit expression for the scalar Gaussian system, due to Tatikonda el al. The bound applies as long as the system noise has a probability density function. It can be closely approached by a simple lattice quantization scheme that only quantizes the innovation, that is, the difference between the controller's belief about the current state and the true state. Via a separation principle between control and communication, similar results hold for causal lossy compression of additive noise Markov sources. Apart from standard dynamic programming arguments, our technical approach leverages the Shannon lower bound, develops new estimates for data compression with coding memory, and uses some recent results on high resolution variable-length vector quantization to prove that the new converse bounds are tight. Feedback control with limited data rates is an emerging area which incorporates ideas from both control and information theory. A fundamental question it poses is how low the closed-loop data rate can be made before a given dynamical system is impossible to stabilize by any coding and control law. Analogously to source coding, this defines the smallest error-free data rate sufficient to achieve "reliable" control, and explicit expressions for it have been derived for linear time-invariant systems without disturbances. In this paper, the more general case of finite-dimensional linear systems with process and observation noise is considered, the object being mean square state stability. By inductive arguments employing the entropy power inequality of information theory, and a new quantizer error bound, an explicit expression for the infimum stabilizing data rate is derived, under very mild conditions on the initial state and noise probability distributions.