Automatic Generation of NC Production Plans in Stamping and Laser Cutting

Raggenbass, A.; Reissner, Josef

doi:10.1016/s0007-8506(07)61979-9

Cited by 19 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The papers that consider common cuts and collisions are either complete CAM system descriptions [76][77][78][79][80], or consider an EDM application where the cutter never stops cutting [66,68], or our own work which focuses on considering simultaneously as many problem aspects as possible [6,[71][72][73][74][75]. Similarly, the papers that consider piercings and bridges are CAM system descriptions [76][77][78][79][80], our own previous work [6,73,75], and one more paper [64]. Thermal effects are only considered by three papers [50][51][52] in addition to our own previous work [74,75].…”

Section: Classificationmentioning

confidence: 99%

See 1 more Smart Citation

A review of cutting path algorithms for laser cutters

Dewil

Vansteenwegen

Cattrysse

2016

Int J Adv Manuf Technol

View full text Add to dashboard Cite

This paper presents a review of the literature on generating cutting paths for laser cutting machines. Firstly, the cutting path problem is defined including all relevant technical side constraints which exist plentifully in laser cutting. Secondly, a former classification method is updated to include all types of cutting path problems. Thirdly, a comprehensive review of solution methods and related applications is presented. Throughout the literature review, trends in research in cutting path generation and interesting areas for future research are identified.

show abstract

Section: Classificationmentioning

confidence: 99%

“…Raggenbass and Reissner [76,77] describe an expert system which recognizes part geometry and generates a complete NC manufacturing plan for a combined stamping-laser cutting machine. For the laser cutting path, the plate is recursively divided in strips of alternating orientation until all parts are part of a single strip.…”

Section: Cam System Descriptionsmentioning

confidence: 99%

A review of cutting path algorithms for laser cutters

Dewil

Vansteenwegen

Cattrysse

2016

Int J Adv Manuf Technol

View full text Add to dashboard Cite

show abstract

“…This data concerns the packing of all the items within a surface that represent the raw material, as illustrated in Figure 1. The position of pieces in the layout stage can be performed by computer-aided design (CAD) systems [10,11] or generated by algorithmic methods [8,[12][13][14]. Wäscher et al used the term strip packing problem to refer to them [7].…”

Section: Introductionmentioning

confidence: 99%

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

et al. 2021

View full text Add to dashboard Cite

The problem of efficiently cutting smaller two-dimensional pieces from a larger surface is recurrent in several manufacturing settings. This problem belongs to the domain of cutting and packing (C&P) problems. This study approached a category of C&P problems called the minimum time cut path (MTCP) problem, which aims to identify a sequence of cutting and sliding movements for the head device to minimize manufacturing time. Both cutting and slide speeds (just moving the head) vary according to equipment, despite their relevance in real-world scenarios. This study applied the MTCP problem on the practical scope and presents two metaheuristics for tackling more significant instances that resemble real-world requirements. The experiments presented in this study utilized parameter values from typical laser cutting machines to assess the feasibility of the proposed methods compared to existing commercial software. The results show that metaheuristic-based solutions are competitive when addressing practical problems, achieving increased performance regarding the processing time for 94% of the instances.

show abstract

“…Raggenbass et al [5] and Pan et al [6] also studied on layout and path planning system for irregular shape parts. Fig.…”

Section: Introductionmentioning

confidence: 99%

A Robust Fast Bridging Algorithm for Laser Cutting

Hu¹,

Lin²,

Fu³

2021

Preprint

View full text Add to dashboard Cite

Bridging the different parts together is considered a simple but effective strategy to reduce the number of piercing operations during laser cutting. However, fast bridging is never an easy task. In this paper, we present a near-linear bridging algorithm for the input parts with the shortest total bridge length. At first, the input part contours are discretized into a point cloud, then the point cloud is triangulated with the Delaunay standard. The shortest line segments between any two adjacent parts are found in the triangles connecting the two parts. These segments are finally extended into bridges. To solve the problem of the damages to the contour characteristics caused by the bridges, some restrictions are set on the screening of the discrete point cloud and the Delaunay triangles. This algorithm not only ensures the minimum total distance of all bridges, but also avoids the problem of generating bridge loops. Computational experiments show that the proposed bridging algorithm is much faster than that in existing commercial software. The feasibility and superiority of the algorithm are verified by actual lasering cutting experiments.

show abstract

Automatic Generation of NC Production Plans in Stamping and Laser Cutting

Cited by 19 publications

References 4 publications

A review of cutting path algorithms for laser cutters

A review of cutting path algorithms for laser cutters

Metaheuristics for the Minimum Time Cut Path Problem with Different Cutting and Sliding Speeds

A Robust Fast Bridging Algorithm for Laser Cutting

Contact Info

Product

Resources

About