Abstract: This paper studies the path sorting and integration problem in automatic path planning system of painting robots. To take both path length and painting direction into account, the problem is modeled as an open Generalized Traveling Salesman Problem(GTSP), and the corresponding optimization objective and cost matrix are created. An Ant Colony Optimization(ACO) algorithm is proposed to solve the problem, and the searching ability as well as convergence performance in the global solution space is guaranteed with the parallelism and positive feedback of ACO. Simulation experimental results show the validity of the method.
Generalized Traveling Salesman Problem(GTSP),
Ant Colony Optimization(ACO),
Genetic Algorithm (GA),