research-article

An Intelligent 3D Printing Path Planning Algorithm 3D Printing Path Planning Algorithm: An Intelligent Sub-Path Planning Algorithm

Authors:

Qi JiaAuthors Info & Claims

ICIAI '21: Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence

Pages 241 - 246

https://doi.org/10.1145/3461353.3461383

Published: 04 September 2021 Publication History

Abstract

The path planning of large industrial parts in additive manufacturing directly affects manufacturing quality and efficiency. At present, the commonly used traditional path planning methods have many problems, such as turning and stacking of print head and the number of rise and fall of the print head, so they are not suitable for large industrial parts. Therefore, an intelligent path planning algorithm is proposed. Firstly, the two-dimensional plane obtained after slicing is concavely convexly decomposed into printing sub-areas, and then the sub-partition connection is treated as a traveling salesman problem (TSP) to reduce the number and length of printing paths. By comparing with traditional path planning algorithms, the proposed method significantly reduced the number of paths, the idle travel distance, and the number of print head lifts. The sub-partition-based intelligent path planning method provides a new idea for the additive manufacturing process of large industrial parts.

References

[1]

Campbell I, Bourell D, Gibson I. 2012. Additive manufacturing: rapid prototyping comes of age. J. Rapid Prototyping Journal 18, 255-258. https://doi.org/10.1108/13552541211231563

[2]

Asiabanpour B, Khoshnevis B. 2004. Machine path generation for the SIS process. J. Robotics and Computer-Integrated Manufacturing 20,167-175. https://doi.org/10.1016/j.rcim.2003.10.005

[3]

Matthew L, David P.F. 2017. 3D printing complex chocolate objects: Platform design, optimization and evaluation. J. Journal of Food Engineering 215, 13-22. https://doi.org/10.1016/j.jfoodeng.2017.06.029

[4]

Tarabanis, Konstantinos A. 2001. Path planning in the Proteus rapid prototyping system. J. Rapid Prototyping Journal 7, 241-252. https://doi.org/10.1108/13552540110410440

[5]

Yang Y, Loh H T, Fuh J Y H, 2002. Equidistant path generation for improving scanning efficiency in layered manufacturing. J. Rapid Prototyping Journal 8, 30-37. https://doi.org/10.1108/13552540210413284

[6]

Zhao H, Chen B, Gu F, 2016. Connected fermat spirals for layered fabrication. J. ACM Transactions on Graphics 35, 1-10. https://doi.org/10.1145/2897824.2925958

Digital Library

[7]

Jin Y, He Y, Fu G, 2017. A non-retraction path planning approach for extrusion-based additive manufacturing. J. Robotics and Computer-Integrated Manufacturing 48, 132-144. https://doi.org/10.1016/j.rcim.2017.03.008

[8]

Xingguo H, Xiaohui S, Ming Y, 2018. Path Optimization Algorithm of 3D Printing Based on Fused Deposition Modeling. J. Transactions of the Chinese Society for Agricultural Machinery 49, 393-401. https://doi.org/10.6041/j.issn.1000-1298.2018.03.050

[9]

Yu Y, Chen Y, Wen Y. 2013. TSP Solution Based on the Ant Colony Algorithm. International Conference on Computational & Information Sciences IEEE Computer Society 2013.6, 951-954.

[10]

Gutin G. 2008. Traveling Salesman Problem. J. Encyclopedia of Operations Research & Management Science 60, 1–12. https://doi.org/10.1287/opre.16.3.538

Digital Library

[11]

HUANG X M, YE C S, HUANG W J, 2013. Planning algorithm of regular polygon grid path for laser rapid prototyping. J. Forging & Stamping Technology 38, 152-155. https://doi.org/10.3969/j.issn.1000-3940.2013.03.036.

[12]

HOU W B, XIA M D, Xu J T. 2017. Region segmentation and scanning algorithm in additive manufacturing. J. Computer Integrated Manufacturing Systems 23(09), 1853-1859. https://doi.org/10.13196/j.cims.2017.09.003

[13]

