Trajectory planning of a cable-driven continuum robot based on particle swarm optimization algorithm
DOI:
CSTR:
Author:
Affiliation:

1.Zhejiang Key Laboratory of Robotics and Intelligent Equipment Technology,Ningbo Institute of Materials Technology and Engineering,Chinese Academy of Sciences;2.Hebei University of Science and Technology,Shijiazhuang

Clc Number:

TP

Fund Project:

the National Natural Science Foundation of China under Project 51705510;the NSFC-Zhejiang Joint Found for the Integration and Information under Project U1909215 ;the Institute of Robotics and Intelligent Manufacturing Innovation, Chinese Academy of Sciences, under Project C2018005

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Different with traditional rigid robots, cable-driven continuum robots are able to working in the narrow space to realize the inspection or detection. To improve the smoothness and stability of its motion trajectory, the trajectory planning method based on spline and particle swarm is proposed for the cable driven continuum robot in its joint space and Cartesian space. Firstly, the kinematic model has been built by using the two parameters local product-of-exponential (POE) formula, Secondly, the inverse kinematic has been solved by using Newton Raphson iterative method. Finally, the particle swarm optimization algorithm based on adaptive inertia weight has been used to solve the time optimal problem and the B-spline function has been used for generate smoothly trajectory, the trajectory planning of the continuum robot in joint space and Cartesian space is realized respectively. The simulation results show that the planned trajectories both in joint space and Cartesian space are continuous. The obtained velocities are less than 10 mm/s and the accelerations are less than 20 mm/s^2. However, the produced position, velocity and acceleration curves are smoother when doing the trajectory planning in joint space. In terms of running time,it takes 9.219 3 s in joint space planning and takes 10.604 6 s in Cartisian space.

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:July 16,2020
  • Revised:July 16,2020
  • Adopted:September 20,2023
  • Online:
  • Published:
Article QR Code