欢迎访问《图学学报》 分享到：
图学学报

图学学报

• 数字化设计 • 上一篇    下一篇

三维打印中喷头的最优路径规划

  

  1. 宁波大学信息科学与工程学院，浙江 宁波 315211
  • 出版日期:2017-02-28 发布日期:2017-02-22
  • 基金资助:
    国家自然科学基金项目(61300168)；浙江省重中之重开放课题(XKXL1429，XKXL1406)；宁波大学研究生教育教学研究项目(JGZDI201501)；
    宁波大学教研项目(JYXMxsj201405)

Optimal Nozzle Path Planning in 3D Printing

  1. Faculty of Electrical Engineering and Computer Science, Ningbo University, Ningbo Zhejiang 315211, China
  • Online:2017-02-28 Published:2017-02-22

PDF (PC)

281

摘要： 三维打印是逐层逐体素打印，喷头的路径规划是其中的关键组成部分，其至少需要
考虑3 个方面的需求：①喷头必须历经每个需要打印的体素；②同一个体素不能被喷头反复打
印；③尽量减少喷头在位置上的跳转，如必须跳转，那么跳转间隔不宜太大。为此将喷头移动
路径的规划问题转化为旅行商问题并用改进的回溯算法来求解，基于大量实验给出了相关参数
的最佳配置。

关键词: 三维打印, 路径规划, 旅行商问题, 改进回溯算法

Abstract: The key idea of the 3D printing technology lies in the layer-by-layer printing style, where
designing the motion plan of the nozzle is a central constituent. It has at least three requirements: ①
The nozzle has to go through each voxel defining the volume of the given 3D object; ② It’s better not
to go through the same voxel multiple times; ③ The jumping from one voxel to a nonadjacent voxel
should not be encouraged, or at least the jumping gap should be as small as possible. Based on the
observations, the nozzle motion problem is transformed into the famous traveling salesman problem
and then an improved backtracking algorithm used to find the solution. Furthermore, the best
configuration of relevant parameters is given based on extensive experimental results.

Key words: 3D printing, path planning, traveling salesman problem, improved backtracking
algorithm