Hostname: page-component-6898cfcb55-kwdml Total loading time: 0 Render date: 2026-11-11T16:54:29.320Z Has data issue: false hasContentIssue false

A new motion planning method for discretely actuated hyper-redundant manipulators

Published online by Cambridge University Press:  27 February 2015

Alireza Motahari*
Affiliation:
Department of Mechanical and Aerospace Engineering, Science and Research Branch, Islamic Azad University, Tehran, Iran
Hassan Zohoor
Affiliation:
Center of Excellence in Design, Robotics and Automation, Sharif University of Technology, &, The Academy of Sciences, Tehran, Iran
Moharam Habibnejad Korayem
Affiliation:
Robotics Research Laboratory, Center of Excellence in Experimental Solid Mechanics and Dynamics, School of Mechanical Engineering, Iran University of Science and Technology, Tehran, Iran
*
*Corresponding author. E-mail: a.motahari@srbiau.ac.ir
Rights & Permissions [Opens in a new window]

Summary

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

A hyper-redundant manipulator is made by mounting the serial and/or parallel mechanisms on top of each other as modules. In discrete actuation, the actuation amounts are a limited number of certain values. It is not feasible to solve the kinematic analysis problems of discretely actuated hyper-redundant manipulators (DAHMs) by using the common methods, which are used for continuous actuated manipulators. In this paper, a new method is proposed to solve the trajectory tracking problem in a static prescribed obstacle field. To date, this problem has not been considered in the literature. The removing first collision (RFC) method, which is originally proposed for solving the inverse kinematic problems in the obstacle fields was modified and used to solve the motion planning problem. For verification, the numerical results of the proposed method were compared with the results of the genetic algorithm (GA) method. Furthermore, a novel DAHM designed and implemented by the authors is introduced.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2015