The Research On Complex Motion Trajectory Planning And Control

This paper studies the cutting paths generation, optimization, and interpolationalgorithms. The part on path optimization: the HPGL files of graphic elements aresaved based on designing sequence of graphics records in the file, resulting in moreinefficient path during the process of drawing or cutting, and even the HPGL filesgraph elements are automatically interpolation of a large number of small segments,so that the process of a simple search sort leads to time-consuming. For this problem,the method of dealing with HPGL files of the recorded graphic elements is proposed ahash way to dynamically change the starting and ending points of graphics recordsand the optimization algorithm of graphics records order. The graphic elementsoptimization uses classical shortest distance algorithm. The part of interpolationalgorithm: the algorithm of small line segments interpolation and the method ofprocessing flexion points mentioned in the references, proposed a method ofprocessing flexion points in which adjust the adaptive segment endpoint to simplifythe overall process of the algorithm. And the program is designed to be in modular,not changing the procedural framework under the premise, to directly modify thedifferent acceleration deceleration of the strategy. Then, there are analyzing theinterpolation of linear acceleration and deceleration and S-curve accelerationdeceleration method and discussing the different segments of the S-curve accelerationdeceleration process parameter settings in detail. Finally interpolation algorithm issaved as the output file from the input path information, by the idea of the using spaceinstead of time, redefined the input file form of numerical control system, reducingthe computational load.