Abstract

During the machining of complicated curves and surfaces, the massive microsegments are generated. The microsegments are inputted into numerical control system (CNC) to process the velocity planning and high-velocity interpolation. This whole procedure is the core algorithm of CNC. During the procedure of velocity planning, the look-ahead iterative calculation is used for several specified future microsegments and the calculation quantity is very large. Additionally, the CNC is a typical hard real-time system. Every interpolation step must be finished in specified interpolation period, so the high calculating ability of CPU is needed. The concept of GPU is quite different from the traditional CPU. It has a very strong parallel computing ability. In this project, the GPU technology is introduced into CNC algorithm. The parallel structure model is constructed by CUDA, and a discrete planning unit look-ahead velocity control strategy is proposed. The GPU parallel computing mechanism of massive microsegments is discussed and, based on the research, a high-performance velocity planning algorithm is presented. This research result can highly raise the velocity planning and interpolation efficiency. This brand new solution can help improve the performance of CNC system dramatically.

Highlights

  • High-velocity and high-accuracy complicated curve and surface processing is the main criterion of the numerical control technology

  • The computation procedures of the velocity grades, velocity in planning unit, and transfer velocity between consecutive planning units are all put into every computation unit (ALU) and dealt with using the parallel strategy

  • The GPU technology is introduced into CNC algorithm

Read more

Summary

Introduction

High-velocity and high-accuracy complicated curve and surface processing is the main criterion of the numerical control technology. Based on velocity look-ahead strategy, we can avoid the unnecessary acceleration/deceleration during the whole interpolation procedure. From all above research works, we can see that the velocity look-ahead computing procedure in CPU is a sequential computation procedure for every microsegment in each interpolation period. This sequential mode means that while even improving the CPU computation ability, for complicated curve or surface, the computation must comply with the specified order. With the increase of look-ahead segment number, the computation increases in exponential way This serial arithmetic mode limits the algorithm efficiency.

Whole Scheme of Parallel Velocity Planning Algorithm with GPU
Interpolation Geometry Elements Linking
Planning Unit and Velocity Grade
Interpolation Velocity in the Planning Unit
Velocity Planning Algorithm of Whole Interpolation Trajectory
Simulation and Experiment Results
Conclusion and Future Work
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call