多区域行切加工路径优化

Tool-path Optimization for Multi-contoured and Direction-paralleled Machining

利用图论中经典的“旅行商问题”数学模型,提出了一种对复杂多区域零件行切加工路径进行优化处理的算法。采用贪婪法和枚举法结合的算法,在精度上比以往的近似算法有所提高,同时在时间上也具备实时性。算法实现了加工的走刀路径最短,也同时确定了每个子区域的下刀点,缩短了走刀时间,提高了加工效率。

By the classical TSP model in graph theory,an algorithm to optimize the tool-path ofdirection-paralleled machining for complex multi-contoured parts is put forward. Combined withgreedy algorithm and enumeration algorithm,the algorithm is improved in precision and real-time.The algorithm gets the shortest tool-path of machining and determines feed points at each sub-contour. The feed time is shorten and working efficiency is increased.