The Dimensional Synthesis of Planar Parallel Cable-Driven Mechanisms Through Convex Relaxations
Bibliographic record
Abstract
The wrench-closure workspace (WCW) of parallel cable-driven mechanisms is the set of poses for which any wrench can be produced at the end-effector by a set of positive cable tensions. In this paper, we tackle the dimensional synthesis problem, namely, that of finding a geometry for a planar parallel cable-driven mechanism (PPCDM) whose WCW contains a prescribed workspace. To this end, we first recall a linear program to determine whether a given pose is inside or outside the WCW of a given PPCDM. The relaxation of this linear program over a box leads to a nonlinear feasibility problem that can only be satisfied when this box is completely inside the WCW. We extend this feasibility problem to find a PPCDM geometry whose WCW includes a given set of boxes. These boxes represent the prescribed workspace or an estimate thereof, which may be obtained through interval analysis. Finally, we introduce a nonlinear program through which the PPCDM geometry is changed while maximizing the scaling factor of the prescribed set of boxes. When the optimum scaling factor is greater or equal to one, the WCW of the resulting PPCDM contains the set of boxes.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| 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.001 | 0.001 |
| 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".