Optimal Finite-Time State Estimation for Discrete-Time Switched Systems under Switching Frequency Constraint
The state estimation problem for a class of switched linear systems which only switches in some short interval is addressed. Besides the asymptotic stability of error dynamics, the boundness of error state is a significant issue for short-time switched systems. By introducing the concept of finite-time stability, the state estimation procedure is formulated to determine appropriate observer gains ensuring the error dynamics is finite-time stable in the short-time switching intervals of interest. Optimal finite-time observers are designed through iterative algorithms to minimize the bound of error state, in the cases with and without disturbances. Particularly, when the total activation time is known, a less conservative result can be derived and an optimization problem can be solved with the help of the genetic algorithm. A numerical example is provided to illustrate the theoretical findings in this paper.
Switched systems, as typical hybrid dynamical system that is composed of a family of subsystems described by differential or difference equations and a switching rule orchestrating the switching between the subsystems, have attracted much attention in control theory and practice during recent decades. Switched systems can be efficiently used to model many practical systems which are inherently multimodel, in the sense that several dynamical systems are required to describe their behaviours. For example, many physical processes exhibit switched and hybrid nature [1–3], and switched systems arise in many engineering applications [4–8]. Generally, the stability and stabilization problems are the main concerns in the field of switched systems [9–13]. For more details of the recent results of the basic problems in stability and stabilization for switched systems, the reader is referred to the survey paper  and the references cited therein.
On the other hand, the issue of state estimation has been investigated intensively in continuous and discrete domain. After Luenberger proposed a method to design an observer for linear time invariant system in 1960s , numerous results on Luenberger-like observer design were developed. Recently, there are some results about observer design for switched systems and most of them are about switched linear systems. In [16, 17] a common quadratic Lyapunov function which guarantees the error system stability was used to design observer for switched continuous-time and discrete-time linear systems and observer design for a class of switched nonlinear systems was investigated in . Pettersson proposed an approach using multiple Lyapunov functions to design an observer for switched linear systems . Full and reduced order observers for a class of linear switched control systems are studied in .
It is worth mentioning that most results about state estimation for switched systems only focus on asymptotic observer which is defined on the infinite time interval; few results concerned with the error dynamics performance in a finite-time interval have been reported, which is also interesting and important in both theory and actual applications. The boundness of state during a fixed interval has been studied extensively based on the notion called finite-time stability [21–23], and it has been extended to analyze state boundness of switched system recently [24–26]. But the boundness of error state in the state estimation problem has not been fully studied. It is well known that frequent switching between stable subsystems can lead to instability due to the obvious reason that the overshoot caused by the transient of subsystem response may destroy the stability . The boundness of state during a fixed interval, which almost relies on the transient response, is naturally supposed to be significantly affected by switching among several subsystems. Therefore, based on the notion of switching frequency, which describes how frequently the switching occurs in a time interval, the optimal finite-time observer design problem is considered.
The main contribution in this paper lies in the optimal finite-time observer design. At first, without considering disturbance, the optimal finite-time observer is designed to minimize the bound of error state by an LMI based iterative algorithm; then, while the performance is taken into account, an optimal observer is constructed to minimize error state bound in regard to an performance. In both cases, the results are relevant to the switching frequency. Furthermore, if more information about switching signal is known, that is, the total activation time of each subsystem is available, a less conservative result can be achieved, and genetic algorithm is introduced in observer design procedure.
The rest of this paper is organized as follows. In Section 2 the problem formulation and some preliminaries are introduced; the main results on optimal observer design are proposed in Section 3. Some further discussion on improved results is given in Section 4. A numerical is provided in Section 5. Conclusions are given in Section 6.
2. Preliminaries and Problem Formulation
In this paper, a switched discrete-time system is considered as follows:where is the discrete-time state, , , and are the input vector, disturbance, and measured output. is a piecewise constant function of time, called switching law or switching signal, which takes value in a finite index set . is the number of subsystems. , , , , , and are constant matrices with appropriate dimensions.
To describe the short-time switching property considered in this paper, we introduce the time interval sequence denoted by , where represents the so-called short-time switching interval in which switching occurs and denotes the relatively long interval in which the system is maintained in a fixed mode . Since the system exhibits the short-time switching property, the following assumption is proposed:
Assumption 1. Consider the time interval sequence ; it is assumed that , the following two conditions are satisfied: ; and .
Remark 2. These two assumptions are necessary for time interval sequence to describe the short-time switching property. The first condition in Assumption 1 implies that the switching occurs in some short-time interval and in most of the other time no switching exists. Furthermore, since , it indicates that the relatively long intervals are sufficiently long so that the stability is explicitly dependent on the stability property of subsystem activated in relatively long interval . Then, the second condition makes sure the sequence is well-posed defined in ; that is, and , .
In the interval , the switching sequence can be defined as , where denotes the initial instant of , denotes the mth switching instant in , and stands for the last instant in , respectively. Explicitly, the length of interval can be figured out as .
Definition 3. For each switching signal and short-time interval , the switching frequency is defined by .
Assumption 4. The switching between system and observer is synchronous; that is, the activated subsystem is explicitly known at each switching instant and the designed corresponding observer can be activated immediately.
In this paper, we focus on the state estimation problem and consider a Luenberger-type observer of the following form: where is the estimated state and matrices are the observer gains to be designed. Letting , one can easily obtain the error dynamics under synchronous switching as follows:
As for switched system with short-time switching signal, the asymptotic stability of the error dynamics is equivalent to the asymptotic stability of each error subsystem; however, in actual applications, the asymptotic stability is not enough for short-time switched system since the frequent switching behaviours may cause the error states to reach a very large value, which is not acceptable in the state estimation process; for example, see examples in . Hence, the concept of finite-time stability is introduced.
Definition 5. Switched error system (3) with is said to be finite-time stable with respect to , where , is a positive definite matrix, and a scalar , if , whenever .
As for the finite-time observer design problem which is supposed to guarantee the error state in a prescribed boundary, the bound is required to be made as small as possible. Thus, the first optimal state observer design problem for a finite-time interval with is given as follows.
When the switched system is subjected to external input signals , which is assumed to be energy bounded in the finite-time interval that is, , where , then, the finite-time boundedness and that with performance are considered.
Definition 7. Switched error system (3) is said to be finite-time bounded with respect to , where , is a positive definite matrix, and a scalar , if , whenever .
Concerned with performance problem, the controlled output for error state is given as where , , , are known matrices.
Definition 8. Switched error system (3)-(4) is said to be finite-time boundness with respect to , where , , is a positive definite matrix, and a scalar , if error system (3)-(4) is finite-time bounded with respect to and under zero-initial condition the output satisfies
When the performance index is taken into account, the minimum value of the state bound is also of interest. Given a prescribed performance, , the following problem is formulized to describe the optimal finite-time observer design problem.
3. Optimal Finite-Time Observer Design
Before giving our results, some explicit facts are recalled. For a symmetric positive definite matrix , it is easy to verify that can be factorized according to , where is a symmetric positive definite matrix. And for any positive definite matrix, , there always exists which is positive definite. At first, we consider Problem 6 where the disturbance ; our first result is proposed as follows.
Theorem 10. Consider switched system (1a) and (1b) with and switching frequency . If there exist a set of matrices , and scalars , , and such that then error dynamics (3) with is finite-time stable with respect to .
Proof. Substituting into (7), it follows that
which implies .
Letting for each subsystem of error dynamics (3) with , we have
Then, if the switched system switches from subsystem to at switching instant , from (6), it is easy to see that
We let where and is the indication function indicating the activated subsystem of error dynamics. Thus, from (10) and (11) we can obtain and , we can obtain where .
On the other hand, , one sees Using the fact that and , we get where , . Altogether (13)~(16), the following inequality can be derived:
From (6), we have and from (17) we have From (8), we can obtain . Therefore error dynamics (3) is finite-time stable.
Remark 11. The idea of Theorem 10 by using switching frequency is similar to the familiar conception, called average dwell time, which figures the average value of interval between consecutive switching instants . From , we can define the average dwell time in the infinite time interval . A well-known fact in both asymptotic and finite-time stability is that the average dwell time should be sufficiently large to guarantee that the switched system is asymptotically or finite-time stable. By (7), we see that the switching frequency should be small enough, which obviously leads to sufficiently large average dwell time, to ensure that the error system is finite-time stable.
Theorem 10 gives a method to obtain finite-time observer, but Problem 6 has not been fully solved since the optimal boundary is not taken into account, and, moreover, condition (8) in Theorem 10 is not an LMI; thus, Theorem 10 needs to be modified for optimal observer design.
Once the state bound is not ascertained, the observer with minimal value is usually of great interest. With a fixed and letting , , (6) and (8) become Then, the following optimization problem can be constructed: with optimized observer gains and minimal . Based on (22), a parameter searching algorithm for designing optimal observer (3) can be formulated as in Algorithm 1.
Then, when the disturbance is considered, that is, , we are going to design optimal finite-time observer, minimizing the bound , while the performance is still maintained. The following theorem is given to solve Problem 9.
Theorem 12. Given a scalar and considering switched system (1a) and (1b) and switching frequency , if there exist a set of matrices , and scalars , , and such that then error dynamics (3) with is finite-time bounded with performance with respect to , where .
Proof. Letting for each subsystem of error dynamics (3), we consider
By letting and by simple manipulations, we see that where . From (24) and Schur complement formula, it follows that At first, we consider the finite-time boundedness. Since , (28) always indicates Iterating the above inequality, one has
Then, we let where and , and from (23) indicating, , , the following results can be obtained: where implies the switching number in . Then by , it has
Following similar guidelines in Theorem 10, we see where , . Altogether (33)~(35), the following inequality can be derived as
From (23), we have
Thus, (36) becomes By (25), the finite-time boundness is obtained; that is, .
Then, the performance is considered. Iterating (28), we get And similarly, it yields
Under zero-initial condition, that is, and by , it implies Therefore, the performance is established. We can conclude that the error dynamics (3) is finite-time bounded with performance with respect to , where .
Remark 13. In Theorem 12, we find that the performance index which relates to the switching frequency ; ifthe is large, which means switching behaviour frequently occurs during the interval, also becomes larger implying that the performance will be worsened. Particularly, if there exists no switching, that is, , it becomes the which is not influenced by switching.
Remark 14. Comparing Theorem 12 with Theorem 10, Theorem 12 can be viewed as an extension of Theorem 10, or Theorem 10 is a particular case with in Theorem 12. For example, letting in (24), it becomes (7) in Theorem 10, and letting implying , (25) in Theorem 12 is exactly the same as (8) in Theorem 10.
Then, the following optimization problem can be constructed: with optimized observer gains and minimal .
In both Algorithms 1 and 2, if we can find a feasible solution with parameter , by the discussion above, we know that the designed observer can guarantee both finite-time and asymptotic stability of error dynamics. But in a general situation, we often obtain observers with , and only finite-time stability can be established. Thus, additional asymptotic observers for each subsystem have to be designed to ensure asymptotic stability, which can be easily obtained by linear system theory.
4. Further Discussions on Improved Results
Theorems 10 and 12 in the previous section are derived based on the switching frequency ; furthermore, if more information about the switching signal is known, that is, the total activation time of each subsystem is available, we can derive another less conservative result on observer design. In Theorems 10 and 12, the subobservers might be designed with only one parameter , which includes the two cases that the asymptotic stability of error dynamics is also established when or not when . When the total activation time of each subsystem can be prespecified, multiple parameters are introduced in observer design. is used to denote the total activation time of subsystem in short-time switching interval . It is explicit that . Then some improved results with less conservativeness can be derived. Because Theorem 12 covers Theorem 10, as Remark 13 indicates, we consider the general case of Theorem 12, where the performance is concerned.
Theorem 15. Given a scalar and considering switched system (1a) and (1b) and switching frequency , if there exist a set of matrices , and scalars , , such that then error dynamics (3) with is finite-time bounded with performance with respect to , where .
Remark 16. In the proof line, we see that Theorem 12 is the case that we choose in Theorem 15; thus, we can easily see that which indicates the less conservativeness of Theorem 15 compared with Theorem 12. But, since more parameters searching is required in Theorem 15, more computation cost such as a genetic algorithm is needed for using Theorem 15. Conservativeness and computation cost comparisons between the two theorems will be given by a numerical example later.
Corollary 17. Consider switched system (1a) and (1b) with and switching frequency . If there exist a set of matrices , and scalars , , such that then error dynamics (3) with is finite-time stable with respect to .
Remark 18. According to (51), the state bound is affected by many factors including several parameters such as and multiple for subsystems. Hence, to obtain the optimal observer gains with minimal value is a complex nonlinear optimization problem based on Theorem 15. As a powerful tool solving complex nonlinear optimization problem, the genetic algorithm, which is an optimization method inspired by the principles of Darwinian evolution, is introduced. As for the details about genetic algorithm, the reader is referred to  and many other textbooks and literature.
5. Numerical Example
Consider a switched discrete-time linear system with two subsystems as follows:
The switching signal is considered as a periodical switching signal in interval , the switching sequence is given as , and the initial subsystem is subsystem 1; thus, the average dwell time , , and . The state estimation design objective in short-time switching interval is to design a set of observer gains minimizing the value of , , when the initial value of error state satisfies . Thus we can choose parameters , , and . To compare the conservativeness of two approaches based on Theorem 10 and Corollary 17, we design observer through them, respectively.
Step 1. Initialize parameters , ,.
Step 3. Ascertain the local optimal value of with near by an unconstrained nonlinear optimization approach with the following optimal observer gains:
The optimal value of with and , and optimal observer gains are Comparing the two results, since genetic algorithm is applied by Corollary 17, the computation cost increases as generations increase. The computation cost of Theorem 10 is much less than that of Corollary 17, which only equals to one generation step in Corollary 17. But, on the other hand, the advantages of Corollary 17 are very obvious; the optimal value of minimal bound derived by Corollary 17 after 100 generation evolution is smaller than that derived by Theorem 10. Hence, we can see that the result by Corollary 17 is less conservative than that by Theorem 10 in this numerical example.
Furthermore, since , the asymptotic observers for long intervals without switching should be designed by traditional asymptotic observer design approach.
In this paper, the state estimation problem for switched system during a finite-time interval is addressed in the framework of switching frequency. Based on the conception of finite-time stability, an optimal observer is designed to minimize the bound of error state, and then the results are extended to the case concerned with performance, where the bound of error state is minimized while the performance in the finite-time interval is maintained. Particularly, when the total activation time is known, a less conservative result can be derived and an optimization problem can be solved with the help of the genetic algorithm. Since many actual switched systems exhibit short-time switching property and hereby can be modeled by short-time switched systems, our theoretical results are supposed to be widely used in real-world switched systems potentially such as extension from synchronous switching case to asynchronous switching case, which should be further considered in future work.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
D. Liberzon, Switching in Systems and Control, Birkhauser, Boston, Mass, USA, 2003.
Z. Sun and S. S. Ge, Switched Linear Systems—Control and Design, Springer, London, UK, 2005.
A. Balluchi, M. D. Benedetto, C. Pinello, C. Rossi, and A. Sangiovanni-Vincentelli, “Cut-off in engine control: a hybrid system approach,” in Proceedings of the 36th IEEE Conference on Decision and Control, pp. 4720–4725, 1997.View at: Google Scholar
J. Daafouz, P. Riedinger, and C. Iung, “Stability analysis and control synthesis for switched systems: a switched Lyapunov function approach,” Institute of Electrical and Electronics Engineers. Transactions on Automatic Control, vol. 47, no. 11, pp. 1883–1887, 2002.View at: Publisher Site | Google Scholar | MathSciNet
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.View at: Google Scholar
D. Luenberger, “Observers for multivariable systems,” IEEE Transaction on Automatic Control, vol. 11, no. 2, pp. 190–197, 1966.View at: Google Scholar
A. Alessandri and P. Coletta, “Switching observers for continuous time and discrete-time linear systems,” in Proceedings of the American Control Conference, pp. 2516–2521, Arlington, Va, USA, 2001.View at: Google Scholar
A. L. Juloski, W. P. M. H. Heemels, and S. Weiland, “Observer design for a class of piece-wise affine systems,” in Proceeding of the 41st IEEE Conference on Decision and Control, vol. 3, pp. 2606–2611, December 2002.View at: Google Scholar
A. L. J. Juloski, W. P. M. H. Heemels, Y. Boers, and F. Verschure, “Two Approaches to State Estimation for a Class of Piecewise Affine Systems,” in Proceedings of the 42nd IEEE Conference on Decision and Control, pp. 143–148, December 2003.View at: Google Scholar
W. Xiang and J. Xiao, “H finite-time control for switched nonlinear discrete-time systems with norm-bounded disturbance,” Journal of the Franklin Institute, vol. 348, no. 2, pp. 331–352, 2011.View at: Google Scholar
W. Xiang, J. Xiao, and M. N. Iqbal, “Asymptotic stability, gain boundness analysis and control synthesis for switched systems: a switching frequency approach,” vol. 26, no. 4, pp. 350–373, 2012.View at: Google Scholar
D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, New York, NY, USA, 1989.