Piecewise Linear Control Systems

This thesis treats analysis and design of piecewise linear control systems. Piecewise linear systems capture many of the most common nonlinearities in engineering systems, and they can also be used for approximation of other nonlinear systems. Several aspects of linear systems with quadratic constraints are generalized to piecewise linear systems with piecewise quadratic constraints. It is shown how uncertainty models for linear systems can be extended to piecewise linear systems, and how these extensions give insight into the classical trade-offs between fidelity and complexity of a model. Stability of piecewise linear systems is investigated using piecewise quadratic Lyapunov functions. Piecewise quadratic Lyapunov functions are much more powerful than the commonly used quadratic Lyapunov functions. It is shown how piecewise quadratic Lyapunov functions can be computed via convex optimization in terms of linear matrix inequalities. The computations are based on a compact parameterization of continuous piecewise quadratic functions and conditional analysis using the S-procedure. A unifying framework for computation of a variety of Lyapunov functions via convex optimization is established based on this parameterization. Systems with attractive sliding modes and systems with bounded regions of attraction are also treated. Dissipativity analysis and optimal control problems with piecewise quadratic cost functions are solved via convex optimization. The basic results are extended to fuzzy systems, hybrid systems and smooth nonlinear systems. It is shown how Lyapunov functions with a discontinuous dependence on the discrete state can be computed via convex optimization. An automated procedure for increasing the flexibility of the Lyapunov function candidate is suggested based on linear programming duality. A Matlab toolbox that implements several of the results derived in the thesis is presented

A linear time-varying approach for robustness analyses of a re-entry flight technology demonstrator

A novel robustness analysis technique is proposed for atmospheric re-entry applications. The problem is stated as a finite time stability (FTS) analysis of linear time-varying (LTV) systems on a compact time domain, subject to bounded variations in initial state and unknown parameters. The FTS property is formulated as the inclusion of all the possible system trajectories into a pre-specified time-varying subset of the state space. Based on assuming the involved sets are polytopes, the proposed approach allows deducing the system FTS from the property verification on a limited number of numerically computed system trajectories. An additional result is presented which allows determination of a conservative estimate of the maximum norm-bound of time-varying perturbations under which the LTV system remains finite time stable. Results of the application of the proposed technique to a re-entry technology demonstrator are presented which demonstrate its effectiveness in complementing conventional linear time invariant-based analyses. Results also show that it is computationally viable and allows linking the system robustness to a quantitative analysis of the system trajectory dispersion around the nominal one due to concurrent initial state dispersion and uncertain parameters effects, which aids in evaluating mission objectives fulfillment

High-Speed and Low-Cost Implementation of Explicit Model Predictive Controllers

This paper presents a new form of piecewise-affine (PWA) solution, referred to as PWA hierarchical (PWAH), to approximate the explicit model predictive control (MPC) law, achieving a very rapid control response with the use of very few computational and memory resources. This is possible because PWAH controllers consist of single-input single-output PWA modules connected in cascade so that the parameters needed to define them increase linearly instead of exponentially with the input dimension of the control problem. PWAH controllers are not universal approximators but several explicit MPC controllers can be efficiently approximated by them. A methodology to design PWAH controllers is presented and validated with application examples already solved by MPC approaches. The designed PWAH controllers implemented in field-programmable gate arrays provide the highest control speed using the fewest resources compared with the other digital implementations reported in the literature.Ministerio de Economía, Industria y Competitividad TEC2014-57971-

Recent Advances in Robust Control

Robust control has been a topic of active research in the last three decades culminating in H_2/H_\infty and \mu design methods followed by research on parametric robustness, initially motivated by Kharitonov's theorem, the extension to non-linear time delay systems, and other more recent methods. The two volumes of Recent Advances in Robust Control give a selective overview of recent theoretical developments and present selected application examples. The volumes comprise 39 contributions covering various theoretical aspects as well as different application areas. The first volume covers selected problems in the theory of robust control and its application to robotic and electromechanical systems. The second volume is dedicated to special topics in robust control and problem specific solutions. Recent Advances in Robust Control will be a valuable reference for those interested in the recent theoretical advances and for researchers working in the broad field of robotics and mechatronics

Review on computational methods for Lyapunov functions

Lyapunov functions are an essential tool in the stability analysis of dynamical systems, both in theory and applications. They provide sufficient conditions for the stability of equilibria or more general invariant sets, as well as for their basin of attraction. The necessity, i.e. the existence of Lyapunov functions, has been studied in converse theorems, however, they do not provide a general method to compute them. Because of their importance in stability analysis, numerous computational construction methods have been developed within the Engineering, Informatics, and Mathematics community. They cover different types of systems such as ordinary differential equations, switched systems, non-smooth systems, discrete-time systems etc., and employ di_erent methods such as series expansion, linear programming, linear matrix inequalities, collocation methods, algebraic methods, set-theoretic methods, and many others. This review brings these different methods together. First, the different types of systems, where Lyapunov functions are used, are briefly discussed. In the main part, the computational methods are presented, ordered by the type of method used to construct a Lyapunov function