Our research team is developing a 6-DOF manipulator that is adequate for the narrow workspace of press forming processes. This paper addresses the task sequence optimization methods for the manipulator to minimize the task-finishing time. First, a kinematic model of the manipulator is presented, and the anticipated times for moving among the task locations are computed. Then, a mathematical model of the task sequence optimization problem is presented, followed by a comparison of three meta-heuristic methods to solve the optimization problem: an ant colony system, simulated annealing, and a genetic algorithm. The simulation shows that the genetic algorithm is robust to the parameter settings and has the best performance in both minimizing the task-finishing time and the computing time compared to the other methods. Finally, the algorithms were implemented and validated through a simulation using Mathworks' Matlab and Coppelia Robotics' V-REP (virtual robot experimentation platform).
[1]
J. Denavit,et al.
A kinematic notation for lower pair mechanisms based on matrices
,
1955
.
[2]
John H. Holland,et al.
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
,
1992
.
[3]
C. D. Gelatt,et al.
Optimization by Simulated Annealing
,
1983,
Science.
[4]
Marco Dorigo,et al.
Distributed Optimization by Ant Colonies
,
1992
.
[5]
Dan Boneh,et al.
On genetic algorithms
,
1995,
COLT '95.
[6]
Marco Dorigo,et al.
Ant system: optimization by a colony of cooperating agents
,
1996,
IEEE Trans. Syst. Man Cybern. Part B.
[7]
J. Lee.
A Change of Peak Outflows due to Decision of Flow Path in Storm Sewer Network
,
2010
.