International Journal of Engineering MathematicsVolume 2013 (2013), Article ID 291976, 7 pageshttp://dx.doi.org/10.1155/2013/291976

Research Article

Delay-Partitioning Approach to Stability of Linear Discrete-Time Systems with Interval-Like Time-Varying Delay

Priyanka Kokil, V. Krishna Rao Kandanvli, and Haranath Kar

Department of Electronics and Communication Engineering, Motilal Nehru National Institute of Technology Allahabad, Allahabad 211004, India

Received 19 March 2013; Accepted 26 May 2013

Academic Editor: J. A. Tenreiro Machado

Copyright © 2013 Priyanka Kokil 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.

Abstract.

This paper is concerned with the problem of global asymptotic stability of linear discrete-time systems with interval-like time-varying delay in the state. By utilizing the concept of delay partitioning, a new linear-matrix-inequality-(LMI-) based criterion for the global asymptotic stability of such systems is proposed. The proposed criterion does not involve any free weighting matrices but depends on both the size of delay and partition size. The developed approach is extended to address the problem of global asymptotic stability of state-delayed discrete-time systems with norm-bounded uncertainties. The proposed results are compared with several existing results.

1. Introduction

A source of instability for discrete-time systems is time delay which inevitably exists in various engineering systems. In many applications, time delays are unavoidable and must be taken into account in a realistic system design, for instance, chemical processes, echo cancellation, local loop equalization, multipath propagation in mobile communication, array signal processing, congestion analysis and control in high speed networks, neural networks, and long transmission line in pneumatic systems [1–6]. The stability analysis of time-delay systems has received considerable attention during the last two decades [3–7]. According to dependence of delay, the existing stability criteria are generally classified into two categories: delay-dependent criteria and delay-independent criteria. It is well known that delay-independent stability criteria are usually more conservative than the delay-dependent ones, especially if the size of time delay is small [6–10]. Therefore, much attention has been paid in recent years to the study of delay-dependent stability criteria.

A number of publications relating to the delay-dependent stability of continuous time-delay systems have appeared (see, e.g., [10–17] and the references cited therein). In contrast, less attention has been paid to studying the problem of stability of discrete time-delay systems. Several delay-dependent criteria for the stability of discrete-time systems have appeared [3, 6, 7, 18, 19]. Reference [7] (see [6] also) presents a novel delay-dependent linear-matrix-inequality-(LMI-) based condition for the global asymptotic stability of linear discrete-time systems with interval-like time-varying delay. The criteria proposed in [6, 7] are less conservative with smaller numerical complexity than [19–23]. The delay partitioning approach has been efficiently applied in [24–30] to the stability analysis of systems with time-varying delays. In the context of stability analysis of linear discrete systems with time-varying delay, the delay partitioning concept is first utilized in [30]. The approaches in [29, 30] divide the lower bound of the time-varying delay into a number of partitions. The criteria in [29, 30] are not only delay dependent but also dependent on the partitioning size. Though the approaches in [29, 30] provide less conservative stability results than [19, 20], these approaches would lead to heavier computational burden and more complicated synthesis procedure.

This paper studies the problem of stability analysis of linear discrete-time system with interval-like time-varying delay in the state. In this paper, inspired by the work of [6, 7, 30], an alternative to the approach presented in [29] for the stability analysis of linear discrete-time systems with interval-like time-varying delay in the state is brought out. The proposed method exploits the delay partitioning idea and does not introduce any free weighting matrices. The paper is organized as follows. Section 2 presents a description of the system under consideration. A novel LMI-based criterion for the global asymptotic stability of discrete-time state-delayed systems is proposed in Section 3. The proposed criterion depends on the size of delay as well as partition size. In Section 4, the approach is extended to derive global asymptotic stable conditions for delayed discrete-time systems with norm-bounded uncertainties. Finally, in Section 5, numerical examples are given to illustrate the effectiveness of the presented results.

2. System Description

The following notations are used throughout the paper:  Set of real matrices, : Set of real vectors, : Identity matrix of appropriate dimension; the order is specified in subscript as the need arises, : Null matrix or null vector of appropriate dimension; the orders are specified in subscripts as the need arises, : Transpose of the matrix (or vector) ,  is positive-definite symmetric matrix,  is negative-definite symmetric matrix.

The system under consideration is given by where is the system state vector, and are constant matrices with appropriate dimensions, is a positive integer representing interval-like time-varying delay satisfying where and are known positive integers representing the lower and upper delay bounds, respectively, and is an initial value at time k. Let the lower bound of the delay be divided into m number of partitions such that where is an integer representing partition size.

