首页 | 本学科首页   官方微博 | 高级检索  
     检索      

点阵结构部件的增材制造路径连接方法
引用本文:周波,刘殿海,赵宇辉,田同同,赵吉宾.点阵结构部件的增材制造路径连接方法[J].航空制造技术,2021(6):14-23.
作者姓名:周波  刘殿海  赵宇辉  田同同  赵吉宾
作者单位:中国科学院沈阳自动化研究所;中国科学院机器人与智能制造创新研究院
基金项目:国家重点研发计划(2016YFB11005);国家自然科学基金(51605475);中央引导地方科技发展专项资金(2021JH6/10500123)。
摘    要:旨在提高点阵结构部件增材制造的加工效率。点阵结构经分层切片后,每层将产生大量待填充多边形,通过将这些多边形抽象为离散点,并在切片层面内求解旅行商问题,进行连接路径的规划,进而获得高效率的点阵模型填充路径。算法综合考虑到旅行商问题的计算效率以及连接路径的计算总长:采用蚁群算法可获得无交叉连接轨迹,计算2000个点的连接规划耗时小于3.5s,对照国际先进算法仅增加0.2%的路径总长;当部分抽象点距离过远,则采用距离聚类的方式将抽象点集分割为子集,再分别进行路径规划。仿真及试验验证结果表明,该方法可以获得高效的无交叉连接路径,有效降低连接路径总长及加工时间:总打印时间减少17.52%,总连接长度减少17.38%,满足实际增材制造需求。

关 键 词:点阵结构模型  增材制造  计算机图形学  旅行商问题  填充

Linking Method for Additive Manufacturing of Lattice Structure Components
ZHOU Bo,LIU Dianhai,ZHAO Yuhui,TIAN Tongtong,ZHAO Jibin.Linking Method for Additive Manufacturing of Lattice Structure Components[J].Aeronautical Manufacturing Technology,2021(6):14-23.
Authors:ZHOU Bo  LIU Dianhai  ZHAO Yuhui  TIAN Tongtong  ZHAO Jibin
Institution:(Shenyang Institute of Automation,Chinese Academy of Sciences,Shenyang 110016,China;Institutes for Robotics and Intelligent Manufacturing,Chinese Academy of Sciences,Shenyang 110169,China)
Abstract:This paper aims to improve the processing efficiency of lattice structural components additive manufacturing.After the lattice structure is layered and sliced,each layer will generate a large number of polygons to be filled.By abstracting these polygons into discrete points,solving the traveling salesman problem at the slice level,carrying out the planning of the connection path,a highly efficient dot matrix model filling path is obtained.The algorithm takes into account the calculation efficiency of the traveling salesman problem and the total length of the calculation of the connection path:the ant colony algorithm is used to obtain a cross-connected trajectory.The calculation of the connection plan of 2000 points takes less than 3.5s and the total path length only increases by 0.2% compared to the international advanced algorithm.When some abstract points are too far apart,the abstract point set is divided into subsets by distance clustering,and then the path planning is performed separately.Simulation and experimental verification results show that this method can obtain an efficient non-cross-connection path,effectively reducing the total length of the connection path and the processing time:the total printing time is reduced by 17.52% and the total connection length is reduced by 17.38%,meeting the actual additive manufacturing needs.
Keywords:Lattice structural model  Additive manufacturing  Computer graphics  Traveling salesman problem  Filling
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号