Skip to main navigation Skip to search Skip to main content

Dynamics based trajectory planning for parallel manipulators

  • Yunjiang Lou*
  • , Fang Feng
  • , Zhibin Li
  • *Corresponding author for this work
  • Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Kinematics based trajectory planning for parallel manipulators has been studied extensively, e.g., to determine a singularity-free path. Dynamics based trajectory planning, however, gains little concern. In order to fully exploit capacity of parallel robots, it is inevitable to conduct motion planning considering both kinematic and dynamic constraints. In this paper, three dynamics based trajectory planning methods, the time-optimal, the jerk-bounded, and the cubic polynomial planning, are investigated and implemented. The Orthopod, a 3-DoF purely translational parallel manipulator, is used as the experimental plant. This study provides a quantitative comparison of the three planning methods. The experimental results provide a guideline to choose an appropriate planning method for practical industrial applications.

Original languageEnglish
Title of host publication2009 IEEE International Conference on Information and Automation, ICIA 2009
Pages295-300
Number of pages6
DOIs
StatePublished - 2009
Externally publishedYes
Event2009 IEEE International Conference on Information and Automation, ICIA 2009 - Zhuhai, Macau, China
Duration: 22 Jun 200925 Jun 2009

Publication series

Name2009 IEEE International Conference on Information and Automation, ICIA 2009

Conference

Conference2009 IEEE International Conference on Information and Automation, ICIA 2009
Country/TerritoryChina
CityZhuhai, Macau
Period22/06/0925/06/09

Keywords

  • Dynamics-based
  • Parallel manipulators
  • Time-optimal
  • Trajectory planning

Fingerprint

Dive into the research topics of 'Dynamics based trajectory planning for parallel manipulators'. Together they form a unique fingerprint.

Cite this