Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne
  • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:Fang Gao,Qiang Zhao,Gui-Xian Li.Path Planning of Continuum Robot Based on a New ImprovedParticle Swarm Optimization Algorithm[J].Journal of Harbin Institute Of Technology(New Series),2013,20(4):78-84.DOI:10.11916/j.issn.1005-9113.2013.04.013.
【Print】   【HTML】   【PDF download】   View/Add Comment  Download reader   Close
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 1510times   downloaded 1111times 本文二维码信息
码上扫一扫!
Shared by: Wechat More
Path Planning of Continuum Robot Based on a New ImprovedParticle Swarm Optimization Algorithm
Author NameAffiliation
Fang Gao School of Mechanical Electrical Engineering, Harbin Institute of Technology, Harbin 150001, China 
Qiang Zhao Traffic College, Northeast Forestry University, Harbin 150040, China 
Gui-Xian Li School of Mechanical Electrical Engineering, Harbin Institute of Technology, Harbin 150001, China 
Abstract:
Continuum robot is a new type of biomimetic robot, which realizes the motion by bending some parts of its body. So its path planning becomes more difficult even compared with hyper-redundant robots. In this paper a circular arc spline interpolating method is proposed for the robot shape description, and a new two-stage position-selectable-updating particle swarm optimization (TPPSO) algorithm is put forward to solve this path planning problem. The algorithm decomposes the standard PSO velocity’s single-step updating formula into two-stage multi-point updating, specifically adopting three points as candidates and selecting the best one as the updated position in the first half stage, and similarly taking seven points as candidates and selecting the best one as the final position in the last half stage. This scheme refines and widens each particle’s searching trajectory, increases the updating speed of the individual best, and improves the converging speed and precision. Aiming at the optimization objective to minimize the sum of all the motion displacements of every segmental points and all the axial stretching or contracting displacements of every segment,the TPPSO algorithm is used to solve the path planning problem. The detailed solution procedure is presented. Numerical examples of five path planning cases show that the proposed algorithm is simple, robust, and efficient.
Key words:  continuum robot  path planning  particle swarm optimization algorithm
DOI:10.11916/j.issn.1005-9113.2013.04.013
Clc Number:TP242
Fund:

LINKS