3. Proposed Criterion

In this section, inspired by the work of [6, 7, 30], an LMI-based criterion for the global asymptotic stability of system (1)–(4) is established.

The main result may be stated as follows.

Theorem 1. For given positive integers , , and , the system in (1)–(4) is asymptotically stable if there exist real matrices , , and such that where

Proof. Consider a Lyapunov function [29, 30] where Taking the forward difference of (15) along the solution of the system (1)-(2), we have Using Lemma 1 in [22], we obtain [6, 7] Note that Define It follows from (1) and (17) that Now, we have the following relation [6, 7]: Letting , one obtains [6] Applying Lemma 1 in [22] and using (23)-(24), we have [6, 7] Employing (18)–(22) and (25), we have the following inequality: Since , for all nonzero if (5) hold true. This completes the proof of Theorem 1.

Remark 2. To prove Theorem 1, a methodology similar to [6, 7] has been adopted.

Remark 3. It may be noted that the inequalities (5) are LMIs and can be effectively solved by using MATLAB LMI toolbox [31, 32].

Remark 4. For a given and , the allowable maximum value of for guaranteeing the global asymptotic stability of system (1)–(4) can be obtained by iteratively solving (5).

Remark 5. For , after some algebraic manipulations, it can be shown that Theorem 1 is equivalent to Theorem 1 in [7]. The parameters and (subject to (4)) in Theorem 1 represent some additional degrees of freedom, that is, in comparison with Theorem 1 in [7] which is free of these parameters.

Remark 6. A comparison of the number of the decision variables involved in several recent stability results is summarized in Table 1. It may be observed that the size of complexity in [6, 7, 18, 19, 23] is only related to state dimension , whereas the complexity of [29, Theorem 3.1], [30, Theorem 2], and Theorem 1 depends on both and .

Table 1: Comparison of the number of decision variables involved in various methods.

Methods
Number of the decision variables

Theorem   in [19]

Theorem in [19]

Theorem in [23]

Theorem in [18]

Proposition in [6]

Theorem in [7]

