Nested Sub-Space Sequencing for Laser Cutting Layout Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for nesting workpieces on a raw material sheet for laser cutting processes do not always derive the most efficient arrangement, leading to suboptimal material usage and cutting paths, which can result in increased costs and quality issues.
Innovation Solution
A method that involves reading and evaluating criteria for arranging sub-spaces using a combination of sequence data, evaluation data, and calculation data through a data aggregation routine within an evaluation algorithm, iteratively improving the nesting arrangement until specified efficiency and quality parameters are met, utilizing a combinatorial logic and data aggregation to optimize the cutting process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If geometric nesting is performed first to determine workpiece arrangement, then a travel sequence can be determined for the processing head, but the nesting results can always be further improved and the existing methods could not always derive the best nesting
Solution Approach 1:
The patent segments the nesting problem into two distinct phases: geometric nesting (arranging workpiece contours on the material sheet) and travel sequence optimization (determining the cutting path). This segmentation allows each phase to be optimized independently, with the travel sequence optimization phase able to improve upon the initial geometric nesting without requiring complete re-optimization of the entire problem.
Solution Approach 2:
The patent introduces dynamic optimization by allowing the travel sequence to be adjusted and optimized after the initial geometric nesting is performed. The system can iteratively improve the nesting results by modifying the travel sequence, making the overall process adaptive rather than static.
2Productivity
If a simple geometric nesting method is used, then the nesting process is fast and simple, but the material efficiency and cutting path optimization are suboptimal
Solution Approach 1:
The patent performs preliminary geometric nesting first to establish a baseline arrangement of workpieces on the material sheet. This preliminary action provides a starting point that is quickly obtained, and then subsequent travel sequence optimization builds upon this foundation to achieve better material efficiency without starting from scratch.
Solution Approach 2:
The patent introduces an intermediary optimization step between geometric nesting and final cutting execution. The travel sequence optimization acts as an intermediary that refines the initial nesting arrangement, achieving better material efficiency while adding only moderate computational overhead compared to performing complete optimization from the beginning.
Data Source
AI summary
The present disclosure relates to nesting sub-spaces for a machine tool by reading in evaluation criteria for an arrangement of nested sub-spaces, generating sequence data for an arrangement of nested sub-spaces, repeatedly performing a process until the result data exceeds a specified range. The process includes: generating evaluation data by evaluating the sequence data with an evaluation algorithm, generating result data based on a combinatorial logic of the evaluation data with the evaluation criteria, generating calculation data from the sequence data, the evaluation data, and the result data using the evaluation algorithm, generating further sequence data taking into account the calculation data with the evaluation algorithm, and repeating the process until the result data exceeds a specified range. The calculation data acts onto the generation of new sequence data to improve an arrangement of nested sub-spaces with respect to evaluation criteria.