Abstract
In this chapter, finite-time control and filtering problems are investigated for discrete-time switched systems with MDPDT. First of all, sufficient conditions are deduced to guarantee the finite-time boundedness and \(\mathscr {H}_{\infty }\) performance of switched systems. Then, control and filtering schemes are developed. The time-scheduled technology is adopted to achieve less conservative disturbance attenuation performance index. Finally, numerical examples are presented to verify the effectiveness of developed methods.
1 Finite-Time Performance Analysis
It is known that the main concern in many practical problems is the performance of systems over a fixed time interval [1, 2, 4, 5]. Thus, considering the finite-time performance is necessary. In Chap. 8, finite-time control and filtering issues for discrete-time switched systems are addressed with MDADT switching. In this chapter, the MDPDT switching mechanism is adopted to deduce the finite-time performance.
Consider a class of switched discrete-time systems given by
where \(x(k)\in \mathbb {R}^{n_{x}}\) is the discrete state vector of the system, \(z(k)\in \mathbb {R}^{n_{z}}\) is the output, \(\omega (k)\in \mathbb {R}^{r}\) is the exogenous disturbance that satisfies
where N is a given constant.
In this section, the QTD technique is adopted to deduce sufficient conditions which can guarantee that the system (12.1)–(12.2) is FTB with a prescribed \(\mathscr {H}_{\infty }\) performance. Here, the following QTD multiple Lyapunov-like function is adopted:
where \(q_{k}\) is the time scheduler and can be easily computed by
-
(i)
in the \(\tau \)-portion,
$$\begin{aligned} q_{k}=\left\{ \begin{array}{cl} k-k_{s_{p}},&{} \quad k\in [ k_{s_{p}},k_{s_{p}}+\tau _{m}), \\ \tau _{m},&{} \quad k\in [ k_{s_{p}}+\tau _{m},k_{s_{p}+1}), \end{array} \right. \end{aligned}$$(12.5) -
(ii)
in the T-portion,
$$\begin{aligned} q_{k}=\min \{k-H_{r}, \tau _{m}\}, k\in [k_{s_{p}+1},k_{s_{p+1}}), \end{aligned}$$(12.6)
where the positive integer \(\tau _{m}\) is the pre-chosen maximum step, and
Firstly, we provided the following lemma, which can guarantee the finite-time boundedness of the system (12.1).
Lemma 12.1
Consider the discrete-time switched linear system (12.1), for given scalars \(\alpha _{i}>1\), \(\mu _{i}>1\), \(i \in \mathscr {M}\), integer \(\tau _{m}>0\), and a prescribed period of persistence T, if there exist matrices \(P_{i}(\phi )>0\), \(i \in \mathscr {M}\), \(\phi \in \mathbb {Z}_{[ 0,\tau _{m}]}\), such that \(\forall (i,j)\in \mathscr {M}\times \mathscr {M} \), \(i \ne j\), \(\varphi \in \mathbb {Z}_{[0,\tau _{m}-1]}\),
where \(\kappa _{1}=\max _{i\in \mathscr {M}, \phi \in \mathbb {Z}_{[ 0,\tau _{m}]}}\{(\lambda _{\max }(\bar{P}_{i}(\phi ))\}\), \(\kappa _{2}=\min _{i\in \mathscr {M}, \phi \in \mathbb {Z}_{[ 0,\tau _{mi}]} }\{\lambda _{\min }(\bar{P}_{i}(\phi ))\}\), \(\bar{P}_{i}(\phi ))=R^{-1/2}P_{i}(\phi )R^{-1/2}\), \(\varepsilon = N\ln \alpha _{\max } +(T+1)\ln \mu _{\max }\), \(\alpha _{\max }=\max _{i\in \mathscr {M}} \{\alpha _{i}\}\), and \(\mu _{\max }=\max _{i\in \mathscr {M}} \{\mu _{i}\}\).
Then, for any MDPDT switching signal satisfying
the system (12.1) is FTB with respect to \((c_{1},c_{2},R,d,N,\sigma )\), where \(\tau _{a\min }= \min _{i\in \mathscr {M}} \{\tau _{ai}\}\).
Proof
Choose the following Lyapunov-like function:
where \(P_{\sigma (k)}(q_{k})>0\) for \(\sigma (k) \in \mathscr {M}\), and \(q_{k}\) is the time scheduler defined by (12.5) and (12.6).
Consider \(\sigma (k_{s_{p}})=i\in \mathscr {M}\). For \(k \in [k_{s_{p}}, k_{s_{p}}+\tau _{m})\), it holds that
where \(\xi (k)= \left[ \begin{array}{cc} x^{\top }(k)&\omega ^{\top }(k) \end{array} \right] ^{\top }\).
Since \(0\le k-k_{s_{p}} < \tau _{m}\) for \(k \in [k_{s_{p}}, k_{s_{p}}+\tau _{m})\). Therefore, (12.7) can guarantee that
By the similar manipulation, (12.8) can guarantee (12.13) for \(k \in [k_{s_{p}}+\tau _{m}, k_{s_{p}+1})\).
Therefore, we can conclude that for \(k \in [k_{s_{p}}, k_{s_{p}+1})\), i.e., in the \(\tau \)-portion, it holds that
According to the definition of \(q_{k}\), (12.14) also holds in the T-portion. Therefore, (12.14) holds for each switching interval \([k_{s}, k_{s+1})\).
By summating (12.14) for \(k \in [k_{s}, k_{s+1})\), one can achieve that
On the other hand, \(\sigma (k_{s})=i \in \mathscr {M}\), \(\sigma (k_{s}-1) =j \in \mathscr {M}\), \(i\ne j\), (12.9) indicates that
Combining (12.15) and (12.16), one can obtain that
It is noted that
Thus, we have
Considering \(\bar{P}_{i}(\phi )=R^{-1/2}P_{i}(\phi ) R^{-1/2}\) for \(\sigma (k)=i \in \mathscr {M}\), one can obtain that
and
It is noted that (12.10) indicates
Notice that \(\varepsilon = N\ln \alpha _{\max } +(T+1) \ln \mu _{\max }\). Combining with (12.11), for \(\forall i \in \mathscr {M}\), it holds that
Therefore, we can arrive at
According to Definition 8.2, the switched linear system (12.1) is FTB with respect to \((c_{1},c_{2},R,d,N,\sigma )\), which ends the proof.
Remark 12.1
It can be seen that condition (12.10) in Lemma 12.1 is not a strict LMI constraint. We can firstly solve (12.7)–(12.9) to gain \(P_{i}(\phi )\), \(i \in \mathscr {M}\), \(\phi \in \mathbb {Z}_{[0,\tau _{m}]}\). Then we can further obtain the values of \(\kappa _{1}\) and \(\kappa _{2}\). Substituting \(\kappa _{1}\), \(\kappa _{2}\) into (12.10) and adjusting parameters \(\alpha _{i}\), \(\mu _{i}\), \(c_{1}\) and \(c_{2}\) properly, we can manage to find an admissible solution such that (12.10) holds.
Based on Lemma 12.1, we further deduce the criterion to guarantee that the system is finite-time boundedness with \(\mathscr {H}_{\infty }\) performance of the switched system (12.1)–(12.2).
Lemma 12.2
Consider the discrete-time switched linear system (12.1)–(12.2), for given scalars \(\alpha _{i}>1\), \(\mu _{i}>1\), \(i \in \mathscr {M}\), integer \(\tau _{m}>0\), and a prescribed period of persistence T, if there exist matrices \(P_{i}(\phi )>0\), \(i \in \mathscr {M}\), \(\phi \in \mathbb {Z}_{[ 0,\tau _{m}]}\), such that \(\forall (i,j)\in \mathscr {M}\times \mathscr {M} \), \(i \ne j\), \(\varphi \in \mathbb {Z}_{[0,\tau _{m}-1]}\), (12.9) holds, and
where \(\kappa _{2}=\min _{i\in \mathscr {M}, \phi \in \mathbb {Z}_{[ 0,\tau _{m}]} }\{\lambda _{\min }(\bar{P}_{i}(\phi ))\}\), \(\bar{P}_{i}(\phi ))=R^{-1/2}P_{i}(\phi )R^{-1/2}\), \(\varepsilon = N\ln \alpha _{\max } +(T+1)\ln \mu _{\max }\), \(\alpha _{\max }=\max _{i\in \mathscr {M}} \{\alpha _{i}\}\), and \(\mu _{\max }=\max _{i\in \mathscr {M}} \{\mu _{i}\}\).
Then, for any MDPDT switching signal satisfying
the system (12.1)–(12.2) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance with respect to \((0,c_{2},R,d,\gamma _{s},N,\sigma )\), where \(\tau _{a\min }= \min _{i\in \mathscr {M}} \{\tau _{ai}\}\), and
Proof
It is noted that (12.17) can be rewritten as
Since
then one can obtain that
That is to say, (12.7) can be ensured by (12.17). By the similar manipulation, (12.18) can guarantee (12.8). Therefore, according to Lemma 12.1, Lemma 12.2 can guarantee that the switched system (12.1) is FTB with respect to \((c_{1},c_{2},R,d,N,\sigma )\) by setting \(c_{1}=0\).
Select (12.12) as the Lyapunov-like function. Denote \(\varGamma (k)=\gamma ^{2}\omega ^{\top }(k)\omega (k) - z^{\top }(k)z(k)\). Consider \(\sigma (k_{s_{p}})=i\in \mathscr {M}\). For \(k \in [k_{s_{p}}, k_{s_{p}}+\tau _{m})\), it holds that
where \(\xi (k)= \left[ \begin{array}{cc} x^{\top }(k)&\omega ^{\top }(k) \end{array} \right] ^{\top }\).
It is noted that \(0\le k-k_{s_{p}} < \tau _{m}\) for \(k \in [k_{s_{p}}, k_{s_{p}}+\tau _{m})\). Thus, (12.17) indicates that
Similarly, for \(k \in [k_{s}+\tau _{mi}, k_{s+1})\), (12.22) can also be ensured by (12.18). That is to say, in the \(\tau \)-portion, (12.18) always holds. Obviously, in the T-portion, (12.18) can also be ensured. Therefore, one can conclude that for each switching interval \(k \in [k_{s}, k_{s+1})\),
By summating (12.23) for \(k \in [k_{s}, k_{s+1})\), one can obtain
Combining (12.16) and (12.24), it holds that
Under zero initial conditions, we have
Furthermore, one can arrive at
Since
It holds that
On the other hand, if (12.20) holds, one can obtain that
Then, we can derive
By setting \(k-1=N\), it can be concluded from (12.25)–(12.27) that
where \(\gamma _{s}=\sqrt{\mathrm {exp}((T+1)\ln \mu _{\max }+2N\ln \alpha _{\max })}\gamma \).
According to Definition 8.3, one can conclude that the system (12.1)–(12.2) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance with respect to \((0,c_{2},R,d,\gamma _{s},N,\sigma )\), which ends the proof.
In Lemma 12.2, sufficient conditions are deduced to guarantee the finite-time \(\mathscr {H}_{\infty }\) performance for discrete-time switched systems. On this basis, the control and filtering schemes are developed in the subsequent sections.
2 Finite-Time Control
In this section, we consider the finite-time \(\mathscr {H}_{\infty }\) control problem. Consider a class of discrete-time switched linear systems:
where \(x(k) \in \mathbb {R}^{n_{x}}\) is the state vector, \(u(k) \in \mathbb {R}^{n_{u}}\) is the control input, \(z(k)\in \mathbb {R}^{n_{z}}\) is the controlled output, and \(\omega (k)\in \mathbb {R}^{n_{\omega }}\) is the exogenous disturbance satisfying (12.3). \(\sigma (k):[0,\infty )\rightarrow \mathscr {M}\) is the switching signal. \(A_{i}\), \(B_{i}\), \(E_{i}\), \(G_{i}\), \(H_{i}\) and \(L_{i}\) are real constant matrices with appropriate dimensions for \(\sigma (k)=i\in \mathscr {M}\).
The considered controller is with the following form:
where \(K_{\sigma (k)}(q_{k})\) is the controller gains to be determined, and \(q_{k}\) can be computed by (12.5) and (12.6).
For \(\sigma (k)=i \in \mathscr {M}\), the corresponding closed-systems are
where \(\mathscr {A}_{i}(q_{k})=A_{i}+B_{i}K_{i}(q_{k})\), \(\mathscr {B}_{i}=E_{i}\), \(\mathscr {C}_{i}(q_{k})=G_{i}+H_{i}K_{i}(q_{k})\), and \(\mathscr {D}_{i}=L_{i}\).
Here, we are aimed to design a set of QTD state feedback controllers (12.30) for the system (12.28)–(12.29), such that the closed-loop system (12.31)–(12.32) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance.
Theorem 12.1
Consider the discrete-time switched linear system (12.28)–(12.29), for given scalars \(\alpha _{i}>1\), \(\mu _{i}>1\), \(i \in \mathscr {M}\), integer \(\tau _{m}>0\), and a prescribed period of persistence T, if there exist matrices \(\tilde{P}_{i}(\phi )>0\), \(U_{i}(\phi )\), \(i \in \mathscr {M}\), \(\phi \in \mathbb {Z}_{[ 0,\tau _{m}]}\), such that \(\forall (i,j)\in \mathscr {M}\times \mathscr {M} \), \(i \ne j\), \(\varphi \in \mathbb {Z}_{[ 0,\tau _{m}-1]}\), (12.19) holds, and
where
\(\kappa _{2}=\min _{i\in \mathscr {M}, \phi _{i} \in \mathbb {Z}_{[ 0,\tau _{m}]} }\{\lambda _{\min }(\bar{P}_{i}(\phi ))\}\), \(\bar{P}_{i}(\phi ))=R^{-1/2}\tilde{P}_{i}^{-1}(\phi )R^{-1/2}\), \(\varepsilon = N\ln \alpha _{\max } +(T+1)\ln \mu _{\max }\), \(\alpha _{\max }=\max _{i\in \mathscr {M}} \{\alpha _{i}\}\), and \(\mu _{\max }=\max _{i\in \mathscr {M}} \{\mu _{i}\}\).
Then, for any MDPDT switching signal satisfying (12.20), the system (12.31)–(12.32) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance with respect to \((0,c_{2},R,d,\gamma _{s},N,\sigma )\), where \(\gamma _{s}\) is given in (12.21). Moreover, the controller gains are given by
Proof
Construct the following Lyapunov-like function:
where \(P_{\sigma (k)}(\phi )=\tilde{P}_{\sigma (k)}(\phi )\) for \(\forall \sigma (k) \in \mathscr {M}\), \(\phi \in \mathbb {Z}_{[ 0,\tau _{m}]}\). In this case, (12.35) is equivalent to (12.9).
By using Schur complement and congruence transformation, (12.33) can guarantee (12.17) and (12.18) can be ensured by (12.34).
It is noted that all conditions in Lemma 12.2 are satisfied. Therefore, one can conclude that the closed-loop system (12.31)–(12.32) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance, which ends the proof.
In the following, the traditional time-independent state feedback controller is designed.
Corollary 12.1
Consider the discrete-time switched linear system (12.28)–(12.29), for given scalars \(\alpha _{i}>1\), \(\mu _{i}>1\), \(i \in \mathscr {M}\), and a prescribed period of persistence T, if there exist matrices \(\tilde{P}_{i}>0\), \(U_{i}\), \(i \in \mathscr {M}\), such that \(\forall (i,j)\in \mathscr {M}\times \mathscr {M} \), \(i \ne j\), (12.19) holds, and
where \(\kappa _{2}=\min _{i\in \mathscr {M}, \phi _{i} \in \mathbb {Z}_{[ 0,\tau _{m}]} }\{\lambda _{\min }(\bar{P}_{i}(\phi ))\}\), \(\bar{P}_{i}(\phi ))=R^{-1/2}\tilde{P}_{i}^{-1}(\phi )R^{-1/2}\), \(\varepsilon = N\ln \alpha _{\max } +(T+1)\ln \mu _{\max }\), \(\alpha _{\max }=\max _{i\in \mathscr {M}} \{\alpha _{i}\}\), and \(\mu _{\max }=\max _{i\in \mathscr {M}} \{\mu _{i}\}\).
Then, for any MDPDT switching signal satisfying (12.20), the system (12.31)–(12.32) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance with respect to \((0,c_{2},R,d,\gamma _{s},N,\sigma )\), where \(\gamma _{s}\) is given in (12.21). Moreover, the controller gains are given by
Proof
Omitted.
Remark 12.2
In this section, finite-time \(\mathscr {H}_{\infty }\) control for discrete-time switched systems is addressed with MDPDT switching. The designed controllers are based on state feedback. In [3], finite-time output feedback control for discrete-time switched systems is studied with MDPDT switching. One can refer to it for more details.
Example 12.1
Consider a discrete-time switched linear system (12.28)–(12.29) consisting of three subsystems, and the system parameters are given by:
Here, we are aimed to design a set of state feedback controllers and find admissible MDPDT switching signals such that the corresponding closed-loop system (12.31)–(12.32) is FTB and has a prescribed \(\ell _{2}\)-gain performance. Set \(\alpha _{1}=1.009\), \(\alpha _{2}=1.008\), \(\alpha _{3}=1.007\), \(\mu _{1}=\mu _{2}=\mu _{3}=1.01\), and \(\tau _{m1}=\tau _{m2}=\tau _{m3}=1\). Moreover, consider \(c_{2}=0.4\), \(d=0.4\), \(N=80\), \(T=10\) and \(R=I\). By using Theorem 12.1, feasible solutions can be found with \(\tau _{a\min }^{*}=2.2162\), and \(\gamma _{s}=0.8641\). Using Corollary 12.1 can also obtain feasible solutions with \(\gamma _{s}=1.0490\). It can be seen that Theorem 12.1 can achieve less conservative performance index compared with Corollary 12.1.
By Theorem 12.1, a set of both mode-dependent and QTD state feedback controllers with
Assume that the exogenous disturbance input is \(\omega (k)=0.1\sin (0.4k)\). The switching signal is given in Fig. 12.1. Under zero initial condition, the state responses of the closed-loop system are shown in Fig. 12.2. The history of \(x^{\top }(k)Rx(k)\) is displayed in Fig. 12.3, which is far less than the given bound \(c_{2}\).
The output responses of the closed-loop system are shown in Fig. 12.4. Introduce
which indicates the influence of the disturbance input \(\omega (k)\) to the controlled output z(k). The evolution of \(\gamma _{l}(k)\) is shown in Fig. 12.5. It can be seen that \(\gamma _{l}(k)\) is no greater than 0.2962 in the concerned interval, which is less than the prescribed value 0.8641. The simulation results show the effectiveness of the designed controllers.
3 Finite-Time Filtering
In this section, the finite-time \(\mathscr {H}_{\infty }\) filtering problem is investigated. Consider the following discrete-time switched linear system:
where \(x(k) \in \mathbb {R}^{n_{x}}\) is the state vector, \(y(k) \in \mathbb {R}^{n_{y}}\) is the output vector, \(z(k)\in \mathbb {R}^{n_{z}}\) is the objective signal to be estimated, and \(\omega (k)\in \mathbb {R}^{n_{\omega }}\) is the exogenous disturbance satisfying (12.3). \(\sigma (k):[0,\infty )\rightarrow \mathscr {M}\) is the switching signal. \(A_{i}\), \(E_{i}\), \(C_{i}\), \(D_{i}\), \(G_{i}\) and \(L_{i}\) are real constant matrices with appropriate dimensions for \(\sigma (k)=i\in \mathscr {M}\).
The following full-order filters are designed for the system (12.41)–(12.43):
where \(x_{f}(k) \in \mathbb {R}^{n_{x}}\) is the state of the filter, \(z_{f}(k) \in \mathbb {R}^{n_{z}}\) is the estimation of z(k). \(A_{fi}(q_{k})\), \(B_{fi}(q_{k})\), \(C_{fi}(q_{k})\) and \(D_{fi}(q_{k})\) are filter gains to be determined for \(i\in \mathscr {M}\), and \(q_{k}\) is defined in (12.5) and (12.6).
For \(\sigma (k)=i\in \mathscr {M}\), the filtering error systems are with the following structure:
where \(\tilde{x}(k)=\left[ \begin{array}{cc} x^{\top }(k)&X_{f}^{\top }(k)\end{array}\right] \), \(e(k)=z(k)-z_{f}(k)\), and
Here, the objective is to design a set of filters (12.44)–(12.45) for the discrete-time switched linear system (12.41)–(12.43), such that the corresponding filtering error system (12.46)–(12.47) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance index.
Theorem 12.2
Consider the discrete-time switched linear system (12.41)–(12.43). For given scalars \(\alpha _{i}>1\), \(\mu _{i}>1\), \(i \in \mathscr {M}\), integer \(\tau _{m}>0\), and a prescribed period of persistence T, if there exist matrices \(P_{1i}(\phi )>0\), \(P_{3i}(\phi )>0\), and \(P_{2i}(\phi )\), \(X_{i}(\phi )\), \(Y_{i}(\phi )\), \(Z_{i}(\phi )\), \(A_{Fi}(\phi )\), \(B_{Fi}(\phi )\), \(C_{Fi}(\phi )\), \(D_{Fi}(\phi )\), \(i \in \mathscr {M}\), \(\phi \in \mathbb {Z}_{[ 0,\tau _{m}]}\), and a scalar \(\gamma >0\), such that \(\forall (i,j)\in \mathscr {M}\times \mathscr {M} \), \(i \ne j\), \(\varphi \in \mathbb {Z}_{[ 0,\tau _{m}-1]}\), (12.9) and (12.19) hold, and
where
with
Then, for any MDPDT switching signal satisfying (12.20), the system (12.46)–(12.47) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance with respect to \((0,c_{2},R,d,\gamma _{s},N,\sigma )\), where \(\gamma _{s}\) is given in (12.21). Moreover, for \(\phi \in \mathbb {Z}_{[0,\tau _{m}]}\), \(i \in \mathscr {M}\), the filter gains are given by
Proof
The proof procedure is similar to above previous theorems. (12.48) and (12.49) can guarantee (12.17) and (12.18), respectively. According to Lemma 12.2, one can conclude that the corresponding filtering error system is FTB with a prescribed \(\mathscr {H}_{\infty }\) performance.
The follow corollary present the time-independent filtering scheme.
Corollary 12.2
Consider the discrete-time switched linear system (12.41)–(12.43). For given scalars \(\alpha _{i}>1\), \(\mu _{i}>1\), \(i \in \mathscr {M}\), and a prescribed period of persistence T, if there exist matrices \(P_{1i}>0\), \(P_{3i}>0\), and \(P_{2i}\), \(X_{i}\), \(Y_{i}\), \(Z_{i}\), \(A_{Fi}\), \(B_{Fi}\), \(C_{Fi}\), \(D_{Fi}\), \(i \in \mathscr {M}\), and a scalar \(\gamma >0\), such that \(\forall (i,j)\in \mathscr {M}\times \mathscr {M} \), \(i \ne j\), (12.19) holds, and
and
Then, for any MDADT switching signal satisfying (12.20), the system (12.46)–(12.47) is FTB and has a prescribed \(\mathscr {H}_{\infty }\) performance with respect to \((0,c_{2},R,d,\gamma _{s},N,\sigma )\), where \(\gamma _{s}\) is given in (12.21). Moreover, for \(i \in \mathscr {M}\), the filter gains are given by
Proof
Omitted.
Example 12.2
Consider the discrete-time switched system (12.41)–(12.43) with two subsystems. The system parameters are same as the ones in Example 8.2.
Set \(\alpha _{1}=\alpha _{2}=1.005\), \(\mu _{1}=1.011\) \(\mu _{2}=1.009\), and \(\tau _{m1}=\tau _{m2}=2\). Moreover, consider \(T=6\), \(c_{2}=20\), \(d=0.27\), \(N=80\) and \(R=I\). By using Theorem 12.2, one can obtain feasible solutions with \(\tau _{a\min }^{*}=9.3542\), and \(\gamma _{s}=0.7824\). The minimum value of \(\gamma _{s}\) obtained by Corollary 12.2 is 0.9382, which is larger than the one obtained by Theorem 12.2.
The filter gains obtained by Theorem 12.2 are given as follows:
Consider the exogenous disturbance input is \(\omega (k)=0.08\sin (0.5k)\). The designed switching signal satisfying the above constraints is given in Fig. 12.6. Under zero initial condition, the origin output and estimation output responses are displayed in Fig. 12.7. The filtering error responses are displayed in Fig. 12.8. The history of \(x^{\top }(k)Rx(k)\) is displayed in Fig. 12.9, which is far less than the given bound. The evolution of \(\gamma _{l}(k)\) is shown in Fig. 12.10. The values of \(\gamma _{l}(k)\) in the concerned interval is no greater than 0.3552, which is less than the prescribed \(\mathscr {H}_{\infty }\) performance index. The above simulation results illustrate the effectiveness of designed filters.
4 Conclusion
In this chapter, finite-time performance for discrete-time switched linear systems is investigate with MDPDT switching. Firstly, Sufficient conditions are addressed, which can guarantee that the switched system is FTB with prescribed \(\mathscr {H}_{\infty }\) performance. Based on the finite-time \(\mathscr {H}_{\infty }\) performance criteria, control and filtering schemes are developed, respectively. Finally, numerical examples are provided to illustrate the effectiveness of the developed methods.
References
Liu, H., Zhao, X.: Finite-time \(\mathscr {H}_{\infty }\) control of switched systems with mode-dependent average dwell time. J. Frankl. Inst. Eng. Appl. Math. 351(3), 1301–1315 (2014)
Orlov, Y.: Finite time stability and robust control synthesis of uncertain switched systems. SIAM J. Control Optim. 43(4), 1253–1271 (2005)
Shi, S., Shi, Z., Fei, Z., Ren, S.: Finite-time output feedback control for discrete-time switched linear systems with mode-dependent persistent dwell-time. J. Frankl. Inst. Eng. Appl. Math. 355(13), 5560–5575 (2018)
Xiang, W., Xiao, J.: Finite-time stability and stabilisation for switched linear systems. Int. J. Syst. Sci. 44(2), 384–400 (2013)
Yang, H., Jiang, B., Zhao, J.: On finite-time stability of cyclic switched nonlinear systems. IEEE Trans. Autom. Control 60(8), 2201–2206 (2015)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Fei, Z., Shi, S., Shi, P. (2020). Finite-Time Control and Filtering. In: Analysis and Synthesis for Discrete-Time Switched Systems. Studies in Systems, Decision and Control, vol 244. Springer, Cham. https://doi.org/10.1007/978-3-030-25812-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-25812-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-25811-5
Online ISBN: 978-3-030-25812-2
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)