Transfer Learning Approach for Estimating Modal Parameters of Robot Manipulators Using Minimal Experimental Data
Bibliographic record
Abstract
Robots are used more and more in manufacturing, especially in tasks like robotic machining, where understanding their vibration behavior is very important. However, robot vibrations vary with posture, and evaluating all representative postures requires significant time and cost. This study proposes a deep learning (DL) based transfer learning (TL) approach to predict robot vibration behavior using fewer experiments. A large dataset was collected from a KUKA KR300 robot (Robot A) by testing nearly 250 postures. This dataset was then used to train a model to predict modal parameters such as natural frequencies (ω_n), damping ratios (ξ), and modal stiffness (k) within the workspace. TL was then used to apply the knowledge from Robot A to two other robots: a Comau NJ 650-2.7 (Robot B, high-payload) and an ABB IRB 4400 (Robot C, low-payload). Only a small number of postures were tested for Robots B and C. They were chosen carefully to cover different workspace areas and avoid collisions. Hammer tests were performed, and a four-step process was used to identify the real vibration modes. Stabilization diagrams were applied to confirm valid modes and remove noise. The results show that TL can accurately predict modal parameters for both Robot B and Robot C, even with limited data. These predictions were also used to estimate frequency response functions (FRFs), which matched well with experimental results. The main novelties of this work are: achieving accurate prediction of posture-dependent dynamics using minimal experimental data, demonstrating generalization across robots with different payload capacities, and revealing that data coverage across the workspace is more critical than dataset size.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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 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".