Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Weighted salp swarm algorithm with deep learning-powered cyber-threat detection for robust network security

  • Received: 05 March 2024 Revised: 23 April 2024 Accepted: 25 April 2024 Published: 22 May 2024
  • MSC : 68T05, 68T40, 90C59

  • The fast development of the internet of things has been associated with the complex worldwide problem of protecting interconnected devices and networks. The protection of cyber security is becoming increasingly complicated due to the enormous growth in computer connectivity and the number of new applications related to computers. Consequently, emerging intrusion detection systems could execute a potential cyber security function to identify attacks and variations in computer networks. An efficient data-driven intrusion detection system can be generated utilizing artificial intelligence, especially machine learning methods. Deep learning methods offer advanced methodologies for identifying abnormalities in network traffic efficiently. Therefore, this article introduced a weighted salp swarm algorithm with deep learning-powered cyber-threat detection and classification (WSSADL-CTDC) technique for robust network security, with the aim of detecting the presence of cyber threats, keeping networks secure using metaheuristics with deep learning models, and implementing a min-max normalization approach to scale the data into a uniform format to accomplish this. In addition, the WSSADL-CTDC technique applied the shuffled frog leap algorithm (SFLA) to elect an optimum subset of features and applied a hybrid convolutional autoencoder (CAE) model for cyber threat detection and classification. A WSSA-based hyperparameter tuning method can be employed to enhance the detection performance of the CAE model. The simulation results of the WSSADL-CTDC system were examined in the benchmark dataset. The extensive analysis of the accuracy of the results found that the WSSADL-CTDC technique exhibited a better value of 99.13% than comparable methods on different measures.

    Citation: Maha M. Althobaiti, José Escorcia-Gutierrez. Weighted salp swarm algorithm with deep learning-powered cyber-threat detection for robust network security[J]. AIMS Mathematics, 2024, 9(7): 17676-17695. doi: 10.3934/math.2024859

    Related Papers:

    [1] Wenpeng Zhang, Jiafan Zhang . The hybrid power mean of some special character sums of polynomials and two-term exponential sums modulo p. AIMS Mathematics, 2021, 6(10): 10989-11004. doi: 10.3934/math.2021638
    [2] Xi Liu . Some identities involving Gauss sums. AIMS Mathematics, 2022, 7(2): 3250-3257. doi: 10.3934/math.2022180
    [3] Xiaoxue Li, Wenpeng Zhang . A note on the hybrid power mean involving the cubic Gauss sums and Kloosterman sums. AIMS Mathematics, 2022, 7(9): 16102-16111. doi: 10.3934/math.2022881
    [4] Wenpeng Zhang, Xiaodan Yuan . On the classical Gauss sums and their some new identities. AIMS Mathematics, 2022, 7(4): 5860-5870. doi: 10.3934/math.2022325
    [5] Jinmin Yu, Renjie Yuan, Tingting Wang . The fourth power mean value of one kind two-term exponential sums. AIMS Mathematics, 2022, 7(9): 17045-17060. doi: 10.3934/math.2022937
    [6] Wenjia Guo, Xiaoge Liu, Tianping Zhang . Dirichlet characters of the rational polynomials. AIMS Mathematics, 2022, 7(3): 3494-3508. doi: 10.3934/math.2022194
    [7] Xue Han, Tingting Wang . The hybrid power mean of the generalized Gauss sums and the generalized two-term exponential sums. AIMS Mathematics, 2024, 9(2): 3722-3739. doi: 10.3934/math.2024183
    [8] Xiaoge Liu, Yuanyuan Meng . On the k-th power mean of one kind generalized cubic Gauss sums. AIMS Mathematics, 2023, 8(9): 21463-21471. doi: 10.3934/math.20231093
    [9] Xuan Wang, Li Wang, Guohui Chen . The fourth power mean of the generalized quadratic Gauss sums associated with some Dirichlet characters. AIMS Mathematics, 2024, 9(7): 17774-17783. doi: 10.3934/math.2024864
    [10] Jianghua Li, Xi Zhang . On the character sums analogous to high dimensional Kloosterman sums. AIMS Mathematics, 2022, 7(1): 294-305. doi: 10.3934/math.2022020
  • The fast development of the internet of things has been associated with the complex worldwide problem of protecting interconnected devices and networks. The protection of cyber security is becoming increasingly complicated due to the enormous growth in computer connectivity and the number of new applications related to computers. Consequently, emerging intrusion detection systems could execute a potential cyber security function to identify attacks and variations in computer networks. An efficient data-driven intrusion detection system can be generated utilizing artificial intelligence, especially machine learning methods. Deep learning methods offer advanced methodologies for identifying abnormalities in network traffic efficiently. Therefore, this article introduced a weighted salp swarm algorithm with deep learning-powered cyber-threat detection and classification (WSSADL-CTDC) technique for robust network security, with the aim of detecting the presence of cyber threats, keeping networks secure using metaheuristics with deep learning models, and implementing a min-max normalization approach to scale the data into a uniform format to accomplish this. In addition, the WSSADL-CTDC technique applied the shuffled frog leap algorithm (SFLA) to elect an optimum subset of features and applied a hybrid convolutional autoencoder (CAE) model for cyber threat detection and classification. A WSSA-based hyperparameter tuning method can be employed to enhance the detection performance of the CAE model. The simulation results of the WSSADL-CTDC system were examined in the benchmark dataset. The extensive analysis of the accuracy of the results found that the WSSADL-CTDC technique exhibited a better value of 99.13% than comparable methods on different measures.



    The walking system of biped robot is a complex dynamic system with multi variables and strong coupling, which makes the research of robot in different walking environments challenging. Passive dynamic walking (PDW), which was proposed by McGeer [1], provides new ideas for walking dynamics of biped robot. The passive dynamic walking robot can walk stably on a gentle slope without any input. In recent years, most of the research on walking dynamics concerns robots on downhill or flat road, while only little has addressed robots climbing stairs. The results about robot walking dynamics on downhill or flat road are very rich. For example, bifurcations and the chaotic behavior of passive dynamic biped robots were discussed in [2], a combination of feedback linearization and finite-time controllers was used to control the walking posture and the stability of the whole behavior was investigated by analysis of a one-dimensional Poincaré map [3]. However, little is known about the walking dynamics of biped robot climbing stairs. This work focuses on biped robot climbing stairs.

    Human walking is a complex mechanical motion powered by the activity of numerous muscles. For humanoid robot, it is necessary to consider what kind of drive to compensate energy loss caused by heel strike and make it walk more stably and effectively in different environments [4,5,6]. Different types of driving forces are added to the ankles of robots to simulate the positive ankle push-off during human walking. For example, Daniel et al. [7] considered a simple model based on spring-mass-running with a compliant ankle joint, Zelik et al. [8] and Chen et al.[9] studied a simple dynamic walking model with feet and series elasticity at the ankle joint. The authors utilized non-instantaneous spring thrust added at the ankle to compensate for collision losses. In recent research, impulsive thrust is considered to provide driving force for robot. This driving force can provide effective power to a compass model on level ground [10,11]. The results of simple two-dimensional (2-D) models with impulsive thrust show that such thrust (ankle push-off) can minimize energy consumption and is a promising driving method for biped robot [12].

    In the past, different kinds of robots, such as wheeled robot [13], tracked robot [14], hexapod robot[15] and so on, have been used to investigate walking dynamics of stair ascending. Bipedal robot, which is closer to human behavior, is considered as an important one investigating walking dynamics of stair ascending. A virtual slope method, which regards the stairs as a virtual slope, was proposed to discuss walking trajectory planning on stairs for biped robots [16]. In 1999, Shih et al. designed a 7-DOF biped robot BR-1 with a simplest bipedal structure, which has two variable-length legs for simulating knee joints of human walking and a translatable balance weight in the body for stair climbing[17]. Its walking stability was insured by large feet and carefully controlling the position of the center of gravity. Figliolini et al. developed a biped robot EP-WAR2 with a suitable binary pneumatic actuation and used external control elements like suction cups to ensure equilibrium of the biped while walking or climbing stairs [18]. For the biped robot with multi joints, the complex structure and multi degrees of freedom make the research of walking dynamics more difficult[19,20,21]. Moreover, stair ascending, so far, is still studied for biped robot as challengeable topics. The theoretical analysis of dynamic stability during stair ascending has been still scarcely involved.

    In the process of climbing stairs, the leg structure of bipedal robot is required to be flexible enough to avoid the scuffing problem between the bottom of the foot and the stairs. Telescopic legs can successfully complete the movement of ascending stairs, for example, Asano discussed a modified mechanism for a parametric excitation using telescopic legs and considered this biped robot to ascent stairs by utilizing the hybrid actuation effect [22]. A unifying framework to study energy-efficient optimal gaits for a bipedal model with telescopic legs and without elastic elements on different support surfaces such as level ground, sloped or staircase is discussed in [23].

    There are many research methods and results on the dynamics of robots walking on slope and level ground. For example, stability of periodic gaits, limit cycle, chaos, and bifurcations of robot walking are well investigated [24,25,26,27], a method of linearization is used to build Poincaré map for PDW [28,29], linear inverted pendulum model is used to discuss biped robots walking [30]. However, the research on the walking of stair climbing biped robot with telescopic legs and impulse thrust is difficult and very challenging at present, and most of the research conclusions are numerical results. Non-smooth system exists widely in the real world and has complex dynamic behavior [31]. The model of ascending stair biped robot with telescopic legs and impulse thrust belongs to the category of non-smooth system and needs to be further investigated theoretically. For an ascending stair biped model, the clear dynamic information, such as the transition during different phase of the stair ascending, the dynamic equation during swing phase and so on, is critical to plan the motion of the robot's two legs. Motivated by these facts, walking dynamics of a ascending stair biped robot with telescopic legs and impulse thrust is discussed in this paper. The research focuses on calculation of torque to ensure robot walking and on theoretical analysis of the existence of periodic gaits.

    This paper is organized as follows: In Section 2, a model of ascending stair biped robot with telescopic legs and impulse thrust is proposed. Theoretical analysis of complex walking dynamics of the ascending stair biped model is given in Section 3. Simulation results are given in Section 4 and this paper is concluded in Section 5.

    The model of ascending stair biped robot, which contains a hip joint and two rigid legs with massless telescoping actuator, is illustrated in Figure 1. The length of supporting leg is Lst and the length of non-supporting leg is Lsw. For simplicity, we assume that the mass of the biped robot is distributed as three units, namely, ankle joints of two legs (m) and hip joint (mH), where mHm. The variable-length legs is set to serve as knee joints for ascending stairs. The variables θ and γ represent the angles of the supporting (stance) and non-supporting (swing) leg relative to the ground of vertical, respectively. The length and height of the stair are 2S and H, respectively. α is the angle between two legs and is given as α=θγ.

    Figure 1.  Schematic representation of the model of ascending stair biped robot.

    During swing phase, we assume that the frictional coefficient is large enough to prevent sliding between the stance foot and the floor, and the foot of the stance leg is always on the ground. The robot starts from the initial posture with two feet placed in the middle of the stairs and the stride length of the robot is fixed to 2S. The projection of the hip joint is located at the boundary of the stair. We assume that the process of collision between the swinging legs and the ground is modeled as the collision of two rigid bodies. After the impact, the stance leg abandons the ground without any interaction with the ground.

    The remaining joint below the ankle, which is used to keep balance of the robot during ascending and whose mass is ignored, is called the heel of the ascending stair biped. The mass of telescoping actuator is merged into that of ankle joint. The actuator can make the leg stretch to a specific length in a short time, while not generating additional impulse force to make the leg bounce from the ground.

    As shown in Figure 2, the four phases separate one step into two continuous phases and two instantaneous process, namely, the swing phase before stretching of the stance leg (Ⅰ and Ⅱ), the instantaneous stretching phase of the stance leg (Ⅱ and Ⅲ), the swing phase after stretching of the stance leg (Ⅲ and Ⅳ), the impact conditions (Ⅳ).

    Figure 2.  The walking process of one step of ascending stair biped robot. The stance leg is represented in blue and the swing leg is represented in red. The black arrow on the swing leg indicates the swing direction of the leg.

    Let q=[θγ] be the vector of generalized coordinates of the ascending stair biped model. The two continuous phases of bipedal robot walking model can be represented by the following nonlinear differential equations according to the Lagrangian dynamics.

    Fi=ddtL˙qi Lqi,  (1)

    where L(q,˙q )=K(q,˙q )V(q) is the Lagrange equation defined by the kinetic energy (K) and potential energy (V) in the system. Fi is the generalized force applied to the mass points.

    At the instantaneous stretching phase of the stance leg and the impact instant with the stair, the state variable of the system undergo two transient variations according to the law of conservation of angular momentum.

    The first phase(Ⅰ–Ⅱ). The bipedal robot starts climbing with the initial state, namely, θ=θ0, γ=γ0 and Lst=Lsw=l0. The behavior of this phase is similar to that of swing phase of a simple two link biped. This phase lasts until θ=0 (the stance leg perpendicular to the stair). It follows from (1) that

    M1(q)¨q+C1(q,˙q)˙q+G1(q)=B1u,  (2)

    where M1 is the inertia matrix, C1 includes Coriolis and centrifugal terms, G1 includes gravity forces, B1 is the input matrix, u is the torque vector. They are given as follows.

    M1(q)=[(1+ρ)l02ρl02cos(θγ)l02cos(θγ)l02],
    C1(q,˙q)=[0ρl02sin(θγ)˙γl02sin(θγ)˙θ0],
    G1(q)=[g(1+ρ)l0sinθgl0sinγ],  B1=1mH[011ρ1ρ],   u=[u1u2]T,

    where ρ=mmH, the torques u1 and u2 are applied to the hip joint and the ankle joints of stance during this phase, respectively.

    The second phase (Ⅱ and Ⅲ). The instantaneous phase occurs when the stance leg perpendicular to the stair, which is defined by the following set.

    ¯HS1={qR2:θ=0}. (3)

    There is no change in the angular momentum just before and after the stretching phase and the length of the stance leg is varied from l0 to L0, where L0 is the maximum leg length. The transition rules at the moment are given as follows.

    q+=q,  ˙q+=Se(q)˙q, (4)

    where the subscripts and represent just after and just before this instantaneous phase, respectively. Se(q)=(Q+1(α))1Q1(α) with α=θγ=θ+γ+,

    Q1=[(1+ρ)l02ρl02cos(α)ρl02(1cos(α))l02cos(α)l02],

    and

    Q+1=[(1+ρ)L20ρl0L0cos(α)ρl02(1cos(α))l0L0cos(α)l02].

    The third phase (Ⅲ and Ⅳ). The stance leg continues swinging around the ankle joint until the swing leg and the stair are about to collide. Unlike first phase, the two legs are not equal in length in this phase. The dynamics of this phase can be expressed as follows.

    M2(q)¨q+C2(q,˙q)˙q+G2(q)=B2u, (5)

    where

    M2(q)=[L20+ρl02ρl0L0cos(θγ)l0L0cos(θγ)l02],   u=[u3u4]T,
    C2(q,˙q)=[0ρl0L0sin(θγ)˙γl0L0sin(θγ)˙θ0],
    G2(q)=[g(1+ρ)L0sinθgl0sinγ],   B2=1mH[011ρ1ρ].

    The forth phase (Ⅳ). In this instantaneous process, in order to let the biped robot have enough energy during the next period gait, we apply impulse force p on the the stance leg, which follows the direction of this leg. Moreover, for avoiding the scuffing problem, the length of the new swing leg is shortened to l0 at the moment of role switch between the two legs, as well as its heel is retracted. The impact phase occurs for the three following mathematical conditions are satisfied.

    ¯HS2={Υ1(q)=L0cosθl0cosγ=H,Υ2(q,˙q)=l0˙γsinγL0˙θsinθ<0,Υ3(q)=l0sinγL0sinθ=2S, (6)

    where Υ2(q,˙q)=dΥ1(q)dt=Υ1(q)q˙q. Condition (6) ensures that the swing leg reaches the stair, is moving downward, and is in front of the stance leg and the mass points of two legs are 2S apart.

    In this impact phase, impulse thrust p along the direction of the stance leg is used to provide the power. Instantaneous collision switching model for bipedal robots with impulse thrust is shown in Figure 3. One can calculate that

    L0=(l20S2+H)2+S2, (7)
    θ=γ+=arcsinSL0,γ=θ+=arcsinSl0.
    Figure 3.  Instantaneous collision switching model for bipedal robots, (a) the moment of just before role switch between two legs, (b) the moment of just after role switch between the two legs. The length of the new swing leg is shortened to l0 and its heel is retracted.

    It follows from v+=l0˙θ+,v=L0˙θ that

    ˙θ+=L0l0˙θcos(θγ)+pmHl0sin(θγ).

    According to the momentum theorem, the following algebraic expression is obtained.

    ˙γ+=(1L0l0+l0L0)˙θ+cos(θ+γ+).

    The transition of the impact phase can be expressed as follows.

    [θγ˙θ˙γ]+=[0100100000s33000s430][θγ˙θ˙γ]+[00w3w4]p, (8)

    where s33=L0l0cos(α), s43=(1L0l0+l0L0)cos(α+)s33, w3=1mHl0sin(α), and w4=(1L0l0+l0L0)mHl0sin(α)cos(α+).

    Equations (2), (4), (5) and (8) and conditions (3) and (6) represent different parts of the walking dynamics of ascending stair biped model in one step. Thus the complete walking dynamics of the ascending stair biped model can be represented as an impulsive hybrid system consisting of multiple continuous nonlinear differential equations and multiple discrete algebraic mappings.

    Let X=(q ˙q)T=(θ γ ˙θ ˙γ)T=(x1 x2 x3 x4)T be the state vector. In view of (2)–(8), the impulsive hybrid system is described as follows.

    {˙X=f1(X),XΩ1,X+=Δ1(X),XHS1,˙X=f2(X),XΩ2,X+=Δ2(X)+g(X)p,XHS2,. (9)

    where

    fi(X)=[˙qMi(q)1(Ci(q,˙q)+Gi(q)Biu)],i=1,2,
    Δ1(X)=[I2×2O2×2O2×2Se(X)]X,  Δ2(X)=[0100100000s33000s430]X,  g=[00w3w4],
    HS1={XR4|G(X)=x1=0},HS2={XR4|Υ1(X)=h,Υ2(X)<0,Υ3(X)=2S}. (10)

    Ω1 and Ω2 denote the state space of the swing phase before and after stretching of the stance leg, respectively.

    Choose the following hyperplane as the Poincaré section.

    Σ={XR4|x1=arcsinSl0, x2=arcsinSL0}. (11)

    Let Xk=(arcsinSl0, arcsinSL0, x3k, x4k)T be the initial point of X(t), where Xk=X(0)Σ.

    As shown in Figure 4, the trajectory X(t) starting from Xk reaches the point  Xk1= (0, x2k1, x3k1, x4k1)T=X(τ1) at t=τ1, and jumps to Xk2= (0, x2k2, x3k2, x4k2)T=X(τ+1) in the plane HS1, where Xk2=Δ1(Xk1).

    Figure 4.  The trajectory X(t) of system (9) starting from the initial point Xk and returning to Poincaré section Σ.

    The trajectory X(t) reaches the point  Xk3= (arcsinSL0, arcsinSl0, x3k3, x4k3)T in the plane HS2 at t=τ1+ τ2 under the action of torques, where Xk3=X(τ1+ τ2). Then it jumps to Xk+1=(arcsinSl0, arcsinSL0, x3(k+1), x4(k+1))T in Poincaré section Σ due to the effect of impulse thrust p and role exchange of two legs.

    Hence we obtain the following Poincaré map.

    Xk+1=F(Xk). (12)

    However, due to the fact that the impulsive hybrid nonlinear dynamics of the system (9) includes two nonlinear differential equations, it is difficult to obtain explicit expression of τ1, τ2, and solutions to (9), especially to ensure the trajectory X(t) intersects the plane HS2 at t=τ1+ τ2, namely, the two conditions x1(τ1+ τ2)=arcsinSL0 and x2(τ1+ τ2)=arcsinSL0 hold at the same time. Hence, the Poincaré map (12) can be used for numerically simulation of the complex dynamic behavior of system (9), but not for theoretical analysis of walking dynamics. In order to solve the above problems, we linearize system (9), obtain an explicit map, and discuss the walking dynamics of ascending stair biped robot.

    For simplicity, we denote basic unit ι by ιΔ=l0g. By dimensionless and linearizing the Eqs (2) and (5) around the equilibrium point q=˙q=O2×2, we have

    {¨θθ=u2¨γ(θγ)=u1+u2ρu2,
    {¨θgL0θ=u4¨γ(θγ)=u31d21u4ρ+L0gu4.

    where ui=uil20mH(i=1,2,3), u4=u4L20mH, d1=l0L0.

    Hence system (9) can be rewritten as

    {˙X=(x3(t),x4(t),x1(t)u2,x1(t)x2(t)+u1+u2ρu2)T,XΩ1,X+=˜Δ1(X),XHS1,˙X=(x3(t),x4(t),gL0x1(t)+u4,x1(t)x2(t)+u31d21u4ρ+L0gu4)T,XΩ2,X+=Δ2(X)+g(X)p,XHS2, (13)

    where ˜Δ1(x)=[I2×2O2×2O2×2˜Se(x)]x, ˜Se=[L200l0L0cos(α)l20]1[l200l20cos(α)l20], and the input torques u2=e2, and u4=e4 are constant.

    Now set the initial point as A+k=(θ0, γ0, x3k0, x4k0)T, where x4k0=cosα0(11d1+d1)x3k0, α0=θ0γ0, x3k0 represents the initial angular velocity of the kth step of the robot's stance leg. As shown in Figure 5, the trajectory of system (13) starting from A+k reaches the point Bk(0, x2(τ1), x3(τ1), x4(τ1))T in HS1 at t=τ1, and jumps to B+k via the algebraic equation in (13), where

    B+k=(0, x2(τ1), d21x3(τ1), cosα1(d11)x3(τ1)+x4(τ1))T,
    Figure 5.  The solution of system (13) from the initial point Ak=(θ0, γ0, x3k0, x4k0)T in x1(x3)x2(x4) space.

    and α1=x1(τ1)x2(τ1)=x2(τ1).

    For t[0,τ1], the solution of (13) is

    {x1(t)=θ0e2+x3k02et+θ0e2x3k02et+e2,x2(t)=(γ0u1+e2ρθ0e22)cost+((11d1+d1)cosα012)x3k0sint+θ0e2+x3k04et+θ0e2x3k04et+u1+e2ρ,x3(t)=θ0e2+x3k02etθ0e2x3k02et,x4(t)=(γ0u1+e2ρθ0e22)sint+((11d1+d1)cosα012)x3k0cost+θ0e2+x3k04etθ0e2x3k04et. (14)

    It follows from T (x(τ1))=x1(τ1)=0 that

    τ1=lne2x23k0θ20+2θ0e2θ0e2+x3k0. (15)

    For convenient calculation and analysis, assume x2(τ1)=γ1 is constant under the action of unknown torque u1 and definite torque u2=e2. So we obtain

    u1=[γ1(γ0e2ρθ0e22)cosτ1cosα0((11d1+d1)12)x3k0sinτ1+ρ22ρe2]ρ1cosτ1. (16)

    Suppose that the trajectory reaches the point Ak+1=(γ0, θ0, x3(τ1+τ2), x4(τ1+τ2)) in the plane HS2 at t=τ1+τ2, and jumps to A+k+1. Similarly, for t(τ1,τ1+τ2], the solution of (13) is

    {x1(t)=C5egL0(tτ1)+C6egL0(tτ1)L0ge4,x2(t)=C7cos(tτ1)+C8sin(tτ1)1d21ρe41ρu3+L0L0+g(C5egL0(tτ1)+C6egL0(tτ1)),x3(t)=gL0C5egL0(tτ1)gL0C6egL0(tτ1),x4(t)=C7sin(tτ1)+C8cos(tτ1)+L0L0+ggL0(C5egL0(tτ1)C6egL0(tτ1)), (17)

    where

    C5=L02ge4Z1, C6=L02ge4+Z1,
    C7=Z2cosτ1+Z3sinτ1+Z5, C8=Z2sinτ1+Z3cosτ1+Z6,
    Z1=d212L0gx23k0θ20+2θ0e2, Z2=γ0u1+e2ρθ0e22,
    Z3=cosα0((11d1+d1)12)x3k0, Z5=e22+u1+e2ρ+Z4e4+1ρu3,
    Z4=L20g(L0+g)+1d21ρ, Z6=(l20(L0+g)L0(d11)cosα112)x23k0θ20+2θ0e2,
    Z7=L0L0+g(L02ge4Z1), Z8=L0L0+g(L02ge4+Z1).

    It follows from Ak+1=(γ0, θ0, x3(τ1+τ2), x4(τ1+τ2))THS2 that x1(τ1+τ2)=γ0 and x2(τ1+τ2)=θ0. Hence

    τ2=L0glnγ0+L0ge44Z21+γ20+2γ0L0ge4L0ge42Z1, (18)
    u3=[θ0L0L0+gγ0+Z4e4(Z2sinτ1+Z3cosτ1+Z6)sinτ2(Z2cosτ1+Z3sinτ1e22+u1+e2ρ+Z4e4)cosτ2]ρcosτ21. (19)

    Set the values of the torques u1 and u3 according to conditions (16) and (19). It follows that x1(τ1+τ2)=γ0 and x2(τ1+τ2)=θ0 hold at the same time, which enables two legs to exchange smoothly and ensures the realization of climbing stairs. The following result is obtained.

    Proposition 1. Given the values of torque u2 and u4 in system (13) and set the initial point as A+k=(θ0, γ0, x3k0, x4k0)T, where x4k0=cosα0(11d1+d1)x3k0. To ensure the realization of climbing stairs, the torque u1 and u3 are determined by (16) and (19), respectively. The time of each step is τ1+τ2, where τ1 and τ2 are shown in (15) and (18), respectively.

    In the above subsection, Ak+1=(γ0, θ0, x3(τ1+τ2), x4(τ1+τ2))T in the plane HS2. It follows from Ak+1 and X+=Δ2(X)+g(X)p (XHS2) that

    A+k+1=(θ0, γ0, cos(α0)d1x3(τ1+τ2)+pmHl0sin(α0),cosα0(11d1+d1)[1d1cos(α0)x3(τ1+τ2)+pmHl0sin(α0)])T,

    where x3(τ1+τ2)=4gL0Z21+gL0γ20+2γ0e4.

    The previous literature considered the constant impulse thrust [10,11], but the change of velocity should be considered in the implementation of impulse thrust. Since the impulse thrust is constrained by control amplitude [32], we consider the following impulse thrust with velocity dependent and amplitude constraint.

    p=b|sinx3k0|+c, (20)

    where bR, cR, and |p||b|+|c|.

    Together with the points A+k and A+k+1, we obtain the following result.

    {x3(k+1)0=b|sinx3k0|+cmHl0sin(α0)cos(α0)d14gL0Z21+gL0γ20+2γ0e4,x4(k+1)0=cosα0(11d1+d1)x3(k+1)0,

    where Z1=d212L0gx23k0θ20+2θ0e2.

    Now consider the following map.

    x3(k+1)0=b|sinx3k0|+cmHl0sin(α0)cos(α0)d14gL0Z21+gL0γ20+2γ0e4, (21)

    Let the fixed point of map (21) is x3d, then

    x3d=b|sinx3d|+cmHl0sin(α0)cos(α0)d14gL0Z21+gL0γ20+2γ0e4,

    where Z1=d212L0gx23dθ20+2θ0e2.

    One fixed point sd of map (21) corresponds to one periodic gait of (13), which starts from the point A+k=(θ0, γ0, x3d, x4d)T and returns to the point A+k after time τ1d+τ2d under the action of torques u1d and u3d, where x4d=cosα0(11d1+d1)x3d,

    τ1d=lne2x23dθ20+2θ0e2θ0e2+x3d,
    τ2d=L0glnγ0+L0ge44Z21+γ20+2γ0L0ge4L0ge42Z1,
    u1d=[γ1(γ0e2ρθ0e22)cosτ1dcosα0((11d1+d1)12)x3dsinτ1d+ρ22ρe2]ρ1cosτ1d,u3d=[θ0L0L0+gγ0+Z4e4(Z2sinτ1d+Z3cosτ1d+Z6)sinτ2d(Z2cosτ1d+Z3sinτ1de22+u1d+e2ρ+Z4e4)cosτ2d]ρcosτ2d1.

    In particular, set e2=θ02, e4=γ02d22 (γ0<0) in (13), where d2=L0g. It follows from map (21) that

    x3(k+1)0=cos(α0)d1|x3k0|+b|sinx3k0|+cmHl0sin(α0)=h(x3k0). (22)

    Note that x3d<0 and α0(0, π2), the fixed point of map (22) is the solution of equation

    x3d=d1cosα0 x3db|sinx3d|+cmHl0sinα0. (23)

    Now construct a function σ1(y) as follows.

    σ1(y)=(1d1cosα0)y+b|siny|+cmHl0sinα0, (24)

    where c(0, +).

    For y=0,

    σ1(0)=cmHl0sinα0>0. (25)

    For y=π2,

    σ1(π2)=π2(1d1cosα0)+b+cmHl0sinα0<0, (26)

    under condition

    b<c+πmHl02sinα0(1d1cosα0):=b1. (27)

    The function σ1(y) is continuous for y[π2,0]. It follows from

    b<mHl0sinα0(1d1cosα0):=b2, (28)

    that

    σ1(y)=(1d1cosα0)bcosymHl0sinα0>0.

    So σ1(y) is a monotonically increasing function and there is only one root of equation σ1(y)=0 for b<min{b1, b2}. There is an unique fixed point in map (22) and hence there is an unique periodic gait in system (13) for e2=θ02, e4=γ02d22 (γ0<0), and b<min{b1, b2}. Thus we obtain the following result.

    Proposition 2. Set e2=θ02, e4=γ02d22 in system (13). There is an unique periodic gait for b<min{b1, b2}, where b1 and b2 are shown in (27) and (28), respectively.

    Now expand the range of parameter e4 and discuss existence of periodic solution of system (13). Set e2=θ02, e4(γ02d22, 0). The fixed point of map (21) is the solution of the following equation.

    x3d=cosα0d1d14x23d+2γ0e4+γ20d22b|sinx3d|+cmHl0sinα0. (29)

    Construct function σ2(y) as follows.

    σ2(y)=y+cosα0d1d14y2+2e4γ0+γ20d22+b|siny|+cmHl0sinα0, (30)

    where c(0, [π2+cosα0d1π2d144+2γ20d22]mHl0sinα0) and α0(0, π2).

    It follows from e4(γ02d22,0) that

    2γ20d22>2γ0e4+γ20d22>γ20d22>0, (31)

    and

    σ2(y)=y+cosα0d1d14y2+2e4γ0+γ20d22+b|siny|+cmHl0sinα0>y+cosα0d1d14y2+b|siny|+cmHl0sinα0=(1d1cosα0)y+b|siny|+cmHl0sinα0=σ1(y).

    So σ2(0)>σ1(0)>0.

    For y=π2,

    σ2(π2)=π2+cosα0d1π2d144+2e4γ0+γ20d22+b+cmHl0sinα0<π2+cosα0d1π2d144+2γ20d22+b+cmHl0sinα0<0

    under condition (31) and

    b<[π2+cosα0d1π2d144+2γ20d22]mHl0sinα0c:=b3. (32)

    It follows from y(π2, 0) and (31) that

    d14y2+2e4γ0+γ20d22>2e4γ0+γ20d22>γ0d2,
    yd14y2+2e4γ0+γ20d22>πd22γ0,

    and

    σ2(y)=1+d31cosα0yd14y2+2e4γ0+γ20d22bcosymHl0sinα0>0,

    under condition

    b<(1+πd31d22γ0cosα0)mHl0sinα0:=b4. (33)

    σ2(y) is monotonically increasing for y(π2,0).

    For y(0, +), σ2(y)> 0 under condition 0<b<b4. In view of σ2(0)>0, σ2(y)>0 for y(0, +).

    For y(, π2), we have

    d41(1d21cos2α0)y2+2e4γ0+γ20d22>0,
    1+d31cosα0yd14y2+2e4γ0+γ20d22> 0,

    and y+cosα0d1d14y2+2e4γ0+γ20d22 is monotonically increasing, so we obtain

    σ2(y)<y+cosα0d1d41y2+2e4γ0+γ20d22+b+cmHl0sinα0<σ2(π2)<0,

    under condition 0<b<b3.

    There is only one root of equation σ2(y)=0 for <y<+, which means that there is an unique fixed point in map (22) and hence there is an unique periodic gait in system (13) for e2=θ02, e4(γ02d22, 0), and 0<b<min{b3,b4}. The following result is obtained.

    Proposition 3. Set e2=θ02, e4(23d2γ0, 0) in system (13). There is an unique periodic gait for 0<b<min{b3, b4}, where b3 and b4 are shown in (32) and (33), respectively.

    As mentioned in the above subsection, one fixed point x3d of map (21) corresponds to one periodic gait of (13). Now we discuss stability of this periodic gait of (13).

    In view of (21), the eigenvalue of the fixed point x3d is

    λd=h(x3d)=sd(x23dθ20+2θ0e2)4Z21d22+γ20d22+2γ0e4d31cos(α0)+brcosx3d+cmHl0sin(α0), (34)

    where r={1,x3d(2nπ, (2n1)π),1,x3d((2n1)π, 2(n1)π), nN. The periodic gait of (13) is stable for |λd|<1.

    Proposition 2 shows that system (13) has an unique periodic gait for some conditions. It follows from map (22) that the eigenvalue of the fixed x3d is

    λd=h(x3d1)=d1cosα0+bcosx3dmHl0sinα0. (35)

    This periodic gait is stable for |λd|<1, namely

    1<d1cosα0+bcosx3dmHl0sinα0<1,
    1d1cosα0sinα0cosx3dmHl0<b<1d1cosα0sinα0cosx3dmHl0.

    Note that cosx3d(0,1), it follows that

    mHl0sinα0(1d1cosα0)<b<mHl0sinα0(1d1cosα0). (36)

    So system (12) has a unique stable period-1 gait for b22mHl0sinα0<b<min{b1, b2}.

    Let (x3d, b5) be the solution to the following equations.

    {x3d=d1cosα0 x3db|sinx3d|+cmHl0sinα0,d1cosα0+bcosx3dmHl0sinα0=1. (37)

    It follows from (35) that λd=1 for b=b5. An eigenvalue with -1 is associated with a flip bifurcation. So (x3d, b5) is a candidate for flip bifurcation point in map (22).

    Now use the following lemma [27] to discuss the stability and direction of bifurcation of period-1 gait.

    Lemma 1. Let fμ:RR be a one-parameter family of maps such that fμ has a fixed point sd with eigenvalue 1. Assume that the following two conditions hold.

    fμ2f2s+22fμs0, ˜a=12f2ss+13fsss0.

    Then, there is a smooth curve of fixed points of fμ passing through (sd,μd), the stability of which changes at (sd,μd). There is also a smooth curve β passing through (sd,μd) so that β(sd,μd) is a union of hyperbolic period2 orbits.

    In map (22), if the following condition holds,

    hb2h2x+22hbx0, ˜a=12h2xx+13hxxx>0, (38)

    at (b5, x3d2), a flip bifurcation occurs at b=b5. System (13) has a stable period-2 gait for b(b5, b5+ϵ), where ϵ>0. Consequently, we obtain the following result.

    Proposition 4. Set e2=θ02, e4=γ02d22 in system (13). There is an unique stable periodic gait for b22mHl0sinα0<b<min{b1, b2}, where b1 and b2 are shown in (27) and (28), respectively. A flip bifurcation occurs at b=b5 under condition (38) and system (13) has a stable period-2 gait for b(b5, b5+ϵ), where ϵ>0 and b5 is the solution to (37).

    To discuss the complex dynamics of system (13), the values of some parameters are given in Table Ⅰ.

    Table 1.  The values of some parameters in system (13).
    l0 L0 m mH g H S
    1 1.0787 0.5 10 0.98 0.1 0.64

     | Show Table
    DownLoad: CSV

    Now first investigate the existence and stability of period-1 gaits of linearized system (13) with θ0=0.6945 rad, γ0=0.6351 rad, and c=3.

    Set u2=e2=0.34725,u4=e4=0.256, γ1=0.4. It follows from (16), (19), (27) and (28) that u1=0.26, u3=0.12, b19.59, and b28.02, respectively. Set b=4.8, where b<min{b1, b2}. System (13) has a period-1 gait, which starts from the initial point Ad=(0.6945, 0.6351, 0.79, 0.16)T, reaches Bd=(0, 0.4, 0.79, 2.08)T at t=τ1=0.94, jumps to B+d=(0, 0.4, 0.68, 2.14)T, reaches Ad=(0.6351, 0.6945, 0.71, 1.7)T at t=τ1+τ2=1.918, and jumps to Ad. The portrait in x1x3 space and time series of xi (i=1,2,3,4) are shown in Figure 6, which is in agreement with Proposition 2.

    Figure 6.  For system (13) with b=4.8, c=3, γ1=0.4, u1=0.26, u2=0.34725, u3=0.12, u4=0.256, (a) the period1 gait in x2x4 space, (b) time series of xi (i=1,2,3,4).

    Set u2=e2=0.34725, u4=e4=0.07, where e4(23d2γ0, 0). It follows from (16), (19), (32) and (33) that u1=0.275, u3=0.24, b32.05, b44.96, respectively. Set γ1=0.9, b=2, where 0<b<min{b3, b4}. As shown as Figure 7, system (13) has a period-1 gait, which is in agreement with Proposition 3.

    Figure 7.  For system (13) with b=2, c=3, γ1=0.9, u1=0.275, u2=0.34725, u3=0.24, u4=0.07, (a) the period1 gait in x1(x3)x2(x4) space, (b) time series of xi (i=1,2,3,4).

    Set b=6.7, γ1=0.4, u1=0.298, u2=0.25, u3=0.183, u4=0.13. In view of the map (22), we can find x3d11.1, |λd|<1, and the fixed point Ad=(0.6945, 0.6351, 1.1, 0.23)T by numerical calculation. It's seen from Figure 8(a) that there exists a period-1 gait starting from Ad in system (13). In Figure 8(b), a gait starting from the point (0.6945, 0.6351, 0.97, 0.195)T tends to the period-1 gait with t increasing, which means that the period-1 gait is stable.

    Figure 8.  For system (13) with b=6.7, c=3, γ1=0.4, u1=0.298, u2=0.25, u3=0.183, u4=0.13, (a) the period-1 gait starting from Ad(0.6945, 0.6351, 1.1, 0.23)T, (b) gaits starting from the points Ad and (0.6945, 0.6351, 0.97, 0.195)T.

    By viewing b as a parameter, the bifurcation diagram, which can well show the dynamic characteristics of system (13) with (θ0,γ0)=(0.6945, 0.6351), c=3, γ1=0.4, u2=0.25, u4=0.13, is shown in Figure 9. A period-2 gait bifurcates from the period-1 gait at b19.095 and the period-2 gait is stable for b(19.095, 23.752). The numerical results shown in Figures 8 and 9 are in agreement with Proposition 4.

    Figure 9.  Bifurcation diagram of system (13) with c=3, γ1=0.4, u2=0.25, u4=0.13, b[5, 28].

    As shown in Figure 10(a)(c), there exists a stable period-2 gait in system (13) with b=22, c=3, γ1=0.4, u2=0.25, u4=0.13. In Figure 10(d), a gait starting from the point (0.6945, 0.6351, 2.7, 0.547)T tends to the period-1 gait with t increasing, which means that the period-2 gait is stable. The values of x3k0, u1, u3 of this period-2 gait of iteration number n are given in Figure 11.

    Figure 10.  For system (13) with b=22, c=3, γ1=0.4, u2=0.25, u4=0.13, (a) period-2 gait in the x1x2x3 space, (b) period2 gait in x1(x3)x2(x4) space, (c) time series of x1 and x3 and time series of x2 and x4, (d) period gait 2 and a gait starting from the point (0.6945, 0.6351, 2.7, 0.547)T.
    Figure 11.  For linearized system (13) with b=22, c=3, γ1=0.4, u2=0.25, u4=0.13, (a) values of x3k0 of iteration number n with n=50, (b) values of u1, u3 of iteration number n with n=50.

    Set b=24.4, c=3, γ1=0.4, u2=0.25, u4=0.13. A period-4 gait is given in Figure 12.

    Figure 12.  For linearized system (13) with b=24.4, c=3, γ1=0.4, u2=0.3, u4=0.13, (a) the period-4 gait in x1x2x3 space, (b) period-4 gait in x1(x3)x2(x4) space.

    Let b=26 in system (13). Figure 13 shows a chaotic portrait of system (13) with c=3, γ1=0.4, u2=0.25, u4=0.13. The numerical results in Figures 1013 are in agreement with bifurcation diagrams in Figure 9.

    Figure 13.  For linearized system (13) with b=26, c=3, γ1=0.4, u2=0.25, u4=0.13, (a) the chaos gait in the x1x2x3 space, (b) the chaos gait in x1(x3)x2(x4) space.

    Now discuss the effect of torque on bifurcation of system (13). In Figure 9, a period-2 gait bifurcates from the period-1 gait at b19.095 for u2=0.25. Set u2(1)=1.25 and u2(2)=1.25. It's seen from Figure 14 that the occurrence of bifurcation is delayed to b20.324 for u2(2)=1.25 and advanced to b18.653 for u2(1)=1.25.

    Figure 14.  Bifurcation diagrams of system (13) with c=3, γ1=0.4, u2=0.25 (u2(1)=1.25, u2(2)=1.25), u4=0.13, b[14, 28].

    The above numerical results show that the linearized system (13) has complex dynamic behavior. Through the study of linearized system, we can roughly understand the dynamic properties of nonlinear system (9). For b=7.8, c=3, a stable period1 gait of linearized system (9) is shown in Figure 7. When the parameters b and c are slightly disturbed, nonlinear system (9) still has a stable period1 gait. Figure 15 shows a stable period-1 gait of nonlinear model for b=8.6, c=3, u1=3.32, u2=2.5, u3=2.4 and u4=1.3, where the fixed point is Xd=[qT, ˙qT]T=[0.6945, 0.6351, 1, 0.2037]T. Stick diagram of system (9) in Figure 16 clearly illustrates the process of ascending stairs of this robot.

    Figure 15.  For nonlinear system (9) with b=8.6, c=3, u1=3.32, u2=2.5, u3=2.4 and u4=1.3, (a) the period-1 gait in x1(x3)x2(x4) space, (b) time series of xi (i=1,2,3,4).
    Figure 16.  Stick diagram of system (9) with b=8.6, c=3, u1=3.32, u2=2.5, u3=2.4 and u4=1.3, and the initial point [0.6945, 0.6351,  1, 0.2037]T.

    The model of biped robot with knee joints [33] is more complex than that of straight legs biped robot. Now, we use the impulse thrust (20) to drive a biped robot with knee joints to walk upwards along slope. The walking process of this bipedal robot with knee joints is divided into four stages, namely, the knee-free phase, the knee strike phase, the knee-locked phase and heel strike. The modeling of up sloped bipedal robot with knee joints is shown in Appendix.

    Set a1=0.375, a2=0.175, b1=0.125, b2=0.325, ms=0.05, mt=0.5, mh=0.5, ls=0.5, lt=0.5,L=1, u1=3.2, u2=0.27, u3=0.003 in this dynamic model of up sloped bipedal robot with knee joints. Set b=3.12, c=1 in impulse thrust (20). Figure 17 shows a stable period1 gait of the up sloped bipedal robot with knee joints. The stick diagram Figure 18 clearly illustrates the process of walking upwards along a slope of this robot.

    Figure 17.  For the up sloped bipedal robot with knee joints with a1=0.375, a2=0.175, b1=0.125, b2=0.325, ms=0.05, mt=0.5, mh=0.5, ls=0.5, lt=0.5,L=1, b=3.12, c=1, (a) the period-1 gait, (b) time series of angular and angular angular velocity.
    Figure 18.  Stick diagram of the up sloped bipedal robot with knee joints with a1=0.375, a2=0.175, b1=0.125, b2=0.325, ms=0.05, mt=0.5, mh=0.5, ls=0.5, lt=0.5,L=1, b=3.12, c=1, and the initial point [0.3, 0.2, 0.2, 2, 0.0155, 0.0155]T. Black dotted lines for stance leg, red solid lines for swing shank, blue solids for the swing thigh and blue dotted lines for the swinging leg during the knee-lock phase.

    In this study, telescopic legs and impulse thrust were considered to build a walking model of stair climbing biped robot. The nonlinear ascending stair biped model was linearized and an one-dimensional discrete map was obtained. The conditions for the existence and stability of period-1 gait were obtained by this one-dimensional discrete map. Flip bifurcation was investigated. Numerical simulation, such as phase diagram of period-1 gait, period-2 gait and period-4 gait, the bifurcation diagram, were given in an example.

    The relationship among the torques ui (i=1,2,3,4) and the initial point (θ0, γ0, x3k0, x4k0)T was investigated through theoretical analysis. We first give the initial point and the torques ui (i=2,4), and then calculate the value of ui (i=1,3), which enable two legs to exchange smoothly and ensure the realization of climbing stairs.

    The parameter b play an important role in the ascending stair biped robot model. Proposition 4 gives the interval (b22mHl0sinα0, min{b1, b2}) of parameter b that makes system has a stable period-1 gait in theory. Figure 9 shows that system has a stable period-1 gait for b(5, 19.095). We can choose the appropriate value of b such that the stair climbing biped robot walk stably with period-1 gait.

    We can adjust the value of torques to broaden the interval of parameter b of the existence of stable period-1 gait. Figure 14 shows that the interval of parameter b of the existence of stable period-1 gait is b(5, 18.653), b(5, 19.095), and b(5, 20.324) for u2=1.25, u2=0.25, and u2=1.25, respectively. Obviously, under certain conditions, the larger the value of parameter u2, the wider the interval of parameter b for the stair climbing biped robot to walk stably with period-1 gait.

    Theoretical analysis and numerical simulation results obtained in this study provide a theoretical basis for stable walking of ascending stair biped robot with periodic gaits.

    This work is jointly supported by the National Natural Science Foundation of China (11662001), the Science Foundation of Guangxi Province (2018GXNSFAA138177), the Young and Middle-aged Teachers Ability Promotion Project of Guangxi District (2019KY0228), and the Graduate innovation program of Guilin University of Electronic Technology (2021YCXS112).

    The authors declare there is no conflicts of interest.

    The model contains a hip joint and two legs with knee joints. The length of each leg is L which is divided into two parts (L=ls+lt), where ls is the distance between the knee and the heel and lt is the distance between the knee and the hip. For simplicity, we assume that the mass of the biped robot is distributed as three units, namely, shanks of two legs (ms), shanks of two legs (mt) and hip joint (mh), where mhms(mh). Shanks and thighs are divided into two parts, ls=a1+b1 and lt=a2+b2, where a1 (resp. b1) is the distance between the sub-mass center ms and the heel (resp. knee), and a2 (resp. b2) is the distance between the sub-mass center mt and the knee(resp. hip). The variables q1, q2 and q3 represent the angles of the stance leg, the swing thigh and the swing shank relative to the ground of vertical, respectively.

    1) Knee-free phase

    The following nonlinear dynamics of the biped robot during the knee-free swinging phases is

    J(q)¨q+H(q,˙q)˙q+G(q)=B3u,  (39)

    where J is the inertia matrix, H includes Coriolis and centrifugal terms, G includes gravity forces,

    B3 is the input matrix, u is the torque vector. They are given as follows.

    J(q)=[J11J12J13J21J22J23J31J32J33],
    H(q,˙q)=[0H12˙q2H13˙q3H21˙q10H23˙q3H31˙q1H32˙q20],
    G(q)=[G1G2G3],  B3=[110010001],   u=[u1u2u3]T,
    J11=msa21+mt(ls+a2)2+(mh+ms+mt)L2,J12=(mtb2+mslt)Lcos(q2q1),J13=msb1Lcos(q3q1),J21=J12,J22=mtb22+msl2t,J23=msltb1cos(q3q2),J31=J13,J32=J23,J33=msb21,H12=(mtb2+mslt)Lsin(q1q2),H13=msb1Lsin(q1q3),H21=H12,H23=msltb1sin(q3q2),H31=H13,H32=H23,G1=(msa1+mt(ls+a2)+(mh+ms+mt)L)gsin(q1),G2=(mtb2+mslt)gsin(q2),G3=msb1gsin(q3),

    where the torques u1, u2 and u3 are applied to the hip joint, the ankle joints of stance during this phase and the knee of swing leg, respectively.\\

    2) Knee strike phase

    For the knee strike phase, the collision condition is

    q2=q3.  (40)

    At the impact, a conservation of the angular momentum exists and leads to the following expression.

    Q+1(q+)˙q+=Q1(q)˙q,  (41)

    where q+=[q+1q+2]T, q=[q1q2q3]T, and

    Q+1(q)=[Q+1,11Q+1,12Q+1,21Q+1,22],Q1(q)=[Q1,11Q1,12Q1,13Q1,21Q1,22Q1,23],
    Q+1,11=Q+1,21+mt(ls+a2)2+(mh+mt+ms)L2+msa21,Q+1,12=Q+1,21+mt(lt+b1)2+mtb22,Q+1,22=ms(lt+b1)2+mtb22,Q1,11=Q1,21+(mt+ms+mh)L2+msa21+mt(ls+a2)2,Q1,12=(mslt+mtb2)Lcos(α1)+msb1ltcos(α3)+mtb22+msl2tQ1,13=msb1Lcos(α2)+msb1ltcos(α3)+msb21,Q1,21=(mslt+mtb2)Lcos(α1)msb1Lcos(α2),Q1,22=msb1ltcos(α3)+msl2t+mtb22,Q1,23=msb1ltcos(α3)+msb21,α1=q1q2α2=q1q3,α3=q2q3.

    3) Knee-locked phase

    The moving pattern of this phase is similar to the third phase(Ⅲ-Ⅳ) of the ascending stair biped robot, so the kinetic equation of this phase is similar to Eq (2).

    4) Heel strike

    For the heel strike phase, the collision condition is given by the following expression:

    q1+q22φ=0,  (42)

    where φ(φ>0) is the angle of the slope.

    In this impact phase, impulse thrust p along the direction of the stance leg is used to provide the power. It follows that

    ˙q1+=˙q1cos(q1q2)+pmhLsin(q1q2).  (43)

    According to the momentum theorem, the following algebraic expression is obtained.

    ˙q2+=(msa1(lt+b1)mtb2(ls+a2))˙q2+(ms(lt+b1)+mtb1)Lcos(q1q2)˙q1+.  (44)


    [1] M. A. Ferrag, O. Friha, L. Maglaras, H. Janicke, L. Shu, Federated deep learning for cyber security in the internet of things: Concepts, applications, and experimental analysis, IEEE Access, 9 (2021), 138509–138542. https://doi.org/10.1109/ACCESS.2021.3118642 doi: 10.1109/ACCESS.2021.3118642
    [2] Y. Li, Y. Zuo, H. Song, Z. Lv, Deep learning in security of internet of things, IEEE Internet Things J., 9 (2022), 22133–22146. https://doi.org/10.1109/JIOT.2021.3106898 doi: 10.1109/JIOT.2021.3106898
    [3] A. Salih, S. T. Zeebaree, S. Ameen, A. Alkhyyat, H. M. Shukur, A survey on the role of artificial intelligence, machine learning and deep learning for cybersecurity attack detection, In: 2021 7th International engineering conference"Research & innovation amid global pandemic" (IEC), IEEE, 2021, 61–66. https://doi.org/10.1109/IEC52205.2021.9476132
    [4] Z. Z. Xian, F. Zhang, Image real-time detection using LSE-Yolo neural network in artificial intelligence-based internet of things for smart cities and smart homes, Wirel. Commun. Mob. Com., 2022 (2022), 2608798. https://doi.org/10.1155/2022/2608798 doi: 10.1155/2022/2608798
    [5] A. D. Raju, I. Y. Abualhaol, R. S. Giagone, Y. Zhou, S. Huang, A survey on cross-architectural IoT malware threat hunting, IEEE Access, 9 (2021), 91686–91709. https://doi.org/10.1109/ACCESS.2021.3091427 doi: 10.1109/ACCESS.2021.3091427
    [6] B. Jothi, M. Pushpalatha, Wils-trs—A novel optimized deep learning based intrusion detection framework for IoT networks, Pers. Ubiquit. Comput., 27 (2023), 1285–1301. https://doi.org/10.1007/s00779-021-01578-5 doi: 10.1007/s00779-021-01578-5
    [7] P. Dixit, S. Silakari, Deep learning algorithms for cybersecurity applications: A technological and status review, Comput. Sci. Rev., 39 (2021), 100317. https://doi.org/10.1016/j.cosrev.2020.100317 doi: 10.1016/j.cosrev.2020.100317
    [8] D. Chen, P. Wawrzynski, Z. Lv, Cyber security in smart cities: A review of deep learning-based applications and case studies, Sustain. Cities Soc., 66 (2021), 102655. https://doi.org/10.1016/j.scs.2020.102655 doi: 10.1016/j.scs.2020.102655
    [9] R. Ahmad, I. Alsmadi, Machine learning approaches to iot security: A systematic literature review, Internet Things, 14 (2021), 100365. https://doi.org/10.1016/j.iot.2021.100365 doi: 10.1016/j.iot.2021.100365
    [10] E. Bout, V. Loscri, A. Gallais, How machine learning changes the nature of cyberattacks on iot networks: A survey, IEEE Commun. Surv. Tutor., 24 (2022), 248–279. https://doi.org/10.1109/COMST.2021.3127267 doi: 10.1109/COMST.2021.3127267
    [11] E. H. Houssein, D. Oliva, N. A. Samee, N. F. Mahmoud, M. M. Emam, Liver cancer algorithm: A novel bio-inspired optimizer, Comput. Biol. Med., 165 (2023), 107389. https://doi.org/10.1016/j.compbiomed.2023.107389 doi: 10.1016/j.compbiomed.2023.107389
    [12] S. Li, H. Chen, M. Wang, A. A. Heidari, S. Mirjalili, Slime mould algorithm: A new method for stochastic optimization, Future Gener. Comp. Syst., 111 (2020), 300–323. https://doi.org/10.1016/j.future.2020.03.055 doi: 10.1016/j.future.2020.03.055
    [13] X. Zhou, Y. Chen, Z. Wu, A. A. Heidari, H. Chen, E. Alabdulkreem, et al., Boosted local dimensional mutation and all-dimensional neighborhood slime mould algorithm for feature selection, Neurocomputing, 551 (2023), 126467. https://doi.org/10.1016/j.neucom.2023.126467 doi: 10.1016/j.neucom.2023.126467
    [14] G. Wang, Moth search algorithm: A bio-inspired metaheuristic algorithm for global optimization problems, Memetic. Comp., 10 (2018), 151–164. https://doi.org/10.1007/s12293-016-0212-3 doi: 10.1007/s12293-016-0212-3
    [15] Y. Yang, H. Chen, A. A. Heidari, A. H. Gandomi, Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts, Expert Syst. Appl., 177 (2021), 114864. https://doi.org/10.1016/j.eswa.2021.114864 doi: 10.1016/j.eswa.2021.114864
    [16] J. C. Butcher, G. Wanner, Runge-kutta methods: Some historical notes, Appl. Numer. Math., 22 (1996), 113–151. https://doi.org/10.1016/S0168-9274(96)00048-7 doi: 10.1016/S0168-9274(96)00048-7
    [17] J. Tu, H. Chen, M. Wang, A. H. Gandomi, The colony predation algorithm, J. Bionic Eng., 18 (2021), 674–710.
    [18] I. Ahmadianfar, A. A. Heidari, S. Noshadian, H. Chen, A. H. Gandomi, INFO: An efficient optimization algorithm based on weighted mean of vectors, Expert Syst. Appl., 195 (2022), 116516. https://doi.org/10.1016/j.eswa.2022.116516 doi: 10.1016/j.eswa.2022.116516
    [19] A. A. Heidari, S. Mirjalili, H. Faris, I. Aljarah, M. Mafarja, H. Chen, Harris hawks optimization: Algorithm and applications, Future Gener. Comp. Syst., 97 (2019), 849–872. https://doi.org/10.1016/j.future.2019.02.028 doi: 10.1016/j.future.2019.02.028
    [20] H. Su, D. Zhao, A. A. Heidari, L. Liu, X. Zhang, M. Mafarja, et al., RIME: A physics-based optimization, Neurocomputing, 532 (2023), 183–214. https://doi.org/10.1016/j.neucom.2023.02.010 doi: 10.1016/j.neucom.2023.02.010
    [21] Y. Li, D. Zhao, C. Ma, J. Escorcia-Gutierrez, N. O. Aljehane, X. Ye, CDRIME-MTIS: An enhanced rime optimization-driven multi-threshold segmentation for covid-19 X-ray images, Comput. Biol. Med., 169 (2024), 107838. https://doi.org/10.1016/j.compbiomed.2023.107838 doi: 10.1016/j.compbiomed.2023.107838
    [22] A. Yazdinejad, M. Kazemi, R. M. Parizi, A. Dehghantanha, H. Karimipour, An ensemble deep learning model for cyber threat hunting in industrial internet of things, Digit. Commun. Netw., 9 (2023), 101–110. https://doi.org/10.1016/j.dcan.2022.09.008 doi: 10.1016/j.dcan.2022.09.008
    [23] I. A. Khan, N. Moustafa, D. Pi, K. M. Sallam, A. Y. Zomaya, B. Li, A new explainable deep learning framework for cyber threat discovery in industrial iot networks, IEEE Internet Things J., 9 (2022), 11604–11613. https://doi.org/10.1109/JIOT.2021.3130156 doi: 10.1109/JIOT.2021.3130156
    [24] I. Bibi, A. Akhunzada, N. Kumar, Deep AI-powered cyber threat analysis in IIOT, IEEE Internet Things J., 10 (2023), 7749–7760. https://doi.org/10.1109/JIOT.2022.3229722 doi: 10.1109/JIOT.2022.3229722
    [25] S. Das, Y. Manchala, S. K. Rout, S. K. Panda, Deep learning and metaheuristics based cyber threat detection in internet of things enabled smart city environment, 2023. http://dx.doi.org/10.21203/rs.3.rs-3141258/v1
    [26] R. Wei, L. Cai, L. Zhao, A. Yu, D. Meng, DeepHunter: A graph neural network based approach for robust cyber threat hunting, In: Security and privacy in communication networks, Springer, 398 (2021), 3–24. https://doi.org/10.1007/978-3-030-90019-9_1
    [27] A. N. Ndife, Y. Mensin, W. Rakwichian, P. Muneesawang, Cyber-security audit for smart grid networks: An optimized detection technique based on bayesian deep learning, J. Internet Serv. Inf. Secur., 12 (2022), 95–114. https://dx.doi.org/10.22667/JISIS.2022.05.31.095 doi: 10.22667/JISIS.2022.05.31.095
    [28] M. A. Ferrag, D. Hamouda, M. Debbah, L. Maglaras, A. Lakas, Generative adversarial networks-driven cyber threat intelligence detection framework for securing internet of things, In: 2023 19th International conference on distributed computing in smart systems and the internet of things (DCOSS-IoT), IEEE, 2023,196–200. https://doi.org/10.1109/DCOSS-IoT58021.2023.00042
    [29] T. Elangovan, S. Sukumaran, S. Muthumarilakshmi, An efficient recurrent neural network based classification method for cyber threat detection analysis, J. Alebr. Stat., 13 (2022), 5514–5520.
    [30] Y. Zhou, B. Yang, H. Hou, L. Zhang, T. Wang, M. Hu, Continuous leakage-resilient identity-based encryption with tight security, Comput. J., 62 (2019), 1092–1105. https://doi.org/10.1093/comjnl/bxy144 doi: 10.1093/comjnl/bxy144
    [31] J. Xu, S. H. Park, X. Zhang, A bio-inspired motion sensitive model and its application to estimating human gaze positions under classified driving conditions, Neurocomputing, 345 (2019), 23–35. https://doi.org/10.1016/j.neucom.2018.09.093 doi: 10.1016/j.neucom.2018.09.093
    [32] Y. Li, W. G. Cui, H. Huang, Y. Z. Guo, K. Li, T. Tan, Epileptic seizure detection in EEG signals using sparse multiscale radial basis function networks and the fisher vector approach, Knowledge Based Syst., 164 (2019), 96–106. https://doi.org/10.1016/j.knosys.2018.10.029 doi: 10.1016/j.knosys.2018.10.029
    [33] Y. Chen, L. Feng, C. Zheng, T. Zhou, L. Liu, P. Liu, et al., LDANet: Automatic lung parenchyma segmentation from CT images, Comput. Biol. Med., 155 (2023), 106659. https://doi.org/10.1016/j.compbiomed.2023.106659 doi: 10.1016/j.compbiomed.2023.106659
    [34] S. B. Lin, Generalization and expressivity for deep nets, IEEE Trans. Neural Netw. Learn. Syst., 30 (2019), 1392–1406. https://doi.org/10.1109/TNNLS.2018.2868980 doi: 10.1109/TNNLS.2018.2868980
    [35] Q. Pham, B. Mohammadi, R. Moazenzadeh, S. Heddam, R. P. Zolá, A. Sankaran, et al., Prediction of lake water-level fluctuations using adaptive neuro-fuzzy inference system hybridized with metaheuristic optimization algorithms, Appl. Water Sci., 13 (2023), 13. https://doi.org/10.1007/s13201-022-01815-z doi: 10.1007/s13201-022-01815-z
    [36] R. Dash, R. Dash, R. Rautray, An evolutionary framework-based microarray gene selection and classification approach using binary shuffled frog leaping algorithm, J. King Saud Univ. Comput. Inf. Sci., 34 (2022), 880–891. https://doi.org/10.1016/j.jksuci.2019.04.002 doi: 10.1016/j.jksuci.2019.04.002
    [37] M. Mafarja, T. Thaher, M. A. Al-Betar, J. Too, M. A. Awadallah, I. A. Doush, et al., Classification framework for faulty software using enhanced exploratory whale optimizer-based feature selection scheme and random forest ensemble learning, Appl. Intell., 53 (2023), 18715–18757. https://doi.org/10.1007/s10489-022-04427-x doi: 10.1007/s10489-022-04427-x
    [38] P. Bedi, P. Gole, Plant disease detection using hybrid model based on convolutional autoencoder and convolutional neural network, Artif. Intell. Agric., 5 (2021), 90–101. https://doi.org/10.1016/j.aiia.2021.05.002 doi: 10.1016/j.aiia.2021.05.002
    [39] M. A. Syed, R. Syed, Weighted salp swarm algorithm and its applications towards optimal sensor deployment, J. King Saud Univ. Comput. Inf. Sci., 34 (2022), 1285–1295. https://doi.org/10.1016/j.jksuci.2019.07.005 doi: 10.1016/j.jksuci.2019.07.005
    [40] G. D. Singh, V. Tripathi, A. Dumka, R. S. Rathore, M. Bajaj, J. Escorcia-Gutierrez, et al., A novel framework for capacitated sdn controller placement: Balancing latency and reliability with pso algorithm, Alex. Eng. J., 87 (2024), 77–92. https://doi.org/10.1016/j.aej.2023.12.018 doi: 10.1016/j.aej.2023.12.018
    [41] Y. Meidan, M. Bohandana, Y. Mathov, Y. Mirsky, A. Shabtai, D. Breitenbacher, et al., N-BaIoT—Network-based detection of IoT botnet attacks using deep autoencoders, IEEE Pervas. Comput., 17 (2018), 12–22. https://doi.org/10.1109/MPRV.2018.03367731 doi: 10.1109/MPRV.2018.03367731
    [42] F. Alrowais, S. Althahabi, S. S. Alotaibi, A. Mohamed, M. A. Hamza, R. Marzouk, Automated machine learning enabled cyber security threat detection in the internet of things environment, Comput. Syst. Sci. Eng., 45 (2023), 687–700. https://doi.org/10.32604/csse.2023.030188 doi: 10.32604/csse.2023.030188
    [43] N. Savanović, A. Toskovic, A. Petervoic, M. Zivkovic, R. Damaševičius, L. Jovanovic, Intrusion detection in healthcare 4.0 internet of things systems via metaheuristics optimized machine learning, Sustainability, 15 (2023), 12563. https://doi.org/10.3390/su151612563 doi: 10.3390/su151612563
    [44] S. S. Kareem, R. R. Mostafa, F. A. Hashim, H. M. El-Bakry, An effective feature selection model using hybrid metaheuristic algorithms for IoT intrusion detection, Sensors, 22 (2022), 1396. https://doi.org/10.3390/s22041396 doi: 10.3390/s22041396
  • This article has been cited by:

    1. Essia Added, Hassène Gritli, Safya Belghith, 2023, Investigation of the Compass Biped Walker's Passive Dynamics and Trajectory Tracking Method for Chaos Control, 979-8-3503-2102-9, 01, 10.1109/IC_ASET58101.2023.10150584
    2. Jun Tang, Yudi Zhu, Wencong Gan, Haiming Mou, Jie Leng, Qingdu Li, Zhiqiang Yu, Jianwei Zhang, Design, Control, and Validation of a Symmetrical Hip and Straight-Legged Vertically-Compliant Bipedal Robot, 2023, 8, 2313-7673, 340, 10.3390/biomimetics8040340
  • Reader Comments
  • © 2024 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(1014) PDF downloads(58) Cited by(1)

Figures and Tables

Figures(11)  /  Tables(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog