Stabilization of collective motion in three dimensions: A consensus approach

This paper proposes a methodology to stabilize relative equilibria in a model of identical, steered particles moving in three-dimensional Euclidean space. Exploiting the Lie group structure of the resulting dynamical system, the stabilization problem is reduced to a consensus problem. We first derive the stabilizing control laws in the presence of all-to-all communication. Providing each agent with a consensus estimator, we then extend the results to a general setting that allows for unidirectional and time-varying communication topologies. © 2007 IEEE.

Predictive control for spacecraft rendezvous in an elliptical orbit using an FPGA

A field programmable gate array (FPGA)-based predictive controller for a spacecraft rendezvous manoeuvre is presented. A linear time varying prediction model is used to accommodate elliptical orbits, and a variable prediction horizon is used to facilitate finite time completion of manoeuvres. The resulting constrained optimisation problems are solved using a primal dual interior point algorithm. The majority of the computational demand is in solving a set of linear equations at each iteration of this algorithm. To accelerate this operation, a custom circuit is implemented, using a combination of Mathworks HDL Coder and Xilinx System Generator for DSP, and used as a peripheral to a MicroBlaze soft core processor. The system is demonstrated in closed loop by linking the FPGA with a simulation of the plant dynamics running in Simulink on a PC, using Ethernet. © 2013 EUCA.

Aberration correction for free space optical communications using rectangular zernike modal wavefront sensing

A time multiplexed rectangular Zernike modal wavefront sensor based on a nematic phase-only liquid crystal spatial light modulator and specially designed for a high power two-electrode tapered laser diode which is a compact and novel free space optical communication source is used in an adaptive beam steering free space optical communication system, enabling the system to have 1.25 GHz modulation bandwidth, 4.6° angular coverage and the capability of sensing aberrations within the system and caused by atmosphere turbulence up to absolute value of 0.15 waves amplitude and correcting them in one correction cycle. Closed-loop aberration correction algorithm can be implemented to provide convergence for larger and time varying aberrations. Improvement of the system signal-to-noise-ratio performance is achieved by aberration correction. To our knowledge, it is first time to use rectangular orthonormal Zernike polynomials to represent balanced aberrations for high power rectangular laser beam in practice. © 2014 IEEE.

Multi-channel signal separation

The separation of independent sources from mixed observed data is a fundamental and challenging problem. In many practical situations, observations may be modelled as linear mixtures of a number of source signals, i.e. a linear multi-input multi-output system. A typical example is speech recordings made in an acoustic environment in the presence of background noise and/or competing speakers. Other examples include EEG signals, passive sonar applications and cross-talk in data communications. In this paper, we propose iterative algorithms to solve the n × n linear time invariant system under two different constraints. Some existing solutions for 2 × 2 systems are reviewed and compared.

Robust multiplexed model predictive control

This paper extends the recently developed multiplexed model predictive control (MMPC) concept to ensure satisfaction of hard constraints despite the action of persistent, unknown but bounded disturbances. MMPC uses asynchronous control moves on each input channel instead of synchronised moves on all channels. It offers reduced computation, by dividing the online optimisation into a smaller problem for each channel, and potential performance improvements, as the response to a disturbance is quicker, albeit via only one channel. Robustness to disturbances is introduced using the constraint tightening approach, tailored to suit the asynchronous updates of MMPC and the resulting time-varying optimisations. Numerical results are presented, involving a simple mechanical example and an aircraft control example, showing the potential computational and performance benefits of the new robust MMPC.

Spray visualisation and acoustic analysis in a gas-turbine type burner

This paper presents the characterisation of self-excited oscillations in a kerosene burner. The combustion instability exhibits two different modes and frequencies depending on the air flow rate. Experimental results reveal the influence of the spray to shift between these two modes. Pressure and heat release fluctuations have been measured simultaneously and the flame transfer function has been calculated from these measurements. The Mie scattering technique has been used to record spray fluctuations in reacting conditions with a high speed camera. Innovative image processing has enabled us to obtain fluctuations of the Mie scattered light from the spray as a temporal signal acquired simultaneously with pressure fluctuations. This has been used to determine a transfer function relating the image intensity and hence the spray fluctuations to changes in air velocity. This function has identified the different role the spray plays in the two modes of instability. At low air flow rates, the spray responds to an unsteady air flow rate and the time varying spray characteristics lead to unsteady combustion. At higher air flow rates, effective evaporation means that the spray dynamics are less important, leading to a different flame transfer function and frequency of self-excited oscillation. In conclusion, the combustion instabilities observed are closely related with the fluctuations of the spray motion and evaporation.

Generalised Wishart Processes

We introduce a stochastic process with Wishart marginals: the generalised Wishart process (GWP). It is a collection of positive semi-definite random matrices indexed by any arbitrary dependent variable. We use it to model dynamic (e.g. time varying) covariance matrices. Unlike existing models, it can capture a diverse class of covariance structures, it can easily handle missing data, the dependent variable can readily include covariates other than time, and it scales well with dimension; there is no need for free parameters, and optional parameters are easy to interpret. We describe how to construct the GWP, introduce general procedures for inference and predictions, and show that it outperforms its main competitor, multivariate GARCH, even on financial data that especially suits GARCH. We also show how to predict the mean of a multivariate process while accounting for dynamic correlations.

BOLTZMANN MACHINES FOR SPEECH RECOGNITION.

Boltzmann machines offer a new and exciting approach to automatic speech recognition, and provide a rigorous mathematical formalism for parallel computing arrays. In this paper we briefly summarize Boltzmann machine theory, and present results showing their ability to recognize both static and time-varying speech patterns. A machine with 2000 units was able to distinguish between the 11 steady-state vowels in English with an accuracy of 85%. The stability of the learning algorithm and methods of preprocessing and coding speech data before feeding it to the machine are also discussed. A new type of unit called a carry input unit, which involves a type of state-feedback, was developed for the processing of time-varying patterns and this was tested on a few short sentences. Use is made of the implications of recent work into associative memory, and the modelling of neural arrays to suggest a good configuration of Boltzmann machines for this sort of pattern recognition.

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.

APPROXIMATE GAUSS-MARKOV REALISATION OF MULTIVARIATE STOCHASTIC PROCESSES.

Given a spectral density matrix or, equivalently, a real autocovariance sequence, the author seeks to determine a finite-dimensional linear time-invariant system which, when driven by white noise, will produce an output whose spectral density is approximately PHI ( omega ), and an approximate spectral factor of PHI ( omega ). The author employs the Anderson-Faurre theory in his analysis.

The modified Kanerva model for automatic speech recognition

A parallel processing network derived from Kanerva's associative memory theory Kanerva 1984 is shown to be able to train rapidly on connected speech data and recognize further speech data with a label error rate of 0·68%. This modified Kanerva model can be trained substantially faster than other networks with comparable pattern discrimination properties. Kanerva presented his theory of a self-propagating search in 1984, and showed theoretically that large-scale versions of his model would have powerful pattern matching properties. This paper describes how the design for the modified Kanerva model is derived from Kanerva's original theory. Several designs are tested to discover which form may be implemented fastest while still maintaining versatile recognition performance. A method is developed to deal with the time varying nature of the speech signal by recognizing static patterns together with a fixed quantity of contextual information. In order to recognize speech features in different contexts it is necessary for a network to be able to model disjoint pattern classes. This type of modelling cannot be performed by a single layer of links. Network research was once held back by the inability of single-layer networks to solve this sort of problem, and the lack of a training algorithm for multi-layer networks. Rumelhart, Hinton & Williams 1985 provided one solution by demonstrating the "back propagation" training algorithm for multi-layer networks. A second alternative is used in the modified Kanerva model. A non-linear fixed transformation maps the pattern space into a space of higher dimensionality in which the speech features are linearly separable. A single-layer network may then be used to perform the recognition. The advantage of this solution over the other using multi-layer networks lies in the greater power and speed of the single-layer network training algorithm. © 1989.

