Laser cutting method and system for irregular parts based on machine vision
AssigneeGuangdong University of Technology
InventorsLijun WEI, Tai ZHANG, Qiang LIU, Libin LIN, Ailin YU
Life of this patent
Estimating the term…
Abstract
A laser cutting method for irregular parts based on machine vision includes: (A) obtaining and numbering vertices of all parts on the layout diagram; (B) planning a part vertex set and an empty cutting path vertex set; (C) obtaining a shortest empty cutting path and the empty cutting path vertex set with the shortest empty cutting path; (D) cutting the parts one by one according to an order obtained by the CPLEX algorithm. This application further provides a laser cutting system.
Claims2
A laser cutting method for irregular parts based on machine vision, comprising:
- (A) obtaining a layout diagram according to patterns of parts to be cut;
- and obtaining and numbering vertices of each of the parts to be cut on the layout diagram;
- (B) planning vertex numbers of each of the parts to be cut into a part vertex set;
- and randomly extracting an element from the part vertex set followed by combining with a cutting starting point to form an empty cutting path vertex set;
- (C) taking the empty cutting path vertex set as a travelling salesman problem (TSP);
- finding a shortest path passing through all vertices in the empty cutting path vertex set;
- solving an empty cutting path of the empty cutting path vertex set by using a CPLEX algorithm;
- and comparing empty cutting paths of empty cutting path vertex sets to obtain a shortest empty cutting path and an empty cutting path vertex set with the shortest empty cutting path;
- (D) cutting the parts to be cut one by one according to an order obtained by the CPLEX algorithm;
- when cutting a part, selecting a vertex corresponding to a first element in an empty cutting path vertex set corresponding to the part as a starting point and selecting a vertex corresponding to a second element in the empty cutting path vertex set as an ending point to generate a cycle for cutting to obtain a physical cutting path;
- obtaining an empty cutting path from the starting point to a selected vertex in each part to be cut;
- and integrating the physical cutting path with the empty cutting path to obtain an optimized cutting path;
- and
- (E) when cutting the parts to be cut one by one, obtaining, by a visual inspection module, boundary information of a raw material sheet, and comparing the boundary information with the physical cutting path;
- when the physical cutting path coincides with a boundary of the raw material sheet, integrating the physical cutting path into the empty cutting path to obtain an optimal cutting path;
- and allowing a laser cutting module to emit laser rays for cutting in the physical cutting path and not to emit laser rays in the empty cutting path;
- in the step (C), a mathematical model for comparing the empty cutting paths of the empty cutting path vertex sets to obtain the shortest empty cutting path and the empty cutting path vertex set with the shortest empty cutting path is expressed as follows:
- min Σe∈A Cexe (1)
- s. t.
- Σe∈Δ(i) xe=2wi, ∀i∈V, (2)
- Σe∈Δ(p) xe=2, ∀p∈P, (3)
- Σe∈Δ(S) xe≤|S|−1, ∀SCP, 2≤|S|≤n−1 (4)
- xe∈{0,1}, ∀e∈A, (5)
- wi∈{0,1}, ∀i∈V,;
- (6)
- wherein A is a set of edges;
- V is a set of all vertices;
- p is a part vertex set;
- P is a set of parts corresponding to all part vertex sets;
- Ce represents a length of edge e;
- Xe is a basic variable;
- Wi is an auxiliary variable;
- Δ(i) indicates a set of edges connected to point i;
- Δ(p) indicates a set of edges connected to points in the part vertex set p;
- and S represents a subset of the set P;
- and
- (E) when cutting the parts to be cut one by one, obtaining, by a visual inspection module, boundary information of a raw material sheet, and comparing the boundary information with the physical cutting path;
- when the physical cutting path coincides with a boundary of the raw material sheet, integrating the physical cutting path into the empty cutting path to obtain an optimal cutting path;
- and
- allowing a laser cutting module to emit laser rays for cutting in the physical cutting path and not to emit laser rays in the empty cutting path;
- in the step (E), the boundary information is compared with the physical cutting path through steps of:
- obtaining a vertex coordinate of each of the parts to be cut on the layout diagram;
- obtaining a vertex coordinate of the raw material sheet by machine vision;
- determining whether a part to be cut has a vertex on the boundary of the raw material sheet:
- if yes, calculating a slope of an edge of the part to be cut connected to the vertex;
- if the slope is the same as that of the boundary of the raw material sheet, indicating that the edge of the part to be cut is on the boundary of the raw material sheet;
- and judging edges of the parts to be cut one by one according to a cutting order selected by a selection method of the optimized cutting path.
A laser cutting system for irregular parts based on machine vision, comprising:
- a layout module;
- a pattern recognition and arrangement module;
- a point set operation module;
- a cutting path planning module;
- a laser cutting module;
- and
- a vision inspection module;
- wherein the layout module is configured to obtain a layout diagram according to parts to be cut;
- the pattern recognition and arrangement module is configured to obtain and number vertices of each of the parts to be cut on the layout diagram, plan vertex numbers of each of the parts to be cut into a part vertex set, and randomly extract an element from the part vertex set to combine with a cutting starting point to form an empty cutting path vertex set;
- the point set operation module is configured to take the empty cutting path vertex set as a travelling salesman problem (TSP), find a shortest path passing through all vertices in the empty cutting path vertex set, solve an empty cutting path of the empty cutting path vertex set by using a CPLEX algorithm, and compare empty cutting paths of empty cutting path vertex sets to obtain a shortest empty cutting path and an empty cutting path vertex set with the shortest empty cutting path;
- the cutting path planning module is configured to cut the parts to be cut one by one according to an order obtained by the CPLEX algorithm;
- wherein when a part is cut, a vertex corresponding to a first element in an empty cutting path vertex set corresponding to the part and a vertex corresponding to a second element in the empty cutting path vertex set are respectively selected as a starting point and an ending point to generate a cycle for cutting to obtain a physical cutting path;
- an empty cutting path from the starting point to a selected vertex in each part to be cut is obtained;
- and an optimized cutting path is obtained by integrating the physical cutting path with the empty cutting path;
- the laser cutting module is configured to perform laser cutting according to the physical cutting path and the empty cutting path planned by the cutting path planning module;
- the point set operation module is provided with a mathematical model configured to compare the empty cutting paths of the empty cutting path vertex sets to obtain the shortest empty cutting path and the empty cutting path vertex set with the shortest empty cutting path, and the mathematical model is expressed as:
- min Σe∈A Cexe (1)
- s. t.
- Σe∈Δ(i) xe=2wi, ∀i∈V, (2)
- Σe∈Δ(p) xe=2, ∀p∈P, (3)
- Σe∈Δ(S) xe≤|S|−1, ∀SCP, 2≤|S|≤n−1 (4)
- xe∈{0,1}, ∀e∈A, (5)
- wi∈{0,1}, ∀i∈V,;
- (6)
- wherein A is a set of edges;
- V is a set of all vertices;
- p is a part vertex set;
- P is a set of parts corresponding to all part vertex sets;
- Ce represents a length of edge e;
- Xe is a basic variable;
- Wi is an auxiliary variable;
- Δ(i) indicates a set of edges connected to point i;
- Δ(p) indicates a set of edges connected to points in the part vertex set p;
- and S represents a subset of the set P;
- the visual inspection module is configured to obtain boundary information of a raw material sheet, and compare the boundary information with the physical cutting path to judge whether the boundary information coincides with the physical cutting path;
- wherein the boundary information is compared with the physical cutting path through the following steps:
- obtaining a vertex coordinate of each of the parts to be cut on the layout diagram;
- obtaining a vertex coordinate of the raw material sheet by machine vision;
- determining whether a part to be cut has a vertex on the boundary of the raw material sheet;
- if yes, calculating a slope of an edge of the part to be cut connected to the vertex;
- if the slope is the same as that of the boundary of the raw material sheet, indicating that the edge of the part to be cut is on the boundary of the raw material sheet;
- and judging edges of the parts to be cut one by one, according to a cutting order selected by a selection method of the optimized cutting path.
Dependencies are inferred from the claim text.