CN112026179A - 3D printer slicing contour path planning algorithm - Google Patents
3D printer slicing contour path planning algorithm Download PDFInfo
- Publication number
- CN112026179A CN112026179A CN202011100069.3A CN202011100069A CN112026179A CN 112026179 A CN112026179 A CN 112026179A CN 202011100069 A CN202011100069 A CN 202011100069A CN 112026179 A CN112026179 A CN 112026179A
- Authority
- CN
- China
- Prior art keywords
- point
- initial
- algorithm
- printing
- path planning
- 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
Images
Classifications
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B29—WORKING OF PLASTICS; WORKING OF SUBSTANCES IN A PLASTIC STATE IN GENERAL
- B29C—SHAPING OR JOINING OF PLASTICS; SHAPING OF MATERIAL IN A PLASTIC STATE, NOT OTHERWISE PROVIDED FOR; AFTER-TREATMENT OF THE SHAPED PRODUCTS, e.g. REPAIRING
- B29C64/00—Additive manufacturing, i.e. manufacturing of three-dimensional [3D] objects by additive deposition, additive agglomeration or additive layering, e.g. by 3D printing, stereolithography or selective laser sintering
- B29C64/30—Auxiliary operations or equipment
- B29C64/386—Data acquisition or data processing for additive manufacturing
-
- B—PERFORMING OPERATIONS; TRANSPORTING
- B33—ADDITIVE MANUFACTURING TECHNOLOGY
- B33Y—ADDITIVE MANUFACTURING, i.e. MANUFACTURING OF THREE-DIMENSIONAL [3-D] OBJECTS BY ADDITIVE DEPOSITION, ADDITIVE AGGLOMERATION OR ADDITIVE LAYERING, e.g. BY 3-D PRINTING, STEREOLITHOGRAPHY OR SELECTIVE LASER SINTERING
- B33Y50/00—Data acquisition or data processing for additive manufacturing
Landscapes
- Chemical & Material Sciences (AREA)
- Engineering & Computer Science (AREA)
- Materials Engineering (AREA)
- Manufacturing & Machinery (AREA)
- Physics & Mathematics (AREA)
- Mechanical Engineering (AREA)
- Optics & Photonics (AREA)
Abstract
The invention requests to protect a 3D printer slicing outline path planning algorithm. The algorithm firstly adopts an optimized shortest distance algorithm to determine the starting points of each closed loop contour in the slicing process, and the starting points are used as connecting points of the 3D printing contour sequence, and the distance between every two starting points is shortened as far as possible. And then determining initial parameter values of the ant colony algorithm by adopting a single variable method. And finally, performing path planning on the determined printing starting point by using an improved ant colony algorithm to obtain an optimal printing path. According to the invention, the printing starting points of the profiles of the closed rings are reasonably selected, and the optimal printing sequence is planned, so that the 3D printing efficiency is improved, and the printing time is shortened.
Description
Technical Field
The invention belongs to the technical field of slicing of an upper computer of a 3D printer, and particularly relates to a slicing contour path planning algorithm of the 3D printer.
Background
From the middle and later stages of the eighties of the last century, with the development of computer technology and material technology, 3D printing technology comes along. As a revolutionary breakthrough technology in the manufacturing field, the 3D printing rapid prototyping technology can complete the processing and manufacturing of complex components in a short time, greatly reduce the research and development cost of products, shorten the research and development period, and deeply influence the mold manufacturing, precision manufacturing, aerospace, bionics, medical appliances and other industrial fields.
The slicing process of fused deposition 3D printing is the core of the overall model processing. The contour path planning algorithm is one of important algorithms in a 3D printing and slicing process, and has the function of reasonably planning and printing sequence of the contour of each layer of section so as to improve the efficiency and the forming quality of 3D printing parts. At present, the problems of overlong printing time and low printing quality exist in 3D printing, the research on path planning in the field is less, and the shortening of the printing time by a path planning algorithm involved in the slicing process still further improves the space.
Disclosure of Invention
Aiming at the technical problems, the invention provides a 3D printer slice contour path planning algorithm, which improves the 3D printing efficiency and shortens the printing time so as to solve the problems in the background technology.
The technical means adopted by the invention are as follows: A3D printer slicing contour path planning algorithm firstly adopts an optimized shortest distance algorithm to determine the starting points of each closed loop contour in a slicing process, and the starting points are used as connecting points of 3D printing contour sequences, and the distance between every two starting points is shortened as far as possible. And then determining initial parameter values of the ant colony algorithm by adopting a single variable method. And finally, performing path planning on the determined printing starting point by using an improved ant colony algorithm to obtain an optimal printing path.
Further, the optimized shortest distance algorithm specifically comprises the following steps: firstly, selecting a printing original point as an initial original point, sequentially solving the distance from the original point to each point in each closed loop contour point set, taking the point with the shortest distance as a next initial point, removing the set where the point is located before next calculation, sequentially solving the initial points of the rest closed loop contours according to the method, and storing the initial points in the initial point set. And then selecting an initial origin and an initial point separated by one bit from the initial origin in the initial point set, judging whether a connecting line segment between the two points is intersected with the outline of the closed ring where the point adjacent to the initial origin is located, if so, selecting an intersection point far away from the initial origin as a new point adjacent to the initial origin, if not, traversing all vertex sets of the closed ring where the point adjacent to the initial origin is located, sequentially solving the sum of the distances from the midpoint of each outline to the two endpoints of the line segment, and taking the point with the shortest distance sum as a new point adjacent to the initial origin. And finally, updating the starting point set according to the method, and determining the starting point of each closed loop contour in the slicing process.
Further, the initial parameter values of the ant colony algorithm are determined by a single-variable method.
Further, the improved ant colony algorithm is an algorithm with which a genetic algorithm is fused.
Compared with the prior art, the invention has the beneficial effects that: firstly, an improved shortest distance algorithm is adopted, when the printing starting points of all closed rings are determined, the connection distance and the shortest distance of all the starting points can be ensured as far as possible, and a foundation is made for the next planning of the printing sequence. Secondly, determining initial parameter values of the ant colony algorithm by adopting a scientific single variable method, so that the ant colony algorithm has the best operation effect. And finally, performing path planning on the printing starting point by adopting an improved ant colony algorithm to obtain an optimal printing path, so that the 3D printing efficiency is improved, and the printing time is shortened.
Drawings
For ease of illustration, the invention is described in detail by the following detailed description and the accompanying drawings.
FIG. 1 is a flowchart of a 3D printer slicing outline path planning algorithm of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described in detail and clearly with reference to the accompanying drawings.
As shown in fig. 1, the present invention provides a 3D printer slicing contour path planning algorithm, which includes the following steps: firstly, an optimized shortest distance algorithm is adopted to determine the starting points of each closed loop contour in the slicing process to serve as connecting points of the 3D printing sequence, and the aim is to shorten the distance between each starting point as much as possible. And then determining initial parameter values of the ant colony algorithm by adopting a single variable method. And finally, fusing the ant colony algorithm and the genetic algorithm, and performing path planning on the determined printing starting point by using the improved ant colony algorithm to obtain the optimal printing path.
The optimized shortest distance algorithm comprises the following specific steps: firstly, selecting a printing original point as an initial original point, sequentially solving the distance from the original point to each point in each closed ring contour point set, taking the point with the shortest distance as a next initial point, and removing the set where the point is located before next solving. And sequentially solving the starting points of the residual closed-loop contours according to the method, and storing the starting points in the starting point set. And then selecting an initial origin and an initial point separated by one bit from the initial origin in the initial point set, judging whether a connecting line segment between the two points is intersected with the outline of the closed ring where the point adjacent to the initial origin is located, if so, selecting an intersection point far away from the initial origin as a new point adjacent to the initial origin, if not, traversing all vertex sets of the closed ring where the point adjacent to the initial origin is located, sequentially solving the sum of the distances from each outline point to the two end points of the line segment, and taking the point with the shortest distance sum as the new point adjacent to the initial origin. And finally, updating the starting point set according to the method, and determining the starting point of each closed loop contour in the slicing process.
The present invention proposes that these examples are to be understood as merely illustrative of the present invention and not as limiting the scope of protection of the present invention. After reading the description of the invention, the skilled person can make various changes or modifications to the invention, and these equivalent changes and modifications also fall into the scope of the invention defined by the claims.
Claims (4)
1. A3D printer slicing outline path planning algorithm is characterized by comprising the following steps: firstly, determining the starting points of each closed loop contour in the slicing process by adopting an optimized shortest distance algorithm to serve as connecting points of a 3D printing contour sequence, wherein the distance between every two starting points is shortened as much as possible; then, determining an initial parameter value of the ant colony algorithm by adopting a single variable method; and finally, performing path planning on the determined printing starting point by using an improved ant colony algorithm to obtain an optimal printing path.
2. The 3D printer slicing profile path planning algorithm according to claim 1, wherein the optimized shortest distance algorithm comprises the following specific steps: firstly, selecting a printing original point as an initial original point, sequentially solving the distance from the original point to each point in each closed loop contour point set, taking the point with the shortest distance as a next initial point, removing the set where the point is located before next calculation, sequentially solving the initial points of the remaining closed loop contours according to the method, and storing the initial points in the initial point set; then selecting an initial origin and an initial point separated by one bit from the initial origin in the initial point set, judging whether a connecting line segment between the two points is intersected with the outline of the closed ring where the adjacent point of the initial origin is located, if so, selecting an intersection point far away from the initial origin as a new adjacent point with the initial origin, if not, traversing all vertex sets of the closed ring where the adjacent point with the initial origin is located, sequentially solving the sum of the distances from the midpoint of each outline to the two endpoints of the line segment, and taking the point with the shortest distance sum as a new adjacent point with the initial origin; and finally, updating the starting point set according to the method, and determining the starting point of each closed loop contour in the slicing process.
3. The 3D printer slicing profile path planning algorithm according to claim 1, wherein the initial parameter values of the ant colony algorithm are determined by a single-variable method.
4. The 3D printer slice contour path planning algorithm according to claim 1, wherein the improved ant colony algorithm is an algorithm with which a genetic algorithm is fused.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011100069.3A CN112026179A (en) | 2020-10-15 | 2020-10-15 | 3D printer slicing contour path planning algorithm |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011100069.3A CN112026179A (en) | 2020-10-15 | 2020-10-15 | 3D printer slicing contour path planning algorithm |
Publications (1)
Publication Number | Publication Date |
---|---|
CN112026179A true CN112026179A (en) | 2020-12-04 |
Family
ID=73573659
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011100069.3A Pending CN112026179A (en) | 2020-10-15 | 2020-10-15 | 3D printer slicing contour path planning algorithm |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112026179A (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112776319A (en) * | 2020-12-24 | 2021-05-11 | 浙江大学 | Slice printing sequence optimization method |
CN113733295A (en) * | 2021-09-10 | 2021-12-03 | 西安建筑科技大学 | Path optimization method for 3D printing of concrete |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111716702A (en) * | 2019-05-23 | 2020-09-29 | 湖南大学 | 3D printing path optimization method, storage device and printing equipment |
-
2020
- 2020-10-15 CN CN202011100069.3A patent/CN112026179A/en active Pending
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111716702A (en) * | 2019-05-23 | 2020-09-29 | 湖南大学 | 3D printing path optimization method, storage device and printing equipment |
Non-Patent Citations (2)
Title |
---|
崔凤英等: "3D打印路径规划研究", 《青岛科技大学学报(自然科学版)》 * |
韩兴国等: "熔融沉积式3D打印路径优化算法研究", 《农业机械学报》 * |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN112776319A (en) * | 2020-12-24 | 2021-05-11 | 浙江大学 | Slice printing sequence optimization method |
CN113733295A (en) * | 2021-09-10 | 2021-12-03 | 西安建筑科技大学 | Path optimization method for 3D printing of concrete |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN112026179A (en) | 3D printer slicing contour path planning algorithm | |
CN107590603B (en) | Based on the dispatching method and system for improving change neighborhood search and differential evolution algorithm | |
CN106054802B (en) | A kind of free-form surface self-adaptive Toolpath Generation method | |
CN104493094A (en) | Rapid precise casting technology based on photocuring 3D printing technique | |
WO2019119268A1 (en) | Numerical control system, apparatus with storage function, and nurbs curve interpolation method | |
Jong et al. | Automatic process planning of mold components with integration of feature recognition and group technology | |
CN104090528B (en) | Method suitable for cycloid high-speed milling machining path | |
CN103309283B (en) | Self-adaptive generating method for machining programs for part three-dimensional model changes | |
US20200401102A1 (en) | Frame Structure Optimization Method Based on 3D Printing | |
CN106777561A (en) | A kind of layout method of turbo blade essence casting wax pattern Tao Xin clamping elements | |
CN115455588A (en) | Turbine blade precision casting mold surface reversible deformation design method | |
CN110412938B (en) | Multi-cavity structural part processing step sequence decision method based on transition feature simplification | |
CN111401515A (en) | Method for constructing incremental L STM by utilizing training process compression and memory consolidation | |
CN106803282A (en) | A kind of thin bent plate of three dimensions abnormity launches modeling method | |
CN106001933B (en) | It is cut by laser the optimization method of trimming line | |
Kamarudin et al. | Taguchi Method Used in Optimization of Plastic Injection Molding | |
Wang et al. | Research on shape change of multimaterial electrode for EDM | |
CN115186867A (en) | NURBS curve-based cutting path optimization method | |
CN112052542B (en) | Intelligent design method and system for ultrasonic rolling amplitude transformer for blade surface strengthening | |
Wang et al. | Re-triangulation in STL meshes for rapid prototyping and manufacture | |
CN111353187B (en) | Method for acquiring spatial linear level curve elements | |
CN116755389A (en) | Method and equipment for determining NURBS curve curvature maximum point | |
CN114254721B (en) | Flexible job shop scheduling method and equipment with interval gray processing time | |
CN109034667B (en) | Optimized scheduling method for hardware mold production process | |
CN114454487B (en) | Additive manufacturing layering slicing method capable of adaptively generating supporting structure |
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 | ||
WD01 | Invention patent application deemed withdrawn after publication | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20201204 |