An Evolutionary Algorithm with Non-random Initial Population for Path Planning of Manipulators

Authors:
Chien-Chou Lin
Affiliations:
Department of Computer Science and Information Engineering, National Yunlin University of Science and Technology, Yunlin, Taiwan, R.O.C. 64002
Venue:
IEA/AIE '09 Proceedings of the 22nd International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: Next-Generation Applied Intelligence
Year:
2009

Citing 7
Cited 0

Real-time obstacle avoidance for manipulators and mobile robots

International Journal of Robotics Research
Robot motion planning: a distributed representation approach

International Journal of Robotics Research
An algorithm for planning collision-free paths among polyhedral obstacles

Communications of the ACM
A Parallel Collision-Avoidance Algorithm for Robot Manipulators

IEEE Concurrency
A novel potential-based path planning of 3-D articulated robots with moving bases

Robotica
Spatial Planning: A Configuration Space Approach

IEEE Transactions on Computers
Complexity of the mover's problem and generalizations

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a hierarchical evolutionary algorithm is proposed for the path planning of manipulators. The proposed algorithm consists of a global path planner (GPP) and a local motion planner (LMP). The global planner, a MAKLINK based approach, plans a trajectory for a robot end-effector from a starting free-space to goal free-space. An evolutionary algorithm with a non-random initial population is adopted to plan the manipulator configurations along a path given by the former stage. Once the optimal configuration is obtained by the evolutionary algorithm, the optimal chromosomes will be reserved as the initial population. Since the initial population is non-random, the evolution is more efficient and the planned path is smoother than traditional GA. Simulation results show that the proposed algorithm works well, specifically in terms of collision avoidance and computation efficiency.