arXiv subjects

Anders Rantzer

Publications and source records attributed to Anders Rantzer.

76 records · Page 5Linked to original sources

arXiv2012

On Structured Realizability and Stabilizability of Linear Systems

We study the notion of structured realizability for linear systems defined over graphs. A stabilizable and detectable realization is structured if the state-space matrices inherit the sparsity pattern of the adjacency matrix of the associated graph. In this paper, we demonstrate that not every structured transfer matrix has a structured realization and we reveal the practical meaning of this fact. We also uncover a close connection between the structured realizability of a plant and whether the plant can be stabilized by a structured controller. In particular, we show that a structured stabilizing controller can only exist when the plant admits a structured realization. Finally, we give a parameterization of all structured stabilizing controllers and show that they always have structured realizations.

eess.SY↗

arXiv2012

Distributed Robust Stability Analysis of Interconnected Uncertain Systems

This paper considers robust stability analysis of a large network of interconnected uncertain systems. To avoid analyzing the entire network as a single large, lumped system, we model the network interconnections with integral quadratic constraints. This approach yields a sparse linear matrix inequality which can be decomposed into a set of smaller, coupled linear matrix inequalities. This allows us to solve the analysis problem efficiently and in a distributed manner. We also show that the decomposed problem is equivalent to the original robustness analysis problem, and hence our method does not introduce additional conservativeness.

math.OC↗

arXiv2012

Optimal Linear Control over Channels with Signal-to-Noise Ratio Constraints

We consider a networked control system where a linear time-invariant (LTI) plant, subject to a stochastic disturbance, is controlled over a communication channel with colored noise and a signal-to-noise ratio (SNR) constraint. The controller is based on output feedback and consists of an encoder that measures the plant output and transmits over the channel, and a decoder that receives the channel output and issues the control signal. The objective is to stabilize the plant and minimize a quadratic cost function, subject to the SNR constraint. It is shown that optimal LTI controllers can be obtained by solving a convex optimization problem in the Youla parameter and performing a spectral factorization. The functional to minimize is a sum of two terms: the first is the cost in the classical linear quadratic control problem and the second is a new term that is induced by the channel noise. %todo ta bort meningen? A necessary and sufficient condition on the SNR for stabilization by an LTI controller follows directly from a constraint of the optimization problem. It is shown how the minimization can be approximated by a semidefinite program. The solution is finally illustrated by a numerical example.

eess.SY↗

arXiv2012

Optimal Linear Joint Source-Channel Coding with Delay Constraint

The problem of joint source-channel coding is considered for a stationary remote (noisy) Gaussian source and a Gaussian channel. The encoder and decoder are assumed to be causal and their combined operations are subject to a delay constraint. It is shown that, under the mean-square error distortion metric, an optimal encoder-decoder pair from the linear and time-invariant (LTI) class can be found by minimization of a convex functional and a spectral factorization. The functional to be minimized is the sum of the well-known cost in a corresponding Wiener filter problem and a new term, which is induced by the channel noise and whose coefficient is the inverse of the channel's signal-to-noise ratio. This result is shown to also hold in the case of vector-valued signals, assuming parallel additive white Gaussian noise channels. It is also shown that optimal LTI encoders and decoders generally require infinite memory, which implies that approximations are necessary. A numerical example is provided, which compares the performance to the lower bound provided by rate-distortion theory.

cs.IT↗