Path Optimization Algorithm for 3D Printing of Concrete Using Euler Circuit
Aiming at the problems of poor forming quality and long printing time in the 3D printing of concrete,a path optimization algorithm for 3D printing of concrete by using the Euler circuit to achieve better and faster forming of concrete components is designed.The algorithm firstly ensures that the nozzle traverses the entire printing path with as the few numbers of the nozzle head-up as possible by constantly finding the Euler circuit in the printing path,and then applies the ant colony algorithm to find the shortest path of the nozzle running between each Euler circuit.Finally,the printing path of the entire concrete component to reduce the number of the nozzle head-up and the idle strokes in the print path is determined.The experimental results show that the number of the nozzle head-up and the idle strokes of the printing path have a very important influence on the forming quality and printing time of concrete 3D printing.Comparing with the traditional algorithm,the printing results via the present algorithm reduce the number of the nozzle head-up by 57.14%and the idle strokes in the nozzle running path by 23.21%.The present algorithm has significantly improved the problems existing in the 3D printing of concrete and provided an effective reference for optimizing the forming quality and printing time of concrete 3D printing components.
concrete 3D printingpath optimizationeuler circuitthe ant colony algorithm
万方数据
维普
