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

Authors:
Lianfang Tian;Curtis Collins
Affiliations:
Department of Mechanical Engineering, University of California at Riverside, Riverside, CA 92521 (USA);Department of Mechanical Engineering, University of California at Riverside, Riverside, CA 92521 (USA)
Venue:
Robotica
Year:
2005

Citing 4
Cited 3

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Neural network dynamics for path planning and obstacle avoidance

Neural Networks
An efficient neural network approach to dynamic robot motion planning

Neural Networks
Genetic Algorithms and Robotics

Genetic Algorithms and Robotics

Determination of optimum robot base location considering discrete end-effector positions by means of hybrid genetic algorithm

Robotics and Computer-Integrated Manufacturing
Improving feasibility of robotic milling through robot placement optimisation

Robotics and Computer-Integrated Manufacturing
Optimal design of manipulator parameter using evolutionary optimization techniques

Robotica

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.