ArticleScientific reports2026
Obstacle-aware inverse kinematics of variable-length continuum robots via teaching-learning-based optimization with experimental validation.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
5 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Continuum robots offer high dexterity and compliance, which makes them attractive for tasks in confined, hazardous, and hard-to-reach environments. Despite this potential, inverse kinematics (IK) for multi-section continuum robots remains challenging due to strong nonlinearities and redundancy, and the problem becomes more demanding when each section can actively change its backbone length. This paper addresses obstacle-aware IK for a cable-driven variable-length continuum robot by formulating IK as a constrained optimization problem built on a constant-curvature forward kinematic model. A teaching-learning-based optimization (TLBO) algorithm is adopted to search for section bending angles, orientation angles, and section lengths that minimize end-effector tracking error while avoiding static obstacles through a capsule-based penalty constraint handling strategy that accounts for the robot's physical radial dimension. The approach is evaluated through multiple three-dimensional MATLAB simulations, including linear and circular trajectory tracking with and without obstacle avoidance, and is benchmarked against particle swarm optimization (PSO), a real-coded genetic algorithm (GA), and differential evolution (DE) over 30 independent runs. Statistical analysis shows that TLBO achieves the best or near-best tracking accuracy (mean error [Formula: see text] mm, best [Formula: see text] mm) while requiring no algorithm-specific tuning parameters. The method is further validated experimentally on a Continuum Bionic Handling Assistant (CBHA) platform by comparing the IK-derived cable-length profiles with potentiometer-based measurements. The results demonstrate accurate trajectory tracking in simulation and good agreement with experimental cable-length measurements, supporting the feasibility of TLBO for constrained IK of variable-length continuum robots.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.