The nonlinear heat release response of stratified lean-premixed flames to acoustic velocity oscillations

This paper analyzes the forced response of swirl-stabilized lean-premixed flames to high-amplitude acoustic forcing in a laboratory-scale stratified burner operated with CH4 and air at atmospheric pressure. The double-swirler, double-channel annular burner was specially designed to generate high-amplitude acoustic velocity oscillations and a radial equivalence ratio gradient at the inlet of the combustion chamber. Temporal oscillations of equivalence ratio along the axial direction are dissipated over a long distance, and therefore the effects of time-varying fuel/air ratio on the response are not considered in the present investigation. Simultaneous measurements of inlet velocity and heat release rate oscillations were made using a constant temperature anemometer and photomultiplier tubes with narrow-band OH*/CH* interference filters. Time-averaged and phase-synchronized CH* chemiluminescence intensities were measured using an intensified CCD camera. The measurements show that flame stabilization mechanisms vary depending on equivalence ratio gradients for a constant global equivalence ratio (φg=0.60). Under uniformly premixed conditions, an enveloped M-shaped flame is observed. In contrast, under stratified conditions, a dihedral V-flame and a toroidal detached flame develop in the outer stream and inner stream fuel enrichment cases, respectively. The modification of the stabilization mechanism has a significant impact on the nonlinear response of stratified flames to high-amplitude acoustic forcing (u'/U∼0.45 and f=60, 160Hz). Outer stream enrichment tends to improve the flame's stiffness with respect to incident acoustic/vortical disturbances, whereas inner stream stratification tends to enhance the nonlinear flame dynamics, as manifested by the complex interaction between the swirl flame and large-scale coherent vortices with different length scales and shedding points. It was found that the behavior of the measured flame describing functions (FDF), which depend on radial fuel stratification, are well correlated with previous measurements of the intensity of self-excited combustion instabilities in the stratified swirl burner. The results presented in this paper provide insight into the impact of nonuniform reactant stoichiometry on combustion instabilities, its effect on flame location and the interaction with unsteady flow structures. © 2011 The Combustion Institute.

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.

Bayesian interpolation in a dynamic sinusoidal model with application to packet-loss concealment

In this paper, we consider Bayesian interpolation and parameter estimation in a dynamic sinusoidal model. This model is more flexible than the static sinusoidal model since it enables the amplitudes and phases of the sinusoids to be time-varying. For the dynamic sinusoidal model, we derive a Bayesian inference scheme for the missing observations, hidden states and model parameters of the dynamic model. The inference scheme is based on a Markov chain Monte Carlo method known as Gibbs sampler. We illustrate the performance of the inference scheme to the application of packet-loss concealment of lost audio and speech packets. © EURASIP, 2010.

The Gaussian mixture MCMC particle algorithm for dynamic cluster tracking

We present a novel filtering algorithm for tracking multiple clusters of coordinated objects. Based on a Markov chain Monte Carlo (MCMC) mechanism, the new algorithm propagates a discrete approximation of the underlying filtering density. A dynamic Gaussian mixture model is utilized for representing the time-varying clustering structure. This involves point process formulations of typical behavioral moves such as birth and death of clusters as well as merging and splitting. For handling complex, possibly large scale scenarios, the sampling efficiency of the basic MCMC scheme is enhanced via the use of a Metropolis within Gibbs particle refinement step. As the proposed methodology essentially involves random set representations, a new type of estimator, termed the probability hypothesis density surface (PHDS), is derived for computing point estimates. It is further proved that this estimator is optimal in the sense of the mean relative entropy. Finally, the algorithm's performance is assessed and demonstrated in both synthetic and realistic tracking scenarios. © 2012 Elsevier Ltd. All rights reserved.