Loading [MathJax]/jax/output/SVG/jax.js
Case study

The Laplace transform as an alternative general method for solving linear ordinary differential equations


  • Received: 01 October 2021 Revised: 01 November 2021
  • The Laplace transform is a popular approach in solving ordinary differential equations (ODEs), particularly solving initial value problems (IVPs) of ODEs. Such stereotype may confuse students when they face a task of solving ODEs without explicit initial condition(s). In this paper, four case studies of solving ODEs by the Laplace transform are used to demonstrate that, firstly, how much influence of the stereotype of the Laplace transform was on student's perception of utilizing this method to solve ODEs under different initial conditions; secondly, how the generalization of the Laplace transform for solving linear ODEs with generic initial conditions can not only break down the stereotype but also broaden the applicability of the Laplace transform for solving constant-coefficient linear ODEs. These case studies also show that the Laplace transform is even more robust for obtaining the specific solutions directly from the general solution once the initial values are assigned later. This implies that the generic initial conditions in the general solution obtained by the Laplace transform could be used as a point of control for some dynamic systems.

    Citation: William Guo. The Laplace transform as an alternative general method for solving linear ordinary differential equations[J]. STEM Education, 2021, 1(4): 309-329. doi: 10.3934/steme.2021020

    Related Papers:

    [1] Ruo Jia, Richard Chamoun, Alexander Wallenbring, Masoomeh Advand, Shanchuan Yu, Yang Liu, Kun Gao . A spatio-temporal deep learning model for short-term bike-sharing demand prediction. Electronic Research Archive, 2023, 31(2): 1031-1047. doi: 10.3934/era.2023051
    [2] Gang Cheng, Changliang He . Analysis of bus travel characteristics and predictions of elderly passenger flow based on smart card data. Electronic Research Archive, 2022, 30(12): 4256-4276. doi: 10.3934/era.2022217
    [3] Xuerui Li, Lican Kang, Yanyan Liu, Yuanshan Wu . Distributed Bayesian posterior voting strategy for massive data. Electronic Research Archive, 2022, 30(5): 1936-1953. doi: 10.3934/era.2022098
    [4] Haoqing Wang, Wen Yi, Yannick Liu . An innovative approach of determining the sample data size for machine learning models: a case study on health and safety management for infrastructure workers. Electronic Research Archive, 2022, 30(9): 3452-3462. doi: 10.3934/era.2022176
    [5] Yazao Yang, Haodong Tang, Tangzheng Weng . Changes in public travel willingness in the post-COVID-19 era: Evidence from social network data. Electronic Research Archive, 2023, 31(7): 3688-3703. doi: 10.3934/era.2023187
    [6] Kai Huang, Chang Jiang, Pei Li, Ali Shan, Jian Wan, Wenhu Qin . A systematic framework for urban smart transportation towards traffic management and parking. Electronic Research Archive, 2022, 30(11): 4191-4208. doi: 10.3934/era.2022212
    [7] Nihar Patel, Nakul Vasani, Nilesh Kumar Jadav, Rajesh Gupta, Sudeep Tanwar, Zdzislaw Polkowski, Fayez Alqahtani, Amr Gafar . F-LSTM: Federated learning-based LSTM framework for cryptocurrency price prediction. Electronic Research Archive, 2023, 31(10): 6525-6551. doi: 10.3934/era.2023330
    [8] Jian Wan, Peiyun Yang, Wenbo Zhang, Yaxing Cheng, Runlin Cai, Zhiyuan Liu . A taxi detour trajectory detection model based on iBAT and DTW algorithm. Electronic Research Archive, 2022, 30(12): 4507-4529. doi: 10.3934/era.2022229
    [9] Moteeb Al Moteri, Mohammed Alojail . Factors influencing the Supply Chain Management in e-Health using UTAUT model. Electronic Research Archive, 2023, 31(5): 2855-2877. doi: 10.3934/era.2023144
    [10] Miguel Arantes, Wenceslao González-Manteiga, Javier Torres, Alberto Pinto . Striking a balance: navigating the trade-offs between predictive accuracy and interpretability in machine learning models. Electronic Research Archive, 2025, 33(4): 2092-2117. doi: 10.3934/era.2025092
  • The Laplace transform is a popular approach in solving ordinary differential equations (ODEs), particularly solving initial value problems (IVPs) of ODEs. Such stereotype may confuse students when they face a task of solving ODEs without explicit initial condition(s). In this paper, four case studies of solving ODEs by the Laplace transform are used to demonstrate that, firstly, how much influence of the stereotype of the Laplace transform was on student's perception of utilizing this method to solve ODEs under different initial conditions; secondly, how the generalization of the Laplace transform for solving linear ODEs with generic initial conditions can not only break down the stereotype but also broaden the applicability of the Laplace transform for solving constant-coefficient linear ODEs. These case studies also show that the Laplace transform is even more robust for obtaining the specific solutions directly from the general solution once the initial values are assigned later. This implies that the generic initial conditions in the general solution obtained by the Laplace transform could be used as a point of control for some dynamic systems.



    Switched systems (SSs) are a significant subclass of hybrid systems consisting of a series of subsystems and a signal for controlling the switch among them [1]. Over the last few decades, SSs have been applied in various domains, such as DC-DC power converters [2], inverter circuits [3], unmanned vehicles [4], secure communication [5], fault estimation [6] and image encryption [7]. At the same time, stability analysis and controller design for SSs, as fundamental issues in the control area, have been intensively studied and a significant amount of results have been proposed in the international literature; see, e.g., [8,9,10,11,12,13,14,15,16].

    The stability of an SS is dependent on each subsystem and highly affected by the switching frequency. Although all subsystems are asymptotically stable (AS), the entire SS may have a non-convergent solution trajectory caused by fast switching [17]. However, the stability can be maintained when the switching is sufficiently slow in the sense that the running time of each active subsystem is not less than a specified threshold called the dwell time (DT) [18]. Actually, this is also true even when fast switching occurs occasionally, as long as the average dwell time (ADT) is long enough [19].

    In 2004, a type of switching signal, called the persistent DT (PDT) switching signal, was introduced in [20] to represent the switching signal that has infinitely many intervals of length no less than a given positive constant ε (i.e., the PDT) during which no switch occurs, and distance between two consecutive intervals with this property does not surpass a period of persistence δ. As explained in [20], the PDT switching is more common and suitable than DT and ADT switching for describing switching phenomena associated with hybrid systems.

    There have been various control strategies, including uniform tube-based control [21], fault-tolerant control [22], quasi-synchronization control [23], quantized fuzzy control [24], L1 finite-time control [25], dynamic output-feedback control [26], sliding mode control [27] and model predictive control [28], that have been introduced for discrete-time SSs with PDT switching over the past few years. To the best of our knowledge, however, there are no available reports on the energy-to-peak control of continuous-time SSs (CTSSs) with PDT switching. Energy-to-peak control can guarantee that the infinity norm of the controlled output is less than a certain disturbance attenuation level [29]. In many practical situations, such a control approach serves as an appropriate selection for system design because it is insensitive to specific statistical characteristics of the noise signals and exhibits good robustness [30].

    In this paper, we are interested in the energy-to-peak control for CTSSs with PDT switching. Our objective is to ensure that the CTSS is AS with a certain energy-to-peak disturbance-attenuation performance (EPDAP) level [31]. We first introduce a lemma regarding the asymptotic stability and EPDAP analysis of the PDT-based CTSS. Then, we propose a time-independent state-feedback controller design approach using a Lyapunov function (LF) and decoupling techniques. To reduce conservatism, we further present a quasi-time-dependent (QTD) controller design method. The required gains of these two types of controllers can be obtained by means of feasible solutions of linear matrix inequalities (LMIs), which are known to be easily solved with available tools in MATLAB [32]. Finally, we give an example to illustrate the effectiveness of our controller design strategies.

    Notation: We denote by Rn the n-dimensional Euclidean space, by Z+ the set of non-negative integers, by R the set of real numbers, by the 2-norm, and by the round-down operator. We apply an asterisk "" to represent a symmetric term in a matrix and the superscript "T" to stand for the transpose operator. For any square matrix X, we utilize X>0(<0) to imply that the matrix is symmetric positive-definite (negative-definite) and define S(X) as X+XT. Moreover, we let K be a class of continuous and strictly increasing functions β() that satisfy β(0)=0.

    In the field of control for SSs with PDT switching, the majority of published work primarily focuses on the discrete-time setting; see, e.g., [21,22,23,24,25,28]. In this paper, we will consider CTSSs with PDT switching as in [33,34]. The system model is described by

    ˙ψ(t)=Aς(t)ψ(t)+Bς(t)u(t)+Eς(t)ϖ(t), (2.1a)
    ϕ(t)=Gς(t)ψ(t), (2.1b)

    within which ψ(t)Rn, ϕ(t)Rp and u(t)Rq stand for the state, controlled output and control input, respectively; ϖ(t)Rr denotes the exterior disturbance that belongs to L2[0,] [35]; Aς(t), Bς(t), Eς(t) and Gς(t) are the given system matrices; ς(t) denotes the switching rule, which is a right-continuous function defined on [0,) and takes values in M={1,,M}. The sequence formed by all switching moments is given as t0=0,,tl,. The minimum time interval between any two switching moments is defined by ht=min{tl+1tl} (lZ+). To avoid Zeno behavior, we set htC0, where C0 is a positive constant.

    As described in Figure 1, the whole time axis is divided into infinitely many stages, where each stage consists of two parts, namely the slow switching part (i.e., ε-part) and the frequent switching part (i.e., δ-part). We denote by εr and δr the duration of each of these two parts in the r-th stage, respectively. Additionally, we use tm(r) to represent the initial moment of the r-th stage and nr to stand for the number of switches within the period of (tm(r),tm(r+1)). Evidently, εr and δr satisfy εrε and δrδ, respectively, and the switching moments within the interval (tm(r),tm(r+1)) can be shown as tm(r)+1,,tm(r)+κ,,tm(r)+nr. For all κZ+, we denote further that δr,κ=tm(r)+κ+1tm(r)+κ. Then, according to the meaning of the symbols introduced, it can be seen that δr,κδ and tm(r+1)=tm(r)+nr+1.

    Figure 1.  The illustration of PDT switching.

    Remark 1. According to the PDT switching scheme, in the r-th stage, the duration of the slow switching part is at least ε, and the duration of the frequent switching part does not surpass δ. As compared to the DT and ADT switching schemes, the PDT switching scheme is more general. To be more specific, when δ takes values of zero and infinity, the PDT switching scheme degenerates into the DT and weak DT switching schemes, respectively [20]. Furthermore, unlike the ADT switching scheme, the PDT switching scheme does not impose any restrictions on the switching frequency of the frequent switching part [36].

    Let us now introduce the concepts concerning the asymptotic stability and EPDAP:

    Definition 1. We say that CTSS (2.1) is AS if there is a function β()K such that

    ψ(t)β(ψ(t0))

    holds in the case of ϖ(t)=0.

    Definition 2. Given a scalar γ>0, we say that CTSS (2.1) has the EPDAP level γ if

    ϕ(t)2γ20ϖ(t)2dt

    holds under ψ(0)=0, where ϕ(t)=supt0ϕ(t).

    Before ending the section, we state three preliminary propositions that we are going to use to prove our main results.

    Proposition 1. [37] Given a scalar ρ>0 and two locally integrable functions V(t) and Γ(t) defined on [0,), if ˙V(t)ρV(t)+Γ(t) holds, then we obtain

    V(t)eρtV(0)+t0eρ(tσ)Γ(σ)dσ,t0.

    Proposition 2. [38] Given a real number η and real matrices X, Y, U and W,

    [XUηWYηS{W}]<0

    holds if and only if both X<0 and X+S{YTU}<0 hold true.

    Proposition 3. [39] For any real matrices N1, N2 and N3,

    [N1N2N3]<0

    holds if and only if

    N3<0  and  N1N2N13NT2<0.

    We will give the following lemma, which provides a criterion for the analysis of the asymptotic stability and EPDAP.

    Lemma 1. Given scalars δ0,μ>1,ρ>0,γ>0 and ht>0, suppose that there is an LF Vς(t)(ψ(t),t):(Rn,Z+)R and two classes of functions β1(), β2()K such that

    β1(ψ(t))Vς(t)(ψ(t),t)β2(ψ(t)), (3.1)
    Vς(t)(ψ(t),t)μVς(t)(ψ(t),t), (3.2)
    ˙Vς(t)(ψ(t),t)ρVς(t)(ψ(t),t)+ϖ(t)2, (3.3)
    ϕ(t)2γ2Vς(t)(ψ(t),t) (3.4)

    hold. Then, for any PDT switching signal satisfying

    ε  (δ/ht+1)lnμρδ, (3.5)

    CTSS (2.1) is AS with the EPDAP level ˉγ=γμδ/ht+1.

    Proof. Denote by N(a,b) the count of switched times within any left-open time interval (a,b]. Then, for any t[tκ,tκ+1),κZ+, one has

    Vς(t)(ψ(t),t)μN(0,t)eρtVς(0)(ψ(0),0)+t0μN(σ,t)eρ(tσ)ϖ(σ)2dσ. (3.6)

    Inequality (3.6) can be shown by mathematical induction. In fact, for t(t0,t1) (i.e., κ=0), using Proposition 1, one can get from (3.3) that

    Vς(t)(ψ(t),t)=Vς(0)(ψ(t),t)eρtVς(0)(ψ(0),0)+t0eρ(tσ)ϖ(σ)2dσ.

    Because of N(σ,t)=0 for σ[t0,t), the inequality (3.6) obviously holds. For t[t1,t2) (i.e., κ=1), from (3.2) and (3.3), one can obtain

    Vς(t)(ψ(t),t)=Vς(t1)(ψ(t),t)eρ(tt1)Vς(t1)(ψ(t1),t1)+tt1eρ(tσ)ϖ(σ)2dσμeρ(tt1)Vς(0)(ψ(t1),t1)+tt1eρ(tσ)ϖ(σ)2dσ=μeρ(tt1){eρ(t10)Vς(0)(ψ(0),0)+t10eρ(t1σ)ϖ(σ)2dσ}+tt1eρ(tσ)ϖ(σ)2dσ=μeρtVς(0)(ψ(0),0)+μt10eρ(tσ)ϖ(σ)2dσ+tt1eρ(tσ)ϖ(σ)2dσ=μN(0,t)eρtVς(0)(ψ(0),0)+t0μN(σ,t)eρ(tσ)ϖ(σ)2dσ,

    which means that the inequality (3.6) is satisfied. Next, assume that (3.6) holds for t[tk,tk+1) (k>1,kZ+). Then, one can write the following inequality:

    Vς(tk)(ψ(t),t)μN(0,t)eρ(t0)Vς(0)(ψ(0),0)+t0μN(σ,t)eρ(tσ)ϖ(σ)2dσt[tk,tk+1). (3.7)

    For t[tk+1,tk+2), using (3.2) and (3.3) and noticing that N(0,t)=k+1, one has

    Vς(t)(ψ(t),t)=Vς(tk+1)(ψ(t),t)eρ(ttk+1)Vς(tk+1)(ψ(tk+1),tk+1)+ttk+1eρ(tσ)ϖ(σ)2dσμeρ(ttk+1)Vς(tk)(ψ(tk+1),tk+1)+ttk+1eρ(tσ)ϖ(σ)2dσ=μeρ(ttk+1)limttk+1Vς(tk)(ψ(t),t)+ttk+1eρ(tσ)ϖ(σ)2dσ.

    It follows from (3.7) that

    Vς(t)(ψ(t),t)μeρ(ttk+1)limttk+1{μN(0,t)eρ(t0)Vς(0)(ψ(0),0)+t0μN(σ,t)eρ(tσ)ϖ(σ)2dσ}+ttk+1eρ(tσ)ϖ(σ)2dσ=limttk+1{μeρ(ttk+1)μN(0,t)eρ(t0)Vς(0)(ψ(0),0)+μeρ(ttk+1)t0μN(σ,t)eρ(tσ)ϖ(σ)2dσ}+ttk+1eρ(tσ)ϖ(σ)2dσ=μN(0,t)eρtVς(0)(ψ(0),0)+tk+10μN(σ,t)eρ(tσ)ϖ(σ)2dσ+ttk+1μN(σ,t)eρ(tσ)ϖ(σ)2dσ=μN(0,t)eρtVς(0)(ψ(0),0)+t0μN(σ,t)eρ(tσ)ϖ(σ)2dσ,

    which means that (3.6) holds true for t[tk+1,tk+2).

    When ϖ(t)=0, for t>0, one obtains from (3.6) that

    Vς(t)(ψ(t),t)μN(0,t)eρtVς(0)(ψ(0),0), (3.8)

    which, together with

    0N(σ,t)(tσε+δ+1)(δ/ht+1) (3.9)

    results in

    Vς(t)(ψ(t),t)μδ/ht+1e(ρ(δ/ht+1)lnμε+δ)tVς(0)(ψ(0),0). (3.10)

    From (3.5), one can find that

    ρ(δ/ht+1)lnμε+δ0. (3.11)

    It follows from (3.1), (3.10) and (3.11) that

    β1(ψ(t))μδ/ht+1e(ρ(δ/ht+1)lnμε+δ)tβ2(ψ(0))μδ/ht+1β2(ψ(0)),

    which means that

    ψ(t)β11(μδ/ht+1β2(ψ(0))).

    Thus, CTSS (2.1) is AS in light of Definition 1.

    When ϖ(t)0, given that ψ(0)=0, from (3.6), one has

    Vς(t)(ψ(t),t)t0μN(σ,t)eρ(tσ)ϖ(σ)dσ,

    for any t>0, which, together with (3.4), yields that

    ϕ(t)2γ2t0μN(σ,t)eρ(tσ)ϖ(σ)2dσ. (3.12)

    From (3.9)–(3.12), one has

    ϕ(t)2γ2t0μ(tσε+δ+1)(δ/ht+1)eρ(tσ)ϖ(σ)2dσ=γ2μδ/ht+1t0e(ρ(δ/ht+1)lnuε+δ)(tσ)ϖ(σ)2dσˉγ2t0ϖ(σ)2dσ.

    Thus, CTSS (2.1) has the EPDAP level ˉγ according to Definition 2.

    Now, as in [40,41,42], we consider a state-feedback-based controller as

    u(t)=Kς(t)ψ(t). (3.13)

    Based on Lemma 1, a design approach of the controller in (3.13) is given as follows:

    Theorem 1. Given scalars δ0,μ>1,ρ>0,γ>0, θ>0 and ht>0, suppose that, for i1M, there exist matrices Pi1>0, Xi1 and Yi1 such that (3.5) and

    [Ω11Pi1Ei1Ω21I0θS{Xi1}]<0, (3.14)
    Pi1μPi2, (3.15)
    [Pi1GTi1γ2I]<0 (3.16)

    hold, where

    Ω11=S{Pi1Ai1+Bi1Yi1}+ρPi1,Ω21=Pi1Bi1Bi1Xi1+θYTi1.

    Then, CTSS (2.1) is AS with the EPDAP level ˉγ=γμδ/ht+1 if the controller gains are chosen as

    Ki1=X1i1Yi1,i1M. (3.17)

    Proof. Consider the LF

    Vς(t)(ψ(t),t)=ψT(t)Pς(t)ψ(t).

    Under the conditions of Pi1>0, Pi2>0 and (3.15), the conditions (3.1) and (3.2) hold true. For any ς(t)=i1, taking the derivative along CTSS (2.1), we have

    ˙Vi1(ψ(t),t)+ρVi1(ψ(t),t)ϖ(t)2=ψTϖ(t)Λi1ψϖ(t),

    where

    ψTϖ(t)=[ψT(t)ϖT(t)],Λi1=[S{Pi1(Ai1+Bi1Ki1)}+ρPi1Pi1Ei1I].

    Because Ki1=X1i1Yi1, we can obtain that S{Pi1Bi1Ki1}=S{Bi1Yi1+(Pi1Bi1Bi1Xi1)X1i1Yi1}. Then, utilizing Proposition 2, from (3.14) we have that Λi1<0, which means that (3.3) is satisfied. Furthermore, by applying Proposition 3 to (3.16), (3.4) in Lemma 1 can be guaranteed. Thus, from Lemma 1, CTSS (2.1) is AS with the EPDAP level ˉγ.

    The controller designed in (3.13) is time-independent. Next, we focus on the time-dependent design. The controller to be determined takes the form of

    u(t)=Kς(t),qtψ(t), (3.18)

    where qt is a time scheduler that takes values in N={0,,ε/ht}, described by

    qt={ttm(r)ht,t[tm(r),tm(r)+ε),εht,t[tm(r)+ε,tm(r)+1),ttηht,t[tm(r)+1,tm(r+1)) (3.19)

    with tηmaxtl[0,t]{tl}.

    The following result can be deduced from Lemma 1.

    Lemma 2. Given scalars δ0,μ>1,ρ>0,γ>0 and ht>0, suppose that, for t>0 and rZ+, there exists a QTD LF Vς(t)(ψ(t),qt):(Rn,Z+)R and two classes of functions β1(), β2()K such that

    β1(ψ(t))Vς(t)(ψ(t),qt)β2(ψ(t)), (3.20)
    ˙Vς(t)(ψ(t),qt)ρVς(t)(ψ(t),qt)+ϖ(t)2, (3.21)
    ϕ(t)2γ2Vς(t)(ψ(t),qt), (3.22)
    Vς(tm(r)+1)(ψ(tm(r)+κ),0){μVς(tm(r)+κ)(ψ(tm(r)+κ),Mε),κ=1,μVς(tm(r)+κ)(ψ(tm(r)+κ),Mr,κ1),κ=2,,nr+1 (3.23)

    hold, where

    Mε=εht,Mr,κ=δr,κht.

    Then, for any PDT switching signal satisfying (3.5), CTSS (2.1) is AS with the EPDAP level ˉγ=γμδ/ht+1.

    Proof. Let ˘Vς(t)(ψ(t),t)=Vς(t)(ψ(t),qt). Then, we deduce from (3.20)–(3.22) that

    β1(ψ(t))˘Vς(t)(ψ(t),t)β2(ψ(t)),˙˘Vς(t)(ψ(t),t)ρ˘Vς(t)(ψ(t),t)+ϖ(t)2,ϕ(t)2γ2˘Vς(t)(ψ(t),t),

    which correspond to (3.1), (3.3) and (3.4) in Lemma 1, respectively.

    Next, we need to prove that

    ˘Vς(t)(ψ(t),t)μ˘Vς(t)(ψ(t),t) (3.24)

    holds, which corresponds to (3.2) in Lemma 1. Obviously (3.24) holds true when t is not a switching instant. When t=tm(r)+1 (rZ+), from (3.23), we obtain

    ˘Vς(t)(ψ(t),t)=Vς(tm(r)+1)(ψ(tm(r)+1),qtm(r)+1)=Vς(tm(r)+1)(ψ(tm(r)+1),0)μVς(tm(r)+1)(ψ(tm(r)+1),Mε)=μVς(tm(r)+1)(ψ(tm(r)+1),qtm(r)+1)=μ˘Vς(t)(ψ(t),t),

    and for t=tm(r)+κ (κ=2,,nr+1,rZ+), we have

    ˘Vς(t)(ψ(t),t)=Vς(tm(r)+κ)(ψ(tm(r)+κ),qtm(r)+κ)=Vς(tm(r)+κ)(ψ(tm(r)+κ),0)μVς(tm(r)+κ)(ψ(tm(r)+κ),Mr,κ1)=μVς(tm(r)+κ)(ψ(tm(r)+κ),qtm(r)+κ)=μ˘Vς(t)(ψ(t),t).

    Thus, (3.24) also holds when t is a switching instant. The proof is finished.

    Then, based on Lemma 2, the desired QTD controller can be constructed according to the following theorem.

    Theorem 2. Given scalars δ0,μ>1,ρ>0,γ>0, θ>0 and ht>0, suppose that, for i1M, i2{0,,Mε1} and i3M, there exist matrices ˜Pi1,i2>0, ˜Pi1,Mε>0, Xi1,i2, Xi1,Mε, Yi1,i2 and Yi1,Mε satisfying

    [Ψ1i1i2˜Pi1,i2Ei1˜Pi1,i2Bi1Bi1Xi1,i2+θYTi1,i2I0θS{Xi1,i2}]<0, (3.25)
    [Ψ2i1i2˜Pi1,i2+1Ei1˜Pi1,i2+1Bi1Bi1Xi1,i2+θYTi1,i2I0θS{Xi1,i2}]<0, (3.26)
    [Ψ3i1Mε˜Pi1,MεEi1˜Pi1,MεBi1Bi1Xi1,Mε+θYTi1,MεI0θS{Xi1,Mε}]<0, (3.27)
    [˜Pi1,i2GTi1γ2I]<0, (3.28)
    [˜Pi1,i2+1GTi1γ2I]<0, (3.29)
    [˜Pi1,MεGTi1γ2I]<0, (3.30)

    and

    ˜Pi1,0μ˜Pi3,κ,κ=0,1,,Mε (3.31)

    for i1i3, where

    Ψ1i1i2=S(˜Pi1,i2Ai1+Bi1Yi1,i2)+1ht(˜Pi1,i2+1˜Pi1,i2)+ρ˜Pi1,i2,Ψ2i1i2=S(˜Pi1,i2+1Ai1+Bi1Yi1,i2)+1ht(˜Pi1,i2+1˜Pi1,i2)+ρ˜Pi1,i2+1,Ψ3i1Mε=S(˜Pi1,MεAi1+Bi1Yi1,Mε)+ρ˜Pi1,Mε.

    Then, for any PDT switching signal satisfying (3.5), the time-dependent controller in (3.18) can ensure that CTSS (2.1) is AS with the EPDAP level ˉγ=γμδ/ht+1 if the control gains are chosen as

    Ki1,i2=X1i1,i2Yi1,i2,i1M,i2N. (3.32)

    Proof. Define ηi2=i2ht. Then, the switching interval [tm(r),tm(r)+1) can be reformulated as

    [tm(r),tm(r)+1)=Mε1i2=0[tm(r)+ηi2,tm(r)+ηi2+1)[tm(r)+ηMε,tm(r)+1).

    Consider the following LF

    Vς(t)(ψ(t),qt)=ψT(t)P(ς(t),qt)ψ(t), (3.33)

    where

    P(ς(t),qt)={˜Pς(t),qt+(˜Pς(t),qt+1˜Pς(t),qt)φ(t),t[tm(r)+ηqt,tm(r)+ηqt+1),0qtMε1,˜Pς(t),Mε,t[tm(r)+ηMε,tm(r)+1),˜Pς(t),qt+(˜Pς(t),qt+1˜Pς(t),qt)φ(t),t[tm(r)+κ+ηqt,tm(r)+κ+ηqt+1),0qtMr,κ1,˜Pς(t),Mr,κ,t[tm(r)+κ+ηMr,κ,tm(r)+κ+1),φ(t)=t(tm(r)+κ+ηqt)ht, κ=1,2,,nr.

    Note that Vς(t)(ψ(t),qt) is continuous on [tm(r),tm(r+1)) and differentiable at ttm(r)+κ. Obviously, (3.20) is satisfied. In addition, (3.23) is guaranteed by (3.31).

    Next, we only need to show that (3.21) and (3.22) hold true for any t0. In order to simplify the notations, we take ς(t)=i1 and qt=i2. For any rZ+, when t[tm(r),tm(r)+ηMε), we can get from (3.33) that

    Vi1(ψ(t),i2)=ψT(t)(˜Pi1,i2+(˜Pi1,i2+1˜Pi1,i2)φ(t))ψ(t). (3.34)

    Then, we obtain

    ˙Vi1(ψ(t),i2)=2ψT(t)(˜Pi1,i2+(˜Pi1,i2+1˜Pi1,i2)φ(t))˙ψ(t)+1htψT(t)(˜Pi1,i2+1˜Pi1,i2)ψ(t). (3.35)

    According to CTSS (2.1) and (3.35), we have

    ˙Vi1(ψ(t),i2)+ρVi1(ψ(t),i2)ϖ(t)2=2ψT(t)(˜Pi1,i2+(˜Pi1,i2+1˜Pi1,i2)φ(t))((Ai1+Bi1Ki1,i2)ψ(t)+Ei1ϖ(t))+ρψT(t)˜Pi1,i2ψ(t)+ρψT(t)(˜Pi1,i2+1˜Pi1,i2)φ(t)ψ(t)+1htψT(t)(˜Pi1,i2+1˜Pi1,i2)ψ(t))ϖ(t)2=(1φ(t))(ψT(t)S(˜Pi1,i2(Ai1+Bi1Ki1,i2))ψ(t)+ψT(t)S(˜Pi1,i2Ei1)ϖ(t)+ρψT(t)˜Pi1,i2ψ(t)+1htψT(t)(˜Pi1,i2+1˜Pi1,i2)ψ(t)ϖ(t)2)+φ(t)(ψT(t)S(˜Pi1,i2+1(Ai1+Bi1Ki1,i2))ψ(t)+ψT(t)S(˜Pi1,i2+1Ei1)ϖ(t)+ρψT(t)˜Pi1,i2+1ψ(t)ϖ(t)2+1htψT(t)(˜Pi1,i2+1˜Pi1,i2)ψ(t))=(1φ(t))ψTϖ(t)Θ1i1i2ψϖ(t)+φ(t)ψTϖ(t)Θ2i1i2ψϖ(t), (3.36)

    where

    Θ1i1i2=[Θ11i1i2˜Pi1,i2Ei1I],Θ2i1i2=[Θ12i1i2˜Pi1,i2+1Ei1I],Θ11i1i2=S(˜Pi1,i2(Ai1+Bi1Ki1,i2))+1ht(˜Pi1,i2+1˜Pi1,i2)+ρ˜Pi1,i2,Θ12i1i2=S(˜Pi1,i2+1(Ai1+Bi1Ki1,i2))+1ht(˜Pi1,i2+1˜Pi1,i2)+ρ˜Pi1,i2+1.

    In addition, utilizing CTSS (2.1) and (3.34), we can get

    ϕ(t)2γ2Vi1(ψ(t),i2)=ψT(t)GTi1Gi1ψ(t)γ2ψT(t)(˜Pi1,i2+(˜Pi1,i2+1˜Pi1,i2)φ(t))ψ(t)=(1φ(t))ψT(t)(GTi1Gi1γ2˜Pi1,i2)ψ(t)+φ(t)ψT(t)(GTi1Gi1γ2˜Pi1,i2+1)ψ(t). (3.37)

    Similarly, when t[tm(r)+ηMε,tm(r)+1), we have from (3.33) that

    Vi1(ψ(t),Mε)=ψT(t)˜Pi1,Mεψ(t).

    This, together with CTSS (2.1), enables us to get that

    ˙Vi1(ψ(t),Mε)+ρVi1(ψ(t),Mε)ϖ(t)2=ψTϖ(t)Θ3i1Mεψϖ(t), (3.38)
    ϕ(t)2γ2Vi1(ψ(t),Mε)=ψT(t)(GTi1Gi1γ2˜Pi1,Mε)ψ(t), (3.39)

    where

    Θ3i1Mε=[S(˜Pi,Mε(Ai1+Bi1Ki1,Mε))+ρ˜Pi,Mε˜Pi,MεEi1I].

    Utilizing Proposition 2, we can deduce from (3.25)–(3.27) that

    Ψ1i1i2+S(U1i1i2X1i1,i2VTi1i2)<0, (3.40)
    Ψ2i1i2+S(U2i1i2X1i1,i2VTi1i2)<0, (3.41)
    Ψ3i1Mε+S(U3i1MεX1i1,MεVTi1Mε)<0, (3.42)

    where

    Ψ1i1i2=[Ψ1i1i2˜Pi1,i2Ei1I],Ψ2i1i2=[Ψ2i1i2˜Pi1,i2+1Ei1I],Ψ3i1i2=[Ψ3i1i2˜Pi1,MεEi1I],U1i1i2=[(˜Pi1,i2Bi1Bi1Xi1,i2)T0]T,U2i1i2=[(˜Pi1,i2+1Bi1Bi1Xi1,i2)T0]T,U3i1Mε=[(˜Pi1,MεBi1Bi1Xi1,Mε)T0]T,Vi1Mε=[Yi1,Mε0]T.

    From (3.32) and (3.40)–(3.42), we can obtain that Θ1i1i2<0, Θ2i1i2<0 and Θ3i1Mε<0, which, together with (3.36) and (3.38), ensure (3.21) for t[tm(r),tm(r)+1). In addition, by means of Proposition 3, (3.28)–(3.30), (3.37) and (3.39) ensure (3.22) for t[tm(r),tm(r)+1). Furthermore, due to the fact that Mr,κMε, (3.25)–(3.30) guarantee (3.21) and (3.22) for t[tm(r)+1,tm(r+1)). Thus, (3.21) and (3.22) hold true for any t[tm(r),tm(r+1)). Considering the arbitrariness of r, by Lemma 2, CTSS (2.1) is shown to be AS with the EPDAP level ˉγ=γμδ/ht+1. The proof is finished.

    Remark 2. As commonly reported in the literature on SSs with PDT switching (see, e.g., [43,44,45], the design strategy proposed in Theorem 1 is time-independent. In order to reduce conservativeness, Theorem 2 presents a QTD design strategy by incorporating the time scheduler qt effectively. The benefits of this approach will be demonstrated in Section 4. However, it may be worth noting that this improvement comes at the cost of increased computational complexity.

    Consider CTSS (2.1) subject to the following parameters:

    A1=[0.50.60.830.55],B1=[0.10.28],A2=[0.60.550.50.3],B2=[0.10.2],E1=[0.10.1],E2=[0.50.5],G1=[0.10.1],G2=[0.20.2].

    We set δ=2, ht=0.2 and θ=0.1. Then, by solving the LMIs of Theorems 1 and 2, respectively, we can get the comparison outcomes of the optimal EPDAP level ˉγmin for different values of ρ and μ, as described in Tables 1 and 2, respectively. From these two tables, we have two observations. First, when one of the values of ρ and μ is fixed, the optimal EPDAP level ˉγmin increases as the value of the other parameter increases. Second, when comparing the controller design method given in Theorem 1 with the one in Theorem 2, it is evident that the latter always yields better performance levels ˉγmin. This improvement can be attributed to the fact that the design method in Theorem 2 is QTD.

    Table 1.  Optimal EPDAP level ˉγmin for different values of ρ given μ=1.2.
    Method ˉγmin
    ρ=0.1 ρ=0.2 ρ=0.3 ρ=0.4 ρ=0.5
    Theorem 1 0.0849 0.0990 0.1182 0.1463 0.1917
    Theorem 2 0.0724 0.0837 0.0991 0.1210 0.1556

     | Show Table
    DownLoad: CSV
    Table 2.  Optimal EPDAP level ˉγmin for different values of μ given ρ=0.5.
    Method ˉγmin
    μ=1.25 μ=1.3 μ=1.35 μ=1.4 μ=1.45
    Theorem 1 0.2301 0.2741 0.3246 0.3821 0.4472
    Theorem 2 0.1845 0.2180 0.2567 0.3010 0.3515

     | Show Table
    DownLoad: CSV

    Next, we set ρ=0.4 and μ=1.1. By solving the LMIs of Theorem 2, we get the EPDAP level ˉγmin=0.0866 and the controller gains as follows:

    [K1,0K1,1K1,2K1,3]=[3.77750.55732.58360.77311.73091.78723.80811.3118],[K2,0K2,1K2,2K2,3]=[2.33770.49881.49271.49470.75622.33233.25630.2743].

    In the simulation, we take the exterior disturbance as ϖ(t)=e0.2tsin(2t) and set the initial value as ψ(0)=[52]T. Figures 24 show the trajectories of PDT switching mode ς(t), time scheduler qt and states of the closed-loop CTSS, respectively. It is evident from Figure 4 that the open-loop CTSS is unstable. The trajectories of the states and control input of the closed-loop CTSS are depicted in Figure 5. It is apparent that the curves tend to zero as time t, indicating that QTD controller (3.18) can ensure that the closed-loop CTSS is AS.

    Figure 2.  Trajectory of ς(t).
    Figure 3.  Trajectory of qt.
    Figure 4.  The trajectories of ψ(t) for the open-loop CTSS.
    Figure 5.  Trajectories of ψ(t) and u(t) for the closed-loop CTSS.

    At last, we introduce

    γ(t)=sups0{ϕ(s)2}t0ϖ(s)2ds.

    Figure 6 further describes the curve of γ(t) given that ψ(0)=[00]T. Apparently, γ(t) progressively converges to 0.0077, which is smaller than the optimal EPDAP level ˉγmin=0.0866. This shows the effectiveness of controller (3.18) in ensuring the EPDAP of the closed-loop CTSS.

    Figure 6.  Trajectory of γ(t).

    This work investigated the issue of energy-to-peak control for CTSSs with PDT switching. With the aid of an LF and a few decoupling techniques, a time-independent controller design approach was proposed in Theorem 1. To reduce conservatism, a QTD controller design method was further presented in Theorem 2. The required gains of these two types of controllers can be acquired by solving LMIs. Finally, an example was utilized to illustrate the validity of our controller design approaches.

    The controllers under consideration are based on full-state feedback, which utilizes state variables as feedback signals to generate control inputs. However, there are certain scenarios in which implementing such controllers becomes challenging because directly measuring all of the state variables is often difficult [46]. The issue of energy-to-peak control for CTSSs with PDT switching based on output feedback will be explored as an extension of the current work.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors declare there is no conflict of interest.



    [1]

    Kreyszig, E., Advanced Engineering Mathematics, 10th ed. 2011, USA: Wiley.

    [2]

    Fatoorehchi, H. and Rach, R., A method for inverting the Laplace transform of two classes of rational transfer functions in control engineering. Alexandria Engineering Journal, 2020, 59: 4879-4887.

    [3]

    Ha, W. and Shin C., Seismic random noise attenuation in the Laplace domain using SVD. IEEE Access, 2021, 9: 62037.

    [4]

    Grasso, F., Manetti, S., Piccirilli, M.C. and Reatti, A., A Laplace transform approach to the simulation of DC-DC converters. International Journal of Numerical Modelling: Electronic Networks, Devices and Fields, 2019, 32(5): e2618.

    [5]

    Han, H. and Kim, H., The solution of exponential growth and exponential decay by using Laplace transform. International Journal of Difference Equations, 2020, 15(2):191-195.

    [6]

    Huang, L., Deng, L., Li, A., Gao, R., Zhang, L. and Lei, W., A novel approach for solar greenhouse air temperature and heating load prediction based on Laplace transform. Journal of Building Engineering, 2021, 44: 102682.

    [7]

    Daci, A. and Tola, S., Laplace transform, application in population growth. International Journal of Recent Technology and Engineering, 2019, 8(2): 954-957.

    [8]

    Etzweiler, G. and S. Steele., The Laplace transformation of the impulse function for engineering problems. IEEE Transactions on Education, 1967, 10: 171-173.

    [9]

    Zill, D.G., A First Course in Differential Equations with Modeling Applications, 10th ed. 2013, Boston, USA: Cengage Learning.

    [10]

    Nise, N.S. Control Systems Engineering, 8th ed. 2019, USA: John Wiley & Sons.

    [11]

    AL-Khazraji, H., Cole, C. and Guo, W., Analysing the impact of different classical controller strategies on the dynamics performance of production-inventory systems using state space approach. Journal of Modelling in Management, 2018, 13(1): 211-235. https://doi.org/10.1108/JM2-08-2016-0071

    doi: 10.1108/JM2-08-2016-0071
    [12]

    AL-Khazraji, H., Cole, C. and Guo, W., Optimization and simulation of dynamic performance of production–inventory systems with multivariable controls. Mathematics, 2021, 9(5): 568. https://doi.org/10.3390/math9050568

    doi: 10.3390/math9050568
    [13]

    Guo, W.W., Advanced Mathematics for Engineering and Applied Sciences, 3rd ed. 2016, Sydney, Australia: Pearson.

    [14]

    Ngo, V. and Ouzomgi, S., Teaching the Laplace transform using diagrams. The College Mathematics Journal, 1992, 23(4): 309-312.

    [15]

    Holmberg, M. and Bernhard. J., University teachers' perspectives on the role of the Laplace transform in engineering education. European Journal of Engineering Education, 2017, 42(4): 413-428. https://doi.org/10.1080/03043797.2016.1190957

    doi: 10.1080/03043797.2016.1190957
    [16]

    Croft, A. and Davison, R., Engineering Mathematics, 5th ed. 2019, Harlow, UK: Pearson.

    [17]

    Greenberg, M.D., Advanced Engineering Mathematics. 2nd ed. 1998, Upper Saddle River, USA: Prentice Hall.

    [18]

    James, G., Modern Engineering Mathematics, 2nd ed. 1996, Harlow, UK: Addison-Wesley Longman.

    [19]

    Yeung, K.S. and Chung, W.D., On solving differential equations using the Laplace transform. International Journal of Electrical Engineering and Education. 2007, 44(4): 373-376.

    [20]

    Robertson, R.L., Laplace transform without integration. PRIMUS, 2017, 27(6): 606–617. https://doi.org/10.1080/10511970.2016.1235643

    doi: 10.1080/10511970.2016.1235643
    [21]

    Srivastava, H.M., Masjed-Jamei, M. and Aktas, R., Analytical solutions of some general classes of differential and integral equations by using the Laplace and Fourier transforms. Filomat, 2020, 34(9): 2869-2876. https://doi.org/10.2298/FIL2009869S

    doi: 10.2298/FIL2009869S
    [22]

    Guo, W., Unification of the common methods for solving the first-order linear ordinary differential equations. STEM Education, 2021, 1(2): 127-140. https://doi.org/10.3934/steme.2021010

    doi: 10.3934/steme.2021010
    [23]

    Guo, W., Li, W. and Tisdell, C.C., Effective pedagogy of guiding undergraduate engineering students solving first-order ordinary differential equations. Mathematics, 2021, 9(14):1623. https://doi.org/10.3390/math9141623

    doi: 10.3390/math9141623
    [24]

    Garner, B. and Garner, L., Retention of concepts and skills in traditional and reformed applied calculus. Mathematics Education Research Journal, 2001, 13: 165-184.

    [25]

    Kwon, O.N., Rasmussen, C. and Allen, K., Students' retention of mathematical knowledge and skills in differential equations. School Science and Mathematics, 2005,105: 227-239.

  • This article has been cited by:

    1. Chuanyao Li, Yichao Lu, Yuqiang Wang, Gege Jiang, Congestion behavior and tolling strategies in a bottleneck model with exponential scheduling preference, 2022, 31, 2688-1594, 1065, 10.3934/era.2023053
    2. Zhiyong Qian, Wangsen Xiao, Shulan Hu, The generalization ability of logistic regression with Markov sampling, 2023, 31, 2688-1594, 5250, 10.3934/era.2023267
  • Reader Comments
  • © 2021 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2681) PDF downloads(204) Cited by(2)

Figures and Tables

Figures(11)  /  Tables(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog