Two-Degree-of-Freedom Decoupled Nonredundant Cable-Loop-Driven Parallel Mechanism
Bibliographic record
Abstract
A novel two-degree-of-freedom (DOF) cable-loop slider-driven parallel mechanism is introduced in this paper. The novelty of the mechanism lies in the fact that no passive rigid-link mechanism or springs are needed to support the end-effector (only cables are connected to the end-effector) while at the same time there is no actuation redundancy in the mechanism. Sliders located on the edges of the workspace are used and actuation redundancy is eliminated while providing force closure everywhere in the workspace. It is shown that the two degrees of freedom of the mechanism are decoupled and only two actuators are needed to control the motion. There are two cable loops for each direction of motion: one acts as the actuating loop while the other is the constraint loop. Due to the simple geometric design, the kinematic and static equations of the mechanism are very compact. The stiffness of the mechanism is also analyzed in the paper. It can be observed that the mechanism's stiffness is much higher than the stiffness of the cables. The proposed mechanism's workspace is essentially equal to its footprint and there are no singularities.
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.001 | 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.001 |
| Research integrity | 0.000 | 0.000 |
| 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".