On general systems with network-enhanced complexities

In recent years, the study of networked control systems (NCSs) has gradually become an active research area due to the advantages of using networked media in many aspects such as the ease of maintenance and installation, the large flexibility and the low cost. It is well known that the devices in networks are mutually connected via communication cables that are of limited capacity. Therefore, some network-induced phenomena have inevitably emerged in the areas of signal processing and control engineering. These phenomena include, but are not limited to, network-induced communication delays, missing data, signal quantization, saturations, and channel fading. It is of great importance to understand how these phenomena influence the closed-loop stability and performance properties

H

This paper investigates the problem of H∞ filtering for class discrete-time Lipschitz nonlinear singular systems with measurement quantization. Assume that the system measurement output is quantized by a static, memoryless, and logarithmic quantizer before it is transmitted to the filter, while the quantizer errors can be treated as sector-bound uncertainties. The attention of this paper is focused on the design of a nonlinear quantized H∞ filter to mitigate quantization effects and ensure that the filtering error system is admissible (asymptotically stable, regular, and causal), while having a unique solution with a prescribed H∞ noise attenuation level. By introducing some slack variables and using the Lyapunov stability theory, some sufficient conditions for the existence of the nonlinear quantized H∞ filter are expressed in terms of linear matrix inequalities (LMIs). Finally, a numerical example is presented to demonstrate the effectiveness of the proposed quantized filter design method

Decentralized control for guaranteed individual costs in a linear multi-agent system: A satisfaction equilibrium approach

International audienceThis work focuses on the design of decentralized feedback control gains that aims at optimizing individual costs in a multi-agent synchronization problem. As reported in the literature, the optimal control design for synchronization of agents using local information is NP-hard. Consequently, we relax the problem and use the notion of satisfaction equilibrium from game theory to ensure that each individual cost is guaranteed to be lower than a given threshold. Our main results provide conditions in the form of linear matrix inequalities (LMIs) to check if a given set of control gains are in satisfaction equilibrium i.e. all individual costs are upper-bounded by the imposed threshold. Moreover, we provide an algorithm in order to synthesize gains that are in satisfaction equilibrium. Finally, we illustrate this algorithm with numerical examples

Integral Sliding Mode Control of Lur’e Singularly Perturbed Systems

This paper investigates the integral sliding mode control problem for Lur’e singularly perturbed systems with sector-constrained nonlinearities. First, we design a proper sliding manifold such that the motion of closed-loop systems with a state feedback controller along the manifold is absolutely stable. To achieve this, we give a matrix inequality-based absolute stability criterion; thus the above problem can be converted into a matrix inequality feasibility problem. In addition, the gain matrix can also be derived by solving the matrix inequality. Then, a discontinuous control law is synthesized to force the system state to reach the sliding manifold and stay there for all subsequent time. Finally, some numerical examples are given to illustrate the effectiveness of the proposed results

Multilevel algorithms for the optimization of structured problems

Although large scale optimization problems are very difficult to solve in general, problems that arise from practical applications often exhibit particular structure. In this thesis we study and improve algorithms that can efficiently solve structured problems. Three separate settings are considered. The first part concerns the topic of singularly perturbed Markov decision processes (MDPs). When a MDP is singularly perturbed, one can construct an aggregate model in which the solution is asymptotically optimal. We develop an algorithm that takes advantage of existing results to compute the solution of the original model. The proposed algorithm can compute the optimal solution with a reduction in complexity without any penalty in accuracy. In the second part, the class of empirical risk minimization (ERM) problems is studied. When using a first order method, the Lipschitz constant of the empirical risk plays a crucial role in the convergence analysis and stepsize strategy of these problems. We derive the probabilistic bounds for such Lipschitz constants using random matrix theory. Our results are used to derive the probabilistic complexity and develop a new stepsize strategy for first order methods. The proposed stepsize strategy, Probabilistic Upper-bound Guided stepsize strategy (PUG), has a strong theoretical guarantee on its performance compared to the standard stepsize strategy. In the third part, we extend the existing results on multilevel methods for unconstrained convex optimization. We study a special case where the hierarchy of models is created by approximating first and second order information of the exact model. This is known as Galerkin approximation, and we named the corresponding algorithm Galerkin-based Algebraic Multilevel Algorithm (GAMA). Three case studies are conducted to show how the structure of a problem could affect the convergence of GAMA.Open Acces

Improving Transient Performance of Adaptive Control Architectures using Frequency-Limited System Error Dynamics

We develop an adaptive control architecture to achieve stabilization and command following of uncertain dynamical systems with improved transient performance. Our framework consists of a new reference system and an adaptive controller. The proposed reference system captures a desired closed-loop dynamical system behavior modified by a mismatch term representing the high-frequency content between the uncertain dynamical system and this reference system, i.e., the system error. In particular, this mismatch term allows to limit the frequency content of the system error dynamics, which is used to drive the adaptive controller. It is shown that this key feature of our framework yields fast adaptation with- out incurring high-frequency oscillations in the transient performance. We further show the effects of design parameters on the system performance, analyze closeness of the uncertain dynamical system to the unmodified (ideal) reference system, discuss robustness of the proposed approach with respect to time-varying uncertainties and disturbances, and make connections to gradient minimization and classical control theory.Comment: 27 pages, 7 figure