Hostname: page-component-89b8bd64d-ksp62 Total loading time: 0 Render date: 2026-05-08T04:15:01.584Z Has data issue: false hasContentIssue false

A memetic algorithm approach for solving the task-based configuration optimization problem in serial modular and reconfigurable robots

Published online by Cambridge University Press:  08 December 2014

Saleh Tabandeh
Affiliation:
Motion Control, Fanuc robotics, Rochester Hills, Michigan, USA
William Melek
Affiliation:
Mechanical and Mechatronics engineering, University of Waterloo, Waterloo, Ontario, Canada
Mohammad Biglarbegian
Affiliation:
School of Engineering, University of Guelph, Guelph, Ontario, Canada
Seong-hoon Peter Won*
Affiliation:
Mechanical and Mechatronics engineering, University of Waterloo, Waterloo, Ontario, Canada
Chris Clark
Affiliation:
Harvey Mudd College, Claremont, California, USA
*
*Corresponding author. E-mail: shwon@engmail.uwaterloo.ca

Summary

This paper presents a novel configuration optimization method for multi degree-of-freedom modular reconfigurable robots (MRR) using a memetic algorithm (MA) that combines genetic algorithms (GAs) and a local search method. The proposed method generates multiple solutions to the inverse kinematics (IK) problem for any given spatial task and the MA chooses the most suitable configuration based on the search objectives. Since the dimension of each robotic link in this optimization is considered telescopic, the proposed method is able to find better solutions to the IK problem than GAs. The case study for a 3-DOF MRR shows that the MA finds solutions to the IK problem much faster than a GA with noticeably less reachability error. Additional case studies show that the proposed MA method can find multiple IK solutions in various scenarios and identify the fittest solution as a suboptimal configuration for the MRR.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2014 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable