Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-10T09:22:59.182Z Has data issue: false hasContentIssue false

Optimal placement of a two-link planar manipulator using a genetic algorithm

Published online by Cambridge University Press:  11 March 2005

Lianfang Tian
Affiliation:
Department of Mechanical Engineering, University of California at Riverside, Riverside, CA 92521 (USA)
Curtis Collins
Affiliation:
Department of Mechanical Engineering, University of California at Riverside, Riverside, CA 92521 (USA)
Rights & Permissions [Opens in a new window]

Abstract

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.

In this paper, we study the base placement problem for a two-degree-freedom-robot. The feasible area for the robot base is described, and its manipulability measure is formulated. To find the optimal base location of the robot, we develop a genetic algorithm (GA) to search for the valid solution in the reachable area of the robot base. To speed up the evolutionary process, we keep the elitists from one generation to the next generation according to certain elitist rate. The genetic algorithm approach is beneficial because it can also be extended to trajectory planning for robots with more degrees-of-freedom. We demonstrate the algorithm with some examples.

Information

Type
Research Article
Copyright
© 2005 Cambridge University Press