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

Stochastic model predictive control of LPV systems via scenario optimization

A stochastic receding-horizon control approach for constrained Linear Parameter Varying discrete-time systems is proposed in this paper. It is assumed that the time-varying parameters have stochastic nature and that the system's matrices are bounded but otherwise arbitrary nonlinear functions of these parameters. No specific assumption on the statistics of the parameters is required. By using a randomization approach, a scenario-based finite-horizon optimal control problem is formulated, where only a finite number M of sampled predicted parameter trajectories (‘scenarios') are considered. This problem is convex and its solution is a priori guaranteed to be probabilistically robust, up to a user-defined probability level p. The p level is linked to M by an analytic relationship, which establishes a tradeoff between computational complexity and robustness of the solution. Then, a receding horizon strategy is presented, involving the iterated solution of a scenario-based finite-horizon control problem at each time step. Our key result is to show that the state trajectories of the controlled system reach a terminal positively invariant set in finite time, either deterministically, or with probability no smaller than p. The features of the approach are illustrated by a numerical example

MPC for LPV Systems Based on Parameter-Dependent Lyapunov Function with Perturbation on Control Input Strategy

In this paper, the model predictive control (MPC) algorithm for linear parameter varying (LPV) systems is proposed. The proposed algorithm consists of two steps. The first step is derived by using parameter-dependent Lyapunov function and the second step is derived by using the perturbation on control input strategy. In order to achieve good control performance, the bounds on the rate of variation of the parameters are taken into account in the controller synthesis. An overall algorithm is proved to guarantee robust stability. The controller design is illustrated with two case studies of continuous stirred-tank reactors. Comparisons with other MPC algorithms for LPV systems have been undertaken. The results show that the proposed algorithm can achieve better control performance

Model Predictive Control Based Trajectory Generation for Autonomous Vehicles - An Architectural Approach

Research in the field of automated driving has created promising results in the last years. Some research groups have shown perception systems which are able to capture even complicated urban scenarios in great detail. Yet, what is often missing are general-purpose path- or trajectory planners which are not designed for a specific purpose. In this paper we look at path- and trajectory planning from an architectural point of view and show how model predictive frameworks can contribute to generalized path- and trajectory generation approaches for generating safe trajectories even in cases of system failures.Comment: Presented at IEEE Intelligent Vehicles Symposium 2017, Los Angeles, CA, US

Real-time predictive control for SI engines using linear parameter-varying models

As a response to the ever more stringent emission standards, automotive engines have become more complex with more actuators. The traditional approach of using many single-input single output controllers has become more difficult to design, due to complex system interactions and constraints. Model predictive control offers an attractive solution to this problem because of its ability to handle multi-input multi-output systems with constraints on inputs and outputs. The application of model based predictive control to automotive engines is explored below and a multivariable engine torque and air-fuel ratio controller is described using a quasi-LPV model predictive control methodology. Compared with the traditional approach of using SISO controllers to control air fuel ratio and torque separately, an advantage is that the interactions between the air and fuel paths are handled explicitly. Furthermore, the quasi-LPV model-based approach is capable of capturing the model nonlinearities within a tractable linear structure, and it has the potential of handling hard actuator constraints. The control design approach was applied to a 2010 Chevy Equinox with a 2.4L gasoline engine and simulation results are presented. Since computational complexity has been the main limiting factor for fast real time applications of MPC, we present various simplifications to reduce computational requirements. A benchmark comparison of estimated computational speed is included

Model Predictive Control of stochastic LPV Systems via Random Convex Programs

This paper considers the problem of stabilization of stochastic Linear Parameter Varying (LPV) discrete time systems in the presence of convex state and input constraints. By using a randomization approach, a convex finite horizon optimal control problem is derived, even when the dependence of the system's matrices on the time-varying parameters is nonlinear. This convex problem can be solved efficiently, and its solution is a-priori guaranteed to be probabilistically robust, up to a user-defined probability level p. Then, a novel receding horizon control strategy that involves, at each time step, the solution of a finite-horizon scenario-based control problem, is proposed. It is shown that the resulting closed loop scheme drives the state to a terminal set in finite time, either deterministically, or with probability no less than p. The features of the approach are shown through a numerical exampl

Computational burden reduction in Min-Max MPC

Min–max model predictive control (MMMPC) is one of the strategies used to control plants subject to bounded uncertainties. The implementation of MMMPC suffers a large computational burden due to the complex numerical optimization problem that has to be solved at every sampling time. This paper shows how to overcome this by transforming the original problem into a reduced min–max problem whose solution is much simpler. In this way, the range of processes to which MMMPC can be applied is considerably broadened. Proofs based on the properties of the cost function and simulation examples are given in the paper

Convergence Properties of Fast quasi-LPV Model Predictive Control

In this paper, we study the convergence properties of an iterative algorithm for fast nonlinear model predictive control of quasi-linear parameter-varying systems without inequality constraints. Compared to previous works considering this algorithm, we contribute conditions under which the iterations are guaranteed to converge. Furthermore, we show that the algorithm converges to suboptimal solutions and propose an optimality-preserving variant with moderately increased computational complexity. Finally, we compare both variants in terms of quality of solution and computational performance with a state-of-the-art solver for nonlinear model predictive control in two simulation benchmarks.Comment: 6 pages, 2 figures. Corrects a mistake in Lemma 1 compared to the conference version, the changes are highlighted in blu

Computationally efficient min-max MPC

2005 IFAC 16th Triennial World Congress, Prague, Czech RepublicMin-Max MPC (MMMPC) controllers (Campo and Morari, 1987) suffer from a great computational burden that is often circumvented by using upper bounds of the worst possible case of a performance index. These upper bounds are usually computed by means of LMI techniques. In this paper a more efficient approach is shown. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound which can be easily computed using simple matrix operations. This implies that the algorithm can be coded easily even in non mathematical oriented programming languages such as those found in industrial embedded control hardware. Simulation examples are given in the paper