Minimum time corner transition algorithm with confined feedrate and axial acceleration for nc machining along linear tool path

Linear tool paths, or G01 codes, are the most widely used form of tool paths for NC machining. Because of the inborn tangent discontinuity, it is difficult to realize the machining with both high speed and high quality along the G01 codes. To solve this problem, a local corner transition algorithm c...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2017-03, Vol.89 (1-4), p.941-956
Main Authors: Zhang, Qiang, Gao, Xiao-Shan, Li, Hong-Bo, Zhao, Ming-Yong
Format: Article
Language:English
Subjects:
Acceleration
Algorithms
CAE) and Design
Computer simulation
Computer-Aided Engineering (CAD
Engineering
Industrial and Production Engineering
Machine tools
Machining
Mechanical Engineering
Media Management
Motion planning
Numerical controls
Original Article
Strategy
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Linear tool paths, or G01 codes, are the most widely used form of tool paths for NC machining. Because of the inborn tangent discontinuity, it is difficult to realize the machining with both high speed and high quality along the G01 codes. To solve this problem, a local corner transition algorithm combined with global motion planning strategy is proposed. Very different from recent corner transition studies in which the transition path and feedrate are planned separately, this work uses a one-step strategy to generate the transition trajectory. Besides, the more reasonable axial acceleration limits are considered in this algorithm, since the acceleration performances of individual axes in conventional machine tools may be significantly different. To enhance the machining efficiency, a modified corner transition strategy with more free transition space is proposed. The feasibility and efficiency of the proposed algorithm are verified by simulations and experiments.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-016-9144-9