A refinement process for nozzle path planning in 3D printing

Abstract

Abstract-A refinement process for nozzle path planning in 3D printing is presented in this paper. The nozzle path planning problem is formulated as an undirected rural postman problem (URPP). Based on the unique characteristics of URPP in 3D printing applications, a new refinement process is proposed to shorten the processing time of a conventional URPP solver. Performances of the proposed refinement process is evaluated using computer simulations. Simulation results show that when comparing with other URPP solvers, solvers with the proposed process have shorter processing time and can provide solutions with shorter transition length.

Tool-Path Optimization using Neural Networks

“…According to TABLE III, the proposed solver required less processing time and can generate identical solutions as the greedy algorithm with 2-opt. According to [15], curves in a 3D model are constructed with multiple short print segments. With the help of the NN, the proposed solver can successfully identify a fast route to traverse those curves segments.…”

Arc routing problems: A review of the past, present, and future

“…For this problem, authors propose several heuristics whose behavior compares favorably with CURA, a popular software for 3DP path definition. Fok et al [94] also deal with this problem for which they propose a procedure based on the Frederickson algorithm for the RPP [95].…”

Optimal tool path planning for 3D printing with spatio-temporal and thermal constraints

“…Optimal path arXiv:2007.09626v1 [cs.RO] 19 Jul 2020 planning for the first class of problems has been investigated based on modifications of the asymmetric travelling salesman problem [21]. The second class of problems have been investigated for different velocity profiles including constant velocity profiles [22] and triangular/trapezoidal velocity profiles [23], [24], [25], [26]. Further, 3D path planning algorithms based on Eulerian tour checking algorithm known as Hierholzers algorithm [22], tour construction algorithm known as Frederickson's algorithm [23], [27], Christofides algorithm [23], and greedy 2-Opt and greedy annealing algorithm [28], have been considered.…”

“…The second class of problems have been investigated for different velocity profiles including constant velocity profiles [22] and triangular/trapezoidal velocity profiles [23], [24], [25], [26]. Further, 3D path planning algorithms based on Eulerian tour checking algorithm known as Hierholzers algorithm [22], tour construction algorithm known as Frederickson's algorithm [23], [27], Christofides algorithm [23], and greedy 2-Opt and greedy annealing algorithm [28], have been considered. While several of these algorithms focus on optimality of the 2D/3D path plans with respect to distance travelled, none of them optimize the plans for superior structural properties based on thermal constraints, which is the focus of this paper.…”