Optimization of Actuator Forces in Cable-Based Parallel Manipulators Using Convex Analysis
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
In cable-driven parallel manipulators (CPMs), cables can perform only under tension, and therefore, redundant actuation, which can be provided by redundant limbs, is needed to maintain the cable tensions. By optimizing the distribution of the forces in the cables and the redundant limbs, the average size of actuators can be reduced resulting in lower cost. Optimizing the force distribution in CPMs requires consideration for the inequality constraints imposed on the cable forces as a result of the unilateral driving property of the cables. In this study, a projection method is presented to calculate optimum solutions for the actuators force distribution in CPMs. Two solutions are presented: 1) a minimum-norm solution that minimizes the 2-norm of all forces in the cables and redundant limbs and 2) a solution that minimizes the 2-norm of the forces in the cables only. The optimization problem is formulated as a projection on an intersection of convex sets and the Dykstra's projection method is used to obtain the solutions. This method is successfully applied to a 3-DOF CPM.
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.001 |
| 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