Finite-Time Gradient Descent-Based Adaptive Neural Network Finite-Time Control Design for Attitude Tracking of a 3-DOF Helicopter
This paper investigates a novel finite-time gradient descent-based adaptive neural network finite-time control strategy for the attitude tracking of a 3-DOF lab helicopter platform subject to composite disturbances. First, the radial basis function neural network (RBFNN) is applied to estimate lumped disturbances, where the weights, centers and widths of the RBFNN are trained online via finite-time gradient descent algorithm. Then, a finite-time backstepping control scheme is constructed to fulfill the tracking control of the elevation and pitch angles. In addition, a hybrid finite-time differentiator (HFTD) is introduced for approximating the intermediate control signal and its derivative to avoid the problem of "explosion of complexity" in the traditional backstepping design protocol. Moreover, the errors caused by the HFTD can be attenuated by the combination of compensation signals. With the aid of the stability theorem, it is proved that the closed-loop system is semi-globally uniformly ultimately boundedness in finite time. Finally, a comparison result is provided to illustrate the effectiveness and advantages of the designed control strategy.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Finite-Time Last-Iterate Convergence for Multi-Agent Learning in Games
In this paper, we consider multi-agent learning via online gradient descent in a class of games called $\lambda$-cocoercive games, a fairly broad class of games that admits many Nash equilibria and that properly includes…
Convergence of two-timescale gradient descent ascent dynamics: finite-dimensional and mean-field perspectives
The two-timescale gradient descent-ascent (GDA) is a canonical gradient algorithm designed to find Nash equilibria in min-max games. We analyze the two-timescale GDA by investigating the effects of learning rate ratios o…
A Convergent Gradient Descent Algorithm for Rank Minimization and Semidefinite Programming from Random Linear Measurements
We propose a simple, scalable, and fast gradient descent algorithm to optimize a nonconvex objective for the rank minimization problem and a closely related family of semidefinite programs. With $O(r^3 \kappa^2 n \log n)…
A qualitative difference between gradient flows of convex functions in finite- and infinite-dimensional Hilbert spaces
We consider gradient flow/gradient descent and heavy ball/accelerated gradient descent optimization for convex objective functions. In the gradient flow case, we prove the following: 1. If $f$ does not have a minimizer, …
Limit Theorems for Stochastic Gradient Descent with Infinite Variance
Stochastic gradient descent is a classic algorithm that has gained great popularity especially in the last decades as the most common approach for training models in machine learning. While the algorithm has been well-st…
regression