Optimisation of the weighting functions of an H_∞ controller using genetic algorithms and structured genetic algorithms

In this paper the optimisation of the weighting functions for an H<sub>∞</sub> controller using genetic algorithms and structured genetic algorithms is considered. The choice of the weighting functions is one of the key steps in the design of an H<sub>∞</sub> controller. The performance of the controller depends on these weighting functions since poorly chosen weighting functions will provide a poor controller. One approach that can solve this problem is the use of evolutionary techniques to tune the weighting parameters. The paper presents the improved performance of structured genetic algorithms over conventional genetic algorithms and how this technique can assist with the identification of appropriate weighting functions' orders

Hyper-Spectral Image Analysis with Partially-Latent Regression and Spatial Markov Dependencies

Hyper-spectral data can be analyzed to recover physical properties at large planetary scales. This involves resolving inverse problems which can be addressed within machine learning, with the advantage that, once a relationship between physical parameters and spectra has been established in a data-driven fashion, the learned relationship can be used to estimate physical parameters for new hyper-spectral observations. Within this framework, we propose a spatially-constrained and partially-latent regression method which maps high-dimensional inputs (hyper-spectral images) onto low-dimensional responses (physical parameters such as the local chemical composition of the soil). The proposed regression model comprises two key features. Firstly, it combines a Gaussian mixture of locally-linear mappings (GLLiM) with a partially-latent response model. While the former makes high-dimensional regression tractable, the latter enables to deal with physical parameters that cannot be observed or, more generally, with data contaminated by experimental artifacts that cannot be explained with noise models. Secondly, spatial constraints are introduced in the model through a Markov random field (MRF) prior which provides a spatial structure to the Gaussian-mixture hidden variables. Experiments conducted on a database composed of remotely sensed observations collected from the Mars planet by the Mars Express orbiter demonstrate the effectiveness of the proposed model.Comment: 12 pages, 4 figures, 3 table

Optimal cooperative control synthesis applied to a control-configured aircraft

A multivariable control augmentation synthesis method is presented that is intended to enable the designer to directly optimize pilot opinion rating of the augmented system. The approach involves the simultaneous solution for the augmentation and predicted pilot's compensation via optimal control techniques. The methodology is applied to the control law synthesis for a vehicle similar to the AFTI F16 control-configured aircraft. The resulting dynamics, expressed in terms of eigenstructure and time/frequency responses, are presented with analytical predictions of closed loop tracking performance, pilot compensation, and other predictors of pilot acceptance

Reinforcement Learning and Planning for Preference Balancing Tasks

Robots are often highly non-linear dynamical systems with many degrees of freedom, making solving motion problems computationally challenging. One solution has been reinforcement learning (RL), which learns through experimentation to automatically perform the near-optimal motions that complete a task. However, high-dimensional problems and task formulation often prove challenging for RL. We address these problems with PrEference Appraisal Reinforcement Learning (PEARL), which solves Preference Balancing Tasks (PBTs). PBTs define a problem as a set of preferences that the system must balance to achieve a goal. The method is appropriate for acceleration-controlled systems with continuous state-space and either discrete or continuous action spaces with unknown system dynamics. We show that PEARL learns a sub-optimal policy on a subset of states and actions, and transfers the policy to the expanded domain to produce a more refined plan on a class of robotic problems. We establish convergence to task goal conditions, and even when preconditions are not verifiable, show that this is a valuable method to use before other more expensive approaches. Evaluation is done on several robotic problems, such as Aerial Cargo Delivery, Multi-Agent Pursuit, Rendezvous, and Inverted Flying Pendulum both in simulation and experimentally. Additionally, PEARL is leveraged outside of robotics as an array sorting agent. The results demonstrate high accuracy and fast learning times on a large set of practical applications

Time-varying Autoregressive Modeling of Nonstationary Signals

Nonstationary signal modeling is a research topic of practical interest. In this thesis, we adopt a time-varying (TV) autoregressive (AR) model using the basis function (BF) parameter estimation method for nonstationary process identification and instantaneous frequency (IF) estimation. The current TVAR model in direct form (DF) with the blockwise least-squares and recursive weighted-least-squares BF methods perform equivalently well in signal modeling, but the large estimation error may cause temporary instabilities of the estimated model. To achieve convenient model stability monitoring and pole tracking, the TVAR model in cascade form (CF) was proposed through the parameterization in terms of TV poles (represented by second order section coefficients, Cartesian coordinates, Polar coordinates), where the time variation of each pole parameter is assumed to be the linear combination of BFs. The nonlinear system equations for the TVAR model in CF are solved iteratively using the Gauss-Newton algorithm. Using the CF, the model stability is easily controlled by constraining the estimated TV poles within the unit circle. The CF model shows similar performance trends to the DF model using the recursive BF method, and the TV pole representation in Cartesian coordinates outperforms all other representations. The individual frequency variation can be finely tracked using the CF model, when several frequency components are present in the signal. Simulations were carried on synthetic sinusoidal signals with different frequency variations for IF estimation. For the TVAR model in DF (blockwise), the basis dimension (BD) is an important factor on frequency estimation accuracy. For the TVAR model in DF (recursive) and CF (Cartesian), the influences of BD are negligible. The additive white noise in the observed signal degrades the estimation performance, and the the noise effects can be reduce by using higher model order. Experiments were carried on the real electromyography (EMG) data for frequency estimation in the analysis of muscle fatigue. The TVAR modeling methods show equivalent performance to the conventional Fourier transform method

A First and Second Order Moment Approach to Probabilistic Control Synthesis

This paper presents a robust control design methodology based on the estimation of the first two order moments of the random variables and processes that describe the controlled response. Synthesis is performed by solving an multi-objective optimization problem where stability and performance requirements in time- and frequency domains are integrated. The use of the first two order moments allows for the efficient estimation of the cost function thus for a faster synthesis algorithm. While reliability requirements are taken into account by using bounds to failure probabilities, requirements related to undesirable variability are implemented by quantifying the concentration of the random outcome about a deterministic target. The Hammersley Sequence Sampling and the First- and Second-Moment- Second-Order approximations are used to estimate the moments, whose accuracy and associated computational complexity are compared numerically. Examples using output-feedback and full-state feedback with state estimation are used to demonstrate the ideas proposed