Design and Kinematic Control of the Cable-Driven Hyper-Redundant Manipulator for Potential Underwater Applications
Bibliographic record
Abstract
Underwater manipulators are important robotic tools in the exploration of the ocean environment. Up to now, most existing underwater manipulators are rigid and with fixed 5 or 7 degrees of freedom (DOF), which may not be very suitable for some complicated underwater scenarios (e.g., pipe networks, narrow deep cavities, etc.). The biomimetic concept of muscles and tendons is also considered as continuum manipulators, but load capacity and operation accuracy are their essential drawbacks and thus limit their practical applications. Recently, the cable-driven technique has been developed for manipulators, which can include numerous joints and hyper-redundant DOF to execute tasks with dexterity and adaptability and thus they have strong potential for these complex underwater applications. In this paper, the design of a novel cable-driven hyper-redundant manipulator (CDHRM) is introduced, which is driven by multiple cables passing through the tubular structure from the base to the end-effector, and the joint numbers can be extended and decided by the specific underwater task requirements. The kinematic analysis of the proposed CDHRM is given which includes two parts: the cable-joint kinematics and the joint-end kinematics. The geometric relationship between the cable length and the joint angles are derived via the established geometric model for the cable-joint kinematics, and the projection relationship between the joint angles and end-effector’s pose is established via the spatial coordinate transformation matrix for the joint-end kinematics. Thus, the complex mapping relationships among the cables, joints and end-effectors are clearly achieved. To implement precise control, the kinematic control scheme is developed for the CDHRM with series-parallel connections and hyper-redundancy to achieve good tracking performance. The experiment on a real CDHRM system with five joints is carried out and the results verify the accuracy of kinematics solution, and the effectiveness of the proposed control design. Particularly, three experiments are tested in the underwater environment, which verifies its good tracking performance, load carrying and grasping capacity.
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.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".