Author:
Liang Antian,Yang Hanshi,Sun Liming,Sun Meng
Abstract
Today, although laser engraving technology is widely used in 2D image engraving, when the image is larger and more complicated, most existing algorithms for engraving path planning have a huge computational burden and reduced engraving efficiency. Accordingly, this article addresses the trajectory optimization problem in large-scale image engraving. First, we formulate the problem as an improved model based on the large-scale traveling salesman problem (TSP). Then, we propose a three-layered algorithm called 3L-MFEA-MP, structured as follows: an upper layer, the genetic algorithm (GA); a middle layer, the GA; and a bottom layer, the parallel multifactorial evolutionary algorithm. Experiments on four classic large-scale TSP datasets show that our algorithm exhibits superior performance in terms of the path length and engraving time compared with other algorithms. In particular, compared with the single-thread algorithm, the proposed parallel algorithm reduced the engraving time by 80%. Moreover, the engraving machine experiment demonstrated that the engraving time of our algorithm on mona-lisa 100K, vangogh 120K, and venus 140K was approximately one tenth that of the traditional dot engraving method. The results indicate that the proposed algorithm can reduce the computational burden and improve engraving efficiency in engraving path planning.
Funder
National National College Students' innovation and entrepreneurship training program of China
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference29 articles.
1. Effect of Laser Cutting on Core Losses in Electrical Machines—Measurements and Modeling
2. The Traveling Salesman Problem and Its Variations,2006
3. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation;Cook,2011
4. A New Tour Construction Algorism and its Application in Laser Carving Path Control;Ruan;J. Image Graph.,2007
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献