Syed W U H, Pinkerton A J, Li L. 2006. Combining wire and coaxial powder feeding in laser direct metal deposition for rapid prototyping. J. Applied Surface Science 252(13), 4803-4808. https://doi.org/10.1016/j.apsusc.2005.08.118

[14]

Razdan A, Bae M S. 2003. A hybrid approach to feature segmentation of triangle meshes. J. Computer Aided Design 35(9), 783-789. https://doi.org/10.1016/s0010-4485(02)00101-x

[15]

Yang S, Yong J H, Sun J. 2009. A point-in-polygon method based on a quasi-closest point. J. Computers & Geosciences 36(2), 205-213. https://doi.org/10.1016/j.cageo.2009.06.008

[16]

BIAN H Y, LIU W J, WANG T W. 2005. New concave polygon convex decomposition algorithm for rapid prototyping subarea scanning. J. Journal of Computer Applications 25(09), 2143-2145. https://doi.org/10.3724/SP.J.1087.2005.02143

[17]

Gibson M, Varadarajan K. 2011. Optimally Decomposing Coverings with Translates of a Convex Polygon. J. Discrete & Computational Geometry 46(2), 313-333. https://doi.org/10.1007/s00454-011-9353-9

[18]

ZHANG Y L. 2001. A improved weighting algorithm for decomposing a simple polygon into convex polygons. J. Journal of Yanshan University 25(1), 76-79. https://doi.org/10.3969/j.issn.1007-791X.2001.01.021

Cited By

Xu WXu HLi QZhang PYang LWang W(2024)Stress-based continuous planar path planning for additive manufacturingAdvances in Engineering Software10.1016/j.advengsoft.2023.103544188:COnline publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1016/j.advengsoft.2023.103544
Cha MKim CLee TKim BCho HKim TLim H(2022)An Optimal Layout Model of Curved Panels for Using 3D PrintingSustainability10.3390/su14211389614:21(13896)Online publication date: 26-Oct-2022
https://doi.org/10.3390/su142113896

Index Terms

An Intelligent 3D Printing Path Planning Algorithm 3D Printing Path Planning Algorithm: An Intelligent Sub-Path Planning Algorithm

Index terms have been assigned to the content through auto-classification.

Recommendations

A Reinforcement Learning-based Path Planning Method for Complex Thin-walled Structures in 3D Printing
ICIAI '21: Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence

Path planning is an important part of the 3D printing process. The optimized path planning method can improve not only effect of the molding but also the efficiency of printing process. However, traditional path planning methods are not satisfactory in ...
An Exact Geometry–Based Algorithm for Path Planning
Abstract
A novel, exact algorithm is presented to solve the path planning problem that involves finding the shortest collision-free path from a start to a goal point in a two-dimensional environment containing convex and non-convex obstacles. The ...
Path Planning based on Astar Algorithm in Automatic Driving
ICACS '22: Proceedings of the 6th International Conference on Algorithms, Computing and Systems

With the rise of automatic driving technology, it needs to be studied more and more problems, path planning is this paper needs to study, at present, the existing algorithms are mainly some traditional algorithms and some improved algorithms on the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

ICIAI '21: Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence

March 2021

246 pages

ISBN:9781450388634

DOI:10.1145/3461353

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 September 2021

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed limited

Funding Sources

National Key Research and Development Program of China

Conference

ICIAI 2021

ICIAI 2021: 2021 the 5th International Conference on Innovation in Artificial Intelligence

March 5 - 8, 2021

Xia men, China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
419
Total Downloads

Downloads (Last 12 months)82
Downloads (Last 6 weeks)8

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xu WXu HLi QZhang PYang LWang W(2024)Stress-based continuous planar path planning for additive manufacturingAdvances in Engineering Software10.1016/j.advengsoft.2023.103544188:COnline publication date: 12-Apr-2024
https://dl.acm.org/doi/10.1016/j.advengsoft.2023.103544
Cha MKim CLee TKim BCho HKim TLim H(2022)An Optimal Layout Model of Curved Panels for Using 3D PrintingSustainability10.3390/su14211389614:21(13896)Online publication date: 26-Oct-2022
https://doi.org/10.3390/su142113896

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Figures

Tables

Media

View Table of Conten