• CN:11-2187/TH
  • ISSN:0577-6686

›› 2006, Vol. 42 ›› Issue (1): 202-205.

• 论文 • 上一篇    下一篇

扫码分享

复杂型腔刀位轨迹规划的优化算法

于源   

  1. 北京化工大学机电工程学院
  • 发布日期:2006-01-15

OPTIMIZATION ALGORITHM OF TOOL-PATH SCHEDULING FOR THE COMPLICATED POCAKETS

YU Yuan   

  1. School of Mechanical and Electrical Engineering, Beijing University of Chemical Technology
  • Published:2006-01-15

摘要: 针对行切法加工复杂型腔,对型腔边界与岛屿轮廓进行扫尾处理时,如何得到最短且合理的刀位轨迹,提出了一种优化算法。首先利用最小树得到环与环之间的最短连通路径。但是无序的最小树却无法映射为扫尾处理的最短刀位轨迹,因此应对同一父节点下的同层子节点进行排序,通过生成最小有序树得到最短的刀位轨迹,减少了空行程从而提高加工效率。该优化算法易于实现,已在自行研制的模具CAM软件中得到成功的应用。

关键词: 刀位轨迹规划, 复杂型腔, 最小有序树

Abstract: A tool-path scheduling optimization algorithm is presented to generate the shortest and appropriate tool-path during sweeping roots for the pocket boundary and island contours in zigzag milling. Minimum tree is used to obtain the shortest link-path of all the loops. But the disordered minimum tree don’t map the shortest tool-path, sorting the child nodes of the same parent at the same level can generate the shortest tool-path by the ordered minimum tree, which reduces the null path and improves the efficiency. The algorithm is easy to achieve and has been successfully used in home-developed mold CAM software.

Key words: Complicated pockets, Ordered minimum tree, Tool-path scheduling

中图分类号: