H∞ sampled-data synthesis and related numerical issues

In this paper we present a new, compact derivation of state-space formulae for the so-called discretisation-based solution of the H∞ sampled-data control problem. Our approach is based on the established technique of continuous time-lifting, which is used to isometrically map the continuous-time, linear, periodically time-varying, sampled-data problem to a discretetime, linear, time-invariant problem. State-space formulae are derived for the equivalent, discrete-time problem by solving a set of two-point, boundary-value problems. The formulae accommodate a direct feed-through term from the disturbance inputs to the controlled outputs of the original plant and are simple, requiring the computation of only a single matrix exponential. It is also shown that the resultant formulae can be easily re-structured to give a numerically robust algorithm for computing the state-space matrices. © 1997 Elsevier Science Ltd. All rights reserved.

Asymmetric quantizers are better at low SNR

We study the behavior of channel capacity when a one-bit quantizer is employed at the output of the discrete-time average-power-limited Gaussian channel. We focus on the low signal-to-noise ratio regime, where communication at very low spectral efficiencies takes place, as in Spread-Spectrum and Ultra-Wideband communications. It is well known that, in this regime, a symmetric one-bit quantizer reduces capacity by 2/π, which translates to a power loss of approximately two decibels. Here we show that if an asymmetric one-bit quantizer is employed, and if asymmetric signal constellations are used, then these two decibels can be recovered in full. © 2011 IEEE.

Multipath channels of unbounded capacity

The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power. © 2008 IEEE.

Robust variable horizon MPC with move blocking

This paper introduces a new formulation of variable horizon model predictive control (VH-MPC) that utilises move blocking for reducing computational complexity. Various results pertaining to move blocking are derived, following which, a generalised blocked VH-MPC controller is formulated for linear discrete-time systems. Robustness to bounded disturbances is ensured through the use of tightened constraints. The resulting time-varying control scheme is shown to guarantee robust recursive feasibility and finite-time completion. An example is then presented for a particular choice of blocking regime, as would be applicable to vehicle manœuvring problems. Simulations demonstrate the efficacy of the formulation. © 2012 Elsevier B.V. All rights reserved.

Robust predictive control with feasible contingencies for fault tolerance

This paper introduces the notion of M-step robust fault tolerance for discrete-time systems where finite-time completion of a control manoeuvre is desired. It considers a scenario with two distinct objectives; a primary and secondary target are specified as sets to be reached in finite-time, whilst satisfying operating constraints on the states and inputs. The primary target is switched to the secondary target when a fault affects the system. As it is unknown when or if the fault will occur, the trajectory to the primary target is constrained to ensure reachability of the secondary target within M steps. A variable-horizon linear MPC formulation is developed to illustrate the concept. The formulation is then extended to provide robustness to bounded disturbances by use of tightened constraints. Simulations demonstrate the efficacy of the controller formulation on a double-integrator model. © 2011 IFAC.

ℓasso MPC: Smart regulation of over-actuated systems

In this paper, a novel MPC strategy is proposed, and referred to as asso MPC. The new paradigm features an 1-regularised least squares loss function, in which the control error variance competes with the sum of input channels magnitude (or slew rate) over the whole horizon length. This cost choice is motivated by the successful development of LASSO theory in signal processing and machine learning. In the latter fields, sum-of-norms regularisation have shown a strong capability to provide robust and sparse solutions for system identification and feature selection. In this paper, a discrete-time dual-mode asso MPC is formulated, and its stability is proven by application of standard MPC arguments. The controller is then tested for the problem of ship course keeping and roll reduction with rudder and fins, in a directional stochastic sea. Simulations show the asso MPC to inherit positive features from its corresponding regressor: extreme reduction of decision variables' magnitude, namely, actuators' magnitude (or variations), with a finite energy error, being particularly promising for over-actuated systems. © 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.

An experimental study on engine dynamics model based in-cylinder pressure estimation

The information provided by the in-cylinder pressure signal is of great importance for modern engine management systems. The obtained information is implemented to improve the control and diagnostics of the combustion process in order to meet the stringent emission regulations and to improve vehicle reliability and drivability. The work presented in this paper covers the experimental study and proposes a comprehensive and practical solution for the estimation of the in-cylinder pressure from the crankshaft speed fluctuation. Also, the paper emphasizes the feasibility and practicality aspects of the estimation techniques, for the real-time online application. In this study an engine dynamics model based estimation method is proposed. A discrete-time transformed form of a rigid-body crankshaft dynamics model is constructed based on the kinetic energy theorem, as the basis expression for total torque estimation. The major difficulties, including load torque estimation and separation of pressure profile from adjacent-firing cylinders, are addressed in this work and solutions to each problem are given respectively. The experimental results conducted on a multi-cylinder diesel engine have shown that the proposed method successfully estimate a more accurate cylinder pressure over a wider range of crankshaft angles. Copyright © 2012 SAE International.

