A study on path-planning algorithm for a multi-section continuum robot in confined multi-obstacle environments

Abstract In confined multi-obstacle environments, generating feasible paths for continuum robots is challenging due to the need to avoid obstacles while considering the kinematic limitations of the robot. This paper deals with the path-planning algorithm for continuum robots in confined multi-obstacle environments to prevent their over-deformation. By modifying the tree expansion process of the Rapidly-exploring Random Tree Star (RRT * ) algorithm, a path-planning algorithm called the continuum-RRT * algorithm herein is proposed to achieve fewer iterations and faster convergence as well as generating desired paths that adhere to the kinematic limitations of the continuum robots. Then path planning and path tracking are implemented on a tendon-driven four-section continuum robot to validate the effectiveness of the path-planning algorithm. The path-planning results show that the path generated by the algorithm indeed has fewer transitions, and the path generated by the algorithm is closer to the optimal path that satisfies the kinematic limitations of the continuum robot. Furthermore, path-tracking experiments validate the successful navigation of the continuum robot along the algorithm-generated path, exhibiting an error range of 2.51%–3.91%. This attests to the effectiveness of the proposed algorithm in meeting the navigation requirements of continuum robots.

Authors

Institutions

Publication Details

Journal
Robotica
Published
2024-09-16
DOI
https://doi.org/10.1017/s0263574724001383
Citations
13
Primary Topic
Soft Robotics and Applications
Type
article
Field-Weighted Citation Impact
2.40
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A study on path-planning algorithm for a multi-section continuum robot in confined multi-obstacle environments

Chunxu Song, Guohua Gao, Kai Liu, Dongjian Li et al.
13 citations
Robotica
Soft Robotics and Applications
2.40
article

A study on path-planning algorithm for a multi-section continuum robot in confined multi-obstacle environments

Chunxu Song, Guohua Gao, Kai Liu, Dongjian Li, Yuxin Ge
article en
13 citations

Abstract

Abstract In confined multi-obstacle environments, generating feasible paths for continuum robots is challenging due to the need to avoid obstacles while considering the kinematic limitations of the robot. This paper deals with the path-planning algorithm for continuum robots in confined multi-obstacle environments to prevent their over-deformation. By modifying the tree expansion process of the Rapidly-exploring Random Tree Star (RRT * ) algorithm, a path-planning algorithm called the continuum-RRT * algorithm herein is proposed to achieve fewer iterations and faster convergence as well as generating desired paths that adhere to the kinematic limitations of the continuum robots. Then path planning and path tracking are implemented on a tendon-driven four-section continuum robot to validate the effectiveness of the path-planning algorithm. The path-planning results show that the path generated by the algorithm indeed has fewer transitions, and the path generated by the algorithm is closer to the optimal path that satisfies the kinematic limitations of the continuum robot. Furthermore, path-tracking experiments validate the successful navigation of the continuum robot along the algorithm-generated path, exhibiting an error range of 2.51%–3.91%. This attests to the effectiveness of the proposed algorithm in meeting the navigation requirements of continuum robots.

RoboticaVol. 42(10)
Beijing University of Technology (CN)
Openalex Percentile: Top 11%
Soft Robotics and Applications
2.40
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.