Parallel-Populations Genetic Algorithm for the Optimization of Cubic Polynomial Joint Trajectories for Industrial Robots
Intelligent Robotics and Applications Lecture Notes in Computer Science
Vol 7101
First page 83
Last page 92

In this paper a parallel-populations genetic algorithm procedure is presented for the obtainment of minimum-time trajectories for industrial robots. This algorithm is fed in first place by a sequence of configurations then cubic spline functions are used for the construction of joint trajectories for industrial robots. The algorithm is subjected to two types of constraints: (1) Physical constraints on joint velocities, accelerations, and jerk. (2) Dynamic constraints on torque, power, and energy. Comparison examples are used to evaluate the method with different combinations of crossover and mutation.