Computer Science ›› 2020, Vol. 47 ›› Issue (8): 267-271.doi: 10.11896/jsjkx.190700184

Previous Articles     Next Articles

Intelligent 3D Printing Path Planning Algorithm

YANG De-cheng1, LI Feng-qi1, WANG Yi2, WANG Sheng-fa2, YIN Hui-shu1   

  1. 1 School of Software Technology, Dalian University of Technology, Dalian 116600, China
    2 International School of Information Science &Engineering, Dalian University of Technology, Dalian 116600, China
  • Online:2020-08-15 Published:2020-08-10
  • About author:YANG De-cheng, born in 1995, M.D.His main research interests include virtual simulation manufacturing and so on.
    WANG Yi, born in 1980, Ph.D, associate professor, is a member of China Computer Federation.Her main research interests include machine learning and virtual reality.
  • Supported by:
    This work was supported by the National Key Research and Development Program of China (2017YFB1107704) and Fundamental Research Funds for the Central Universities (DUT19ZD209).

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 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 internal long-axis scanning along the partition is performed on each sub-area to reduce the number and length of printing paths.Then, the sub-partition connection is treated as a traveling salesman problem (TSP) using gene-tic algorithms to complete the path planning between the sub-areas.Meanwhile, an intelligent 3D printing path planning system is designed and developed with C# language, which has the functions of slice input and display, print width setting, intelligent path planning and G-code code output.By comparing with the two traditional path planning algorithms, the proposed method significantly reduces 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.

Key words: 3D Printing, Concave polygonal convex decomposition, Genetic algorithm, Path planning, Traveling Salesman Problem

CLC Number: 

  • TP391
