Recursive genetic algorithm for robot manipulator motion planning in the existence of obstacles

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Robotic Manipulators motion planning may be challenging due to the high dimensionality of configuration space, complexity of some manipulators geometry, obstacles and physical constraints. In this paper, a recursive genetic algorithm (GA) for manipulators off-line motion planning in existence of obstacles is introduced. The proposed algorithm considers the kinematics prospective of the manipulator motion planning problem. It divides the motion planning problem into smaller sub-problems. Hence, it is capable of handling efficiently complex problems. In addition, the algorithm utilizes the multi-objectives optimization feature of GA to solve implicitly the Inverse Kinematics enabling the motion task to be assigned in high level Cartesian-coordinates. Hence, the user doesn't have to specify target joint angles. Moreover, using a recursive mechanism, the algorithm can be modified to handle online-motion planning. The algorithm is verified and tested through 3D simulation. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Atia, M., & Noureldin, A. (2012). Recursive genetic algorithm for robot manipulator motion planning in the existence of obstacles. In Lecture Notes in Electrical Engineering (Vol. 124 LNEE, pp. 571–581). https://doi.org/10.1007/978-3-642-25781-0_84

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free