摘要
大型工业制件在增材制造中的路径规划的优劣直接影响着制造质量和效率。现阶段常用的传统3D打印路径规划方法存在打印头转弯堆积和打印头起落次数较多等问题,并不完全适用于大型工业制造。因此,文中提出了一种智能路径规划方法。首先,将切片后得到的二维平面进行凹多边形凸分解,形成打印子区;然后,对每个分区内部进行沿分区长轴打印以减少打印路径数量和总行程;最后,将子分区的连接视作TSP旅行商问题,使用遗传算法完成子分区间的打印路径规划。同时,利用C#语言设计开发了一套智能3D打印路径规划系统,该系统具有切片面输入和显示、打印宽度设置、智能路径规划和G-code代码输出的功能。分别与两种传统路径规划算法进行对比实验,证明了智能路径规划算法生成的路径条数、空行程距离、打印头抬起次数均有明显减少。基于子分区的智能路径规划方法为大型工业制件的增材制造过程提供了新的思路。
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.
作者
杨德成
李凤岐
王祎
王胜法
殷慧殊
YANG De-cheng;LI Feng-qi;WANG Yi;WANG Sheng-fa;YIN Hui-shu(School of Software Technology,Dalian University of Technology,Dalian 116600,China;International School of Information Science&Engineering,Dalian University of Technology,Dalian 116600,China)
出处
《计算机科学》
CSCD
北大核心
2020年第8期267-271,共5页
Computer Science
基金
国家重点研发计划子课题(2017YFB1107704)
中央高校基本科研业务费(DUT19ZD209)。
关键词
三维打印
路径规划
遗传算法
凹多边形凸分解
旅行商问题
3D Printing
Path planning
Genetic algorithm
Concave polygonal convex decomposition
Traveling Salesman Problem
