Synthesis and prototyping of a backdrivable parallel robot for metal finishing tasks
Bibliographic record
Abstract
This article presents the synthesis, control and experimental validation of a backdrivable three-degree-of-freedom translational mini robot used to control the interaction between a robot and a machined part during finishing tasks, such as polishing, sanding and deburring without requiring the use of a force/torque sensor. The mini robot acts as an active contact flange, allowing an industrial robot (the macro robot) to adapt to a part using an impedance control algorithm. Firstly, different three-degree-of-freedom parallel robot architectures are compared and the most suitable architecture is selected. Geometrical properties are chosen for the robot and the physical capabilities of the architecture are predicted to ensure that the design criteria are satisfied. An impedance control algorithm is then developed for the mini robot. The macro-mini system is formed by installing the mini robot on a gantry robot. Sanding tests are carried out in order to validate the performance of the system and the mini robot is compared to other contact flanges already available on the market. Finally, a method allowing the determination of the magnitude of the friction forces in the mini robot is presented and a preliminary friction compensation algorithm is developed. As opposed to existing tools, the novel mini robot proposed in this work is based on a compact parallel architecture, which makes it possible to ensure the backdrivability of the system in three directions. An impedance control algorithm can therefore be implemented thereby providing stability even with stiff environments and eliminating the need for a force/torque sensor. • Synthesis and design of a 3-dof backdrivable robot for sensorless force control. • Design of a prototype and implementation of a customized impedance controller. • Experimental validation using a macro-mini approach. • Experimental determination of the force control capability. • Development of a friction estimation model and validation.
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.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".