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

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

• Article • Previous Articles     Next Articles

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

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

CLC Number: