New criteria for dissipativity analysis of Caputo fractional-order neural networks with non-differentiable time-varying delays

In this article, we investigate the delay-dependent and order-dependent dissipativity analysis for a class of Caputo fractional-order neural networks (FONNs) subject to time-varying delays. By employing the Razumikhin fractional-order (RFO) approach combined with linear matrix inequalities (LMIs) techniques, a new sufficient condition is derived to guarantee that the considered fractional-order is strictly (Q, S, R) − γ − dissipativity. The condition is presented via LMIs and can be efficiently checked. Two numerical examples and simulation results are finally provided to express the effectiveness of the obtained results.

State and fault estimation based on fuzzy observer for a class of Takagi-Sugeno singular models

Singular nonlinear systems have received wide attention in recent years, and can be found in various applications of engineering practice. On the basis of the Takagi-Sugeno (T-S) formalism, which represents a powerful tool allowing the study and the treatment of nonlinear systems, many control and diagnostic problems have been treated in the literature. In this work, we aim to present a new approach making it possible to estimate simultaneously both non-measurable states and unknown faults in the actuators and sensors for a class of continuous-time Takagi-Sugeno singular model (CTSSM). Firstly, the considered class of CTSSM is represented in the case of premise variables which are non-measurable, and is subjected to actuator and sensor faults. Secondly, the suggested observer is synthesized based on the decomposition approach. Next, the observer’s gain matrices are determined using the Lyapunov theory and the constraints are defined as linear matrix inequalities (LMIs). Finally, a numerical simulation on an application example is given to demonstrate the usefulness and the good performance of the proposed dynamic system.

Fault-tolerant control system for the formation of carbon products

The production of carbon products is largely resource- and energy-intensive. That is why increasing the efficiency of this production is an urgent scientific and practical task, especially in modern conditions of constant growth of energy costs. An effective way to solve this problem is to create a modern process control system, taking into account possible failures of system components. A method for the synthesis of a fault-tolerant control system for the cyclic formation of carbon products has been developed, which takes into account control errors that are caused by malfunctions of controllers under conditions of unknown disturbances. According to the cyclic nature of the technological process under consideration, a control method with iterative learning was used in the synthesis of the control system. This method considers cyclic processes based on a two-dimensional model (2D model). The proposed control algorithm ensures the convergence of the control process with the task both in time and in each work cycle in order to promote the required quality of control even in the event of unknown disturbances and errors in the performance of controllers. The synthesis of the control system is based on the solution of a system of linear matrix inequalities. Based on the combination of a control method with iterative learning and a control method that takes into account failures in controllers, a method of constructing a fault-tolerant control system for the cyclic formation of carbon products has been synthesized to ensure acceptable operation of the control object in abnormal conditions. The control system has been synthesized by solving a system of linear matrix inequalities with the MATLAB software. In the future, it is necessary to consider optimal settings of the proposed control system and examine its effectiveness in comparison with conventional fault-tolerant systems for non-cyclic processes.

Finite-Time Control of Singular Linear Semi-Markov Jump Systems

The problem of finite-time control for singular linear semi-Markov jump systems (SMJSs) with unknown transition rates is considered in this paper. By designing a new semi-positive definite Lyapunov-like function, state feedback controller design methods are given that allow closed-loop singular linear SMJSs to be regular, impulse-free and stochastically finite-time-stable without external disturbance, and stochastically finite-time bounded with external disturbance. The obtained conditions are expressed by a set of strict matrix inequalities, which can be simplified to a set of linear matrix inequalities by a one dimensional search for a scalar. Two numerical examples are given to illustrate the effectiveness of proposed method.

Disturbance observer-based controller for inverted pendulum with uncertainties: Linear matrix inequality approach

<span lang="EN-US">A new approach based on linear matrix inequality (LMI) technique for stabilizing the inverted pendulum is developed in this article. The unknown states are estimated as well as the system is stabilized simultaneously by employing the observer-based controller. In addition, the impacts of the uncertainties are taken into consideration in this paper. Unlike the previous studies, the uncertainties in this study are unnecessary to satisfy the bounded constraints. These uncertainties will be converted into the unknown input disturbances, and then a disturbance observer-based controller will be synthesized to estimate the information of the unknown states, eliminate completely the effects of the uncertainties, and stabilize inverted pendulum system. With the support of lyapunov methodology, the conditions for constructing the observer and controller under the framework of linear matrix inequalities (LMIs) are derived in main theorems. Finally, the simulations for system with and without uncertainties are exhibited to show the merit and effectiveness of the proposed methods.</span>

Observer-Based Control for Nonlinear Time-Delayed Asynchronously Switching Systems: A New LMI Approach

This paper designs an observer-based controller for switched systems (SSs) with nonlinear dynamics, exogenous disturbances, parametric uncertainties, and time-delay. Based on the multiple Lyapunov–Krasovskii and average dwell time (DT) approaches, some conditions are presented to ensure the robustness and investigate the effect of time-delay, uncertainties, and lag issues between switching times. The control parameters are determined through solving the established linear matrix inequalities (LMIs) under asynchronous switching. A novel LMI-based conditions are suggested to guarantee the H∞ performance. Finally, the accuracy of the designed observer-based controller is examined by simulations on practical case-study plants.

Sum-of-squares chordal decomposition of polynomial matrix inequalities

We prove decomposition theorems for sparse positive (semi)definite polynomial matrices that can be viewed as sparsity-exploiting versions of the Hilbert–Artin, Reznick, Putinar, and Putinar–Vasilescu Positivstellensätze. First, we establish that a polynomial matrix P(x) with chordal sparsity is positive semidefinite for all $$x\in \mathbb {R}^n$$ x ∈ R n if and only if there exists a sum-of-squares (SOS) polynomial $$\sigma (x)$$ σ ( x ) such that $$\sigma P$$ σ P is a sum of sparse SOS matrices. Second, we show that setting $$\sigma (x)=(x_1^2 + \cdots + x_n^2)^\nu $$ σ ( x ) = ( x 1 2 + ⋯ + x n 2 ) ν for some integer $$\nu $$ ν suffices if P is homogeneous and positive definite globally. Third, we prove that if P is positive definite on a compact semialgebraic set $$\mathcal {K}=\{x:g_1(x)\ge 0,\ldots ,g_m(x)\ge 0\}$$ K = { x : g 1 ( x ) ≥ 0 , … , g m ( x ) ≥ 0 } satisfying the Archimedean condition, then $$P(x) = S_0(x) + g_1(x)S_1(x) + \cdots + g_m(x)S_m(x)$$ P ( x ) = S 0 ( x ) + g 1 ( x ) S 1 ( x ) + ⋯ + g m ( x ) S m ( x ) for matrices $$S_i(x)$$ S i ( x ) that are sums of sparse SOS matrices. Finally, if $$\mathcal {K}$$ K is not compact or does not satisfy the Archimedean condition, we obtain a similar decomposition for $$(x_1^2 + \cdots + x_n^2)^\nu P(x)$$ ( x 1 2 + ⋯ + x n 2 ) ν P ( x ) with some integer $$\nu \ge 0$$ ν ≥ 0 when P and $$g_1,\ldots ,g_m$$ g 1 , … , g m are homogeneous of even degree. Using these results, we find sparse SOS representation theorems for polynomials that are quadratic and correlatively sparse in a subset of variables, and we construct new convergent hierarchies of sparsity-exploiting SOS reformulations for convex optimization problems with large and sparse polynomial matrix inequalities. Numerical examples demonstrate that these hierarchies can have a significantly lower computational complexity than traditional ones.