Bounded inputs total energy shaping for a class of underactuated mechanical systems
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
Abstract Designing control systems with bounded input is a practical consideration since realizable physical systems are limited by the saturation of actuators. The actuators' saturation degrades the performance of the control system, and in extreme cases, the stability of the closed‐loop system may be lost. However, actuator's saturation is typically neglected in the design of control systems, with compensation being made in the form of overdesigning the actuator or by postanalyzing the resulting system to ensure acceptable performance. The bounded input control of fully actuated mechanical systems has been investigated in multiple studies, but it is not generalized for underactuated mechanical systems. This article proposes a systematic framework for finding the upper bound of control effort in underactuated systems, based on interconnection and the damping assignment passivity based control approach. The proposed method also offers design variables for the control law to be tuned, considering the actuator's limit. The primary difficulty in finding the control input upper bounds is the velocity‐dependent kinetic energy‐related terms. Thus, the upper bound of velocity is computed using a suitable Lyapunov candidate as a function of closed‐loop system parameters. The validity and application of the proposed method are investigated in detail through two benchmark systems simulations.
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.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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it