A review of convex approaches for control, observation and safety of linear parameter varying and Takagi-Sugeno systems

This paper provides a review about the concept of convex systems based on Takagi-Sugeno, linear parameter varying (LPV) and quasi-LPV modeling. These paradigms are capable of hiding the nonlinearities by means of an equivalent description which uses a set of linear models interpolated by appropriately defined weighing functions. Convex systems have become very popular since they allow applying extended linear techniques based on linear matrix inequalities (LMIs) to complex nonlinear systems. This survey aims at providing the reader with a significant overview of the existing LMI-based techniques for convex systems in the fields of control, observation and safety. Firstly, a detailed review of stability, feedback, tracking and model predictive control (MPC) convex controllers is considered. Secondly, the problem of state estimation is addressed through the design of proportional, proportional-integral, unknown input and descriptor observers. Finally, safety of convex systems is discussed by describing popular techniques for fault diagnosis and fault tolerant control (FTC).Peer ReviewedPostprint (published version

Gaussian process based model predictive control : a thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Engineering, School of Engineering and Advanced Technology, Massey University, New Zealand

The performance of using Model Predictive Control (MPC) techniques is highly dependent on a model that is able to accurately represent the dynamical system. The datadriven modelling techniques are usually used as an alternative approach to obtain such a model when first principle techniques are not applicable. However, it is not easy to assess the quality of learnt models when using the traditional data-driven models, such as Artificial Neural Network (ANN) and Fuzzy Model (FM). This issue is addressed in this thesis by using probabilistic Gaussian Process (GP) models. One key issue of using the GP models is accurately learning the hyperparameters. The Conjugate Gradient (CG) algorithms are conventionally used in the problem of maximizing the Log-Likelihood (LL) function to obtain these hyperparameters. In this thesis, we proposed a hybrid Particle Swarm Optimization (PSO) algorithm to cope with the problem of learning hyperparameters. In addition, we also explored using the Mean Squared Error (MSE) of outputs as the fitness function in the optimization problem. This will provide us a quality indication of intermediate solutions. The GP based MPC approaches for unknown systems have been studied in the past decade. However, most of them are not generally formulated. In addition, the optimization solutions in existing GP based MPC algorithms are not clearly given or are computationally demanding. In this thesis, we first study the use of GP based MPC approaches in the unconstrained problems. Compared to the existing works, the proposed approach is generally formulated and the corresponding optimization problem is eff- ciently solved by using the analytical gradients of GP models w.r.t. outputs and control inputs. The GPMPC1 and GPMPC2 algorithms are subsequently proposed to handle the general constrained problems. In addition, through using the proposed basic and extended GP based local dynamical models, the constrained MPC problem is effectively solved in the GPMPC1 and GPMPC2 algorithms. The proposed algorithms are verified in the trajectory tracking problem of the quadrotor. The issue of closed-loop stability in the proposed GPMPC algorithm is addressed by means of the terminal cost and constraint technique in this thesis. The stability guaranteed GPMPC algorithm is subsequently proposed for the constrained problem. By using the extended GP based local dynamical model, the corresponding MPC problem is effectively solved

On generalized terminal state constraints for model predictive control

This manuscript contains technical results related to a particular approach for the design of Model Predictive Control (MPC) laws. The approach, named "generalized" terminal state constraint, induces the recursive feasibility of the underlying optimization problem and recursive satisfaction of state and input constraints, and it can be used for both tracking MPC (i.e. when the objective is to track a given steady state) and economic MPC (i.e. when the objective is to minimize a cost function which does not necessarily attains its minimum at a steady state). It is shown that the proposed technique provides, in general, a larger feasibility set with respect to existing approaches, given the same computational complexity. Moreover, a new receding horizon strategy is introduced, exploiting the generalized terminal state constraint. Under mild assumptions, the new strategy is guaranteed to converge in finite time, with arbitrarily good accuracy, to an MPC law with an optimally-chosen terminal state constraint, while still enjoying a larger feasibility set. The features of the new technique are illustrated by three examples.Comment: Part of the material in this manuscript is contained in a paper accepted for publication on Automatica and it is subject to Elsevier copyright. The copy of record is available on http://www.sciencedirect.com

Design of generalized minimum variance controllers for nonlinear multivariable systems

The design and implementation of Generalized Minimum Variance control laws for nonlinear multivariable systems that can include severe nonlinearities is considered. The quadratic cost index minimised involves dynamically weighted error and nonlinear control signal costing terms. The aim here is to show the controller obtained is simple to design and implement. The features of the control law are explored. The controller obtained includes an internal model of the process and in one form is a nonlinear version of the Smith Predictor

Wind generator behaviour in a pay-as-bid curtailment market

A pay-as-bid curtailment market, where Wind Power Plants (WPPs) may offer prices to have their output reduced in the event of network balancing or stability constraints, is one approach towards the market integration of a high proportion of wind energy onto a power system. Such a market aims to procure curtailment at a cost close to the marginal value of the electricity plus renewable subsidies and incentives, reducing risks for WPPs while minimising costs to the Independent System Operator (ISO). Through the use of game theory and market modelling, a key set of bidding strategies are identified that may evolve within such a market, which may act in opposition to the goals of the ISO. These are applied to a variety of network conditions in order to determine their likely impact and the resulting bidding signals provided to market participants. Bidding behaviours and market fluidity may also be affected by factors particular to wind power plants. Through analysis of both ex ante and ex post case studies, the existence of these behaviours is demonstrated, illustrating that a pay-as-bid curtailment market may not be efficient at price discovery in practice