Consensus under general convexity

A method is proposed to characterize contraction of a set through orthogonal projections. For discrete-time multi-agent systems, quantitative estimates of convergence (to a consensus) rate are provided by means of contracting convex sets. Required convexity for the sets that should include the values that the transition maps of agents take is considered in a more general sense than that of Euclidean geometry. © 2007 IEEE.

Quantitative convergence analysis of multi-agent systems

We introduce a characterization of contraction for bounded convex sets. For discrete-time multi-agent systems we provide an explicit upperbound on the rate of convergence to a consensus under the assumptions of contractiveness and (weak) connectedness (across an interval.) Convergence is shown to be exponential when either the system or the function characterizing the contraction is linear. Copyright © 2007 IFAC.

Predicting the response of structures to transient shock loading.

This work concerns the prediction of the response of an uncertain structure to a load of short duration. Assuming an ensemble of structures with small random variations about a nominal form, a mean impulse response can be found using only the modal density of the structure. The mean impulse response turns out to be the same as the response of an infinite structure: the response is calculated by taking into account the direct field only, without reflections. Considering the short duration of an impulsive loading, the approach is reasonable before the effect of the reverberant field becomes important. The convolution between the mean impulse response and the shock loading is solved in discrete time to calculate the response at the driving point and at remote points. Experimental and numerical examples are presented to validate the theory presented for simple structures such as beams, plates, and cylinders.

Single camera pose estimation using Bayesian filtering and Kinect motion priors

Traditional approaches to upper body pose estimation using monocular vision rely on complex body models and a large variety of geometric constraints. We argue that this is not ideal and somewhat inelegant as it results in large processing burdens, and instead attempt to incorporate these constraints through priors obtained directly from training data. A prior distribution covering the probability of a human pose occurring is used to incorporate likely human poses. This distribution is obtained offline, by fitting a Gaussian mixture model to a large dataset of recorded human body poses, tracked using a Kinect sensor. We combine this prior information with a random walk transition model to obtain an upper body model, suitable for use within a recursive Bayesian filtering framework. Our model can be viewed as a mixture of discrete Ornstein-Uhlenbeck processes, in that states behave as random walks, but drift towards a set of typically observed poses. This model is combined with measurements of the human head and hand positions, using recursive Bayesian estimation to incorporate temporal information. Measurements are obtained using face detection and a simple skin colour hand detector, trained using the detected face. The suggested model is designed with analytical tractability in mind and we show that the pose tracking can be Rao-Blackwellised using the mixture Kalman filter, allowing for computational efficiency while still incorporating bio-mechanical properties of the upper body. In addition, the use of the proposed upper body model allows reliable three-dimensional pose estimates to be obtained indirectly for a number of joints that are often difficult to detect using traditional object recognition strategies. Comparisons with Kinect sensor results and the state of the art in 2D pose estimation highlight the efficacy of the proposed approach.

Adaptive fading Kalman filter with an application

A new adaptive state estimation algorithm, namely adaptive fading Kalman filter (AFKF), is proposed to solve the divergence problem of Kalman filter. A criterion function is constructed to measure the optimality of Kalman filter. The forgetting factor in AFKF is adaptively adjusted by minimizing the defined criterion function using measured outputs. The algorithm remains convergent and tends to be optimal in the presence of model errors. It has been successfully applied to the headbox of a paper-making machine for state estimation.

水流作用下疏松土壤材料中细沟的再生及其临界剪应力的实验研究

动态土壤侵蚀包括依赖于空间与时间的土壤剥离、细沟的形成、水流中过量泥沙的沉积、沉积泥沙中细沟的再生等物理过程。与泥沙从沉积区域再剥离相关联的细沟再生是细沟变窄加深过程中的一个重要的现象。该文介绍一种实验装置 ,用于测量类似于沉积土壤的疏松土壤材料细沟再生的力学参数。用一种沙壤土进行实验 ,测定了不同团聚体大小和坡度下细沟再生开始和停止所对应的临界水流量。计算出了与沟坡相关的临界剪切应力。这些结果有助于理解细沟的再生及其数量关系 ,以及临界剪切应力与坡度间的定量关系 ;对于发展由沉积土壤再生的细沟演化过程模型特别有用。

网络控制系统稳定性的图理论

针对具有有界时延和数据包丢失的网络控制系统,提出了一种新的稳定性判据.基于Lyapunov方法和图论理论,给出非线性离散和连续网络控制系统渐近稳定的充分条件,获得保持这两类系统稳定的最大允许时延界,得到控制器设计方法.并且,利用区间矩阵的谱特征,给出网络控制系统区间稳定的充分条件.设计算法,获得比例积分反馈控制器增益.算例表明所提方法的有效性。