Neural network based dynamic modeling of flexible-link manipulators with application to the SSRMS
Bibliographic record
Abstract
This paper presents an approach for dynamic modeling of flexible-link manipulators using artificial neural networks. A state-space representation is considered for a neural identifier. A recurrent network configuration is obtained by a combination of feedforward network architectures with dynamical elements in the form of stable filters. To guarantee the boundedness of the states, a joint PD control is introduced in the system. The method can be considered both as an online identifier that can be used as a basis for designing neural network controllers as well as an offline learning scheme to compute deflections due to link flexibility for evaluating forward dynamics. Unlike many other methods, the proposed approach does not assume knowledge of the nonlinearities of the system nor that the nonlinear system is linear in parameters. The performance of the proposed neural identifier is evaluated by identifying the dynamics of different flexible-link manipulators. To demonstrate the effectiveness of the algorithm, simulation results for a single-link manipulator, a two-link planar manipulator, and the Space Station Remote Manipulator System (SSRMS) are presented. ©2000 John Wiley & Sons, Inc.
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.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".