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

Control Regularization for Reduced Variance Reinforcement Learning

Dealing with high variance is a significant challenge in model-free reinforcement learning (RL). Existing methods are unreliable, exhibiting high variance in performance from run to run using different initializations/seeds. Focusing on problems arising in continuous control, we propose a functional regularization approach to augmenting model-free RL. In particular, we regularize the behavior of the deep policy to be similar to a policy prior, i.e., we regularize in function space. We show that functional regularization yields a bias-variance trade-off, and propose an adaptive tuning strategy to optimize this trade-off. When the policy prior has control-theoretic stability guarantees, we further show that this regularization approximately preserves those stability guarantees throughout learning. We validate our approach empirically on a range of settings, and demonstrate significantly reduced variance, guaranteed dynamic stability, and more efficient learning than deep RL alone.Comment: Appearing in ICML 201

Small gain theorems for large scale systems and construction of ISS Lyapunov functions

We consider interconnections of n nonlinear subsystems in the input-to-state stability (ISS) framework. For each subsystem an ISS Lyapunov function is given that treats the other subsystems as independent inputs. A gain matrix is used to encode the mutual dependencies of the systems in the network. Under a small gain assumption on the monotone operator induced by the gain matrix, a locally Lipschitz continuous ISS Lyapunov function is obtained constructively for the entire network by appropriately scaling the individual Lyapunov functions for the subsystems. The results are obtained in a general formulation of ISS, the cases of summation, maximization and separation with respect to external gains are obtained as corollaries.Comment: provisionally accepted by SIAM Journal on Control and Optimizatio

Contraction analysis of nonlinear systems and its application

The thesis addresses various issues concerning the convergence properties of switched systems and differential algebraic equation (DAE) systems. Specifically, we focus on contraction analysis problem, as well as tackling problems related to stabilization and synchronization. We consider the contraction analysis of switched systems and DAE systems. To address this, a transformation is employed to convert the contraction analysis problem into a stabilization analysis problem. This transformation involves the introduction of virtual systems, which exhibit a strong connection with the Jacobian matrix of the vector field. Analyzing these systems poses a significant challenge due to the distinctive structure of their Jacobian matrices. Regarding the switched systems, a time-dependent switching law is established to guarantee uniform global exponential stability (UGES). As for the DAE system, we begin by embedding it into an ODE system. Subsequently, the UGES property is ensured by analyzing its matrix measure. As our first application, we utilize our approach to stabilize time-invariant switched systems and time-invariant DAE systems, respectively. This involves designing control laws to achieve system contractivity, thereby ensuring that the trajectory set encompasses the equilibrium point. In oursecond application, we propose the design of a time-varying observer by treating the system’s output as an algebraic equation of the DAE system. In our study on synchronization problems, we investigate two types of synchronization issues: the trajectory tracking of switched oscillators and the pinning state synchronization. In the case of switched oscillators, we devise a time-dependent switching law to ensure that these oscillators effectively follow the trajectory of a time-varying system. As for the pinning synchronization problem, we define solvable conditions and, building upon these conditions, we utilize contraction theory to design dynamic controllers that guarantee synchronization is achieved among the agents

Contraction analysis of nonlinear systems and its application

The thesis addresses various issues concerning the convergence properties of switched systems and differential algebraic equation (DAE) systems. Specifically, we focus on contraction analysis problem, as well as tackling problems related to stabilization and synchronization. We consider the contraction analysis of switched systems and DAE systems. To address this, a transformation is employed to convert the contraction analysis problem into a stabilization analysis problem. This transformation involves the introduction of virtual systems, which exhibit a strong connection with the Jacobian matrix of the vector field. Analyzing these systems poses a significant challenge due to the distinctive structure of their Jacobian matrices. Regarding the switched systems, a time-dependent switching law is established to guarantee uniform global exponential stability (UGES). As for the DAE system, we begin by embedding it into an ODE system. Subsequently, the UGES property is ensured by analyzing its matrix measure. As our first application, we utilize our approach to stabilize time-invariant switched systems and time-invariant DAE systems, respectively. This involves designing control laws to achieve system contractivity, thereby ensuring that the trajectory set encompasses the equilibrium point. In oursecond application, we propose the design of a time-varying observer by treating the system’s output as an algebraic equation of the DAE system. In our study on synchronization problems, we investigate two types of synchronization issues: the trajectory tracking of switched oscillators and the pinning state synchronization. In the case of switched oscillators, we devise a time-dependent switching law to ensure that these oscillators effectively follow the trajectory of a time-varying system. As for the pinning synchronization problem, we define solvable conditions and, building upon these conditions, we utilize contraction theory to design dynamic controllers that guarantee synchronization is achieved among the agents

Exponential synchronization of complex networks with Markovian jump and mixed delays

This is the post print version of the article. The official published version can be obtained from the link - Copyright 2008 Elsevier LtdIn this Letter, we investigate the exponential synchronization problem for an array of N linearly coupled complex networks with Markovian jump and mixed time-delays. The complex network consists of m modes and the network switches from one mode to another according to a Markovian chain with known transition probability. The mixed time-delays are composed of discrete and distributed delays, both of which are mode-dependent. The nonlinearities imbedded with the complex networks are assumed to satisfy the sector condition that is more general than the commonly used Lipschitz condition. By making use of the Kronecker product and the stochastic analysis tool, we propose a novel Lyapunov–Krasovskii functional suitable for handling distributed delays and then show that the addressed synchronization problem is solvable if a set of linear matrix inequalities (LMIs) are feasible. Therefore, a unified LMI approach is developed to establish sufficient conditions for the coupled complex network to be globally exponentially synchronized in the mean square. Note that the LMIs can be easily solved by using the Matlab LMI toolbox and no tuning of parameters is required. A simulation example is provided to demonstrate the usefulness of the main results obtained.This work was supported in part by the Biotechnology and Biological Sciences Research Council (BBSRC) of the UK under Grants BB/C506264/1 and 100/EGM17735, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grants GR/S27658/01 and EP/C524586/1, an International Joint Project sponsored by the Royal Society of the UK, the Natural Science Foundation of Jiangsu Province of China under Grant BK2007075, the National Natural Science Foundation of China under Grant 60774073, and the Alexander von Humboldt Foundation of Germany