Type Synthesis of 3-DOF Translational Parallel Manipulators Based on Screw Theory
Bibliographic record
Abstract
A method is proposed for the type synthesis of 3-DOF (degree-of-freedom) translational parallel manipulators (TPMs) based on screw theory. The wrench systems of a translational parallel kinematic chain (TPKC) and its legs are first analyzed. A general procedure is then proposed for the type synthesis of TPMs. The type synthesis of legs for TPKCs, the type synthesis of TPKCs as well as the selection of actuated joints of TPMs are dealt with in sequence. An approach to derive the full-cycle mobility conditions for legs for TPKCs is proposed based on screw theory and the displacement analysis of serial kinematic chains undergoing small joint motions. In addition to the TPKCs proposed in the literature, TPKCs with inactive joints are synthesized. The phenomenon of dependent joint groups in a TPKC is revealed systematically. The validity condition of actuated joints of TPMs is also proposed. Finally, linear TPMs, which are TPMs whose forward displacement analysis can be performed by solving a set of linear equations, are also revealed.
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.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.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 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".