- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents
Abstract and Applied Analysis
Volume 2013 (2013), Article ID 870486, 8 pages
An LMI Approach for Dynamics of Switched Cellular Neural Networks with Mixed Delays
1College of Mathematics and Computing Science, Changsha University of Science and Technology, Changsha, Hunan 410114, China
2School of Business, Central South University, Changsha, Hunan 410083, China
Received 3 January 2013; Revised 1 March 2013; Accepted 1 March 2013
Academic Editor: Jinde Cao
Copyright © 2013 Chuangxia Huang 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.
This paper considers the dynamics of switched cellular neural networks (CNNs) with mixed delays. With the help of the Lyapnnov function combined with the average dwell time method and linear matrix inequalities (LMIs) technique, some novel sufficient conditions on the issue of the uniformly ultimate boundedness, the existence of an attractor, and the globally exponential stability for CNN are given. The provided conditions are expressed in terms of LMI, which can be easily checked by the effective LMI toolbox in Matlab in practice.
Cellular neural networks (CNNs) introduced by Chua and Yang in [1, 2] have attracted increasing interest due to the potential applications in classification, signal processing, associative memory, parallel computation, and optimization problems. In these applications, it is essential to investigate the dynamical behavior [3–5]. Both in biological and artificial neural networks, the interactions between neurons are generally asynchronous. As a result, time delay is inevitably encountered in neural networks, which may lead to an oscillation and furthermore to instability of networks. Since Roska et al. [6, 7] first introduced the delayed cellular neural networks (DCNNs), DCNN has been extensively investigated [8–10]. The model can be described by the following differential equation: where , corresponds to the number of units in a neural network; denotes the potential (or voltage) of cell at time ; denotes a nonlinear output function; denotes the th component of an external input source introduced from outside the network to the cell at time ; denotes the rate with which the cell resets its potential to the resting state when isolated from other cells and external inputs; denotes the strength of the th unit on the th unit at time ; denotes the strength of the th unit on the th unit at time ; corresponds to the time delay required in processing and transmitting a signal from the th cell to the th cell at time .
Although the use of constant fixed delays in models of delayed feedback provides of a good approximation in simple circuits consisting a small number of cells, recently, it has been well recognized that neural networks usually have a spatial extent due to the presence of a multitude of parallel pathways with a variety of axon sizes and lengths. Therefore, there will be a distribution of conduction velocities along these pathways and a distribution of propagation delays. As the fact that delays in artificial neural networks are usually time varying and sometimes vary violently with time, system (1) can be generalized as follow: where, , , , , , , , , .
On the other hand, neural networks are complex and large-scale nonlinear dynamics; during hardware implementation, the connection topology of networks may change very quickly and link failures or new creation in networks often bring about switching connection topology [11, 12]. To obtain a deep and clear understanding of the dynamics of this complex system, one of the usual ways is to investigate the switched neural network. As a special class of hybrid systems, switched neural network systems are composed of a family of continuous-time or discrete-time subsystems and a rule that orchestrates the switching between the subsystems . A switched DCNN can be characterized by the following differential equation: where is the switching signal, which is a piecewise constant function of time.
Corresponding to the switching signal , we have the switching sequence , which means that the th subsystem is activated when .
Over the past decades, the stability of the unique equilibrium point for switched neural networks has been intensively investigated. There are three basic problems in dealing with the stability of switched systems: (1) find conditions that guarantee that the switched system (3) is asymptotically stable for any switching signal; (2) identify those classes of switching signals for which the switched system (3) is asymptotically stable; (3) construct a switching signal that makes the switched system (3) asymptotically stable . Recently, some novel results on the stability of switched systems have been reported; see for examples [14–22] and references therein.
Just as pointed out in , when the activation functions are typically assumed to be continuous, bounded, differentiable, and monotonically increasing, such as the functions of sigmoid type, the existence of an equilibrium point can be guaranteed. However, in some special applications, one is required to use unbounded activation functions. For example, when neural networks are designed for solving optimization problems in the presence of constraints (linear, quadratic, or more general programming problems), unbounded activations modeled by diode-like exponential-type functions are needed to impose constraints satisfaction. Different from the bounded case where the existence of an equilibrium point is always guaranteed, for unbounded activations it may happen that there is no equilibrium point. In this case, it is difficult to deal with the issue of the stability of the equilibrium point for switched neural networks.
In fact, studies on neural dynamical systems involve not only the discussion of stability property but also other dynamics behaviors such as the ultimate boundedness and attractor [24, 25]. To the best of our knowledge, so far there are no published results on the ultimate boundedness and attractor for the switched system (3).
Motivated by the above discussions, in the following, the objective of this paper is to establish a set of sufficient criteria on the attractor and ultimate boundedness for the switched system. The rest of this paper is organized as follows. Section 2 presents model formulation and some preliminary works. In Section 3, ultimate boundedness and attractor for the considered model are studied. In Section 4, a numerical example is given to show the effectiveness of our results. Finally, in Section 5, conclusions are given.
2. Problem Formulation
For the sake of convenience, throughout this paper, two of the standing assumptions are formulated below: Assume the functions and are bounded: where are scalars.Assume there exist constants and , , such that
Remark 1. We shall point out that the constants and can be positive, negative, or zero, and the boundedness on is no longer needed in this paper. Therefore, the activation function may be unbounded, which is also more general than the form . Different from the bounded case where the existence of an equilibrium point is always guaranteed, under the condition , in the switched system (3) it may happen that there is no equilibrium point. Thus it is of great interest to investigate the ultimate boundedness solutions and the existence of an attractor by replacing the usual stability property for system (3).
Without loss of generality, let denote the Banach space of continuous mapping from to equipped with the supremum norm . Throughout this paper, we give some notations: denotes the transpose of any square matrix , denotes a positive (negative) definite matrix , the symbol “*” within the matrix represents the symmetric term of the matrix, represents the minimum eigenvalue of matrix , and represents the maximum eigenvalue of matrix .
System (3) is supplemented with initial values of the type Now, we briefly summarize some needed definitions and lemmas as below.
Definition 3. The nonempty closed set is called an attractor for the solution of system (3) if the following formula holds: where .
Definition 4 (see ). For any switching signal and any finite constants , satisfying , denote the number of discontinuity of a switching signal over the time interval by . If holds for , , then is called the average dwell time.
3. Main Results
Theorem 5. Assume there is a constant , such that , and denote as For a given constant , if there exist positive-definite matrixes , , , such that the following condition holds: where and then system (2) is uniformly ultimately bounded.
Proof. Choose the following Lyapunov functional:
Computing the derivative of along the trajectory of system (2), one can get
Similarly, computing the derivative of along the trajectory of system (2), one can get
From assumption , we have
Then we have Denote ; combing with (11)–(16), we have and then we have where .
Therefore, we obtain where , which implies
If one chooses , then for any constant and , there is , such that for all . According to Definition 2, we have for all . That is to say, system (2) is uniformly ultimately bounded. This completes the proof.
Proof. If one chooses , Theorem 5 shows that for any there is , such that for all . Let be denoted by . Clearly, is closed, bounded, and invariant. Furthermore, . Therefore, is an attractor for the solutions of system (2). This completes the proof.
Corollary 7. In addition to all of the conditions of Theorem 5 holding, if and for all , then system (2) has a trivial solution , and the trivial solution of system (2) is globally exponentially stable.
Proof. If and for all , then , and it is obvious that system (2) has a trivial solution . From Theorem 5, one has where . Therefore, the trivial solution of system (2) is globally exponentially stable. This completes the proof.
We now consider the switched cellular neural networks without uncertainties as system (3). When , the th subsystem is activated; from (22) and Theorem 5, there is a positive constant , such that where .
Theorem 8. For a given constant , if there exist positive-definite matrixes , , , such that the following condition holds: where Then system (3) is uniformly ultimately bounded for any switched signal with average dwell time satisfying where .
Proof . Define the Lyapunov functional candidate
Since the system state is continuous, it follows from (23) that
If one chooses , then for any constant and , there is , such that for all . According to Definition 2, we have for all . That is to say, system (3) is uniformly ultimately bounded, and the proof is completed.
Proof. If one chooses , Theorem 8 shows that for any there is , such that for all . Let be denoted by . Clearly, is closed, bounded, and invariant. Furthermore, . Therefore, is an attractor for the solutions of system (3). This completes the proof.
Corollary 10. In addition to all of the conditions of Theorem 8 holding, if and for all , then system (2) has a trivial solution , and the trivial solution of system (3) is globally exponentially stable.
Proof. If and for all , then it is obvious that system (3) has a trivial solution . From Theorem 8, one has where Therefore, the trivial solution of system (3) is globally exponentially stable. This completes the proof.
Remark 11. Up to now, various dynamical results have been proposed for switched neural networks in the literature. For example, in , synchronization control of switched linearly coupled delayed neural networks is investigated; in [16–20], the authors investigated the stability of switched neural networks; in [21, 22], stability and L2-gain analysis for switched delay system have been investigated. To the best of our knowledge, there are few works about the uniformly ultimate boundedness and the existence of an attractor for switched neural networks. Therefore, results of this paper are new.
Remark 12. We notice that Lian and Zhang developed an LMI approach to study the stability of switched Cohen-Grossberg neural networks and obtained some novel results in a very recent paper , where the considered model includes both discrete and bounded distributed delays. In , the following fundamental assumptions are required: (i) the delay functions are bounded, and , ; (ii) , , for all ; (iii) the switched system has only one equilibrium point. However, as a defect appearing in , just checking the inequality in , it is easy to see that the assumed condition on is not correct, which should be revised as . On the other hand, just as described by Remark 1 in this paper, for a neural network with unbounded activation functions, the considered system in  may have no equilibrium point or have multiple equilibrium points. In this case, it is difficult to deal with the issue of the stability of equilibrium point for switched neural networks. In order to modify this imperfection, after relaxing the conditions , , and , replacing (i), (ii), and (iii) with assumptions and , we drop out the assumption of the existence of a unique equilibrium point and investigate the issue of the ultimate boundedness and attractor; this modification seems more natural and reasonable.
Remark 13. When investigating the stability, although the adopted Lyapunov function in this paper is similar to those used in ; just from Corollaries 7 and 10, the conservatism of the conditions of the delay function in this paper has been further reduced. Hence, the obtained results on stability in this paper are complementary to the corresponding results in .
Remark 14. When the uncertainties appear in the system (3), employing the Lyapunov function as (27) in this paper and applying a similar method to the one used in , we can get the corresponding dynamical results. Due to the limitation of space, we choose not to give the straightforward but the tedious computations here for the formulas that determine the uniformly ultimate boundedness, the existence of an attractor, and stability.
4. Illustrative Example
In this section, we present an example to illustrate the effectiveness of the proposed results. Consider the switched cellular neural networks with two subsystems.
Example 15. Consider the switched cellular neural networks system (3) with , , , , and the connection weight matrices where
From assumptions and , we can obtain , , , , , , .
Choosing and solving LMIs (23), we get Using (26), we can get the average dwell time .
In this paper, the dynamics of switched cellular neural networks with mixed delays (interval time-varying delays and distributed-time varying delays) are investigated. Novel multiple Lyapunov-Krasovkii functional methods are designed to establish new sufficient conditions guaranteeing the uniformly ultimate boundedness, the existence of an attractor, and the globally exponential stability. The derived conditions are expressed in terms of LMIs, which are more relaxed than algebraic formulation and can be easily checked by the effective LMI toolbox in Matlab in practice.
The authors are extremely grateful to Professor Jinde Cao and the anonymous reviewers for their constructive and valuable comments, which have contributed much to the improvement of this paper. This work was jointly supported by the National Natural Science Foundation of China under Grants nos. 11101053, 70921001, and 71171024, the Key Project of Chinese Ministry of Education under Grant no. 211118, and the Excellent Youth Foundation of Educational Committee of Hunan Provincial no. 10B002, the Scientific Research Funds of Hunan Provincial Science and Technology Department of China.
- L. O. Chua and L. Yang, “Cellular neural networks: theory,” IEEE Transactions on Circuits and Systems, vol. 35, no. 10, pp. 1257–1272, 1988.
- L. O. Chua and L. Yang, “Cellular neural networks: applications,” IEEE Transactions on Circuits and Systems, vol. 35, no. 10, pp. 1273–1290, 1988.
- T. Chen, “Global exponential stability of delayed Hopfield neural networks,” Neural Networks, vol. 14, no. 8, pp. 977–980, 2001.
- K. Lu, D. Xu, and Z. Yang, “Global attraction and stability for Cohen-Grossberg neural networks with delays,” Neural Networks, vol. 19, no. 10, pp. 1538–1549, 2006.
- J. Cao and L. Li, “Cluster synchronization in an array of hybrid coupled neural networks with delay,” Neural Networks, vol. 22, no. 4, pp. 335–342, 2009.
- T. Roska, T. Boros, P. Thiran, and L. Chua, “Detecting simple motion using cellular neural networks,” in Proceedings of the International Workshop Cellular neural networks Application, pp. 127–138, 1990.
- T. Roska and L. O. Chua, “Cellular neural networks with non-linear and delay-type template elements and non-uniform grids,” International Journal of Circuit Theory and Applications, vol. 20, no. 5, pp. 469–481, 1992.
- J. Cao, “A set of stability criteria for delayed cellular neural networks,” IEEE Transactions on Circuits and Systems. I., vol. 48, no. 4, pp. 494–498, 2001.
- J. Cao, G. Feng, and Y. Wang, “Multistability and multiperiodicity of delayed Cohen-Grossberg neural networks with a general class of activation functions,” Physica D, vol. 237, no. 13, pp. 1734–1749, 2008.
- H. Jiang and Z. Teng, “Global eponential stability of cellular neural networks with time-varying coefficients and delays,” Neural Networks, vol. 17, no. 10, pp. 1415–1425, 2004.
- J. Zhao, D. J. Hill, and T. Liu, “Synchronization of complex dynamical networks with switching topology: a switched system point of view,” Automatica, vol. 45, no. 11, pp. 2502–2511, 2009.
- J. Lu, D. W. C. Ho, and L. Wu, “Exponential stabilization of switched stochastic dynamical networks,” Nonlinearity, vol. 22, no. 4, pp. 889–911, 2009.
- H. Huang, Y. Qu, and H. X. Li, “Robust stability analysis of switched Hopfield neural networks with time-varying delay under uncertainty,” Physics Letters A, vol. 345, no. 4–6, pp. 345–354, 2005.
- D. Liberzon and A. S. Morse, “Basic problems in stability and design of switched systems,” IEEE Control Systems Magazine, vol. 19, no. 5, pp. 59–70, 1999.
- W. Yu, J. Cao, and W. Lu, “Synchronization control of switched linearly coupled neural networks with delay,” Neurocomputing, vol. 73, no. 4–6, pp. 858–866, 2010.
- W.-A. Zhang and L. Yu, “Stability analysis for discrete-time switched time-delay systems,” Automatica, vol. 45, no. 10, pp. 2265–2271, 2009.
- H. Huang, Y. Qu, and H. Li, “Robust stability analysis of switched hop?eld neural networks with time-varying delay under uncertainty,” Physics Letters A, vol. 345, pp. 345–354, 2005.
- P. Li and J. Cao, “Global stability in switched recurrent neural networks with time-varying delay via nonlinear measure,” Nonlinear Dynamics, vol. 49, no. 1-2, pp. 295–305, 2007.
- X. Lou and B. Cui, “Delay-dependent criteria for global robust periodicity of uncertain switched recurrent neural networks with time-varying delay,” IEEE Transactions on Neural Networks, vol. 19, no. 4, pp. 549–557, 2008.
- J. Lian and K. Zhang, “Exponential stability for switched Cohen-Grossberg neural networks with average dwell time,” Nonlinear Dynamics, vol. 63, no. 3, pp. 331–343, 2011.
- D. Xie, Q. Wang, and Y. Wu, “Average dwell-time approach to gain control synthesis of switched linear systems with time delay in detection of switching signal,” IET Control Theory & Applications, vol. 3, no. 6, pp. 763–771, 2009.
- X.-M. Sun, J. Zhao, and D. J. Hill, “Stability and -gain analysis for switched delay systems: a delay-dependent method,” Automatica, vol. 42, no. 10, pp. 1769–1774, 2006.
- C. Huang and J. Cao, “Convergence dynamics of stochastic Cohen-Grossberg neural networks with unbounded distributed delays,” IEEE Transactions on Neural Networks, vol. 22, no. 4, pp. 561–572, 2011.
- J. Cao and J. Liang, “Boundedness and stability for Cohen-Grossberg neural network with time-varying delays,” Journal of Mathematical Analysis and Applications, vol. 296, no. 2, pp. 665–685, 2004.
- H. Zhang, Z. Yi, and L. Zhang, “Continuous attractors of a class of recurrent neural networks,” Computers & Mathematics with Applications, vol. 56, no. 12, pp. 3130–3137, 2008.
- J. P. Hespanha and A. S. Morse, “Stability of switched systems with average dwell-time,” in Proceedings of the 38th IEEE Conference on Decision and Control (CDC '99), pp. 2655–2660, December 1999.