Robust Global Boundary Vibration Control of Uncertain Timoshenko Beam With Exogenous Disturbances
Mohamed Ahmed Eshag, Lei Ma, Yongkui Sun and 1 more
IEEE Access · 2020
doi:10.1109/access.2020.2984558 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper, the dynamics solution problem and the boundary control problem for the Timoshenko beam under uncertainties and exogenous disturbances are addressed. The dynamics of the Timoshenko beam are represented by one non-homogenous hyperbolic partial differential equation (PDE), one homogenous hyperbolic PDE, and three ordinary differential equations (ODEs). The authors suggest a method of lines (MOL) for obtaining the dynamics of the Timoshenko beam in the form of the ODE formula instead of the PDE formula. A global sliding mode boundary control (GSMBC) is designed for vibration reduction of the Timoshenko beam influenced by uncertainties, distributed disturbance, displacement boundary disturbance, and rotation boundary disturbance. Chattering phenomena are avoided by using exponential reaching law reinforced by a relay function. Along the time and position axis: a) the boundary displacements and rotation of the Timoshenko beam are converged to equilibrium; b) the distributed vibrations on both displacements and rotation axis of the Timoshenko are attenuated; c) influence of the exogenous disturbances and system parameters uncertainties are compensated. By using the Lyapunov direct approach, exponential convergence and robustness of the closed-loop system are guaranteed. Finally, simulations are carried out to show that the proposed GSMBC-based MOL scheme is effective for vanishing the vibrations of the Timoshenko beam under uncertainties and external disturbances.
Abstract licence: CC BY-NC-ND
References50
40 more references, whose wording the paper’s licence keeps private.
All 50 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.