A Nozzle Path Planner for 3D Printing Applications

Kai-Yin Fok*, Nuwan Ganganath, Chi-Tsun Cheng, Herbert Ho-Ching Iu, Chi K. Tse

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

10 Citations (Scopus)

Abstract

Additive manufacturing technologies have been widely applied in both household and industrial applications. The fabrication time of a 3D printed object can be shortened by optimizing its segments printing order. The computational times required by existing nozzle path planning algorithms can increase rapidly with the number of printing segments. In this work, the nozzle path planning problem is formulated as an undirected rural postman problem (URPP) and a computationally efficient heuristic search algorithm is proposed to find fast routes and mitigate overheads in printing processes. Both simulation and experimental results concur that the proposed algorithm can significantly speed up printing processes and outperform its counterparts in 3D printing applications.

Original languageEnglish
Pages (from-to)6313-6323
JournalIEEE Transactions on Industrial Informatics
Volume16
Issue number10
Online published25 Dec 2019
DOIs
Publication statusPublished - Oct 2020

Research Keywords

  • 3D printing
  • additive manufacturing
  • undirected rural postman problem (URPP)
  • heuristic search
  • path planning

Fingerprint

Dive into the research topics of 'A Nozzle Path Planner for 3D Printing Applications'. Together they form a unique fingerprint.

Cite this