A Study on Torch Path Generation for Laser Cutting Process

레이저 절단공정에서의 토지경로 생성에 관한 연구

  • Han, Guk-Chan (Dept. of Mechanical Engineering, Korea Advanced Institute of Science and Technology) ;
  • Na, Seok-Ju (Dept. of Mechanical Engineering, Korea Advanced Institute of Science and Technology)
  • 한국찬 (한국과학기술원 기계공학과) ;
  • 나석주 (한국과학기술원 기계공학과)
  • Published : 1996.06.01


This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.


Torch Path Problem;Simulated Annealing Algorithm;Cost Function;Laser Cutting;Neighborhood Structure;Piercing Point