An Adaptive Robust Approach to Modeling and Control of Flexible Arm Robots
Bibliographic record
Abstract
In this paper, a novel adaptive robust approach to modeling and control of a class of flexible-arm robots subject to actuators unmodeled dynamics is proposed. It is shown how real-time signals measured from a dynamical system can be utilized to improve the accuracy of the mathematical model of flexible robots. Given the elasticity of the robot’s arms, flexible manipulators have both passive and active degrees of freedom. A nonlinear robust controller is designed for the active degrees of freedom to enable the robot to follow desired trajectories in the presence of actuators unmodeled dynamics. Furthermore, it is shown that under some feasible conditions, another nonlinear robust controller is designed for the passive degrees of freedom. Moreover, to use the system response for model extraction, two auxiliary signals are proposed to provide sufficient information for improving the accuracy of the dynamics of the system numerically. Additionally, two adaptive laws are proposed in each case to update the two introduced auxiliary signals. As a result, the controller controls the passive degrees of freedom after the active degrees of freedom converge to their desired trajectories. Simultaneously, the information collected from the system to update the auxiliary signals enhances the model accuracy. In the end, simulation results are presented to verify the performance of the proposed controller.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".