CN102880113A - Laser cutting path optimizing method - Google Patents
Laser cutting path optimizing method Download PDFInfo
- Publication number
- CN102880113A CN102880113A CN2012104182743A CN201210418274A CN102880113A CN 102880113 A CN102880113 A CN 102880113A CN 2012104182743 A CN2012104182743 A CN 2012104182743A CN 201210418274 A CN201210418274 A CN 201210418274A CN 102880113 A CN102880113 A CN 102880113A
- Authority
- CN
- China
- Prior art keywords
- contour patterns
- grid
- patterns
- contour
- warp
- 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.)
- Granted
Links
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Numerical Control (AREA)
Abstract
The invention relates to the technical field of digital control laser cutters, and in particular relates to a laser cutting path optimizing method. The optimizing method is characterized by comprising the following steps: (1) inputting a graph to be cut into a control system of the laser cutter, wherein the graph is composed of at least one independent pattern, and each pattern is composed of at least one outline pattern; (2) ordering all outline patterns in the graph in accordance with inner and outer layers, so as to distinguish that whether the filling type of each outline pattern is negative cutting or positive cutting; (3) in the output graph with ordered outline patterns in inner and outer layers, ordering the outline patterns of each layer from inside to outside in sequence in a single layer and separated piece mode; and (4) outputting an optimized path. Compared with the prior art, the rate that single section long distance empty motion happens is greatly reduced, the potential safety hazard is reduced, the implementation is simple, the speed is rapid, and the efficiency in processing large graphs is higher.
Description
Technical field
The present invention relates to the numerical control laser cutter technical field, specifically a kind of cut method for optimizing route.
Background technology
Generally all adopt the CAM software programming in laser cutting system, this CAM software is to generate the NC code that machine tool can read by computer programming, thereby makes the machine tool operation, and is more accurate, more efficient, for enterprise saves a large amount of costs.Adopt a key issue will considering when CAM software is programmed is how to improve cutting efficiency.If cutting efficiency is excessively low, will inevitably increase processing cost, cause enterprise competitiveness to descend.In cutting process, the length that the sky that comprises on the laser head path moves is the bottleneck of restriction cutting efficiency.For the figure that a plurality of profiles are arranged, different cutting sequences can produce different skies and move length.The purpose of path optimization finds a cutting path exactly, makes sky move length short as far as possible, must satisfy again some specific (special) requirements of laser cutting parameter.
The method for optimizing route that general laser cutting software adopts can be divided into two large classes: the one, and interactive optimization, it is the manual or automanual generation cutting path of experience of User, the advantage of these class methods is generally can both obtain optimal path, but fairly large figure is needed a large amount of manual operationss, reduced equally efficient; The 2nd, Automatic Optimal, these class methods can be divided into two classes again: the one, according to certain predetermined rule, as from left to right to the figure auto-sequencing, the cutting path that produces like this is more regular, also can shorten sky and move length, but apart from larger, there is not a kind of rule can adapt to all situations to different graphics-optimized weak effects; The 2nd, intelligent optimization method, in conjunction with artificial intelligence and bionics algorithm, improve the effect of path optimization such as ant group algorithm, the cutting path that these class methods produce relatively approaches the human mode of thinking, it is shorter that sky moves length, but it is very large that the common shortcoming of intelligent optimization method is calculated amount, and travelling speed is very slow, can't process large-scale figure.Present automated path optimization method all moves apart from sky than being easier to produce unnecessary single hop length, and this is breakneck in laser cutting process.In addition, present automatic optimization method to the singularity of cut consider not, can't satisfy in practice the requirement of laser cutting parameter, even have larger potential safety hazard.
Summary of the invention
The objective of the invention is to overcome the deficiencies in the prior art, optimize the order of pattern cut, at utmost shorten sky and move.
For achieving the above object, design a kind of cut method for optimizing route, comprise that the process software by the laser cutting machine of computer control work carries out path optimization, it is characterized in that this optimization method comprises the steps: the figure of (1) the required cutting of input in the control system of laser cutting machine, described figure has at least an independent pattern to form, and each pattern is comprised of a contour patterns at least; (2) all contour patterns in the figure being carried out the ectonexine minor sort, is that the moon is cut or sun is cut with the filling type of distinguishing each contour patterns; The described treatment step that all contour patterns in the figure is carried out the ectonexine minor sort: (a), take out in the figure and be positioned at outermost all contour patterns, be mounted under the root node of one tree, and arrange that to fill type be that sun is cut; Each outermost contour patterns taken out the contour patterns of its most contiguous internal layer, be mounted under the present node, and arrange that to fill type be that the moon is cut (b), respectively; (c), the contour patterns that is in interior one deck is repeated above step, be arranged alternately successively from outside to inside the filling type of every one deck contour patterns, until reach innermost layer; (3) in the figure that sequences level inside and outside each contour patterns of output, successively the contour patterns of each level is carried out the individual layer block sorting from inside to outside; The treatment step that described individual layer block sorting adopts: (a), each contour patterns in the same level is calculated and set up grid; (b), positioning pattern, determine that namely each contour patterns is distributed in the position in each grid, output contour patterns grid array; (c), the traversal figure, namely according to the route traversal grid of planning, export successively the contour patterns in each contour patterns grid; (d), the figure after the output ordering; (4) output path optimizing.
Each contour patterns in the same level is calculated and set up grid adopt following treatment step: (a), calculate the minimum rectangle surround these all contour patterns of level; (b), rectangle is divided into 10 * 10 little rectangle by warp and weft; (c), the coordinate figure tabulation of every warp and weft of record; (d), warp and parallel sort from small to large by coordinate figure respectively.
Described positioning pattern adopts following treatment step: (a), according to parallel and warp list initialization grid, this grid is a two-dimensional array, and each element can both the some contour patterns of carry; (b), get a contour patterns, calculate this contour patterns centre coordinate (X, Y); (c), in parallel tabulation this Y coordinate figure of binary search, find the 1st parallel of this Y coordinate figure below, that is to say the 1st parallel of this contour patterns below, establishing this parallel sequence number is L; (d), in warp tabulation binary search X, find the 1st warp in this contour patterns left side, establish this warp sequence number M; (e), this contour patterns is navigated in the grid [L, M], this grid [L, M] is registered as 1 contour patterns grid; (f), judge whether contour patterns takes, when contour patterns does not take, return step (b); When all contour patterns take, then export contour patterns grid array, finish the location.
The treatment step that described traversal figure carries out: (a), 4 corners of procuratorial work grid, choose a wherein nearest contour patterns grid of distance reference point; (b), take reference point as benchmark, each contour patterns in the current contour patterns grid is done nearest ordering; (c), successively the contour patterns of exporting in the current contour patterns grid is tabulated to optimizing, and upgrading reference point is the terminal point of last contour patterns; (d), judge whether the whole contour patterns grids in the grid are covered; (e), all cover when the contour patterns grid, then export complete optimization tabulation; All do not cover when the contour patterns grid, get next contour patterns grid and return step (b); The rule of getting next contour patterns grid is to judge that first whether warp quantity is greater than parallel quantity, when warp quantity＞parallel quantity, then get the next contour patterns grid in these row, when warp number≤parallel quantity is got next contour patterns grid in this row, whenever cover row, the counter-rotating working direction is walked next column, whenever covers delegation, and the counter-rotating working direction is walked next line.
Described process software adopts CAM software.
The present invention compared with prior art has the following advantages:
1. can automatically accurately detect the relation of inclusion of any multilayer contour patterns, only the contour patterns of same level shortened the optimization that sky moves,, and between different ectonexines time, also can optimize sky during transition and move length then according to from inside to outside order cutting the contour patterns of different levels;
2. greatly reduce empty existing probability, the minimizing potential safety hazard of shifting out of the long distance of single hop;
3. be to advance by snakelike to the optimum results of the regular array contour patterns of same level, at utmost shorten sky and move; To contour patterns positional alignment rule, but the contour patterns of variform similar array, optimum results is equal to the regular array contour patterns, obviously is better than traditional optimization; To the contour patterns of irregular alignment, the test result of a large amount of master drawings shown adopt the present invention that the optimum results of most of figure still is better than existing method for optimizing route;
4. implement simply, speed is fast, processes extensive figure efficient higher.
Description of drawings
Fig. 1 is main-process stream block diagram of the present invention.
Fig. 2 is ectonexine minor sort schematic diagram among the present invention.
Fig. 3 is the individual layer block sorting FB(flow block) among Fig. 1.
Fig. 4 is the calculating among Fig. 3 and sets up the grid FB(flow block).
Fig. 5 is the positioning pattern FB(flow block) among Fig. 3.
Fig. 6 is the traversal figure FB(flow block) among Fig. 3.
Fig. 7 is the figure to be cut in the embodiment of the invention.
Fig. 8 is the cutting sequence schematic diagram after a pattern amplifies in the lower right corner among Fig. 7, and stain wherein represents the cutting starting point of contour patterns.
Fig. 9 is outermost layer cutting sequence schematic diagram among Fig. 7.
Embodiment
The invention will be further described below in conjunction with accompanying drawing.
As shown in Figure 1, cut method for optimizing route among the present invention is to adopt the process software by the laser cutting machine of computer control work to carry out path optimization, this process software adopts CAM software among the present invention, mainly comprises two large processing modules in this disposal route:
1, to the ectonexine minor sort of all contour patterns in the figure, it also is the relation of inclusion of the inside and outside level of contour patterns, that the moon is cut or sun is cut with the filling type of distinguishing each contour patterns, this is the important parameter that leads in/out with cut functions such as cutting gap compensations, generally needs to cut first internal layer to cut skin in cut again;
2, individual layer block sorting namely in the figure that sequences the contour patterns level, carries out the individual layer block sorting to the contour patterns of each level from inside to outside successively.
Embodiment 1
As shown in Figure 7, be a typical planar laser cutting drawing, some patterns are arranged in the figure on this drawing, the quantity of these patterns is medium, and interactive optimization is adopted in inconvenience; And each pattern comparatively rule that distributes, but not alignment, the cutting starting point of pattern is also different, and each pattern also is comprised of the contour patterns of some moulding, and these contour patterns may be comprised of closed lines, also may adopt inc lines.Behind this drawing input laser cutting machine, the CAM software in the laser cutting machine control system is handled as follows step:
One, by treatment step shown in Figure 1 each contour patterns is carried out the ectonexine minor sort first: (a), take out in the figure and be positioned at outermost all contour patterns, be mounted under the root node of one tree, and arrange that to fill type be that sun is cut; Each outermost contour patterns taken out the contour patterns of its most contiguous internal layer, be mounted under the present node, and arrange that to fill type be that the moon is cut (b), respectively; (c), the contour patterns that is in interior one deck is repeated above step, be arranged alternately successively from outside to inside the filling type of every one deck contour patterns, until reach innermost layer.
Separately in Fig. 7 a pattern in the lower right corner as example, by treatment step shown in Figure 2 this pattern is carried out result behind the ectonexine minor sort, referring to Fig. 8, each contour patterns in this pattern is distinguished expression with numeral, wherein, there is the multilayer relation of inclusion between contour patterns 5～contour patterns 10, its relation of inclusion from inside to outside is contour patterns 6-contour patterns 7-contour patterns 10, the present invention has guaranteed to cut first internal layer all the time, cut again outer field order, and between different inside and outside levels during transition, such as contour patterns 5, contour patterns 6 is in different inside and outside levels, also can optimize sky and move length, although it is contour patterns 5-contour patterns 9-contour patterns 8-contour patterns 7 that the shortest sky of the contour patterns in this pattern in same level moves order, but after considering the contour patterns 6 in the internal layer of contour patterns 7, it is contour patterns 5-contour patterns 6-contour patterns 7-contour patterns 8-contour patterns 9 that the shortest sky of each contour patterns moves order.
Two, referring to Fig. 3, the individual layer block sorting adopts following treatment step: (a), each contour patterns in the same level is calculated and set up grid; (b), positioning pattern, determine that namely each contour patterns is distributed in the position in each grid, output contour patterns grid array; (c), the traversal figure, namely according to the route traversal grid of planning, export successively the contour patterns in each contour patterns grid; (d), the figure after the output ordering.
Referring to Fig. 4, each contour patterns in the same level is calculated and sets up the treatment step that grid adopts: (a), calculate the minimum rectangle that surrounds these all contour patterns of level; (b), rectangle is divided into 10 * 10 little rectangle by warp and weft; (c), the coordinate figure tabulation of every warp and weft of record; (d), warp and parallel sort from small to large by coordinate figure respectively; To all levels finish calculate and set up grid after, the step that enters again positioning pattern.
Referring to Fig. 5, the treatment step that positioning pattern adopts: the treatment step that described positioning pattern adopts: (a), according to parallel and warp list initialization grid, this grid is a two-dimensional array, and each element can both the some contour patterns of carry; (b), get a contour patterns, calculate this contour patterns centre coordinate (X, Y); (c), in parallel tabulation this Y coordinate figure of binary search, find the 1st parallel of this Y coordinate figure below, that is to say the 1st parallel of this contour patterns below, establishing this parallel sequence number is L; (d), in warp tabulation binary search X, find the 1st warp in this contour patterns left side, establish this warp sequence number M; (e), this contour patterns is navigated in the grid [L, M], this grid [L, M] is registered as 1 contour patterns grid; (f), judge whether contour patterns takes, if contour patterns does not take, return step (b); If all contour patterns take, then export contour patterns grid array, finish the location.
Referring to Fig. 6, the treatment step that carries out of traversal figure: (a), 4 corners of procuratorial work grid, choose a wherein nearest contour patterns grid of distance reference point; (b), take reference point as benchmark, each contour patterns in the current contour patterns grid is done nearest ordering; (c), successively the contour patterns of exporting in the current contour patterns grid is tabulated to optimizing, and upgrading reference point is the terminal point of last contour patterns; (d), judge whether the whole contour patterns grids in the grid are covered; (e) if the contour patterns grid is all covered, then export complete optimization tabulation, otherwise, get next contour patterns grid and return step (b); The rule of getting next contour patterns grid is to judge that first whether warp quantity is greater than parallel quantity, if warp quantity is greater than parallel quantity, then get the next contour patterns grid in these row, otherwise get the next contour patterns grid in this row, whenever cover row, the counter-rotating working direction is walked next column, whenever covers delegation, and the counter-rotating working direction is walked next line.
They are positioned at same level to the outermost layer contour patterns of each pattern in the figure shown in Figure 7, after individual layer block sorting processing shown in Figure 3, roughly cutting sequence after the optimization of its output is referring to Fig. 9, the initial stop position of laser head is in the lower right corner, can see that the path after the optimization advances by snakelike, namely shorten to the full extent sky and moved.
Claims (5)
1. cut method for optimizing route, comprise that the process software by the laser cutting machine of computer control work carries out path optimization, it is characterized in that this optimization method comprises the steps: the figure of (1) the required cutting of input in the control system of laser cutting machine, described figure has at least an independent pattern to form, and each pattern is comprised of a contour patterns at least; (2) all contour patterns in the figure being carried out the ectonexine minor sort, is that the moon is cut or sun is cut with the filling type of distinguishing each contour patterns; The described treatment step that all contour patterns in the figure is carried out the ectonexine minor sort: (a), take out in the figure and be positioned at outermost all contour patterns, be mounted under the root node of one tree, and arrange that to fill type be that sun is cut; Each outermost contour patterns taken out the contour patterns of its most contiguous internal layer, be mounted under the present node, and arrange that to fill type be that the moon is cut (b), respectively; (c), the contour patterns that is in interior one deck is repeated above step, be arranged alternately successively from outside to inside the filling type of every one deck contour patterns, until reach innermost layer; (3) in the figure that sequences level inside and outside each contour patterns of output, successively the contour patterns of each level is carried out the individual layer block sorting from inside to outside; The treatment step that described individual layer block sorting adopts: (a), each contour patterns in the same level is calculated and set up grid; (b), positioning pattern, determine that namely each contour patterns is distributed in the position in each grid, output contour patterns grid array; (c), the traversal figure, namely according to the route traversal grid of planning, export successively the contour patterns in each contour patterns grid; (d), the figure after the output ordering; (4) output path optimizing.
2. a kind of cut method for optimizing route as claimed in claim 1 is characterized in that: each contour patterns in the same level is calculated and set up grid adopt following treatment step: (a), calculate the minimum rectangle that surrounds these all contour patterns of level; (b), rectangle is divided into 10 * 10 little rectangle by warp and weft; (c), the coordinate figure tabulation of every warp and weft of record; (d), warp and parallel sort from small to large by coordinate figure respectively.
3. a kind of cut method for optimizing route as claimed in claim 1, it is characterized in that: described positioning pattern adopts following treatment step: (a), according to parallel and warp list initialization grid, this grid is a two-dimensional array, and each element can both the some contour patterns of carry; (b), get a contour patterns, calculate this contour patterns centre coordinate (X, Y); (c), in parallel tabulation this Y coordinate figure of binary search, find the 1st parallel of this Y coordinate figure below, that is to say the 1st parallel of this contour patterns below, establishing this parallel sequence number is L; (d), in warp tabulation binary search X, find the 1st warp in this contour patterns left side, establish this warp sequence number M; (e), this contour patterns is navigated in the grid [L, M], this grid [L, M] is registered as 1 contour patterns grid; (f), judge whether contour patterns takes, when contour patterns does not take, return step (b); When all contour patterns take, then export contour patterns grid array, finish the location.
4. a kind of cut method for optimizing route as claimed in claim 1 is characterized in that: the treatment step that described traversal figure carries out: (a), 4 corners of procuratorial work grid, choose a wherein nearest contour patterns grid of distance reference point; (b), take reference point as benchmark, each contour patterns in the current contour patterns grid is done nearest ordering; (c), successively the contour patterns of exporting in the current contour patterns grid is tabulated to optimizing, and upgrading reference point is the terminal point of last contour patterns; (d), judge whether the whole contour patterns grids in the grid are covered; (e), all cover when the contour patterns grid, then export complete optimization tabulation; All do not cover when the contour patterns grid, get next contour patterns grid and return step (b); The rule of getting next contour patterns grid is to judge that first whether warp quantity is greater than parallel quantity, when warp quantity＞parallel quantity, then get the next contour patterns grid in these row, when warp number≤parallel quantity is got next contour patterns grid in this row, whenever cover row, the counter-rotating working direction is walked next column, whenever covers delegation, and the counter-rotating working direction is walked next line.
5. a kind of cut method for optimizing route as claimed in claim 1 is characterized in that: described process software employing CAM software.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210418274.3A CN102880113B (en) | 2012-10-26 | 2012-10-26 | Laser cutting path optimizing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210418274.3A CN102880113B (en) | 2012-10-26 | 2012-10-26 | Laser cutting path optimizing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102880113A true CN102880113A (en) | 2013-01-16 |
| CN102880113B CN102880113B (en) | 2015-07-15 |
Family
ID=47481485
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210418274.3A Active CN102880113B (en) | 2012-10-26 | 2012-10-26 | Laser cutting path optimizing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102880113B (en) |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103389683A (en) * | 2013-08-21 | 2013-11-13 | 济南铸造锻压机械研究所有限公司 | CAM (computer-aided manufacturing) system of high-power thick-plate numerical control laser cutting machine and method |
| CN104625435A (en) * | 2015-01-23 | 2015-05-20 | 大族激光科技产业集团股份有限公司 | Laser flight cutting method and system |
| CN105404240A (en) * | 2015-12-29 | 2016-03-16 | 苏州博众精工科技有限公司 | Method for automatically generating AutoCAD drawing file and rapidly ordering point position coordinates |
| CN106527344A (en) * | 2016-12-15 | 2017-03-22 | 上海柏楚电子科技有限公司 | Path optimization method for partial common-edge cutting of slot part |
| CN107330226A (en) * | 2017-07-28 | 2017-11-07 | 哈尔滨理工大学 | A kind of laser cutting machine protection steel plate cuts method for optimizing route |
| CN107877582A (en) * | 2017-10-30 | 2018-04-06 | 长沙市健科电子有限公司 | A kind of circuit board Cutting road planning method |
| CN108340077A (en) * | 2018-01-31 | 2018-07-31 | 深圳泰德激光科技有限公司 | Laser marking method and system |
| CN108581220A (en) * | 2018-04-10 | 2018-09-28 | 上海柏楚电子科技股份有限公司 | It is a kind of to move paths planning method for the empty of laser cutting |
| CN109753937A (en) * | 2019-01-09 | 2019-05-14 | 宽凳（北京）科技有限公司 | It is a kind of nesting target recognition methods and device |
| CN111230329A (en) * | 2020-02-19 | 2020-06-05 | 上海柏楚电子科技股份有限公司 | Method, system, device and medium for controlling continuous cutting of a plurality of racetrack shaped patterns |
| CN112157352A (en) * | 2020-09-03 | 2021-01-01 | 烟台大东钢板有限公司 | Laser cutting machine control method and device, computer equipment and storage medium |
| CN112935575A (en) * | 2021-01-12 | 2021-06-11 | 大族激光科技产业集团股份有限公司 | Cutting path optimization method and device and computer readable storage medium |
| CN113182711A (en) * | 2021-05-24 | 2021-07-30 | 浙江热刺激光技术有限公司 | Circular continuous fly-cutting method |
| CN113793351A (en) * | 2021-09-30 | 2021-12-14 | 中国人民解放军国防科技大学 | Laser filling method and device of multi-layer contour pattern based on contour line |
| CN113902755A (en) * | 2021-09-30 | 2022-01-07 | 中国人民解放军国防科技大学 | Laser filling method and device of multi-layer profile pattern based on zigzag |
| CN113909683A (en) * | 2021-10-13 | 2022-01-11 | 华中科技大学 | Three-laser-head collaborative cutting blanking path planning method and system with delta-shaped layout |
| CN113953685A (en) * | 2021-11-22 | 2022-01-21 | 重庆工商大学 | Planar plate laser cutting path planning method |
| CN114833461A (en) * | 2021-02-02 | 2022-08-02 | 大族激光科技产业集团股份有限公司 | Free steering method and sequencing device for non-closed contour of laser cutting path |
| CN115246050A (en) * | 2022-09-23 | 2022-10-28 | 江苏跃格智能装备有限公司 | Laser cutting path optimization control method based on machine vision |
| CN115582631A (en) * | 2022-09-23 | 2023-01-10 | 深圳市汇川技术股份有限公司 | Flight processing method, flight processing device, laser plane cutting equipment and medium |
| CN117066724A (en) * | 2023-10-16 | 2023-11-17 | 济南邦德激光股份有限公司 | Method, device and equipment for rapidly cutting part processing graph |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5568391A (en) * | 1990-05-29 | 1996-10-22 | Mckee; Lance D. | Automated tile mosaic creation system |
| US5933353A (en) * | 1997-09-16 | 1999-08-03 | New Focus, Inc. | Method and apparatus for computer aided machining |
| CN102023611A (en) * | 2010-12-02 | 2011-04-20 | 广东工业大学 | Seeking route plan optimizing method of laser cutting machine |
-
2012
- 2012-10-26 CN CN201210418274.3A patent/CN102880113B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5568391A (en) * | 1990-05-29 | 1996-10-22 | Mckee; Lance D. | Automated tile mosaic creation system |
| US5933353A (en) * | 1997-09-16 | 1999-08-03 | New Focus, Inc. | Method and apparatus for computer aided machining |
| CN102023611A (en) * | 2010-12-02 | 2011-04-20 | 广东工业大学 | Seeking route plan optimizing method of laser cutting machine |
Non-Patent Citations (1)
| Title |
|---|
| 许智: "激光切割机管理与控制***的研制", 《中国优秀硕士学位论文全文数据库》, 8 April 2005 (2005-04-08) * |
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103389683A (en) * | 2013-08-21 | 2013-11-13 | 济南铸造锻压机械研究所有限公司 | CAM (computer-aided manufacturing) system of high-power thick-plate numerical control laser cutting machine and method |
| CN103389683B (en) * | 2013-08-21 | 2016-01-20 | 济南铸造锻压机械研究所有限公司 | High-power slab numerical control laser cutter CAM system and method |
| CN104625435A (en) * | 2015-01-23 | 2015-05-20 | 大族激光科技产业集团股份有限公司 | Laser flight cutting method and system |
| CN104625435B (en) * | 2015-01-23 | 2017-04-19 | 大族激光科技产业集团股份有限公司 | Laser flight cutting method and system |
| CN105404240A (en) * | 2015-12-29 | 2016-03-16 | 苏州博众精工科技有限公司 | Method for automatically generating AutoCAD drawing file and rapidly ordering point position coordinates |
| CN106527344A (en) * | 2016-12-15 | 2017-03-22 | 上海柏楚电子科技有限公司 | Path optimization method for partial common-edge cutting of slot part |
| CN107330226A (en) * | 2017-07-28 | 2017-11-07 | 哈尔滨理工大学 | A kind of laser cutting machine protection steel plate cuts method for optimizing route |
| CN107330226B (en) * | 2017-07-28 | 2020-03-10 | 哈尔滨理工大学 | Method for optimizing cutting path of protective steel plate of laser cutting machine |
| CN107877582A (en) * | 2017-10-30 | 2018-04-06 | 长沙市健科电子有限公司 | A kind of circuit board Cutting road planning method |
| CN108340077A (en) * | 2018-01-31 | 2018-07-31 | 深圳泰德激光科技有限公司 | Laser marking method and system |
| CN108581220A (en) * | 2018-04-10 | 2018-09-28 | 上海柏楚电子科技股份有限公司 | It is a kind of to move paths planning method for the empty of laser cutting |
| CN109753937A (en) * | 2019-01-09 | 2019-05-14 | 宽凳（北京）科技有限公司 | It is a kind of nesting target recognition methods and device |
| CN111230329A (en) * | 2020-02-19 | 2020-06-05 | 上海柏楚电子科技股份有限公司 | Method, system, device and medium for controlling continuous cutting of a plurality of racetrack shaped patterns |
| CN112157352A (en) * | 2020-09-03 | 2021-01-01 | 烟台大东钢板有限公司 | Laser cutting machine control method and device, computer equipment and storage medium |
| CN112935575A (en) * | 2021-01-12 | 2021-06-11 | 大族激光科技产业集团股份有限公司 | Cutting path optimization method and device and computer readable storage medium |
| CN112935575B (en) * | 2021-01-12 | 2024-06-07 | 大族激光科技产业集团股份有限公司 | Cutting path optimization method and device and computer readable storage medium |
| CN114833461A (en) * | 2021-02-02 | 2022-08-02 | 大族激光科技产业集团股份有限公司 | Free steering method and sequencing device for non-closed contour of laser cutting path |
| CN114833461B (en) * | 2021-02-02 | 2024-01-23 | 大族激光科技产业集团股份有限公司 | Free steering method and sorting device for non-closed contour of laser cutting path |
| CN113182711B (en) * | 2021-05-24 | 2023-09-29 | 浙江热刺激光技术有限公司 | Perfect circle continuous fly-cutting method |
| CN113182711A (en) * | 2021-05-24 | 2021-07-30 | 浙江热刺激光技术有限公司 | Circular continuous fly-cutting method |
| CN113793351B (en) * | 2021-09-30 | 2023-06-02 | 中国人民解放军国防科技大学 | Laser filling method and device for multilayer outline pattern based on contour lines |
| CN113902755A (en) * | 2021-09-30 | 2022-01-07 | 中国人民解放军国防科技大学 | Laser filling method and device of multi-layer profile pattern based on zigzag |
| CN113902755B (en) * | 2021-09-30 | 2024-03-12 | 中国人民解放军国防科技大学 | Laser filling method and device for zigzag-based multilayer outline pattern |
| CN113793351A (en) * | 2021-09-30 | 2021-12-14 | 中国人民解放军国防科技大学 | Laser filling method and device of multi-layer contour pattern based on contour line |
| CN113909683A (en) * | 2021-10-13 | 2022-01-11 | 华中科技大学 | Three-laser-head collaborative cutting blanking path planning method and system with delta-shaped layout |
| CN113953685A (en) * | 2021-11-22 | 2022-01-21 | 重庆工商大学 | Planar plate laser cutting path planning method |
| CN113953685B (en) * | 2021-11-22 | 2023-09-01 | 重庆工商大学 | Planning method for laser cutting path of planar plate |
| CN115246050A (en) * | 2022-09-23 | 2022-10-28 | 江苏跃格智能装备有限公司 | Laser cutting path optimization control method based on machine vision |
| CN115582631A (en) * | 2022-09-23 | 2023-01-10 | 深圳市汇川技术股份有限公司 | Flight processing method, flight processing device, laser plane cutting equipment and medium |
| CN117066724A (en) * | 2023-10-16 | 2023-11-17 | 济南邦德激光股份有限公司 | Method, device and equipment for rapidly cutting part processing graph |
| CN117066724B (en) * | 2023-10-16 | 2024-02-06 | 济南邦德激光股份有限公司 | Method, device and equipment for rapidly cutting part processing graph |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102880113B (en) | 2015-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102880113A (en) | Laser cutting path optimizing method | |
| CN103235556B (en) | The complex parts digital control processing manufacture method of feature based | |
| CN104360634B (en) | Skin mirror image milling numerical control program fast generating method based on features | |
| CN101763069B (en) | Identification method of machining characteristics of complex parts of airplane | |
| CN102799144B (en) | Numerical control processing program transplanting method based on characteristics | |
| CN110989491B (en) | Automatic cutting track generation method and device for flexible material zero-space layout pattern | |
| CN103365243B (en) | Method for rapidly generating corner side milling process path | |
| CN105652791A (en) | Order-driven discrete manufacturing process energy consumption optimization method | |
| CN102756483B (en) | Multi-path pre-impregnation belt laying method | |
| CN103454974A (en) | Intelligent numerical control programming method driven by complex component process scheme | |
| CN113953685B (en) | Planning method for laser cutting path of planar plate | |
| CN102591261A (en) | Multilayer numerical control programming method for flexible hole formation on large-scale wing part | |
| CN106169006A (en) | A kind of model library building method based on reverse-engineering | |
| CN103114429A (en) | Type setting method and type setting system of leather and cloth | |
| CN104463355A (en) | Mini-satellite testing and planning system based on testing model | |
| CN103197605A (en) | Method of CNC automatic programming for gear hobbing based on standard template and expression driving | |
| CN108228409A (en) | A kind of algorithm performs based on signal stream are sequentially generated method | |
| CN102346459A (en) | Cutting process offline coordination method of multi-beam type water jet cutting system | |
| CN103163837B (en) | A kind of cutter path adaptive management system and method towards five-shaft numerical control processing | |
| CN103984289B (en) | Complex structural member different mountain feature self adaptation determines method around Profile milling cutter rail | |
| CN102609564A (en) | Fast positioning and corresponding method for machining features and machining operations | |
| CN101458726A (en) | Wire cutting program generating system and method | |
| CN106446472A (en) | STL-model-based intersection loop calculation algorithm for numerical control machining geometrical simulation | |
| CN102074027A (en) | Two-dimensional geological model blocking method | |
| CN105929796B (en) | The small line segment interpolation coprocessor of three-axis numerical control system high-speed high-precision and its operation method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address | ||
| CP03 | Change of name, title or address |
Address after: 200240 No. 953 lane, Jianchuan Road, Minhang District, Shanghai 322 Patentee after: SHANGHAI FRIENDESS ELECTRONIC TECHNOLOGY Co.,Ltd. Address before: 200241 room 1033, B tower, 555 Dongchuan Road, Minhang District, Shanghai. Patentee before: FRIENDESS CO.,LTD. |
|
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: 200241 No. 1000, Lanxiang Hunan Road, Minhang District, Shanghai Patentee after: SHANGHAI FRIENDESS ELECTRONIC TECHNOLOGY Co.,Ltd. Address before: 200240 No. 953 lane, Jianchuan Road, Minhang District, Shanghai 322 Patentee before: SHANGHAI FRIENDESS ELECTRONIC TECHNOLOGY Co.,Ltd. |