计算机科学 ›› 2020, Vol. 47 ›› Issue (8): 267-271.doi: 10.11896/jsjkx.190700184

• 人工智能 • 上一篇    下一篇

智能3D打印路径规划算法

杨德成1, 李凤岐1, 王祎2, 王胜法2, 殷慧殊1   

  1. 1 大连理工大学软件学院 辽宁 大连 116600
    2 大连理工大学国际信息与软件学院 辽宁 大连 116600
  • 出版日期:2020-08-15 发布日期:2020-08-10
  • 通讯作者: 王祎(dlutwangyi@dlut.edu.cn)
  • 作者简介:yangdecheng@mail.dlut.edu.cn
  • 基金资助:
    国家重点研发计划子课题(2017YFB1107704);中央高校基本科研业务费(DUT19ZD209)

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).

摘要: 大型工业制件在增材制造中的路径规划的优劣直接影响着制造质量和效率。现阶段常用的传统3D打印路径规划方法存在打印头转弯堆积和打印头起落次数较多等问题, 并不完全适用于大型工业制造。因此, 文中提出了一种智能路径规划方法。首先, 将切片后得到的二维平面进行凹多边形凸分解, 形成打印子区;然后, 对每个分区内部进行沿分区长轴打印以减少打印路径数量和总行程;最后, 将子分区的连接视作TSP旅行商问题, 使用遗传算法完成子分区间的打印路径规划。同时, 利用C#语言设计开发了一套智能3D打印路径规划系统, 该系统具有切片面输入和显示、打印宽度设置、智能路径规划和G-code代码输出的功能。分别与两种传统路径规划算法进行对比实验, 证明了智能路径规划算法生成的路径条数、空行程距离、打印头抬起次数均有明显减少。基于子分区的智能路径规划方法为大型工业制件的增材制造过程提供了新的思路。

关键词: 凹多边形凸分解, 路径规划, 旅行商问题, 三维打印, 遗传算法

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

中图分类号: 

  • 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].https://mpen.ca/406/bayazit.
[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] 王兵, 吴洪亮, 牛新征.
基于改进势场法的机器人路径规划
Robot Path Planning Based on Improved Potential Field Method
计算机科学, 2022, 49(7): 196-203. https://doi.org/10.11896/jsjkx.210500020
[2] 杨浩雄, 高晶, 邵恩露.
考虑一单多品的外卖订单配送时间的带时间窗的车辆路径问题
Vehicle Routing Problem with Time Window of Takeaway Food ConsideringOne-order-multi-product Order Delivery
计算机科学, 2022, 49(6A): 191-198. https://doi.org/10.11896/jsjkx.210400005
[3] 王永, 崔源.
基于四边形最优圈内最短路径的旅行商问题割边方法
Cutting Edge Method for Traveling Salesman Problem Based on the Shortest Paths in Optimal Cycles of Quadrilaterals
计算机科学, 2022, 49(6A): 199-205. https://doi.org/10.11896/jsjkx.210400065
[4] 谭任深, 徐龙博, 周冰, 荆朝霞, 黄向生.
海上风电场通用运维路径规划模型优化及仿真
Optimization and Simulation of General Operation and Maintenance Path Planning Model for Offshore Wind Farms
计算机科学, 2022, 49(6A): 795-801. https://doi.org/10.11896/jsjkx.210400300
[5] 沈彪, 沈立炜, 李弋.
空间众包任务的路径动态调度方法
Dynamic Task Scheduling Method for Space Crowdsourcing
计算机科学, 2022, 49(2): 231-240. https://doi.org/10.11896/jsjkx.210400249
[6] 吴善杰, 王新.
基于AGA-DBSCAN优化的RBF神经网络构造煤厚度预测方法
Prediction of Tectonic Coal Thickness Based on AGA-DBSCAN Optimized RBF Neural Networks
计算机科学, 2021, 48(7): 308-315. https://doi.org/10.11896/jsjkx.200800110
[7] 陈镜宇, 郭志军, 尹亚昆.
基于混合算法的智能割草机全遍历路径规划及其系统设计
Full Traversal Path Planning and System Design of Intelligent Lawn Mower Based on Hybrid Algorithm
计算机科学, 2021, 48(6A): 633-637. https://doi.org/10.11896/jsjkx.201100002
[8] 郑增乾, 王锟, 赵涛, 蒋维, 孟利民.
带宽和时延受限的流媒体服务器集群负载均衡机制
Load Balancing Mechanism for Bandwidth and Time-delay Constrained Streaming Media Server Cluster
计算机科学, 2021, 48(6): 261-267. https://doi.org/10.11896/jsjkx.200400131
[9] 王金恒, 单志龙, 谭汉松, 王煜林.
基于遗传优化PNN神经网络的网络安全态势评估
Network Security Situation Assessment Based on Genetic Optimized PNN Neural Network
计算机科学, 2021, 48(6): 338-342. https://doi.org/10.11896/jsjkx.201200239
[10] 左剑凯, 吴杰宏, 陈嘉彤, 刘泽源, 李忠智.
异构无人机编队防御及评估策略研究
Study on Heterogeneous UAV Formation Defense and Evaluation Strategy
计算机科学, 2021, 48(2): 55-63. https://doi.org/10.11896/jsjkx.191100053
[11] 杜婉茹, 王潇茵, 田涛, 张越.
面向未知环境及动态障碍的人工势场路径规划算法
Artificial Potential Field Path Planning Algorithm for Unknown Environment and Dynamic Obstacles
计算机科学, 2021, 48(2): 250-256. https://doi.org/10.11896/jsjkx.191100170
[12] 郭启程, 杜晓玉, 张延宇, 周毅.
基于改进鲸鱼算法的无人机三维路径规划
Three-dimensional Path Planning of UAV Based on Improved Whale Optimization Algorithm
计算机科学, 2021, 48(12): 304-311. https://doi.org/10.11896/jsjkx.201000021
[13] 姚泽玮, 林嘉雯, 胡俊钦, 陈星.
基于PSO-GA的多边缘负载均衡方法
PSO-GA Based Approach to Multi-edge Load Balancing
计算机科学, 2021, 48(11A): 456-463. https://doi.org/10.11896/jsjkx.210100191
[14] 高帅, 夏良斌, 盛亮, 杜宏亮, 袁媛, 韩和同.
基于投影圆度和遗传算法的空间圆柱面拟合方法
Spatial Cylinder Fitting Based on Projection Roundness and Genetic Algorithm
计算机科学, 2021, 48(11A): 166-169. https://doi.org/10.11896/jsjkx.201100057
[15] 赵杨, 倪志伟, 朱旭辉, 刘浩, 冉家敏.
基于改进狮群进化算法的面向空间众包平台的多工作者多任务路径规划方法
Multi-worker and Multi-task Path Planning Based on Improved Lion Evolutionary Algorithm forSpatial Crowdsourcing Platform
计算机科学, 2021, 48(11A): 30-38. https://doi.org/10.11896/jsjkx.201200085
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!