Theorem in [30]
(

Theorem in [29]

Theorem 1

The total number of scalar decision variables of Theorem 1 is , and the total row size of the LMIs is . The numerical complexity of Theorem 1 is proportional to [14]. The total number of scalar decision variables of Theorem 2 in [30] is , the total row size of the LMIs is , and the numerical complexity is proportional to . Therefore, Theorem 1 has much smaller numerical complexity than Theorem 2 in [30]. Since no free weighting matrix has been introduced in the presented method, Theorem 1 involves less number of decision variables as compared to Theorem 3.1 in [29] (see Table 1). Thus, in general, Theorem 1 is numerically less complex than Theorem 3.1 in [29].

Remark 7. Using similar steps as in the proof of Proposition 8 in [30], it is easy to establish that the conservatism of the stability result obtained via Theorem 1 is nonincreasing as the number of partitions increases.

4. Extensions to Uncertain State-Delayed Discrete-Time Systems

In this section, we extend the previously discussed approach to derive global asymptotic stable conditions for delayed discrete-time systems with norm-bounded uncertainties.

Consider the system given by The parameter uncertainties and are assumed to be norm-bounded and of the following form: where and are known constant matrices and is an unknown matrix which satisfies The parameter uncertainties and are said be admissible if both (28) and (29) are satisfied.

The following lemma is needed in the proof of our next result.

Lemma 8 (see [5, 25]). Let , and be the real matrices of appropriate dimensions with satisfying ; then for all , if and only if there exists a scalar such that

Theorem 9. For given scalars and , system described by (27)–(29) and (2)–(4) is globally asymptotically stable for all the admissible uncertainties, if there exist real matrices , , and   and a scalar such that the following LMIs hold: where and in (35) are given by (7)–(9).

Proof. Applying Theorem 1, the sufficient conditions for the global asymptotic stability of system described by (27)–(29) and (2)–(4) are obtained as follows: By Lemma 8 and Schur complement, it can be shown that (41) and (42) are equivalent to (32) and (33), respectively. This completes the proof of Theorem 9.

Remark 10. With, Theorem 9 reduces to an equivalent form of Theorem 4 in [7]. The parameters and (subject to (4)) in Theorem 9 may be treated as additional degrees of freedom, that is, in comparison with Theorem 4 in [7] which is free of such parameters.

5. Numerical Examples

To demonstrate the applicability of the presented results and compare them with previous results, we now consider the following examples.

Example 1 (see [6, 7, 19, 20, 29]). Consider the delayed discrete-time system (1) with the following parameters:

For given and , the admissible maximum value of guaranteeing the asymptotically stability of the delayed discrete-time system can be obtained by solving the LMIs (5). For a given , a comparison of the maximum values of calculated by different methods is summarized in Table 2, from which one can easily see that the stability conditions obtained in this paper are less conservative than those in [7, 19, 20].

Table 2: Comparison of the maximum values of for given .

Methods

Theorem in [20]
8
9
12
13
20

Theorem in [19]
13
14
15
16
22

Proposition in [6]
15
16
18
19
25

Theorem in [7]
15
16
18
19
25

Theorem 1
15
16
18
19
25

15
16
18
20
26

A comparison of [29, Table 2] and Table 2 reveals that Theorem 3.1 in [29] may provide a larger upper delay bound than Theorem 1. However, as discussed in Remark 6, Theorem 1 involves less number of decision variables as compared to Theorem 3.1 in [29].

Example 2 (see [7, 19]). Consider the following delayed discrete-time system with parameter uncertainty: where and . System (44) can be represented in the form of (27) with For given and , we wish to find such that the uncertain system (44) is asymptotically stable for any . Table 3 presents a comparison of the values of obtained by various methods. From Table 3, it is clear that Theorem 9 can provide less conservative results than [7, 19, 20]. In the situation where , the stability criteria in [7, 19, 20] are invalid whereas the value of obtained by Theorem 9 is 0.0837 for .

Table 3: Comparison of upper bound for given and .

Methods

Theorem in [20]
0.0830
Infeasible
Infeasible
Infeasible
Infeasible
Infeasible

Corollary in [19]
0.1901
0.1457
0.1313
0.0906
0.0655
Infeasible

Theorem in [7]
0.1920
0.1548
0.1425
0.1146
0.1023
Infeasible

Theorem 9
0.1927
0.1560
0.1476
0.1194
0.1080
0.0834 0.0837

6. Conclusion

In this paper, we have considered the problem of global asymptotic stability of linear discrete-time systems with interval-like time-varying delay in the state. By utilizing the concept of delay partitioning, an LMI-based criterion for the global asymptotic stability of such systems has been established. The proposed criterion depends on both the size of delay and partition size. With the help of numerical examples, it has been illustrated that the proposed stability condition may provide less conservative result than most of the existing results [6, 7, 19, 20] due to the delay partitioning, and it may become even less conservative when the partitioning goes finer. Since no free weighting matrix has been introduced in the presented method, Theorem 1 involves less number of decision variables as compared to Theorem 3.1 in [29]. However, a comparison of [29, Table 2] and Table 2 reveals that Theorem 3.1 in [29] may provide a larger upper delay bound than Theorem 1. The proposed criterion is numerically less complex than [30]. The method has been extended to deal with the problem of global asymptotic stability of state-delayed discrete-time systems with norm-bounded uncertainties.

References

J. K. Hale, Theory of Functional Differential Equations, Springer, New York, NY, USA, 1977.

J. Richard, “Time-delay systems: an overview of some recent advances and open problems,” Automatica, vol. 39, no. 10, pp. 1667–1694, 2003.

H. Shao, “New delay-dependent stability criteria for systems with interval delay,” Automatica, vol. 45, no. 3, pp. 744–749, 2009.

V. K. R. Kandanvli and H. Kar, “Robust stability of discrete-time state-delayed systems employing generalized overflow nonlinearities,” Nonlinear Analysis: Theory, Methods and Applications, vol. 69, no. 9, pp. 2780–2787, 2008.

K. F. Chen and I. K. Fong, “Stability analysis and output-feedback stabilisation of discrete-time systems with an interval time-varying state delay,” IET Control Theory and Applications, vol. 4, no. 4, pp. 563–572, 2010.

H. Shao and Q. Han, “New stability criteria for linear discrete-time systems with interval-like time-varying delays,” IEEE Transactions on Automatic Control, vol. 56, no. 3, pp. 619–625, 2011.

H. Huang and G. Feng, “Improved approach to delay-dependent stability analysis of discrete-time systems with time-varying delay,” IET Control Theory and Applications, vol. 4, no. 10, pp. 2152–2159, 2010.

M. S. Mahmoud, F. M. Al-Sunni, and Y. Shi, “Switched discrete-time delay systems: delay-dependent analysis and synthesis,” Circuits, Systems, and Signal Processing, vol. 28, no. 5, pp. 735–761, 2009.

M. S. Mahmoud and Y. Xia, “Robust stability and stabilization of a class of nonlinear switched discrete-time systems with time-varying delays,” Journal of Optimization Theory and Applications, vol. 143, no. 2, pp. 329–355, 2009.

S. Xu and J. Lam, “On equivalence and efficiency of certain stability criteria for time-delay systems,” IEEE Transactions on Automatic Control, vol. 52, no. 1, pp. 95–101, 2007.

E. Fridman and U. Shaked, “A descriptor system approach to control of linear time-delay systems,” IEEE Transactions on Automatic Control, vol. 47, no. 2, pp. 253–270, 2002.

Q. Han, “On stability of linear neutral systems with mixed time delays: a discretized Lyapunov functional approach,” Automatica, vol. 41, no. 7, pp. 1209–1218, 2005.

Q. Han, “A discrete delay decomposition approach to stability of linear retarded and neutral systems,” Automatica, vol. 45, no. 2, pp. 517–524, 2009.

Q. Han, “Improved stability criteria and controller design for linear neutral systems,” Automatica, vol. 45, no. 8, pp. 1948–1952, 2009.

Q. Han and K. Gu, “Stability of linear systems with time-varying delay: a generalized discretized lyapunov functional approach,” Asian Journal of Control, vol. 3, no. 3, pp. 170–180, 2001.

X. Jiang and Q. Han, “On control for linear systems with interval time-varying delay,” Automatica, vol. 41, no. 12, pp. 2099–2106, 2005.

M. Wu, Y. He, J. She, and G. Liu, “Delay-dependent criteria for robust stability of time-varying delay systems,” Automatica, vol. 40, no. 8, pp. 1435–1439, 2004.

Y. He, M. Wu, G. Liu, and J. She, “Output feedback stabilization for a discrete-time system with a time-varying delay,” IEEE Transactions on Automatic Control, vol. 53, no. 10, pp. 2372–2377, 2008.

H. Gao and T. Chen, “New results on stability of discrete-time systems with time-varying state delay,” IEEE Transactions on Automatic Control, vol. 52, no. 2, pp. 328–334, 2007.

H. Gao, J. Lam, C. Wang, and Y. Wang, “Delay-dependent output-feedback stabilisation of discrete-time systems with time varying state delay,” IEE Proceedings—Control Theory and Applications, vol. 151, no. 6, pp. 691–698, 2004.

E. Fridman and U. Shaked, “Stability and guaranteed cost control of uncertain discrete delay systems,” International Journal of Control, vol. 78, no. 4, pp. 235–246, 2005.

X. Jiang, Q. Han, and X. Yu, “Stability criteria for linear discrete-time systems with interval-like time-varying delay,” in Proceedings of the American Control Conference (ACC '05), pp. 2817–2822, Portland, Ore, USA, June 2005.

B. Zhang, S. Xu, and Y. Zou, “Improved stability criterion and its applications in delayed controller design for discrete-time systems,” Automatica, vol. 44, no. 11, pp. 2963–2967, 2008.

H. Huang and G. Feng, “State estimation of recurrent neural networks with time-varying delay: a novel delay partition approach,” Neurocomputing, vol. 74, no. 5, pp. 792–796, 2011.

B. Du, J. Lam, Z. Shu, and Z. Wang, “A delay-partitioning projection approach to stability analysis of continuous systems with multiple delay components,” IET Control Theory and Applications, vol. 3, no. 4, pp. 383–390, 2009.

Y. Zhao, H. Gao, J. Lam, and B. Du, “Stability and stabilization of delayed T-S fuzzy systems: a delay partitioning approach,” IEEE Transactions on Fuzzy Systems, vol. 17, no. 4, pp. 750–762, 2009.

J. Liu, B. Yao, and Z. Gu, “Delay-dependent filtering for Markovian jump time-delay systems: a piecewise analysis method,” Circuits, Systems, and Signal Processing, vol. 30, no. 6, pp. 1253–1273, 2011.

L. Wu, J. Lam, X. Yao, and J. Xiong, “Robust guaranteed cost control of discrete-time networked control systems,” Optimal Control Applications and Methods, vol. 32, no. 1, pp. 95–112, 2011.

P. Kokil, H. Kar, and V. K. R. Kandanvli, “Stability analysis of linear discrete-time systems with interval delay: a delay-partitioning approach,” ISRN Applied Mathematics, vol. 2011, Article ID 624127, 10 pages, 2011.

X. Meng, J. Lam, B. Du, and H. Gao, “A delay-partitioning approach to the stability analysis of discrete-time systems,” Automatica, vol. 46, no. 3, pp. 610–614, 2010.

S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, Pa, USA, 1994.

P. Gahinet, A. Nemirovski, A. J. Laub, and M. Chilali, LMI Control Toolbox for Use with Matlab, MATH Works, Natick, Mass, USA, 1995.