An Emulator-Based Prediction of Dynamic Stiffness for Redundant Parallel Kinematic Mechanisms
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
The accuracy of a parallel kinematic mechanism (PKM) is directly related to its dynamic stiffness, which in turn is configuration dependent. For PKMs with kinematic redundancy, configurations with higher stiffness can be chosen during motion-trajectory planning for optimal performance. Herein, dynamic stiffness refers to the deformation of the mechanism structure, subject to dynamic loads of changing frequency. The stiffness-optimization problem has two computational constraints: (i) calculation of the dynamic stiffness of any considered PKM configuration, at a given task-space location, and (ii) searching for the PKM configuration with the highest stiffness at this location. Due to the lack of available analytical models, herein, the former subproblem is addressed via a novel effective emulator to provide a computationally efficient approximation of the high-dimensional dynamic-stiffness function suitable for optimization. The proposed method for emulator development identifies the mechanism's structural modes in order to breakdown the high-dimensional stiffness function into multiple functions of lower dimension. Despite their computational efficiency, however, emulators approximating high-dimensional functions are often difficult to develop and implement due to the large amount of data required to train the emulator. Reducing the dimensionality of the approximation function would, thus, result in a smaller training data set. In turn, the smaller training data set can be obtained accurately via finite-element analysis (FEA). Moving least-squares (MLS) approximation is proposed herein to compute the low-dimensional functions for stiffness approximation. Via extensive simulations, some of which are described herein, it is demonstrated that the proposed emulator can predict the dynamic stiffness of a PKM at any given configuration with high accuracy and low computational expense, making it quite suitable for most high-precision applications. For example, our results show that the proposed methodology can choose configurations along given trajectories within a few percentage points of the optimal ones.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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