Toolpath optimization for minimizing airtime during machining

被引：99

作者：

Castelino, K ^{[1
]}

D'Souza, R ^{[1
]}

Wright, PK ^{[1
]}

机构：

[1] Univ Calif Berkeley, Berkeley, CA 94720 USA

来源：

JOURNAL OF MANUFACTURING SYSTEMS | 2003年 / 22卷 / 03期

基金：

美国国家科学基金会;

关键词：

toolpath planning; airtime minimization; traveling salesman problem; sequential ordering problem; combinatorial optimization;

D O I：

10.1016/S0278-6125(03)90018-5

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper describes an algorithm for minimizing the nonproductive time or 'airtime' for milling by optimally connecting different toolpath segments. This problem is formulated as a generalized traveling salesman problem with precedence constraints and is solved using a heuristic method. The performance of the heuristic algorithm and the amount of improvement obtained for different problem sizes is also presented. This algorithm has been implemented in an automated process planning system and can be applied easily to other areas of path planning optimization like fused deposition modeling and laser cutting.

引用

页码：173 / 180

页数：8

共 29 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2]

[Anonymous], 388 GSIA CARN MELL U

[3] A branch & cut algorithm for the asymmetric traveling salesman problem with precedence constraints [J].