[1]WONG K V, HERNANDEZ A.A Review of Additive Manufacturing[J].ISRN Mechanical Engineering, 2012, 2012:1-10.
[2]ASIABANPOUR B, KHOSHNVIS B.Machine path generation for the SIS process [J].Robotics and Computer-Integrated Ma-nufacturing, 2004, 20(3):167-175.
[3]LANARO M, FORRESTAL D P, SCHEURER S, et al.3Dprinting complex chocolate objects:Platform design, optimization and evaluation[J].Journal of Food Engineering, 2017, 215:13-22.
[4]TARABANIS K A.Path planning in the proteus rapid prototyping system[J].Rapid Prototyping Journal, 2001, 7(5):241-252.
[5]YANG Y, LOH H T, FUH J Y H, et al.Equidistant path gene-ration for improving scanning efficiency in layered manufactur-
ing[J].Rapid Prototyping Journal, 2002, 8(1):30-37.
[6]ZHAO H S, GU F L, JORGE G, et al.Connected fermat spirals for layered fabrication[J].ACM Transactions on Graphics, 2016, 35(4):1-10.
[7]JIN Y, HE Y, FU G, et al.A non-retraction path planning approach for extrusion-based additive manufacturing[J].Robotics and Computer Integrated Manufacturing, 2017, 48(1):132-144.
[8]HAN G X, SONG X H, YIN M, et al.Path Optimization Algo-rithm of 3D Printing Based on Fused Deposition Modeling[J].Transactions of The Chinese Society of Agricultural Machinery, 2018, 49(3):393-401.
[9]GREGORY G.Traveling Salesman Problem[J].Encyclopedia of Operations Research & Management Science, 2008, 60(4):1-12.
[10]CHEN T.An Improved Algorithm of Cyrus-Beck Segment Clipping to Process Concave Polygon [J].Computer Science, 2006, 33(12):217-220.
[11]XIONG W J.A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree for the Master of Engineering [D].Hangzhou:Huazhong University of Science and Technology, 2007.
[12]ZHANG Y L.Software design and algorithm optimization ofmulti-axis Laser Direct Metal Deposition system [D].Changsha:Hunan University, 2018.
[13]KOK-WHY N, WONG Y P, HO S N.Improvement in Decimation of Triangle Meshes for Level of Detail[C]∥International Conference on Geometric Modeling & Graphics.IEEE, 2003.
[14]BAI R B.Research and Implementation of Critical PolygonMethod in Two-Dimensional Irregular Parts Layout[D].Xi’an:Northwestern Polytechnical University, 2002.
[15]KEIL M, SNOEYINK J.On The Time Bound for Convex Decomposition of Simple Polygons[J].International Journal of Computational Geometry & Applications, 2002, 12(3):181-192.
[16]MARK BAYAZIT.Mark Bayazit's Algorithm [EB/OL].[2019-03-25].
[17]LIN Z, FU J, HE Y, et al.A robust 2D point-sequence curve offset algorithm with multiple islands for contour-parallel tool path[J].Computer-Aided Design, 2013, 45(3):657-670.
[1] WANG Bing, WU Hong-liang, NIU Xin-zheng. Robot Path Planning Based on Improved Potential Field Method [J]. Computer Science, 2022, 49(7): 196-203.
[2] YANG Hao-xiong, GAO Jing, SHAO En-lu. Vehicle Routing Problem with Time Window of Takeaway Food ConsideringOne-order-multi-product Order Delivery [J]. Computer Science, 2022, 49(6A): 191-198.
[3] WANG Yong, CUI Yuan. Cutting Edge Method for Traveling Salesman Problem Based on the Shortest Paths in Optimal Cycles of Quadrilaterals [J]. Computer Science, 2022, 49(6A): 199-205.
[4] TAN Ren-shen, XU Long-bo, ZHOU Bing, JING Zhao-xia, HUANG Xiang-sheng. Optimization and Simulation of General Operation and Maintenance Path Planning Model for Offshore Wind Farms [J]. Computer Science, 2022, 49(6A): 795-801.
[5] SHEN Biao, SHEN Li-wei, LI Yi. Dynamic Task Scheduling Method for Space Crowdsourcing [J]. Computer Science, 2022, 49(2): 231-240.
[6] WU Shan-jie, WANG Xin. Prediction of Tectonic Coal Thickness Based on AGA-DBSCAN Optimized RBF Neural Networks [J]. Computer Science, 2021, 48(7): 308-315.
[7] CHEN Jing-yu, GUO Zhi-jun, YIN Ya-kun. Full Traversal Path Planning and System Design of Intelligent Lawn Mower Based on Hybrid Algorithm [J]. Computer Science, 2021, 48(6A): 633-637.
[8] ZHENG Zeng-qian, WANG Kun, ZHAO Tao, JIANG Wei, MENG Li-min. Load Balancing Mechanism for Bandwidth and Time-delay Constrained Streaming Media Server Cluster [J]. Computer Science, 2021, 48(6): 261-267.
[9] WANG Jin-heng, SHAN Zhi-long, TAN Han-song, WANG Yu-lin. Network Security Situation Assessment Based on Genetic Optimized PNN Neural Network [J]. Computer Science, 2021, 48(6): 338-342.
[10] ZUO Jian-kai, WU Jie-hong, CHEN Jia-tong, LIU Ze-yuan, LI Zhong-zhi. Study on Heterogeneous UAV Formation Defense and Evaluation Strategy [J]. Computer Science, 2021, 48(2): 55-63.
[11] DU Wan-ru, WANG Xiao-yin, TIAN Tao, ZHANG Yue. Artificial Potential Field Path Planning Algorithm for Unknown Environment and Dynamic Obstacles [J]. Computer Science, 2021, 48(2): 250-256.
[12] GUO Qi-cheng, DU Xiao-yu, ZHANG Yan-yu, ZHOU Yi. Three-dimensional Path Planning of UAV Based on Improved Whale Optimization Algorithm [J]. Computer Science, 2021, 48(12): 304-311.
[13] GAO Shuai, XIA Liang-bin, SHENG Liang, DU Hong-liang, YUAN Yuan, HAN He-tong. Spatial Cylinder Fitting Based on Projection Roundness and Genetic Algorithm [J]. Computer Science, 2021, 48(11A): 166-169.
[14] ZHAO Yang, NI Zhi-wei, ZHU Xu-hui, LIU Hao, RAN Jia-min. Multi-worker and Multi-task Path Planning Based on Improved Lion Evolutionary Algorithm forSpatial Crowdsourcing Platform [J]. Computer Science, 2021, 48(11A): 30-38.
[15] YAO Ze-wei, LIU Jia-wen, HU Jun-qin, CHEN Xing. PSO-GA Based Approach to Multi-edge Load Balancing [J]. Computer Science, 2021, 48(11A): 456-463.
Full text



No Suggested Reading articles found!