Research on kinematics modeling and path planning of a hyper-redundant continuum robot

Author:

Sheng Zhongqi1,Wang Yubin1,Li Shicheng2,Yang Jianyu1,Xie Hualong1,Lu Xiao1ORCID

Affiliation:

1. Institute of Advanced Manufacturing and Automation Technology, College of Mechanical Engineering and Automation, Northeastern University, Shenyang, China

2. King’s College London, Strand, London, UK

Abstract

It has always been the case that work in confined spaces has high difficulty and complexity, and robots are usually required to replace humans to perform the corresponding operations. For the maintenance work in the fuel tank of a certain type of aircraft, a continuum robot with 32 staggered orthogonal joints is designed in this paper. To solve the motion problem of this robot, this paper combines the end-following method with the Jacobi inverse kinematics method, and proposes an end-following-segmented Jacobi method, which improves the accuracy and efficiency of the inverse kinematics solution. A ray path-planning algorithm for continuum robots is proposed for the job requirements of this robot and the specific operating environment inside an airplane fuel tank, and it is compared with the rapidly-exploring random trees (RRT) algorithm and particle swarm optimization (PSO) algorithm. The experimental results show that the planning time of the ray path-planning algorithm is less compared with the RRT algorithm and the PSO algorithm, and the paths obtained are shorter. Finally, a path-following simulation is performed on a 32-joint continuum robot model to verify the followability of the ray path algorithm.

Publisher

SAGE Publications

Subject

Mechanical Engineering

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3