CLADP - THE CAMBRIDGE LINEAR ANALYSIS AND DESIGN PROGRAMS USER REFERENCE MANUAL (4TH ISSUE: APRIL 1983).

CLADP is an engineering software program developed at Cambridge University for the interactive computer aided design of feedback control systems. CLADP contains a wide range of tools for the analysis of complex systems, and the assessment of their performance when feedback control is applied, thus enabling control systems to be designed to meet difficult performance objectives. The range of tools within CLADP include the latest techniques in the field whose central theme is the extension of classical frequency domain concepts (well known and well proven for single loop systems) to multivariable or multiloop systems, and by making extensive use of graphical presentation information is provided in a readily understood form.

CLADP: THE CAMBRIDGE LINEAR ANALYSIS AND DESIGN PROGRAMS.

An interactive software facility for designing multivariable control systems is described. The paper discusses the desirable characteristics of such a facility, the particular capabilities of CLADP and the numerical algorithms which lie behind them.

Sensor data scheduling for linear quadratic Gaussian control with full state feedback

Networked control systems (NCSs) have attracted much attention in the past decade due to their many advantages and growing number of applications. Different than classic control systems, resources in NCSs, such as network bandwidth and communication energy, are often limited, which degrade the closed-loop system performance and may even cause the system to become unstable. Seeking a desired trade-off between the closed-loop system performance and the limited resources is thus one heated area of research. In this paper, we analyze the trade-off between the sensor-to-controller communication rate and the closed-loop system performance indexed by the conventional LQG control cost. We present and compare several sensor data schedules, and demonstrate that two event-based sensor data schedules provide better trade-off than an optimal offline schedule. Simulation examples are provided to illustrate the theories developed in the paper. © 2012 AACC American Automatic Control Council).

Optimal constraint tightening policies for robust variable horizon model predictive control

This paper develops a technique for improving the region of attraction of a robust variable horizon model predictive controller. It considers a constrained discrete-time linear system acted upon by a bounded, but unknown time-varying state disturbance. Using constraint tightening for robustness, it is shown how the tightening policy, parameterised as direct feedback on the disturbance, can be optimised to increase the volume of an inner approximation to the controller's true region of attraction. Numerical examples demonstrate the benefits of the policy in increasing region of attraction volume and decreasing the maximum prediction horizon length. © 2012 IEEE.

Design trade-offs for energy regeneration and control in vehicle suspensions

This paper investigates the fundamental trade-offs involved in designing energy-regenerative suspensions, in particular, focusing on efficiency of power extraction and its effect on vehicle dynamics and control. It is shown that typical regenerative devices making use of linear-to-rotational elements can be modelled as a parallel arrangement of an inerter and a dissipative admittance. Taking account of typical adjustable parameters of the generator, it is shown, for a given suspension damping coefficient, that the power efficiency ratio scales with inertance. For a typical passenger vehicle, it is shown that there is a feasible compromise, namely that good efficiency is achievable with an inertance value that is not detrimental to vehicle performance. A prototype is designed and tested with a resistive termination and experimental results show good agreement between ideal and experimental admittances. The possibility to use dynamic (rather than purely resistive) loads to improve vehicle control without limiting the energy recovery is discussed. © 2013 Copyright Taylor and Francis Group, LLC.

Uniform stability of a particle approximation of the optimal filter derivative

Sequential Monte Carlo methods, also known as particle methods, are a widely used set of computational tools for inference in non-linear non-Gaussian state-space models. In many applications it may be necessary to compute the sensitivity, or derivative, of the optimal filter with respect to the static parameters of the state-space model; for instance, in order to obtain maximum likelihood model parameters of interest, or to compute the optimal controller in an optimal control problem. In Poyiadjis et al. [2011] an original particle algorithm to compute the filter derivative was proposed and it was shown using numerical examples that the particle estimate was numerically stable in the sense that it did not deteriorate over time. In this paper we substantiate this claim with a detailed theoretical study. Lp bounds and a central limit theorem for this particle approximation of the filter derivative are presented. It is further shown that under mixing conditions these Lp bounds and the asymptotic variance characterized by the central limit theorem are uniformly bounded with respect to the time index. We demon- strate the performance predicted by theory with several numerical examples. We also use the particle approximation of the filter derivative to perform online maximum likelihood parameter estimation for a stochastic volatility model.