CN112026179A

CN112026179A - 3D printer slicing contour path planning algorithm

Info

Publication number: CN112026179A
Application number: CN202011100069.3A
Authority: CN
Inventors: 吕宁; 李云旭; 欧阳雪峰
Original assignee: Harbin University of Science and Technology
Current assignee: Harbin University of Science and Technology
Priority date: 2020-10-15
Filing date: 2020-10-15
Publication date: 2020-12-04

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

3D printer slicing contour path planning algorithm

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

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.