ARE PARALLEL ROBOTS MORE ACCURATE THAN SERIAL ROBOTS?
Bibliographic record
Abstract
It is widely claimed that parallel robots are intrinsically more accurate than serial robots because their errors are averaged instead of added cumulatively, an assertion which has not been properly addressed in the literature. This paper addresses this void by comparing the kinematic accuracy of two pairs of serial-parallel 2-DOF planar robots. Only input errors are considered and all robots are optimized for accuracy, the only constraint being that they cover a given desired workspace. The results of this comparison seem to confirm that parallel robots are less sensitive to input errors than serial robots. However, this comparison is too limited to draw any general conclusions. Besides, it is virtually impossible to make a meaningful comparison between other pairs of serial and parallel robot. Therefore, there is no simple answer to this question of superiority.
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.003 | 0.017 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.003 |
| Scholarly communication | 0.002 | 0.006 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.002 |
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".