CN114066103A - Cutting path planning method and system for two-dimensional irregular part layout drawing - Google Patents
Cutting path planning method and system for two-dimensional irregular part layout drawing Download PDFInfo
- Publication number
- CN114066103A CN114066103A CN202111534772.XA CN202111534772A CN114066103A CN 114066103 A CN114066103 A CN 114066103A CN 202111534772 A CN202111534772 A CN 202111534772A CN 114066103 A CN114066103 A CN 114066103A
- Authority
- CN
- China
- Prior art keywords
- odd
- cutting
- cutting path
- degree
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000005520 cutting process Methods 0.000 title claims abstract description 160
- 230000001788 irregular Effects 0.000 title claims abstract description 34
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000003698 laser cutting Methods 0.000 claims description 19
- 238000012986 modification Methods 0.000 claims description 9
- 230000004048 modification Effects 0.000 claims description 9
- 238000005457 optimization Methods 0.000 claims description 6
- 238000003909 pattern recognition Methods 0.000 claims description 5
- 238000004519 manufacturing process Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 4
- 238000005299 abrasion Methods 0.000 description 2
- 238000009776 industrial production Methods 0.000 description 2
- 239000002994 raw material Substances 0.000 description 2
- 229910000831 Steel Inorganic materials 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 239000011521 glass Substances 0.000 description 1
- 239000010985 leather Substances 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000002035 prolonged effect Effects 0.000 description 1
- 239000010959 steel Substances 0.000 description 1
- 239000002023 wood Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B23—MACHINE TOOLS; METAL-WORKING NOT OTHERWISE PROVIDED FOR
- B23K—SOLDERING OR UNSOLDERING; WELDING; CLADDING OR PLATING BY SOLDERING OR WELDING; CUTTING BY APPLYING HEAT LOCALLY, e.g. FLAME CUTTING; WORKING BY LASER BEAM
- B23K26/00—Working by laser beam, e.g. welding, cutting or boring
- B23K26/36—Removing material
- B23K26/38—Removing material by boring or cutting
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B23—MACHINE TOOLS; METAL-WORKING NOT OTHERWISE PROVIDED FOR
- B23K—SOLDERING OR UNSOLDERING; WELDING; CLADDING OR PLATING BY SOLDERING OR WELDING; CUTTING BY APPLYING HEAT LOCALLY, e.g. FLAME CUTTING; WORKING BY LASER BEAM
- B23K26/00—Working by laser beam, e.g. welding, cutting or boring
- B23K26/70—Auxiliary operations or equipment
- B23K26/702—Auxiliary equipment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/04—Manufacturing
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
- Y02P90/30—Computing systems specially adapted for manufacturing
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Plasma & Fusion (AREA)
- Marketing (AREA)
- Theoretical Computer Science (AREA)
- Optics & Photonics (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Mechanical Engineering (AREA)
- General Business, Economics & Management (AREA)
- Laser Beam Processing (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Manufacturing & Machinery (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Quality & Reliability (AREA)
Abstract
The invention relates to the field of part layout cutting, in particular to a method and a system for planning a cutting path of a two-dimensional irregular part layout drawing. The cutting path planning method comprises the following steps: A. obtaining a layout drawing according to the figure of the part to be cut; B. identifying each vertex in the layout drawing, and dividing the vertex into odd-degree points and even-degree points; C. when the number of the odd-degree points is zero, solving an Euler loop passing through each vertex in the layout chart; D. when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set; E. and D, carrying out repeated iteration operation according to the content of the step D until the number of the quarter points in the layout chart is zero, and obtaining the optimized cutting path corresponding to the layout chart. The cutting path planning method can obtain the shortest cutting path for cutting a single or a plurality of irregular parts, so that the time and the cost of the cutting operation of the irregular parts are saved, and the cutting efficiency is higher.
Description
Technical Field
The invention relates to the field of part layout cutting, in particular to a method and a system for planning a cutting path of a two-dimensional irregular part layout drawing.
Background
The cutting path planning method for the two-dimensional irregular part layout drawing can be widely applied to industrial production, such as manufacturing industries of wood processing, glass processing, steel plate cutting, leather cutting and the like. Most articles in life and production are made by piecing together small parts which are generally cut and separated from a mother plate of raw material. In the current industrial production, two-dimensional irregular parts required by orders are reasonably distributed on a raw material mother board, and then materials of the parts are processed and separated through a laser cutting device, so that the reasonable planning of cutting paths has great influence on the production efficiency. The laser cutting device is generally expensive, abrasion and consumption are caused in the cutting process, the cutting time is particularly critical for an urgent order, the production time can be shortened by optimizing the cutting path, the production cost can be saved, and the production efficiency can be greatly improved.
At present, a cutting path cannot be systematically planned in two-dimensional irregular part processing and blanking of more related enterprises, most enterprises directly cut one by one according to parts, and the laser cutting device is moved to the initial position after the last part is cut, so that the cutting device can repeatedly cut one edge and excessively wear cutting tools, the cutting time can be prolonged, and the production period and the production efficiency of each time are finally influenced.
Disclosure of Invention
In view of the above-mentioned drawbacks, the present invention provides a method and a system for planning a cutting path of a two-dimensional irregular part layout pattern, so as to optimize and minimize the required cutting path and improve the cutting efficiency.
In order to achieve the purpose, the invention adopts the following technical scheme:
a cutting path planning method for a two-dimensional irregular part layout drawing comprises the following steps:
A. obtaining a layout drawing according to the figure of the part to be cut;
B. identifying the positions of all vertexes in the layout drawing, and dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex;
C. when the number of the odd-degree points is zero, solving Euler loops passing through each vertex in the layout drawing to obtain an optimized cutting path corresponding to the layout drawing;
D. when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points;
E. and D, repeating iterative operation according to the content of the step D until the number of the quarter points in the layout drawing is zero, and solving Euler loops passing through all vertexes in the layout drawing to obtain the optimized cutting path corresponding to the layout drawing.
Preferably, the step E further comprises a step F:
when the cutting path has more than two euler loops, i.e. sub-cutting loops;
and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path.
Preferably, the method further comprises a step G after the step F:
when the optimized cutting path does not pass through the cutting origin,
and connecting the cutting origin with the vertex with the latest distance in the closed-loop cutting path twice to obtain the optimal cutting path of the layout.
Preferably, the vertex and the line in the template map generate the euler loop by using a Fleury algorithm.
A cutting system, comprising: the device comprises a typesetting module, a graph recognition module, a graph modification module, an iteration module, an Euler loop planning module and a laser cutting module; the typesetting module is used for obtaining a typesetting drawing according to the part to be cut; the pattern recognition module is used for recognizing the positions of all vertexes in the layout pattern, dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex, and judging the number of the odd-degree points in the layout pattern; the figure modification module modifies the line shape and the vertex type of the layout drawing according to the figure identification module information; the iteration module performs iteration operation according to the planning instruction of the graphic planning module; the Euler loop planning module is used for producing the Euler loop by adopting a Fleury algorithm according to the top points and the lines in the layout chart; and the laser cutting module is used for carrying out laser cutting operation according to the cutting path planned by the Euler planning module.
Preferably, the specific operation of the graph modification module to modify the layout graph is as follows: when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points; and repeating iterative operation according to the content until the number of the quarter points in the layout drawing is zero, and solving Euler loops passing through all vertexes in the layout drawing to obtain the optimized cutting path corresponding to the layout drawing.
Preferably, the cutting system further comprises a sub-loop planning module, configured to receive identification information of the pattern identification module, when the cutting path has more than two euler loops, that is, sub-cutting loops; and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path.
Preferably, the cutting system further includes an optimization module, where the optimization module is configured to receive identification information of the pattern recognition module, and when the optimized cutting path does not pass through the cutting origin, connect the cutting origin and a vertex with the latest distance in the closed-loop cutting path twice, so as to obtain an optimal cutting path of the layout.
The embodiment of the invention has the following beneficial effects:
the cutting path planning method refers to the concept of an Euler circuit, continuously selects odd number points in an irregular part layout drawing to carry out shortest connecting line operation, after iterative operation is carried out according to setting, the odd number points in the irregular part layout drawing can be completely eliminated, the shortest connecting line is planned into a cutting path, finally, the Euler circuit is planned for an irregular figure formed by single or multiple irregular parts, and finally, the shortest cutting path for cutting the single or multiple irregular parts can be obtained, so that the cutting operation of the irregular parts saves time and cost, and the cutting efficiency is higher.
Drawings
Fig. 1 is a schematic flow chart of a cutting path planning method according to an embodiment of the present invention;
fig. 2 is a schematic operation diagram of steps (a) to (f) in the cutting path planning method according to another embodiment of the present invention;
FIG. 3 is a schematic diagram illustrating the operation of steps (f) to (m) in the cutting path planning method in the embodiment shown in FIG. 2;
fig. 4 is an enlarged schematic view of the cutting path obtained in step (m) in the cutting path planning method in the embodiment shown in fig. 3.
Detailed Description
The technical scheme of the invention is further explained by the specific implementation mode in combination with the attached drawings.
In an embodiment of the present application, as shown in fig. 1, a method for planning a cutting path of a two-dimensional irregular part layout diagram includes the following steps:
A. obtaining a layout drawing according to the figure of the part to be cut;
B. identifying the positions of all vertexes in the layout drawing, and dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex;
C. when the number of the odd-degree points is zero, solving Euler loops passing through each vertex in the layout drawing to obtain an optimized cutting path corresponding to the layout drawing;
D. when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points;
E. and D, repeating iterative operation according to the content of the step D until the number of the quarter points in the layout drawing is zero, and solving Euler loops passing through all vertexes in the layout drawing to obtain the optimized cutting path corresponding to the layout drawing.
The cutting path planning method refers to the concept of an Euler circuit, continuously selects odd number points in an irregular part layout drawing to carry out shortest connecting line operation, after iterative operation is carried out according to setting, the odd number points in the irregular part layout drawing can be completely eliminated, the shortest connecting line is planned into a cutting path, finally, the Euler circuit is planned for an irregular figure formed by single or multiple irregular parts, and finally, the shortest cutting path for cutting the single or multiple irregular parts can be obtained, so that the cutting operation of the irregular parts saves time and cost, and the cutting efficiency is higher.
The step E also comprises the step F: when the cutting path has more than two euler loops, i.e. sub-cutting loops; and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path. After the step E is added, a plurality of sub-cutting loops of each irregular figure dispersed in the layout can be fused into a complete closed-loop cutting path; the cutting path planning method can plan a closed-loop cutting path, and the laser cutting module can cut and separate each irregular part graph in the layout graph more efficiently in the shortest cutting path and the shortest cutting time along the closed-loop cutting path.
Step G is also included after step F: and when the optimized cutting path does not pass through the cutting origin, connecting the cutting origin with the vertex with the latest distance in the closed-loop cutting path twice to obtain the optimal cutting path of the layout. Increase behind the G step, can make laser cutting module when cutting each irregular part figure in arranging the appearance picture, can make laser cutting module from cutting the initial point of origin cutting, follow at last the cutting back of all figures is accomplished to the optimum cutting route can return to on the cutting initial point for at every turn laser cutting operation, homoenergetic begins and ends from the cutting initial point, need not carry out the operation of adding standard of cutting initial point, makes laser cutting operation more high-efficient, and the cutting precision is higher.
Specifically, the Euler loop is generated by using a Fleury algorithm for the top points and the lines in the template graph.
The Fleury algorithm is an effective algorithm for solving the Euler loop, and aims to connect all undirected edges in a graph into a complete Euler loop from a starting point and ensure that each edge only passes once.
An embodiment of the present application, as shown in fig. 2 to 4, is a method for planning a cutting path of a two-dimensional irregular part layout diagram, which is characterized by including the following steps:
(a) obtaining a layout drawing according to the figure of the part to be cut;
(b) identifying the positions of all vertexes in the layout drawing, and dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex; as shown in fig. 2, the top points circled by circles are odd-degree points, and other points not marked are even-degree points;
(c) when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points;
(d) repeating the iteration operation according to the content of the step (c) until the number of the quarter points in the layout chart is zero;
(f) when the cutting path has more than two euler loops, i.e. sub-cutting loops; and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path.
(m) when the optimized cutting path does not pass through the cutting origin, connecting the cutting origin with the vertex with the latest distance in the closed-loop cutting path twice to obtain the optimal cutting path of the layout, as shown in fig. 4, wherein the sequence of the cutting path is represented by the arabic numerals in the optimal cutting path.
One embodiment of the present application, a cutting system, comprising: the device comprises a typesetting module, a graph recognition module, a graph modification module, an iteration module, an Euler loop planning module and a laser cutting module; the typesetting module is used for obtaining a typesetting drawing according to the part to be cut; the pattern recognition module is used for recognizing the positions of all vertexes in the layout pattern, dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex, and judging the number of the odd-degree points in the layout pattern; the figure modification module modifies the line shape and the vertex type of the layout drawing according to the figure identification module information; the iteration module performs iteration operation according to the planning instruction of the graphic planning module; the Euler loop planning module is used for producing the Euler loop by adopting a Fleury algorithm according to the top points and the lines in the layout chart; and the laser cutting module is used for carrying out laser cutting operation according to the cutting path planned by the Euler planning module.
The specific operation of the graph modification module for modifying the layout graph is as follows: when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points; and repeating iterative operation according to the content until the number of the quarter points in the layout drawing is zero, and solving Euler loops passing through all vertexes in the layout drawing to obtain the optimized cutting path corresponding to the layout drawing.
The cutting system further comprises a sub-loop planning module for receiving the identification information of the pattern identification module, when the cutting path has more than two Euler loops, namely sub-cutting loops; and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path.
The cutting system further comprises an optimization module, wherein the optimization module is used for receiving the identification information of the pattern identification module, and when the optimized cutting path does not pass through the cutting origin, the cutting origin is connected with the vertex with the latest distance in the closed-loop cutting path twice to obtain the optimal cutting path of the layout.
The cutting system can be used for quickly planning the shortest cutting path for the two-dimensional irregular part layout drawing, the laser cutting module can be used for quickly separating and blanking all irregular parts along the shortest cutting path, the time for the operation of the laser cutting module is shortened, the abrasion of the cutting system is reduced, the automatic speech level of a cutting production line is improved, the cutting blanking efficiency is improved, and the production period of an enterprise is shortened.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, and it should be understood that when the terms "comprises" and/or "comprising" are used in this specification, they specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof, unless the context clearly indicates otherwise.
The relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise. Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description. Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate. In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values. It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
In the description of the present invention, it is to be understood that the orientation or positional relationship indicated by the orientation words such as "front, rear, upper, lower, left, right", "lateral, vertical, horizontal" and "top, bottom", etc. are usually based on the orientation or positional relationship shown in the drawings, and are only for convenience of description and simplicity of description, and in the case of not making a reverse description, these orientation words do not indicate and imply that the device or element being referred to must have a specific orientation or be constructed and operated in a specific orientation, and therefore, should not be considered as limiting the scope of the present invention; the terms "inner and outer" refer to the inner and outer relative to the profile of the respective component itself.
Spatially relative terms, such as "above … …," "above … …," "above … …," "above," and the like, may be used herein for ease of description to describe one device or feature's spatial relationship to another device or feature as illustrated in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if a device in the figures is turned over, devices described as "above" or "on" other devices or configurations would then be oriented "below" or "under" the other devices or configurations. Thus, the exemplary term "above … …" can include both an orientation of "above … …" and "below … …". The device may be otherwise variously oriented (rotated 90 degrees or at other orientations) and the spatially relative descriptors used herein interpreted accordingly.
The technical principle of the present invention is described above in connection with specific embodiments. The description is made for the purpose of illustrating the principles of the invention and should not be construed in any way as limiting the scope of the invention. Based on the explanations herein, those skilled in the art will be able to conceive of other embodiments of the present invention without inventive effort, which would fall within the scope of the present invention.
Claims (8)
1. A cutting path planning method for a two-dimensional irregular part layout drawing is characterized by comprising the following steps:
A. obtaining a layout drawing according to the figure of the part to be cut;
B. identifying the positions of all vertexes in the layout drawing, and dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex;
C. when the number of the odd-degree points is zero, solving Euler loops passing through each vertex in the layout drawing to obtain an optimized cutting path corresponding to the layout drawing;
D. when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points;
E. and D, repeating iterative operation according to the content of the step D until the number of the quarter points in the layout drawing is zero, and solving Euler loops passing through all vertexes in the layout drawing to obtain the optimized cutting path corresponding to the layout drawing.
2. The method for planning the cutting path of the two-dimensional irregular part layout drawing according to claim 1, wherein the step E is further followed by the step F:
when the cutting path has more than two euler loops, i.e. sub-cutting loops;
and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path.
3. The method for planning the cutting path of the two-dimensional irregular part layout drawing according to claim 2, wherein the step F is followed by a step G:
when the optimized cutting path does not pass through the cutting origin,
and connecting the cutting origin with the vertex with the latest distance in the closed-loop cutting path twice to obtain the optimal cutting path of the layout.
4. The method for planning the cutting path of the two-dimensional irregular part layout drawing as claimed in claim 1, wherein the Euler loop is generated by using a Fleury algorithm for the vertex and the line in the layout drawing.
5. A cutting system, comprising: the device comprises a typesetting module, a graph recognition module, a graph modification module, an iteration module, an Euler loop planning module and a laser cutting module;
the typesetting module is used for obtaining a typesetting drawing according to the part to be cut;
the pattern recognition module is used for recognizing the positions of all vertexes in the layout pattern, dividing the corresponding vertexes into odd-degree points and even-degree points according to the odd-even number condition of the number of line edges passed by each vertex, and judging the number of the odd-degree points in the layout pattern;
the figure modification module modifies the line shape and the vertex type of the layout drawing according to the figure identification module information;
the iteration module performs iteration operation according to the planning instruction of the graphic planning module;
the Euler loop planning module is used for producing the Euler loop by adopting a Fleury algorithm according to the top points and the lines in the layout chart;
and the laser cutting module is used for carrying out laser cutting operation according to the cutting path planned by the Euler planning module.
6. The cutting system according to claim 5, wherein the pattern modification module is configured to modify the layout pattern by: when the number of the odd-degree points is not zero, connecting all the odd-degree points pairwise to obtain an odd-degree connecting line set, planning the shortest odd-degree connecting line in the odd-degree connecting line set into a cutting path, and updating the odd-degree points at two ends of the shortest odd-degree connecting line into even-degree points;
and repeating iterative operation according to the content until the number of the quarter points in the layout drawing is zero, and solving Euler loops passing through all vertexes in the layout drawing to obtain the optimized cutting path corresponding to the layout drawing.
7. The cutting system according to claim 6, further comprising a sub-loop planning module for receiving identification information of the pattern recognition module when the cutting path has more than two Euler loops (sub-cutting loops);
and connecting two vertexes with the nearest distance in the adjacent Euler loops twice to form a new Euler loop, and repeating iteration operation until only one Euler loop exists in the template map to obtain a closed-loop cutting path.
8. The cutting system of claim 7, further comprising an optimization module,
the optimization module is used for receiving the identification information of the pattern identification module, when the optimized cutting path does not pass through the cutting origin,
and connecting the cutting origin with the vertex with the latest distance in the closed-loop cutting path twice to obtain the optimal cutting path of the layout.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111534772.XA CN114066103A (en) | 2021-12-15 | 2021-12-15 | Cutting path planning method and system for two-dimensional irregular part layout drawing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111534772.XA CN114066103A (en) | 2021-12-15 | 2021-12-15 | Cutting path planning method and system for two-dimensional irregular part layout drawing |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114066103A true CN114066103A (en) | 2022-02-18 |
Family
ID=80229524
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111534772.XA Pending CN114066103A (en) | 2021-12-15 | 2021-12-15 | Cutting path planning method and system for two-dimensional irregular part layout drawing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114066103A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114925915A (en) * | 2022-05-23 | 2022-08-19 | 广东工业大学 | Cutting path planning method and system for large-scale blanking |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111260135A (en) * | 2020-01-17 | 2020-06-09 | 山东晨熙智能科技有限公司 | Method and system for solving cutting path of closed printing |
| CN113347059A (en) * | 2021-05-24 | 2021-09-03 | 北京邮电大学 | In-band network telemetering optimal detection path planning method based on fixed probe position |
-
2021
- 2021-12-15 CN CN202111534772.XA patent/CN114066103A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111260135A (en) * | 2020-01-17 | 2020-06-09 | 山东晨熙智能科技有限公司 | Method and system for solving cutting path of closed printing |
| CN113347059A (en) * | 2021-05-24 | 2021-09-03 | 北京邮电大学 | In-band network telemetering optimal detection path planning method based on fixed probe position |
Non-Patent Citations (3)
| Title |
|---|
| 侯茂盛等: "基于改进Fleury算法的激光扫描投影路径规划方法", 《应用光学》 * |
| 吴俊杰: "船体零件数控切割路径优化研究", 《中国优秀博硕士学位论文全文数据库（博士） 工程科技Ⅱ辑》 * |
| 陈艳平等: "基于欧拉回路的数控火焰切割路径优化研究与实现", 《制造业自动化》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114925915A (en) * | 2022-05-23 | 2022-08-19 | 广东工业大学 | Cutting path planning method and system for large-scale blanking |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104933387B (en) | Rapid positioning and identifying method based on two-dimensional code decoding | |
| CN102592031B (en) | Automatic stock layout method of insulated paper board | |
| CN101718977B (en) | CAM system for automobile longeron punching processing and control method and construction method thereof | |
| CN108247764A (en) | Plank cutting method, device, electronic equipment and medium based on machine learning | |
| CN108262809A (en) | Plank processing method, device, electronic equipment and medium based on artificial intelligence | |
| CN114066103A (en) | Cutting path planning method and system for two-dimensional irregular part layout drawing | |
| CN109733508B (en) | Production control method, device, equipment and system for material-driven production | |
| Faigl et al. | Fast heuristics for the 3-D multi-goal path planning based on the generalized traveling salesman problem with neighborhoods | |
| US20230173703A1 (en) | Cutting stock approach and system for rectangular sheets with defects | |
| CN102707669A (en) | Method for constructing CAM (computer-aided manufacturing) system for punching for automobile girders | |
| CN109063917A (en) | Sublevel cloth Nesting based on genetic Optimization Algorithm | |
| CN114239958B (en) | Laser cutting method and system for special-shaped part based on machine vision | |
| CN111462119A (en) | Wide and thick plate shearing stock layout method based on machine vision | |
| CN104636867A (en) | Method and device for quickly generating material code from texture in ERP system | |
| CN113190885A (en) | Layout planning method for industrial assembly line workshop | |
| KR102162088B1 (en) | Method for auto nest building to using genetic algorithm smart auto nesting of programs | |
| CN115170580A (en) | Plate processing control method and device, computer equipment and storage medium | |
| CN111090624A (en) | MES and CR plate-based customized furniture plate classification combination algorithm | |
| CN116342554A (en) | Wafer regularity failure adjacent die marking method adopting deep learning and related device | |
| CN110705650A (en) | Metal plate layout method based on deep learning | |
| CN106843158B (en) | CAM system of stamping frame connecting plate equipment and processing method | |
| CN111353255A (en) | Automatic generation system of processing parameters | |
| CN101850564B (en) | Numerical control surging and punching control method | |
| CN109188898B (en) | Optimal parameter decision method under ship longitudinal motion multi-target strategy | |
| CN114925915B (en) | Cutting path planning method and system for large-scale blanking |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |