32,362 research outputs found
Robust Stability of a Class of Uncertain Lur'e Systems of Neutral Type
This paper deals with the problem of stability for a class of Lurāe systems with interval time-varying delay and sector-bounded nonlinearity. The interval time-varying delay function is not assumed to be differentiable. We analyze the global exponential stability for uncertain neutral and Lurāe dynamical systems with some sector conditions. By constructing a set of improved Lyapunov-Krasovskii functional combined with Leibniz-Newtonās formula, we establish some stability criteria in terms of linear matrix inequalities. Numerical examples are given to illustrate the effectiveness of the results
Delay-dependent stabilization of stochastic interval delay systems with nonlinear disturbances
This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Elsevier Ltd.In this paper, a delay-dependent approach is developed to deal with the robust stabilization problem for a class of stochastic time-delay interval systems with nonlinear disturbances. The system matrices are assumed to be uncertain within given intervals, the time delays appear in both the system states and the nonlinear disturbances, and the stochastic perturbation is in the form of a Brownian motion. The purpose of the addressed stochastic stabilization problem is to design a memoryless state feedback controller such that, for all admissible interval uncertainties and nonlinear disturbances, the closed-loop system is asymptotically stable in the mean square, where the stability criteria are dependent on the length of the time delay and therefore less conservative. By using ItƓ's differential formula and the Lyapunov stability theory, sufficient conditions are first derived for ensuring the stability of the stochastic interval delay systems. Then, the controller gain is characterized in terms of the solution to a delay-dependent linear matrix inequality (LMI), which can be easily solved by using available software packages. A numerical example is exploited to demonstrate the effectiveness of the proposed design procedure.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Nuffield Foundation of the UK under Grant NAL/00630/G, and the Alexander von Humboldt Foundation of Germany
New summation inequalities and their applications to discrete-time delay systems
This paper provides new summation inequalities in both single and double
forms to be used in stability analysis of discrete-time systems with
time-varying delays. The potential capability of the newly derived inequalities
is demonstrated by establishing less conservative stability conditions for a
class of linear discrete-time systems with an interval time-varying delay in
the framework of linear matrix inequalities. The effectiveness and least
conservativeness of the derived stability conditions are shown by academic and
practical examples.Comment: 15 pages, 01 figur
Dissipative Stabilization of Linear Systems with Time-Varying General Distributed Delays (Complete Version)
New methods are developed for the stabilization of a linear system with
general time-varying distributed delays existing at the system's states, inputs
and outputs. In contrast to most existing literature where the function of
time-varying delay is continuous and bounded, we assume it to be bounded and
measurable. Furthermore, the distributed delay kernels can be any
square-integrable function over a bounded interval, where the kernels are
handled directly by using a decomposition scenario without using
approximations. By constructing a Krasovski\u{i} functional via the application
of a novel integral inequality, sufficient conditions for the existence of a
dissipative state feedback controller are derived in terms of matrix
inequalities without utilizing the existing reciprocally convex combination
lemmas. The proposed synthesis (stability) conditions, which take dissipativity
into account, can be either solved directly by a standard numerical solver of
semidefinite programming if they are convex, or reshaped into linear matrix
inequalities, or solved via a proposed iterative algorithm. To the best of our
knowledge, no existing methods can handle the synthesis problem investigated in
this paper. Finally, numerical examples are presented to demonstrate the
effectiveness of the proposed methodologies.Comment: Accepted by Automatic
Robust synchronization of an array of coupled stochastic discrete-time delayed neural networks
Copyright [2008] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.This paper is concerned with the robust synchronization problem for an array of coupled stochastic discrete-time neural networks with time-varying delay. The individual neural network is subject to parameter uncertainty, stochastic disturbance, and time-varying delay, where the norm-bounded parameter uncertainties exist in both the state and weight matrices, the stochastic disturbance is in the form of a scalar Wiener process, and the time delay enters into the activation function. For the array of coupled neural networks, the constant coupling and delayed coupling are simultaneously considered. We aim to establish easy-to-verify conditions under which the addressed neural networks are synchronized. By using the Kronecker product as an effective tool, a linear matrix inequality (LMI) approach is developed to derive several sufficient criteria ensuring the coupled delayed neural networks to be globally, robustly, exponentially synchronized in the mean square. The LMI-based conditions obtained are dependent not only on the lower bound but also on the upper bound of the time-varying delay, and can be solved efficiently via the Matlab LMI Toolbox. Two numerical examples are given to demonstrate the usefulness of the proposed synchronization scheme
Time-and event-driven communication process for networked control systems: A survey
Copyright Ā© 2014 Lei Zou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In recent years, theoretical and practical research topics on networked control systems (NCSs) have gained an increasing interest from many researchers in a variety of disciplines owing to the extensive applications of NCSs in practice. In particular, an urgent need has arisen to understand the effects of communication processes on system performances. Sampling and protocol are two fundamental aspects of a communication process which have attracted a great deal of research attention. Most research focus has been on the analysis and control of dynamical behaviors under certain sampling procedures and communication protocols. In this paper, we aim to survey some recent advances on the analysis and synthesis issues of NCSs with different sampling procedures (time-and event-driven sampling) and protocols (static and dynamic protocols). First, these sampling procedures and protocols are introduced in detail according to their engineering backgrounds as well as dynamic natures. Then, the developments of the stabilization, control, and filtering problems are systematically reviewed and discussed in great detail. Finally, we conclude the paper by outlining future research challenges for analysis and synthesis problems of NCSs with different communication processes.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany
Discrete-time recurrent neural networks with time-varying delays: Exponential stability analysis
This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Elsevier LtdThis Letter is concerned with the analysis problem of exponential stability for a class of discrete-time recurrent neural networks (DRNNs) with time delays. The delay is of the time-varying nature, and the activation functions are assumed to be neither differentiable nor strict monotonic. Furthermore, the description of the activation functions is more general than the recently commonly used Lipschitz conditions. Under such mild conditions, we first prove the existence of the equilibrium point. Then, by employing a LyapunovāKrasovskii functional, a unified linear matrix inequality (LMI) approach is developed to establish sufficient conditions for the DRNNs to be globally exponentially stable. It is shown that the delayed DRNNs are globally exponentially stable if a certain LMI is solvable, where the feasibility of such an LMI can be easily checked by using the numerically efficient Matlab LMI Toolbox. A simulation example is presented to show the usefulness of the derived LMI-based stability condition.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grant GR/S27658/01, the Nuffield Foundation of the UK under Grant NAL/00630/G, the Alexander von Humboldt Foundation of Germany, the Natural Science Foundation of Jiangsu Education Committee of China (05KJB110154), the NSF of Jiangsu Province of China (BK2006064), and the National Natural Science Foundation of China (10471119)
Recommended from our members
A delay-dependent LMI approach to dynamics analysis of discrete-time recurrent neural networks with time-varying delays
This is the post print version of the article. The official published version can be obtained from the link below - Copyright 2007 Elsevier Ltd.In this Letter, the analysis problem for the existence and stability of periodic solutions is investigated for a class of general discrete-time recurrent neural networks with time-varying delays. For the neural networks under study, a generalized activation function is considered, and the traditional assumptions on the boundedness, monotony and differentiability of the activation functions are removed. By employing the latest free-weighting matrix method, an appropriate LyapunovāKrasovskii functional is constructed and several sufficient conditions are established to ensure the existence, uniqueness, and globally exponential stability of the periodic solution for the addressed neural network. The conditions are dependent on both the lower bound and upper bound of the time-varying time delays. Furthermore, the conditions are expressed in terms of the linear matrix inequalities (LMIs), which can be checked numerically using the effective LMI toolbox in MATLAB. Two simulation examples are given to show the effectiveness and less conservatism of the proposed criteria.This work was supported in part by the National Natural Science Foundation of China under Grant 50608072, an International Joint Project sponsored by the Royal Society of the UK and the National Natural Science Foundation of China, and the Alexander von Humboldt Foundation of Germany
- ā¦