Finite-Time Nonlinear <i> H <sub>∞</sub> </i> Control of Robot Manipulators With Prescribed Performance
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This letter addresses the problem of robust finite-time tracking control with prescribed performance for robot manipulators experiencing uncertain inertia and external disturbance. We develop a control strategy that incorporates the nonlinear <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\boldsymbol {\mathcal {H}_{\infty }}$ </tex-math></inline-formula> concept into the backstepping approach, using a novel virtual control, to guarantee practical finite-time convergence to a trajectory, whilst the closed-loop <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\boldsymbol {\mathcal {L}_{2}}$ </tex-math></inline-formula> gain is less than a pre-specified value. We also use adaptive gains, instead of complex error transformations (common in prescribed performance controllers), to simultaneously impose constraints on the steady-state and transient response of the closed-loop, including maximum error, maximum overshoot, and minimum convergence rate. The developed controller is not contingent on solving the Hamilton-Jacobi or Riccati equations and is free of the singularities associated with using fractional power in finite-time control. The performance and efficacy of the proposed control framework are demonstrated through simulation studies and comparisons with pertinent works.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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.000 | 0.001 |
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 it