Statistical evaluation of an evolutionary algorithm for minimum time trajectory planning problem for industrial robots Articles uri icon

publication date

  • March 2017

start page

  • 389

end page

  • 406

issue

  • 1

volume

  • 89

International Standard Serial Number (ISSN)

  • 0268-3768

Electronic International Standard Serial Number (EISSN)

  • 1433-3015

abstract

  • This paper presents, evaluates, and validates a genetic algorithm procedure with parallel-populations for the obtaining of minimum time trajectories for robot manipulators. The aim of the algorithm is to construct smooth joint trajectories for robot manipulators using cubic polynomial functions, where the sequence of the robot configurations is already given. Three different types of constraints are considered in this work: (1) Kinematics: these include the limits of joint velocities, accelerations, and jerk. (2) Dynamic: which include limits of torque, power, and energy. (3) Payload constraints. A complete statistical analysis using ANOVA test is introduced in order to evaluate the efficiency of the proposed algorithm. In addition, a comparison analysis between the results of the proposed algorithm and other different techniques found in the literature is described in the experimental section of this paper.

keywords

  • industrial robots; minimum-time trajectory planning; obstacle avoidance