Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/87456
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Electronic and Information Engineering | en_US |
dc.creator | Fok, KY | en_US |
dc.creator | Cheng, CT | en_US |
dc.creator | Ganganath, N | en_US |
dc.creator | Iu, H | en_US |
dc.creator | Tse, CK | en_US |
dc.date.accessioned | 2020-07-03T11:01:15Z | - |
dc.date.available | 2020-07-03T11:01:15Z | - |
dc.identifier.issn | 1551-3203 | en_US |
dc.identifier.uri | http://hdl.handle.net/10397/87456 | - |
dc.language.iso | en | en_US |
dc.publisher | Institute of Electrical and Electronics Engineers | en_US |
dc.rights | © 2019 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. | en_US |
dc.rights | The following publication K. Fok, N. Ganganath, C. Cheng, H. H. Iu and C. K. Tse, "A Nozzle Path Planner for 3-D Printing Applications," in IEEE Transactions on Industrial Informatics, vol. 16, no. 10, pp. 6313-6323, Oct. 2020, is available at https://dx.doi.org/10.1109/TII.2019.2962241. | en_US |
dc.subject | 3D printing | en_US |
dc.subject | Additive manufacturing | en_US |
dc.subject | Heuristic search | en_US |
dc.subject | Path planning | en_US |
dc.subject | Undirected rural postman problem | en_US |
dc.title | A nozzle path planner for 3D printing applications | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 6313 | en_US |
dc.identifier.epage | 6323 | en_US |
dc.identifier.volume | 16 | en_US |
dc.identifier.issue | 10 | en_US |
dc.identifier.doi | 10.1109/TII.2019.2962241 | en_US |
dcterms.abstract | Additive manufacturing technologies have been widely applied in both household and industrial applications. The fabrication time of a three-dimensional (3-D) 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 article, the nozzle path planning problem is formulated as an undirected rural postman problem 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 3-D printing applications. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | IEEE transactions on industrial informatics, 2020, v. 16, no. 10, p. 6313-6323 | en_US |
dcterms.isPartOf | IEEE transactions on industrial informatics | en_US |
dcterms.issued | 2020-10 | - |
dc.identifier.scopus | 2-s2.0-85077254061 | - |
dc.identifier.eissn | 1941-0050 | en_US |
dc.description.validate | 202007 bcma | en_US |
dc.description.oa | Accepted Manuscript | en_US |
dc.identifier.FolderNumber | a0441-n01 | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fok_Nozzle_Path_Planner.pdf | Pre-published version | 8.15 MB | Adobe PDF | View/Open |
Page views
108
Last Week
0
0
Last month
Citations as of May 19, 2024
Downloads
154
Citations as of May 19, 2024
SCOPUSTM
Citations
8
Citations as of May 16, 2024
WEB OF SCIENCETM
Citations
6
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.