Patent ID: 9529813
Filing Date: 2016-12-27
CPC Classification: G05B,G06F,Y02P

Claim Text:
1. A computer-aided numerical control method, comprising: related data flow file planning to be used to manufacture a related data flow file, wherein the related data flow file is used to manufacture digital control information of a tool path; the digital control information comprise a L-division and a T-division of the tool path; the L-division is a increment-type related data flow, the increment-type related data flow is a sequence of consecutive micro-segments, a maximum normal distance from the tool path to each micro-segment is less than or equal to a discrete scale; the T-division is a sequence of consecutive time intervals; the L-division is used to control relevant axes to produce required synthetic displacements, the T-division is used to control a time interval between two consecutive synthetic displacements, which is a control of a feedrate (F); the related data flow file planning further comprising: discrete coordinate system planning, to be used to establish a discrete coordinate system by griding a coordinate plane of the discrete coordinate system by a set of equidistance lines, wherein a distance between the lines is equal to the discrete scale; tool-path planning, to be used to divide the tool-path into multiple segments according to feature points of the tool-path, to determine a drive-axis (y) and a linkage-axis (x) for each segment of the tool-path, and to generate a tool-path file; a coordinate value of the segment of the drive-axis (y) is larger than a coordinate value of the segment of the linkage-axis (x); the feature points are points at which the drive-axis or the linkage-axis change a drive or linkage attribute; discrete geometry planning, to be used to generate an intrinsic L-division of the tool-path in the tool-path file; the intrinsic L-division is a supremum of the L-division; the discrete geometry planning further comprising the steps of: ( 1031 ) setting an optimization goal for a first segment; the optimization goal is one of three goals including a shortest distance, a smallest discrete error, and an optimization of tolerance and fit; ( 1032 ) generating a neighborhood of a basic-point in the discrete coordinate system, wherein the basic-point is a start-point of the first segment, the neighborhood is all images of the basic-point at allowed feed directions, each image is a lattice-point which distance from the first segment is less than or equal to the discrete scale; ( 1033 ) determining a lead-point in the neighborhood of the basic-point according to the optimization goal, and generating a coordinate value increment between the lead-point and the basic-point; ( 1034 ) generating a line-segment between the lead-point and the basic-point; ( 1035 ) generating the neighborhood of the line-segment at the allowing feed directions; and judging whether the neighborhood of the line-segment is a subset of the neighborhood of the first segment; if the neighborhood of the line segment is the subset, then the line-segment is the micro-segment of the first segment; the neighborhood of the line-segment is a set of images of all lattice-points at the line segment; the neighborhood of the first segment is a set of images of all lattice-points at the first segment; ( 1036 ) if the neighborhood of the line segment is the subset, returning to the step ( 1033 ) and generating a next lead-point; ( 1037 ) if the line segment is not the subset, then a previous lead-point of the lead-point is an end-point of a first micro-segment of the first segment, and the coordinate value increment between the previous lead-point and the basic-point is the coordinate value increment of the first micro-segment; ( 1038 ) setting the previous lead-point as a new basic-point, and generating a next micro-segment of the first segment by executing the step ( 1032 ) to the step ( 1037 ), until generating the intrinsic L-division of the first segment, wherein the intrinsic L-division satisfies the optimization goal; ( 1039 ) executing the step ( 1031 ) to the step ( 1038 ) for a second segment and all subsequent segments of the tool-path file, until generating the intrinsic L-division of the tool-path, wherein the intrinsic L-division satisfies the optimization goals; and discrete kinematics planning, to be used to generate the T-division for the intrinsic L-division; for a given F and a given tool-path, first to check a smoothness of the drive-axis to adjust the F according to the intrinsic L-division of the tool-path, and to generate the T-division according to the adjusted F; next to check a smoothness of the linkage-axis axis based on a structure factor of the linkage-axis, and to generate the L-division and the T-division of the tool-path; the discrete kinematics planning further comprising the steps of: calculating corresponding time intervals for all micro-segments of the intrinsic L-division based on the F; and adjusting the value of the time intervals as many times as desired, and simultaneously or separately adjusting the length of the micro-segments as many times as desired to meet the smoothness of the drive-axis and the smoothness of the linkage-axis; and related data flow file planning, to be used to generate a linkage-table and a follow-table of the tool-path, the linkage-table is used to store the L-division adjusted by the discrete kinematics planning, the follow-table is used to store the T-division planned by the discrete kinematics planning and to merge the linkage-table and the follow-table as the related data flow file.