Adaptive Stabilization Control for a Class of Non-Strict Feedback Underactuated Nonlinear Systems by Backstepping
Bibliographic record
Abstract
Inspired by backstepping method, this paper proposes a novel adaptive stabilizing control method for a class of uncertain underactuated nonlinear systems, which is named as underactuated adaptive backstepping. Firstly, based on a virtual controller and a partial differential equation (PDE), a residual system is constructed. Then, a novel coordinate transformation is introduced to analyse the adaptive stabilizing control problem of the residual system, which breaks through the restriction of strict feedback form and achieves the estimation of unknown parameters. The proposed method first applies backstepping to form a residual system, and then uses backstepping again to design an adaptive controller for the residual system. The stability of the proposed method is proven based on Lyapunov’s theorems. Finally, two actual underactuated examples with physical damping are provided to demonstrate the effectiveness of the proposed underactuated adaptive backstepping.Note to Practitioners—This paper aims to develop a novel underactuated adaptive scheme called underactuated adaptive backstepping for underactuated mechanical systems. This scheme can effectively address the parameter uncertainty problem and achieve good control effect, even if there is uncertain physical damping which may change the equilibrium point in the system. Compared with existing methods, this scheme provides a novel design approach without linearization and approximation, which fully promotes the development of backstepping in the underactuated field. Moreover, the simulation experiments are carried out on the inertia wheel pendulum and ball and beam system with physical damping, thus effectively proving the feasibility of this scheme. In the future, the scheme will be applied to practical mechanical systems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".