Search

We study the fundamental limits of disturbance attenuation of a networked control scheme, where a remote preview of the disturbance is available. The preview information is conveyed to the controller, via an encoder and a finite capacity channel. In this article, we present an example where we design a remote preview system by means of an additive, white and Gaussian channel. The example is followed by a summary of our recent results on general performance bounds, which we use to prove optimality of the design method. [ABSTRACT FROM AUTHOR]

We consider distributed parameter systems where the underlying dynamics are spatially invariant, and where the controls and measurements are spatially distributed. These systems arise in many applications such as the control of platoons, smart structures, or distributed flow control through the fluid boundary. For optimal control problems involving quadratic criteria such as LQR, H2 and H∞, it is shown how to reduce the optimization to a family of problems over spatial frequency. We also show that optimal controllers have an inherent degree of decentralization, which leads to a practical distributed architecture. Under a more general class of performance criteria, a general result is given showing that optimal controllers inherit the spatial invariance structure of the plant. [ABSTRACT FROM AUTHOR]

In this paper, we discuss the problem of identifying a complex system with a limited-complexity model using finite corrupted data. Complex systems are ones that cannot be uniformly approximated by a finite dimensional space. Nevertheless, our prejudice is represented by selecting a finitely parameterized set of models from which an estimate of the original system will ultimately be drawn. We will give an account of a new formulation that shows how such a model should be selected from data. We will demonstrate this paradigm on the class of linear time-invariant stable systems and give an overview of the available results concerning input design, consistency, error bounds, and sample complexity. [ABSTRACT FROM AUTHOR]

In this paper, a complete solution for the ℓ1 sampled-data problem is furnished for arbitrary plants. Then ℓ1 sampled-data problem is described as follows: Given a continuous-time plant, with continuous-time performance objectives, design a digital controller that delivers this performance. This problem differs from the s-tandard discrete-time methods in that it takes into consideration the inter-sampling behaviour of the closed loop system. The resulting closed loop system dynamics consists of both continuous-time and discrete-time dynamics and thus such systems are known as "Hybrid" systems. It is shown that given any degree of accuracy, there exists a standard discrete-time ℓ1 problem, which can be determined apriori, such that for any controller that achieves a level of performance for the discrete-time problem, the same controller achieves the same performance within the prescribed level of accuracy if implemented as a sampled-data controller. [ABSTRACT FROM AUTHOR]