S-shaped speed planning and improved filtering processing method and system based on single cycle

Through the S-shaped speed planning based on single-cycle and improved filtering processing method, the problem of large increase and acceleration fluctuations under different conditions of the S-shaped acceleration and deceleration algorithm is solved. The T-shaped filtering model is used to reduce the increase and acceleration fluctuations, and the CNC system is realized smooth acceleration and deceleration control.

CN118915625AInactive Publication Date: 2024-11-08徐州元杰自动化科技有限公司
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202410947972.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-16
Publication Date
2024-11-08
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

The existing S-shaped acceleration and deceleration algorithms are difficult to effectively reduce the fluctuations in acceleration under different conditions, and the average filtering method may cause the acceleration to exceed the theoretical limit.

Method used

Using S-shaped speed planning based on single-cycle and improved filtering processing method, the S-shaped Acc/Dec solution method of classified motion states and using a single interpolation cycle is filtered in combination with the T-shaped acceleration and deceleration algorithm to reduce the acceleration and acceleration. Maximum value and fluctuation.

Benefits of technology

The smooth motion trajectory in acceleration and deceleration control is realized, the fluctuations of acceleration and acceleration are reduced, the acceleration is ensured that acceleration and acceleration are within the theoretical limit value, and the stability and accuracy of the CNC system are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118915625A_ABST
    Figure CN118915625A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of speed control of a numerical control system, and discloses an S-shaped speed planning and improved filtering processing method and system based on a single cycle. According to the method, on the basis of an analytical solution, an overall plan of S-shaped Acc / Dec is provided, a simple algorithm for solving a polynomial equation is provided, and meanwhile, an S-shaped Acc / Dec solving method of a single interpolation period is provided. The S-shaped Acc / Dec filtering method based on the T-shaped filtering model is provided for the situation that the jerk in average filtering often exceeds a theoretical limit value, and fluctuation of the jerk is reduced. Through simulation verification, the method has important theoretical and practical values for guiding selection and application of the S-shaped Acc / Dec method in a numerical control system.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The invention belongs to the technical field of speed control of numerical control systems, and in particular relates to a single-cycle-based S-shaped speed planning and improved filtering processing method and system. Background Art

[0002] Acceleration and deceleration capability is an important indicator to measure the performance of CNC systems, which directly affects the processing efficiency and quality of CNC equipment. High-speed and high-quality processing puts higher requirements on the acceleration and deceleration control capabilities of CNC systems. CNC equipment must be able to move quickly and accurately from the current position to the next position, while ensuring the smooth operation of the equipment to avoid impact, loss of step, out-of-range or oscillation. Therefore, a good acceleration and deceleration control algorithm can effectively avoid vibration, impact and loss of step during the movement of machine tools. In order to achieve the stability of feed speed and improve positioning accuracy and efficiency, it is very important to develop an efficient addition / subtraction control algorithm. In recent years, different scholars have made many studies on Acc / Dec control algorithms.

[0003] Traditional T-shaped and exponential acceleration and deceleration algorithms are suitable for point control, but due to the discontinuity of acceleration, they will cause greater shock and vibration, affecting the processing quality and making it difficult to achieve high-precision processing. For this reason, Erkorkmaz et al. first proposed the S-curve acceleration and deceleration control algorithm in 2001. Compared with linear and exponential addition / subtraction control algorithms, the instructions generated by this algorithm are smoother and more accurate. Therefore, the S-curve acceleration and deceleration control algorithm has received widespread attention. The S-curve acceleration and deceleration algorithm can greatly improve the shortcomings of traditional acceleration and deceleration algorithms. The entire motion process of the standard S-shaped acceleration and deceleration is divided into seven stages: acceleration, uniform acceleration, deceleration acceleration, constant speed, acceleration and deceleration, uniform deceleration, and deceleration.

[0004] The mathematical model and solution of the S-shaped addition / subtraction method have attracted widespread attention. The complete S-shaped addition / subtraction curve consists of 7 segments with many parameters. In most cases, the speed solution equation is nonlinear, which makes its solution complicated. In order to reduce the complexity of planning and solving the S-shaped addition / subtraction curve, some scholars have introduced artificial intelligence algorithms, such as genetic algorithms and particle swarm optimization algorithms. Although the above artificial intelligence algorithms have strong robustness, compared with the traditional dichotomy method and Newton iteration method, the algorithm has a large amount of calculation and poor real-time performance. For the S-shaped addition / subtraction curve, the ideal solution method should have a smaller computational complexity and higher solution accuracy. Wang et al. proposed a forward control algorithm based on the S-shaped acc / dec curve, assuming that the speed curve is symmetrical to simplify the calculation difficulty. In the prior art, the uniform acceleration segment and uniform deceleration segment are removed, and the model is simplified to 5 segments, which reduces the difficulty of calculation and solution, but also limits the dynamic performance of CNC machine tools.

[0005] The use of appropriate acceleration and deceleration curves can make the CNC system more flexible and the processing trajectory smoother, thereby reducing the vibration and impact of the system, improving the flexibility of the system, adjusting the feed rate and reducing acceleration fluctuations. Zhang et al. adopted the S-type acceleration and deceleration algorithm to achieve precise control of the position of the lifting mechanism. Han et al. proposed an improved S-curve flexible acceleration and deceleration control method to solve the flexible impact and vibration problems at the start and end of the automatic wire stripping module of the intelligent live working robot. On the basis of ensuring the continuity of acceleration, a five-stage motion planning was adopted, and different S-shaped curve transition forms could be selected according to different working conditions. In order to improve the sorting accuracy and efficiency of the large inertia robot sorting system, Chen et al. proposed a trajectory planning method based on the S-shaped acceleration and deceleration algorithm to reduce the calculation amount of speed planning. In order to meet the requirements of fast pick-up and placement or obstacle avoidance of industrial robots, Song et al. proposed a modified S-shaped acceleration and deceleration (ACC / DEC) control algorithm based on segmented continuous acceleration curve. There are 9 motion states in the acceleration and deceleration process, and the judgment conditions and calculation methods of these 9 motion states are analyzed respectively. Wang et al. proposed a discrete S-curve speed control algorithm. Under several constraints such as axial feed speed and feed acceleration limit, arc radius error limit and processing segment length limit, the look-ahead method was used to seek the optimal linkage feed speed to achieve the maximum feed speed. Lu et al. constructed S-curve acc / dec according to the actual axial limit and applied genetic algorithm to optimize the processing time, making it easier to obtain the optimal parameters of S-curve acc / dec. Chen et al. proposed a feed speed profile generation method based on S-curve acc / dec and the corresponding look-ahead algorithm, so that the generation of feed speed curve effectively predetermines the number of interpolation steps in different regions and the free feed speed of S-curve acc / dec path to meet the real-time requirements. Li et al. proposed the concept of separating curve profile recognition from speed solution based on S-shaped acceleration and deceleration curve, and proposed a solution for quickly identifying the solution position interval. Hepeng et al. proposed a PVT control of S-shaped ACC / DEC algorithm modified on the basis of a new speed planning method in order to generate a smooth trajectory while meeting kinematic constraints such as maximum speed, acceleration and jerk. For reasonable PVT instructions, the given PVT conditions can be met, the velocity profile is smooth, and the kinematic parameters can be limited to the allowed range. However, for unreasonable PVT instructions, large errors will occur. Ni et al. proposed a time rounding feed speed scheduling method based on the S-shaped ACC / DEC algorithm. However, the feed speed scheduling effect is not good when there is only a deceleration stage. Later, in order to solve the problem of only having a deceleration stage, Tao et al. proposed an S-shaped feed speed scheduling method that eliminates rounding errors. A series of feed speed scheduling methods were designed for different S-shaped acceleration / deceleration situations. Different rounding methods were used in different time intervals to ensure the continuity of the speed.Li et al. proposed an asymmetric S-curve acceleration and deceleration control algorithm, and derived simple calculation formulas for the maximum achievable speed, deceleration displacement in the deceleration zone, and displacement in the constant acceleration section to solve the end point correction and target speed correction. Zhang et al. proposed a one-step smoothing method for straight line segment corners based on feed rate mixing. The feed speed scheduling method of the S-shaped acceleration and deceleration algorithm is used to achieve the smoothing of the feed speed curve. Yang et al. proposed a smooth S-curve acceleration and deceleration control algorithm based on the runout limit contour. For curves that do not meet the completely smooth S-curve acceleration and deceleration conditions, they are divided into three cases according to the curve length, and detailed calculation formulas are given. Yang et al. proposed a scheduling method combining morphological filtering and S-shaped acceleration and deceleration mode. Based on the morphological filter, the trimming operation is used to reduce the fluctuation on the constrained surface, so that the feed speed of the difficult-to-process area is more constant. Then, the adaptive S-shaped acceleration / deceleration mode is used to plan the acceleration / deceleration stage on the trimmed feed speed curve to make the speed curve smoother. He et al. improved the traditional S-shaped acceleration and deceleration model so that the jerk changes linearly at a certain slope to reduce the acceleration shock. Wu et al. proposed a segmented interpolation method based on the curve curvature threshold. The S-shaped velocity planning algorithm and the bidirectional velocity scanning algorithm were used to update and implement the global velocity curve to reduce velocity fluctuations. Fan et al. proposed a high-precision NURBS surface modeling method based on S-shaped feed velocity scheduling to ensure the accuracy of NURBS curves.

[0006] In addition, some scholars have also made the acceleration change smoother from the perspective of digital filtering. The commonly used method is the traditional average filtering, which aims to ensure a smooth acceleration transition and help achieve a smooth acceleration transition. Yang et al. proposed a scheduling method combining morphological filtering and S-shaped acceleration and deceleration mode. Based on the morphological filter, the trimming operation is used to reduce the fluctuation on the constraint surface, so that the feed speed of the difficult-to-process area is more constant. Then the adaptive S-shaped acceleration / deceleration mode is used to plan the acceleration / deceleration stage on the trimmed feed speed curve to make the speed curve smoother. Sencer et al. proposed a kinematic corner smoothing algorithm method, in which the turning trajectory of the tool is generated by FIR (finite impulse response) filtering of the discontinuous axis speed command at the connection of the line segment. In the prior art, the NURBS curve is divided into a non-deceleration zone and a deceleration zone according to the acceleration of each interpolation, and the acceleration of the non-deceleration zone and the deceleration zone is adjusted by filtering to solve the acceleration mutation problem. However, this method does not limit the acceleration, which may cause the problem of acceleration exceeding. Chang et al. proposed a filtering method combining a look-ahead algorithm and three modified moving average filters (3MMAF) to achieve smooth acceleration changes. However, in some cases, the above method may result in large acceleration values ​​or exceed the theoretical limit of acceleration, and cannot truly achieve proportional changes in acceleration and jerk over time.

[0007] The above prior art highlights the advantages and wide application of the S-shaped Acc / Dec algorithm. However, there is still a lack of comprehensive and systematic analysis of the S-shaped Acc / Dec algorithm under different conditions, and it cannot effectively reduce the fluctuation of acceleration. Summary of the invention

[0008] In order to overcome the problems existing in the related art, the disclosed embodiments of the present invention provide a method and system for S-shaped speed planning and improved filtering processing based on a single cycle, which focuses on equation solving and filtering processing.

[0009] The technical solution is as follows: a single-cycle S-shaped speed planning and improved filtering processing method, comprising:

[0010] S1, during the operation, the distance S from the initial speed to the terminal speed vs_ve , the distance S from the initial speed to the desired speed vs_vr , the operation from the desired speed to the terminal speed S vr_ve The motion state is classified based on the relationship between the speed and the remaining distance, and the classified running state is processed by a simplified processing method to make the speed of the classified running state smooth and uniform;

[0011] S2, based on the classified running state after simplified processing, using the S-shaped Acc / Dec solution method of a single interpolation cycle, the speed of the running state under different conditions is modified and solved in a single cycle to obtain the motion parameters of the interpolation cycle;

[0012] S3, using the T-shaped acceleration and deceleration method to obtain motion parameters of each interpolation cycle, filtering the obtained motion parameters based on the T-shaped acceleration and deceleration algorithm to obtain filtered motion parameters, so as to reduce the maximum value of the acceleration and reduce the fluctuation of the acceleration.

[0013] In step S1, the simplified processing method includes:

[0014] Solve for a s The distance S to 0 vs_as_0 and speed v vs_as_0 , and from the speed v vs_as_0 To terminal speed v e The distance S vs_ve ; Among them, a s is the initial acceleration;

[0015] Perform S vs_as_0 +S v_ve With S left Value comparison, where S left is the remaining distance;

[0016] If S vs_as_0+S v_ve left , then the entire operation process becomes from v s ,a s To S vs_as_0 ; Then with v vs_as_0 Run at a constant speed, then from v vs_as_0 to v e ; where v s is the initial velocity;

[0017] If S vs_as_0 +S v_ve ≥S left , then the entire operation process becomes from v s ,a s to v e ; Then with v e Running at a constant speed, if v e is 0, then the speed Completed; among them, j m is the maximum acceleration.

[0018] In step S2, the S-shaped Acc / Dec solution method for a single interpolation cycle includes:

[0019] (I)S vs_ve >S left Solve, when S vs_ve >S left , unable to reach the terminal speed, entering the pure acceleration or pure deceleration process, the jerk J is solved according to formula (1): s_half j m ,-j m , the corresponding acceleration at 0 is a ie , the speed is v ie , the distance is S ie ; Then solve the acceleration a corresponding to the three cases ie The distance S to when the acceleration is zero aie_0 ; Finally, S ie +S aie_0 and the remaining distance S left Make comparisons;

[0020] Formula (1) is expressed as:

[0021]

[0022] Where, t is time, unit is s; v s ,v e are the initial velocity and terminal velocity respectively, v r is the expected speed, in mm / s; a s ,a e are the initial acceleration and terminal acceleration respectively, j​m is the maximum acceleration, in mm / s 3 ; S is the distance, the unit is mm;

[0023] (II)S vs_ve ≤S left Solution: If S vs_ve ≤S left , then the motion process reaches the terminal velocity; first, according to formula (1), solve j m The velocity v is positive, negative and 0 respectively. ie , acceleration a ie , distance S ie According to formula (2), we can solve the v corresponding to the three cases respectively. ie to v e The distance S vie_ve , according to the three cases of S ie The corresponding S vie_ve The sum of the remaining distance S left Compare; the judgment of the remaining distance is divided into seven cases, and the judgment verification is performed;

[0024] Formula (2) is expressed as:

[0025]

[0026] In the formula, v half is the speed at the midpoint, a half is the midpoint acceleration, t s_half is the time from the initial point to the midpoint, t half_e The time from the midpoint to the end point.

[0027] In step (II), the remaining distance is determined in seven cases, including:

[0028] (i) All three cases satisfy the residual distance, i.e. S ie +S aie_0 left ;

[0029] According to formula (1), the initial velocity is calculated as v ie When a ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time;

[0030] (ii) Any two of the three conditions satisfy the remaining distance: ​

[0031] The two conditions that meet the conditions are calculated by formula (1) respectively when the initial velocity is v ie Time ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time;

[0032] (iii) Only one of the three cases satisfies the remaining distance:

[0033] From equation (1), we can calculate a situation that satisfies the condition. When the initial velocity is v ie Time ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time;

[0034] (iv) If none of the conditions are met, it means that none of the three situations can meet the operation requirements of an interpolation cycle, and the following processing is required: the speed v of the previous interpolation cycle is ie and acceleration a ie Make a ie The positive direction is 0, which means the acceleration a of the entire motion process ais_0 , speed v aie_0 , distance S aie_0 , and S aie_0 Less than the current remaining distance in a ie When it is 0, the segment is not over yet and the remaining distance is expressed in v aie_0 Run at a constant speed and take out the parameters after an interpolation cycle, which include: initial speed, acceleration; terminal speed, acceleration; maximum acceleration, jerk, interpolation cycle, and remaining time.

[0035] In step (II), the remaining distance is determined in seven cases and a discrimination check is performed, including:

[0036] (a) All three cases satisfy the remaining distance:

[0037] The three cases are calculated by formula (1) when the initial velocity is v ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie, acceleration a ie , distance S ie are the parameters obtained this time;

[0038] (b) Any two of the three conditions satisfy the remaining distance:

[0039] The two conditions that meet the conditions are calculated by formula (1) respectively when the initial velocity is v ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time;

[0040] (c) Only one of the three situations satisfies the remaining distance:

[0041] From formula (1), we can calculate a situation where the initial velocity is v. ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time;

[0042] (d) If none of the conditions are met, these three situations cannot meet the operation requirements of an interpolation cycle. The speed v of the previous interpolation cycle ie and acceleration a ie To terminal speed v e According to formula (1), we can solve the acceleration a of the whole motion process. vie_ve , speed v vie_ve , distance S vie_ve , and S vie_ve The remaining distance is less than the current speed v e , this segment is not over yet, and the remaining distance is v e Running at a constant speed, if v e is 0, then the speed Completed, retrieve the parameters after one interpolation cycle runs.

[0043] In step S3, the obtained motion parameters are filtered based on a T-shaped acceleration and deceleration algorithm, including:

[0044] S301, average filtering, in speed planning, the speed constraints are determined, including the speed constraints v caused by the chord height error c , forward-looking speed constraint v per , desired speed constraint v rand the centripetal velocity constraint v n and the filter speed constraint v filter ;

[0045] Determine the filter speed constraint v filter Including: When the number of filtering times is 2n, len = vT, Among them, len is the running distance, len' is the distance after filtering, and the geometric relationship is obtained ε is the maximum allowable error of the filter, and v filter ; The expression is:

[0046]

[0047] When the number of filtering times is N = 2n-1, By geometric relationship Then find v filter ; The expression is:

[0048]

[0049] S302, after obtaining the T-shaped acceleration / deceleration curve, a filtering process based on the T-shaped acceleration / deceleration model is performed to complete the S-shaped acceleration / deceleration of the overall speed curve.

[0050] In step S302, the filtering processing method based on the T-shaped acceleration and deceleration model includes:

[0051] Filtering times N and maximum acceleration a m , maximum jerk j m , the interpolation period T satisfies the following relationship:

[0052]

[0053] The coordinates of the first and last points, velocity, acceleration, and distance interpolation information obtained above are passed to the filtering module. Let the coordinates of the first and last points of the nth interpolation information be p ns (x ns ,y ns ) and p ne (x ne ,y ne ), initial and final speed v ns ,v ne , interpolation period T, acceleration a nvse =(v ne -v ns ) / T, the distance between the first and last point coordinates is expressed as:

[0054]

[0055] Then the T-shaped acceleration and deceleration distance of the interpolation cycle is:

[0056]

[0057] To avoid the theoretical running distance len nv The actual running distance len np If they are not equal, adding an interpolation cycle, the running distance correction coefficient is:

[0058]

[0059] The i-th filtering process of any interpolation information n, i∈[1,N], assumes that the initial speed of filtering at this time is v nis , terminal velocity v nie =v nis +a nves t,t=T / N, the distance traveled according to the T-shaped acceleration and deceleration model is:

[0060]

[0061] Then the distance used for the final real filtering is S nip , the solution is:

[0062] s nip =v ni +p pro (12)

[0063] The nth segment, Δx corresponding to the i-th filtering ni ,Δy ni The change is:

[0064]

[0065] Then the changes of Δx and Δy in any filtering are:

[0066]

[0067] After filtering, the curve profiles of velocity, acceleration and jerk are optimized.

[0068] Another object of the present invention is to provide an S-shaped speed planning and improved filtering processing system based on a single cycle, the system implements the S-shaped speed planning and improved filtering processing method based on a single cycle, the system comprising:

[0069] S-shaped Acc / Dec module is used to measure the distance S from the initial speed to the terminal speed during operation. vs_ve , the distance S from the initial speed to the desired speed vs_vr , the operation from the desired speed to the terminal speed S vr_veThe motion state is classified based on the relationship between the speed and the remaining distance, and the classified running state is processed by a simplified processing method to make the speed of the classified running state smooth and uniform;

[0070] The solution module, based on the simplified classified running state, uses the S-shaped Acc / Dec solution method of a single interpolation cycle to modify and solve the speed of the running states under different conditions in a single cycle to obtain the motion parameters of the interpolation cycle;

[0071] The filtering module uses the T-shaped acceleration and deceleration method to obtain the motion parameters of each interpolation cycle, and performs filtering processing based on the T-shaped acceleration and deceleration algorithm on the obtained motion parameters to obtain filtered motion parameters, so as to reduce the maximum value of the acceleration and reduce the fluctuation of the acceleration.

[0072] Combined with all the above technical solutions, the beneficial effects of the present invention are as follows: Acceleration / Deceleration (Acc / Dec) control is one of the important functions of a computer numerical control (CNC) system, which is used to generate a smooth motion trajectory to achieve a high level of motion results. The S-shaped Acc / Dec algorithm is widely used in the speed control process of a numerical control system because of its smooth start and stop and minimal vibration and impact on the equipment. The present invention conducts a comprehensive and detailed analysis of the analytical solution and filtering process of the S-shaped Acc / Dec. On the basis of the analytical solution, the overall planning of the S-shaped Acc / Dec is explained, and a simple algorithm for solving polynomial equations is proposed. At the same time, the present invention innovatively proposes a method for solving the S-shaped Acc / Dec for a single interpolation cycle. In view of the fact that the acceleration in the average filter often exceeds the theoretical limit value, an S-shaped Acc / Dec filtering method based on a T-shaped filtering model is proposed to reduce the fluctuation of the acceleration. Through simulation verification, the S-shaped Acc / Dec method proposed in the present invention is compared and analyzed, and their advantages and disadvantages are analyzed. The invention has important theoretical and practical value in guiding the selection and application of the S-shaped Acc / Dec method in a numerical control system. BRIEF DESCRIPTION OF THE DRAWINGS

[0073] The accompanying drawings herein are incorporated in and constitute a part of the specification, illustrate embodiments consistent with the present disclosure, and together with the description, serve to explain the principles of the present disclosure;

[0074] Figure 1 It is a diagram of an acceleration and deceleration speed planning and an improved filtering processing method based on a single interpolation cycle provided by an embodiment of the present invention;

[0075] Figure 2 is S provided in the embodiment of the present invention vs_ve Schematic diagram of the movement process;

[0076] Figure 3is a general planning flow chart provided by an embodiment of the present invention;

[0077] Figure 4 This is a single interpolation cycle S-shaped acceleration and deceleration flow chart provided by an embodiment of the present invention;

[0078] Figure 5 This is a schematic diagram of less than one interpolation cycle provided by an embodiment of the present invention;

[0079] Figure 6 is a schematic diagram of filtering speed clamping when the filtering number is 2n provided by an embodiment of the present invention;

[0080] Figure 7 It is a schematic diagram of filtering speed clamping when the filtering number is 2n-1 provided by an embodiment of the present invention;

[0081] Figure 8 It is a principle diagram of a filtering processing method based on a T-shaped acceleration and deceleration model provided by an embodiment of the present invention;

[0082] Fig. 9 It is a schematic diagram of solving the interpolation cycle running distance correction coefficient provided by an embodiment of the present invention;

[0083] Fig.10 It is the motion trajectory of the S-shaped Acc / Dec in a single cycle in the simulation of the square curve provided by the embodiment of the present invention, and its local enlarged diagram;

[0084] Fig.11 It is a filtering trajectory of the S-type Acc / Dec based on the T-type Acc / Dec model in the simulation of the square curve provided by the embodiment of the present invention, and its local enlarged diagram;

[0085] Fig.12 is a schematic diagram of the speed of a square curve during processing provided by an embodiment of the present invention;

[0086] Fig.13 is a schematic diagram of the acceleration of a square curve during processing provided by an embodiment of the present invention;

[0087] Fig.14 is a diagram of the acceleration of a square curve during processing provided by an embodiment of the present invention;

[0088] Fig.15 It is the motion trajectory of the S-shaped Acc / Dec in a single cycle in the simulation of the five-pointed star curve provided by the embodiment of the present invention, and its local enlarged diagram;

[0089] Fig.16 It is a filtering trajectory of the S-shaped Acc / Dec based on the T-shaped Acc / Dec model in the simulation of the five-pointed star curve provided by an embodiment of the present invention, and its local enlarged diagram;

[0090] Fig.17 is a speed diagram of a square curve during processing provided by an embodiment of the present invention;

[0091] Fig.18 is an acceleration diagram of a square curve during processing provided by an embodiment of the present invention;

[0092] Fig.19 It is an acceleration diagram of the square curve during the processing provided by the embodiment of the present invention. DETAILED DESCRIPTION

[0093] In order to make the above-mentioned objects, features and advantages of the present invention more obvious and easy to understand, the specific embodiments of the present invention are described in detail below in conjunction with the accompanying drawings. In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention can be implemented in many other ways different from those described herein, and those skilled in the art can make similar improvements without violating the connotation of the present invention, so the present invention is not limited by the specific implementation disclosed below.

[0094] The innovation of the present invention lies in that: the present invention proposes an S-shaped Acc / Dec solution method for a single interpolation cycle, and considering that the acceleration in the average filtering often exceeds the theoretical limit value, an S-shaped Acc / Dec filtering method based on a T-shaped filtering model is proposed to reduce the fluctuation of the acceleration.

[0095] Embodiment 1, as Figure 1 As shown, the acceleration and deceleration speed planning and improved filtering processing method based on a single interpolation cycle provided by the embodiment of the present invention includes:

[0096] S1, during the operation, the distance S from the initial speed to the terminal speed vs_ve , the distance S from the initial speed to the desired speed vs_vr , the operation from the desired speed to the terminal speed S vr_ve The motion state is classified based on the relationship between the speed and the remaining distance, and the classified running state is processed by a simplified processing method to make the speed of the classified running state smooth and uniform;

[0097] S2, based on the classified running state after simplified processing, using the S-shaped Acc / Dec solution method of a single interpolation cycle, the speed of the running state under different conditions is modified and solved in a single cycle to obtain the motion parameters of the interpolation cycle;

[0098] S3, using the T-shaped acceleration and deceleration method to obtain motion parameters of each interpolation cycle, filtering the obtained motion parameters based on the T-shaped acceleration and deceleration algorithm to obtain filtered motion parameters, so as to reduce the maximum value of the acceleration and reduce the fluctuation of the acceleration.

[0099] Example 2, in order to further describe the technical solution of Example 1 in detail, is specifically described as follows:

[0100] 1. Overall plan.

[0101] The standard formula for solving acceleration, speed and distance in the S-shaped Acc / Dec control algorithm is as follows:

[0102]

[0103] Where, t is time, unit is s; v s ,v e are the initial velocity and terminal velocity respectively, v r is the expected speed, in mm / s; a s ,a e are the initial acceleration and terminal acceleration respectively, j m is the maximum acceleration, in mm / s 3 ; S is the distance, the unit is mm;

[0104]

[0105] In the formula, v half is the speed at the midpoint, a half is the midpoint acceleration, t s_half is the time from the initial point to the midpoint, t half_e The time from the midpoint to the end point.

[0106] First, by adding |a s ±t s_half ×j m |with a m For comparison, a m is the maximum acceleration, in mm / s 2 ; It can be determined whether the current acceleration exceeds the maximum acceleration. From the initial velocity v s To the final speed v e The distance traveled S vs_ve It can be calculated using formula (1) and formula (2), as Figure 2 S vs_ve The motion process is shown in the schematic diagram. s to v e The entire motion process can be calculated by the formula, allowing to obtain information such as the sign of the jitter, whether there is a uniform acceleration and its operation time. Similarly, by using equations (1) and (2), it is possible to obtain the initial velocity v s To the desired speed v r The distance S vs_vr , and from the expected speed v rTo the final speed v e The distance S vr_ve , and related motion parameters.

[0107] Then, according to S during exercise vs_ve , S vs_vr , S vr_ve The relationship between and remaining distance is used to classify the motion state, such as Figure 3 The overall planning process is shown. During this period, when the expected speed cannot be achieved, three situations are further distinguished: both terminals cannot reach the maximum acceleration; only one terminal reaches the maximum acceleration; both terminals can reach the maximum acceleration. In order to further classify each situation, the present invention uses the parameter conditions listed in Table 1 for calculation.

[0108] Table 1 Parameter Conditions

[0109] Symbol Parameter Value <![CDATA[a s ]]> Initial acceleration <![CDATA[10mm / s 2 ]]> <![CDATA[a e ]]> Terminal acceleration <![CDATA[30mm / s 2 ]]> <![CDATA[v s ]]> Initial Speed 10mm / s <![CDATA[v e ]]> Terminal velocity 60mm / s <![CDATA[v r ]]> Expected speed 200mm / s <![CDATA[j m ]]> Maximum acceleration <![CDATA[10mm / s 3 ]]>

[0110] 1.1, S vs_ve >S left

[0111] If S vs_ve >S left , it means that this motion process cannot reach the terminal speed, and then enters the pure acceleration and pure deceleration processing process. The basis for judging whether it is pure acceleration or pure deceleration is to solve S above. vs_ve When the initial jerk is positive or negative, if it is positive, it is a pure acceleration process, and if it is negative, it is a pure deceleration process.

[0112] Exemplarily, in a pure acceleration process with an initial velocity, a pure acceleration process involving uniform acceleration, the acceleration increases from the initial acceleration to the maximum allowed acceleration, then runs at this acceleration value for a period of time, and then gradually decreases to 0. During this period, the jerk (acceleration rate of change) is a set value, which is positive when the acceleration increases and negative when the acceleration decreases. When the maximum acceleration is reached, the jerk is zero. The acceleration starts to decrease and then increases to the maximum acceleration until it reaches 0. It can be seen from the jerk that the jerk changes directly from a positive value to a negative value. Pure deceleration motion is similar to pure acceleration motion, except that the acceleration value becomes a negative value.

[0113] 1.2, S vs_ve ≤S left

[0114] When S vs_ve No more than S left When , it means that the speed during the motion can reach the terminal speed. Next, it is still necessary to determine whether the motion speed can reach the expected speed. It is necessary to compare S _ve_vr +S_vr_ve and S left Here, S _vs_vr Represents the distance from the initial speed to the desired speed, S _vr_ve represents the distance from the desired speed to the terminal speed. If S _vs_vr +S _vr_ve Less than or equal to S left , it means that the actual movement speed can reach the expected speed, and the standard S-shaped acceleration and deceleration has uniform movement in this process.

[0115] If S _vr_vr +S _vr_ve >S left , then the speed during the motion can reach the terminal speed but cannot reach the desired speed. This shows that there is a maximum speed v during the motion process m . Because the actual movement speed cannot reach the expected speed, specifically, there are the following three situations.

[0116] (1) In both the acceleration and deceleration phases, the acceleration can reach the maximum acceleration. The parameters t1, t3, t5, and t7 can be solved as follows:

[0117]

[0118] In the formula, a m is the maximum acceleration, in mm / s 2 ;

[0119] According to equation (1), t2 and t6 can be solved using quadratic equations.

[0120] (2) When the acceleration reaches the maximum value during acceleration or deceleration. The parameters t1 and t3 can be solved using the following formula.

[0121]

[0122] According to formula (1), we can get m to v e During the forward deceleration and reverse acceleration, t5 and t7 are equal. Therefore, only t2 and t5 are unknown, and equation (1) yields a quartic equation to solve for these variables.

[0123] (3) When the acceleration cannot reach the maximum value during acceleration and deceleration, for the acceleration from v m to v e From the deceleration process and the reverse acceleration process, it can be deduced that t5 and t7 are equal to equation (1). Therefore, a high-order polynomial equation (1) can be obtained through the equation, where t1, t3 and t5 are all unknowns. The bisection method is used to iteratively approximate and solve these variables to obtain other parameters.

[0124] In view of the complexity of the above-mentioned solution process, the present invention proposes a simplified processing method, which specifically includes:

[0125] First solve for a s The distance S to 0 vs_as_0 and speed v vs_as_0 , and from the speed v vs_as_0 To terminal speed v e The distance S v_ve ; Then judge S vs_as_0 +S v_ve With S left Value comparison, if S vs_as_0 +S v_ve left , then the entire operation process becomes from v s ,a s To S vs_as_0 Then with v vs_as_0 Run at a constant speed for a period of time, and then start from v vs_as_0 to v e If S vs_as_0 +S v_ve ≥S left , then the entire operation process becomes from v s ,a s to v e ; then with v e Run at a constant speed for a period of time. If v e If it is 0, it will be at a lower speed. Completed; it takes 7.56s with the same parameters as the median binary search method, which is 0.29s slower than the median binary search method.

[0126] 2. Single-cycle planning.

[0127] The T-shaped Acc / Dec algorithm includes two speed processing modes: overall planning and single interpolation cycle processing. At present, there is limited research on the speed processing within a single interpolation cycle of the S-shaped Acc / Dec algorithm. The present invention adopts the circular arc interpolation method to set the acceleration value within an interpolation cycle to j m 、-j m and 0. Therefore, the motion speed can be processed under three conditions. The advantage of speed planning in a single cycle is its small computational complexity and real-time responsiveness. In addition, by simply modifying and solving the known parameters, the motion parameters of the subsequent interpolation cycle can be obtained. The calculation process of the S-shaped Acc / Dec in a single interpolation cycle is as follows Figure 4 shown.

[0128] The input parameters during the interpolation cycle include: a s ,v e ,v r ,S​left ,a m ,j m ,T,. Initially, determine the overall motion category: calculate v s to v e The distance S vs_ve , according to S vs_ve The relationship between the distance and the remaining distance determines the movement. Then different calculations are performed in each interpolation cycle.

[0129] 2.1, S vs_ve >S left

[0130] when Since the terminal speed cannot be reached, the process enters the pure acceleration or pure deceleration process. First, the jerk is solved according to formula (1): j m 、-j m and the corresponding acceleration a when 0 ie , speed v ie , distance S ie . Then solve the corresponding a for the three cases ie The distance S to when the acceleration is zero aie_0。 Finally, S ie +S aie_0 and the remaining distance S left The remaining distance can be judged in the following seven cases:

[0131] (i) All three cases satisfy the residual distance, i.e. S ie +S aie_0 left :

[0132] According to formula (1), the initial velocity is calculated as v ie When a ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time.

[0133] (ii) Any two of the three conditions satisfy the remaining distance:

[0134] From formula (1), we can calculate the two conditions that meet the conditions when the initial velocity is v ie Time ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie ​, acceleration a ie , distance S ie This is the parameter obtained this time.

[0135] (iii) Only one of the three cases satisfies the remaining distance:

[0136] From formula (1), we can calculate a case where the initial velocity is v ie Time ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie This is the parameter obtained this time.

[0137] (iv) If none of the conditions are met, it means that none of the three situations can meet the operation requirements of an interpolation cycle, and special processing is required: the speed v of the previous interpolation cycle is ie and acceleration a ie Make a ie The positive direction is 0, which means the acceleration a of the entire motion process ais_0 , speed a aie_0 , distance S aie_0 , and S aie_0 Less than the current remaining distance means that in a ie When it is 0, this segment has not ended yet, and there is still a little distance. aie_0 Just run at a constant speed, and then take out the relevant parameters after an interpolation cycle, such as Figure 5 As shown in the schematic diagram of less than one interpolation cycle, it only appears once in the processing of a line segment.

[0138] 2.2, S vs_ve ≤S left

[0139] If S vs_ve ≤S left , then the motion process can reach the terminal velocity. First, according to equation (1), solve j m The velocity v in the three cases of positive, negative and 0 respectively ie , acceleration a ie , distance S ie Then, according to formula (2), we solve the v corresponding to the three cases respectively. ie to v e The distance S vie_ve Finally, according to the three cases of S ie The corresponding S vie_ve The sum of the remaining distance S leftThere are seven situations for judging the remaining distance, all of which require verification:

[0140] (a) All three cases satisfy the remaining distance:

[0141] From formula (1), we can calculate the three cases when the initial velocity is v ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie This is the parameter obtained this time.

[0142] (b) Any two of the three conditions satisfy the remaining distance:

[0143] From formula (1), we can calculate the two conditions that meet the conditions when the initial velocity is v ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie This is the parameter obtained this time.

[0144] (c) Only one of the three situations satisfies the remaining distance:

[0145] From formula (1), we can calculate a case where the initial velocity is v ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie This is the parameter obtained this time.

[0146] (d) If none of the conditions are met, it means that none of the three situations can meet the operation requirements of an interpolation cycle, and special processing is required: the speed v of the previous interpolation cycle is ie and acceleration a ie To terminal speed v e According to formula (1), the acceleration a of the entire motion process is solved vie_ve , speed v vie_ve , distance S vie_ve , and S vie_ve If the remaining distance is less than the current one, it means the speed reaches v e , this section is not over yet, there is still a little distance to go. eRun at a constant speed. If v e If it is 0, it will be at a lower speed. Complete. Then take out the relevant parameters after an interpolation cycle. It only appears once in a line segment processing. The relevant parameters include: initial speed, acceleration; terminal speed, acceleration; maximum acceleration, jerk and interpolation cycle, remaining time.

[0147] 3. Speed ​​planning algorithm for S-type acceleration and deceleration combination combined with filtering method.

[0148] Since the acceleration value of the average filtering method is too large, the present invention introduces an S-shaped Acc / Dec filtering method based on a T-shaped filtering model to solve this problem and make the speed-time curve smoother.

[0149] 3.1, average filtering (speed constraint of filtering process).

[0150] In speed planning, four common speed constraints are identified: speed constraints caused by chord height errors v c , forward-looking speed constraint v per , desired speed constraint v r and the centripetal velocity constraint v n The present invention proposes and verifies the filtering speed constraint v for the first time. filter The concept of filtered velocity constraint v filter like Figure 6 The schematic diagram of filter speed clamping when the number of filters is 2n is as follows: Figure 7 The schematic diagram of filter speed clamping when the filtering order is 2n-1 is shown below.

[0151] The filtering direction is from point C to point B and then to point A. When the number of filtering times is 2n, when starting from point C and reaching point B, the number of filtering times on the horizontal axis is times, and the number of remaining filters on the ordinate is times, then do Figure 6 When the number of filtering steps is 2n-1, when the user starts from point C and reaches point B, the number of filtering steps of the horizontal axis is times, and the number of remaining filters on the ordinate is times, then do Figure 7 deal with.

[0152] like Figure 6 As shown, when N = 2n, len = vT, Where len is the running distance, len' is the distance after filtering, and the geometric relationship in the figure shows ε is the maximum allowable error of the filter, and then v can be obtained filter ; The expression is:

[0153]

[0154] like Figure 7 As shown, when N = 2n-1, According to the geometric relationship in the figure Then we can find v filter ; The expression is:

[0155]

[0156] 3.2, Filtering based on T-type Acc / Dec model.

[0157] In the traditional S-shaped acceleration and deceleration method, in order to ensure that the acceleration becomes zero at the end of each line segment, there is a disadvantage of too much time reduction. To avoid this disadvantage, this work performs a filtering processing method based on the T-shaped acceleration and deceleration model after obtaining the T-shaped acceleration and deceleration curve to achieve S-shaped acceleration and deceleration of the overall speed curve. The filtering processing method based on the T-shaped acceleration and deceleration model, such as Figure 8 As shown. Among them, the number of filtering times N and the maximum acceleration a m , maximum jerk j m , the interpolation period T satisfies the following relationship:

[0158]

[0159] The interpolation information such as the coordinates of the first and last points, speed, acceleration, and distance obtained above are passed to the filtering module. Let the coordinates of the first and last points of the nth interpolation information be p ns (x ns ,y ns ) and p ne (x ne ,y ne ), initial and final speed v ns ,v ne , interpolation period T, acceleration a nvse =(v ne -v ns ) / T, the distance between the first and last point coordinates is expressed as:

[0160]

[0161] The T-shaped acceleration and deceleration distance is:

[0162]

[0163] To avoid the theoretical running distance len nv The actual running distance len np Not equal, such as Fig. 9 The interpolation cycle running distance correction coefficient solution diagram is shown in the figure. Adding an interpolation cycle running distance correction coefficient is:

[0164]

[0165] Assume that the i-th filtering process of any interpolation information n, i∈[1,N]: Let the initial speed of filtering at this time be v nis , terminal velocity v nie =v nis +a nves t,t=T / N, the distance traveled according to the T-shaped acceleration and deceleration model is:

[0166]

[0167] Then the distance used for the final real filtering is s nip , the solution is:

[0168] s nip =v ni +p pro (12

[0169] The nth segment, Δx corresponding to the i-th filtering ni ,Δy ni The change is:

[0170]

[0171] Then the changes of Δx and Δy in any filtering are:

[0172]

[0173] After filtering, the curve profiles of velocity, acceleration and jerk are further optimized.

[0174] It can be seen from the above embodiments that the S-shaped acceleration and deceleration of the present invention realizes a gradual change in acceleration, which can reduce the problem of excessive acceleration encountered in the operation of machinery and equipment, causing vibration of equipment with weak rigidity, and so on, thereby ensuring the processing quality of some processing equipment. It has great application and demand in numerical control equipment and various motion devices.

[0175] The present invention conducts a comprehensive and detailed discussion on the analytical solution and filtering process of S-shaped Acc / Dec. On the basis of the analytical solution, the overall planning of S-shaped Acc / Dec is explained, and a simple algorithm for solving polynomial equations is proposed. At the same time, the present invention innovatively proposes a method for solving S-shaped Acc / Dec for a single interpolation cycle. Considering that the acceleration in average filtering often exceeds the theoretical limit value, an S-shaped Acc / Dec filtering method based on a T-shaped filtering model is proposed to reduce the fluctuation of acceleration. Through simulation verification, the S-shaped Acc / Dec method proposed in the present invention is compared and analyzed, and their advantages and disadvantages are discussed. The present invention has important theoretical and practical value in guiding the selection and application of the S-shaped Acc / Dec method in the numerical control system.

[0176] Although the S-shaped acceleration and deceleration algorithm has been around for decades, according to existing literature, there is no clear solution or mathematical formula for various practical problems. At the same time, there is almost no research on the operation of a single interpolation cycle. At the same time, the present invention also implements a filtering process based on a trapezoidal acceleration and deceleration algorithm model to address the situation where the jerk caused by the average filtering to achieve the S-shaped acceleration is large and cannot meet the clamping requirements. Through data comparison, a better jerk performance is obtained, which can basically meet the clamping requirements.

[0177] Embodiment 3, the present invention provides an acceleration and deceleration speed planning and improved filtering processing system based on a single interpolation cycle, comprising:

[0178] S-shaped Acc / Dec module is used to measure the distance S from the initial speed to the terminal speed during operation. vs_ve , the distance S from the initial speed to the desired speed vs_vr , the operation from the desired speed to the terminal speed S vr_ve The motion state is classified based on the relationship between the speed and the remaining distance, and the classified running state is processed by a simplified processing method to make the speed of the classified running state smooth and uniform;

[0179] The solution module, based on the simplified classified running state, uses the S-shaped Acc / Dec solution method of a single interpolation cycle to modify and solve the speed of the running states under different conditions in a single cycle to obtain the motion parameters of the interpolation cycle;

[0180] The filtering module uses the T-shaped acceleration and deceleration method to obtain the motion parameters of each interpolation cycle, and performs filtering processing based on the T-shaped acceleration and deceleration algorithm on the obtained motion parameters to obtain filtered motion parameters, so as to reduce the maximum value of the acceleration and reduce the fluctuation of the acceleration.

[0181] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0182] To further illustrate the effects of the embodiments of the present invention, the following simulation experiment is performed.

[0183] The present invention adopts overall planning, single cycle planning, average filtering and filtering based on T-type Acc / Dec model to realize the S-shaped Acc / Dec control process of two typical curves. The velocity, acceleration and jerk are obtained and compared and analyzed. In the velocity planning simulation, the tool moves in the counterclockwise direction. The simulation parameters are shown in Table 2.

[0184] Table 2 Simulation graphics parameter conditions

[0185]

[0186]

[0187] (1) Square curve.

[0188] First, the "square" figure is processed in the counterclockwise direction. The specific simulation parameters are shown in Table 2.

[0189] The simulation results of the square curve are as follows Fig.10 As shown in Figure 1. The motion trajectory of the S-shaped Acc / Dec in a single cycle is described, as well as its local magnification. Since the running time at the end of each segment may be insufficient to complete a full interpolation cycle, a small portion from the beginning of the next segment is required to complete an interpolation cycle. The interpolation image will show the segment line connected to the end of the next segment. Fig.11 The filtering trajectory of the S-type Acc / Dec based on the T-type Acc / Dec model. The local enlarged image shows that there is an obvious arc transition at the corner, which enhances the smoothness of the square curve contour.

[0190] The speed diagram of the square curve during processing is as follows Fig.12 , the acceleration diagram of the square curve during the processing is as follows Fig.13 The acceleration of the square curve during processing is as follows: Fig.14 As shown. Total running time t, time to reach the desired speed t vr , the maximum acceleration and maximum jerk during the motion are a max and j max .Depend on Figure 12-14 From Table 3, we can see that Figure 12-14As shown, in terms of time, the two filtering methods are 0.478s faster than the method that implements S-shaped acceleration and deceleration within a single interpolation cycle, and the overall planning method is 0.1s faster than the method that implements S-shaped acceleration and deceleration within a single interpolation cycle. In terms of speed, the speed curves of the two filtering methods are almost the same, and both reduce speed fluctuations at corners. The speed curve of the overall planning is smoother than the method that implements S-shaped acceleration and deceleration within a single interpolation cycle. The latter has a slight jitter between 99.99655mm / s and 100.00435mm / s after reaching the desired speed. In terms of acceleration, all four methods exceed the maximum acceleration limit of 1000mm / s 2 Among them, the average filtering method has a large acceleration fluctuation, while the other three methods all achieve a gradual acceleration change rather than a sudden change. In terms of acceleration, the maximum jitter values ​​of the average filtering and the filtering based on the T-shaped acceleration model both exceed the limit value of 10000mm / s 3 The maximum value of the T-shaped acc / dec model is 19780mm / s 3 , which is usually about twice the maximum allowed value given. The maximum value of the average filter method is 19928 mm / s 3 , slightly larger than the method used in the present invention, and this value will be larger under some different motion parameters. The methods without filtering all achieved S-shaped changes in acceleration, and none of them exceeded the limit value of 10000mm / s 3 .

[0191] Table 3 “Square” simulation data

[0192]

[0193] (2) Pentagram curve.

[0194] like Fig.15 The simulation of the five-pointed star curve depicts the motion trajectory of the S-shaped Acc / Dec in a single cycle, as well as its partial enlargement. Similarly, due to insufficient running time at the end of each segment, a full interpolation cycle may be completed, and a small portion of the next segment is used to complete the interpolation cycle. The interpolated image will show a polyline at the end of each segment connected to the next segment. Fig.16 The filtering trajectory of the S-shaped Acc / Dec based on the T-shaped Acc / Dec model in the simulation of the five-pointed star curve. From the local enlarged image, it can be seen that there is an obvious arc transition at the corner, indicating that filtering can effectively improve the smoothness of the five-pointed star curve contour.

[0195] in, Fig.15The trajectory diagram and partial enlargement diagram of S-shaped acceleration and deceleration in a single cycle. Since the running time at the end of each segment may be less than one interpolation cycle, it is necessary to take a small part at the beginning of the next segment to make up one interpolation cycle. The interpolation image will appear at the end of each segment with a discount connecting to the next segment. Fig.16 The filtering trajectory diagram of S-shaped acceleration and deceleration is realized based on the filtering processing method of the T-shaped acceleration and deceleration model. From the local enlarged image, it can be seen that there is an obvious arc transition at the corner to improve the smoothness of the curve corner contour.

[0196] The speed of the square curve during processing is as follows Fig.17 , the acceleration of the square curve during processing is as follows Fig.18 The acceleration of the square curve during processing is as follows: Fig.19 As shown. Total running time t, time to reach the desired speed t vr , the maximum acceleration and maximum jerk during the motion are a max and j max .Depend on Figure 17-Figure 19 From Table 4, we can see that Figure 17-Figure 19 As shown, in terms of time, the running time of the method that realizes S-shaped acceleration and deceleration within a single interpolation cycle of the two filtering methods is 1.276s faster, and the overall planning method is 0.235s faster than the method that realizes S-shaped acceleration and deceleration within a single interpolation cycle. In terms of speed, the speed curves of the two filtering methods are almost the same, and both reduce speed fluctuations at corners. The speed curve of the overall planning is smoother than that of the method that realizes S-shaped acceleration and deceleration within a single interpolation cycle. The latter has a slight jitter between 99.9953mm / s and 100.00488mm / s after reaching the desired speed. In terms of acceleration, all four methods exceed the maximum acceleration limit of 1000mm / s 2 Among them, the average filtering method has a large acceleration fluctuation, while the other three methods all achieve S-shaped changes in acceleration. In terms of acceleration, the maximum jitter values ​​of the average filtering and the filtering based on the T-shaped acceleration model both exceed the limit value of 10000mm / s 3 The maximum value of the T-shaped acc / dec model is 29972mm / s 3 , which is usually about twice the maximum allowed value given. The maximum value of the average filter method is 37928 mm / s 3 , which is greater than the method used in the present invention. Under some different motion parameters, this value will be larger. The methods without filtering all achieved S-shaped changes in acceleration, and none of them exceeded the limit value of 10000mm / s 3 .

[0197] Table 4 “Five-pointed star” simulation data

[0198]

[0199] In summary, the present invention comprehensively outlines the process of realizing S-shaped Acc / Dec control by analytical solution and filtering processing through two methods. In terms of analytical solution, the classification process flow of the overall planning of S-shaped Acc / Dec is systematically analyzed. A simplified method is proposed to solve the problem of highly univariate equations. The present invention adopts the method of circular arc interpolation and proposes an algorithm to realize S-shaped Acc / Dec within one interpolation cycle. In addition, the present invention also innovatively proposes an Acc / Dec filtering method based on the T-shaped model to realize S-shaped control. The following effects can be obtained:

[0200] (1) The S-shaped Acc / Dec planning method implemented by analytical solution has good velocity smoothness and uniformity. In addition, the time point of solution is more accurate. This method is suitable for acceleration control systems with high solution accuracy.

[0201] (2) The advantages of the S-shaped Acc / Dec control method based on the analytical solution within a single interpolation cycle are its simple processing and fast acceleration response. However, the long running time makes it suitable for acceleration control systems that do not require high accuracy in the solution.

[0202] (3) The S-shaped Acc / Dec is realized by averaging filtering, which significantly improves the speed fluctuation at the turning point and can quickly reach the desired speed. The S-shaped Acc / Dec filtering method based on the T-shaped filtering model can meet the operational requirements of the S-shaped Acc / Dec control and effectively suppress the strong fluctuation of the acceleration.

[0203] The above description is only a preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. Any modifications, equivalent substitutions and improvements made by any technician familiar with the technical field within the technical scope disclosed by the present invention and within the spirit and principles of the present invention should be covered within the protection scope of the present invention.

Claims

1. A single-cycle S-shaped speed planning and improved filtering processing method, characterized in that: The method includes: S1, during the operation, the distance S from the initial speed to the terminal speed vs_ve , the distance S from the initial speed to the desired speed vs_vr , the operation from the desired speed to the terminal speed S vr_ve The motion state is classified based on the relationship between the speed and the remaining distance, and the classified running state is processed by a simplified processing method to make the speed of the classified running state smooth and uniform; S2, based on the classified running state after simplified processing, using the S-shaped Acc / Dec solution method of a single interpolation cycle, the speed of the running state under different conditions is modified and solved in a single cycle to obtain the motion parameters of the interpolation cycle; S3, using the T-shaped acceleration and deceleration method to obtain the motion parameters of each interpolation cycle, and filtering the obtained motion parameters based on the T-shaped acceleration and deceleration algorithm to obtain filtered motion parameters, so as to reduce the maximum value of the acceleration and reduce the fluctuation of the acceleration.

2. The single-cycle S-shaped speed planning and improved filtering processing method according to claim 1 is characterized in that: In step S1, the simplified processing method includes: Solve for a s The distance S to 0 vs_as_0 and speed v vs_as_0 , and from the speed v vs_as_0 To terminal speed v e The distance S vs_ve ; Among them, a s is the initial acceleration; Perform S vs_as_0 +S v_ve With S left Value comparison, where S left is the remaining distance; If S vs_as_0 +S v_ve left , then the entire operation process becomes from v s ,a s To S vs_as_0 ; Then with v vs_as_0 Run at a constant speed, then from v vs_as_0 to v e ; where v s is the initial velocity;​ If S vs_as_0 +S v_ve ≥S left , then the entire operation process becomes from v s ,a s to v e ; Then with v e Running at a constant speed, if v e is 0, then the speed Completed; among them, j m is the maximum acceleration.

3. The single-cycle S-shaped speed planning and improved filtering processing method according to claim 2 is characterized in that: In step S2, the S-shaped Acc / Dec solution method for a single interpolation cycle includes: (I)S vs_ve >S left Solve, when S vs_ve >S left , unable to reach the terminal speed, entering the pure acceleration or pure deceleration process, the jerk J is solved according to formula (1): s_half j m, -j m , the corresponding acceleration at 0 is a ie , the speed is v ie , the distance is S ie ; Then solve the acceleration a corresponding to the three cases ie The distance S to when the acceleration is zero aie_0 ; Finally, S ie +S aie_0 and the remaining distance S left Make comparisons; Formula (1) is expressed as: Where, t is time, unit is s; v s ,v e are the initial velocity and terminal velocity respectively, v r is the expected speed, in mm / s; a s ,a e are the initial acceleration and terminal acceleration respectively, j m is the maximum acceleration, in mm / s 3 ; S is the distance, unit is mm; (II)S vs_ve ≤S left Solution: If S vs_ve ≤S left , then the motion process reaches the terminal velocity; first, according to formula (1), solve j m The velocity v is positive, negative and 0 respectively. ie , acceleration a ie , distance S ie According to formula (2), we can solve the v corresponding to the three cases respectively. ie to v e The distance S vie_ve , according to the three cases of S ie The corresponding S vie_ve The sum of the remaining distance S left Compare; the judgment of the remaining distance is divided into seven cases, and the judgment verification is performed; Formula (2) is expressed as: In the formula, v half is the speed at the midpoint, a half is the midpoint acceleration, t s_half is the time from the initial point to the midpoint, t half_e The time from the midpoint to the end point.

4. The single-cycle S-shaped speed planning and improved filtering processing method according to claim 3 is characterized in that: In step (II), the remaining distance is determined in seven cases, including: (i) All three cases satisfy the residual distance, i.e. S ie +S aie_0 left ;​ According to formula (1), the initial velocity is calculated as v ie When a ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time; (ii) Any two of the three conditions satisfy the remaining distance: The two conditions that meet the conditions are calculated by formula (1) respectively when the initial velocity is v ie Time ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time; (iii) Only one of the three cases satisfies the remaining distance: From equation (1), we can calculate a situation that satisfies the condition. When the initial velocity is v ie Time ie The velocity v when the positive direction is 0 ie_ve , select v ie_ve With v e The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time; (iv) If none of the conditions are met, it means that none of the three situations can meet the operation requirements of an interpolation cycle, and the following processing is required: the speed v of the previous interpolation cycle is ie and acceleration a ie Make a ie The positive direction is 0, which means the acceleration a of the entire motion process ais_0 , speed v aie_0 , distance S aie_0 , and S aie_0 Less than the current remaining distance in a ie When it is 0, the segment is not over yet and the remaining distance is expressed in v aie_0 Run at a constant speed and take out the parameters after an interpolation cycle, which include: initial speed, acceleration; terminal speed, acceleration; maximum acceleration, jerk, interpolation cycle, and remaining time.

5. The single-cycle S-shaped speed planning and improved filtering processing method according to claim 4 is characterized in that: In step (II), the remaining distance is determined in seven cases and a discrimination check is performed, including: (a) All three cases satisfy the remaining distance: The three cases are calculated by formula (1) when the initial velocity is v ie The terminal velocity v ie_vie , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time; (b) Any two of the three conditions satisfy the remaining distance: The two conditions that meet the conditions are calculated by formula (1) respectively when the initial velocity is v ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time; (c) Only one of the three situations satisfies the remaining distance: From formula (1), we can calculate a situation where the initial velocity is v. ie The terminal velocity v ie_ve , select v ie_ve With v r The set of speeds v with the smallest difference ie , acceleration a ie , distance S ie are the parameters obtained this time; (d) If none of the conditions are met, these three situations cannot meet the operation requirements of an interpolation cycle. The speed v of the previous interpolation cycle ie and acceleration a ie To terminal speed v e According to formula (1), we can solve the acceleration a of the whole motion process. vie_ve , speed v vie_ve , distance S vie_ve , and S vie_ve The remaining distance is less than the current speed v e , this segment is not over yet, and the remaining distance is v e Running at a constant speed, if v e is 0, then the speed Completed, retrieve the parameters after one interpolation cycle runs.

6. The single-cycle S-shaped speed planning and improved filtering processing method according to claim 1 is characterized in that: In step S3, the obtained motion parameters are filtered based on a T-shaped acceleration and deceleration algorithm, including: S301, average filtering, in speed planning, the speed constraints are determined, including the speed constraints v caused by the chord height error c , forward-looking speed constraint v per , desired speed constraint v r and the centripetal velocity constraint v n and the filter speed constraint v filter ; Determine the filter speed constraint v filter Including: When the number of filters is 2n, len = vT, Among them, len is the running distance, len' is the distance after filtering, and the geometric relationship is obtained ε is the maximum allowable error of the filter, and v filter ; The expression is: When the number of filters is N = 2n-1, len = vT, By geometric relationship Then find v filter ; The expression is: S302, after obtaining the T-shaped acceleration / deceleration curve, a filtering process based on the T-shaped acceleration / deceleration model is performed to complete the S-shaped acceleration / deceleration of the overall speed curve.

7. The single-cycle S-shaped speed planning and improved filtering processing method according to claim 6 is characterized in that: In step S302, the filtering processing method based on the T-shaped acceleration and deceleration model includes: Filtering times N and maximum acceleration a m , maximum jerk j m , the interpolation period T satisfies the following relationship: The coordinates of the first and last points, velocity, acceleration, and distance interpolation information obtained above are passed to the filtering module. Let the coordinates of the first and last points of the nth interpolation information be p ns (x ns ,y ns ) and p ne (x ne ,y ne ), initial and final speed v ns ,v ne , interpolation period T, acceleration a nvse =(v ne -v ns ) / T, the distance between the first and last point coordinates is expressed as: Then the T-shaped acceleration and deceleration distance of the interpolation cycle is: To avoid the theoretical running distance len nv The actual running distance len np If they are not equal, adding an interpolation cycle, the running distance correction coefficient is: The i-th filtering process of any interpolation information n, i∈[1,N], assumes that the initial speed of filtering at this time is v nis , terminal velocity v nie =v nis +a nves t,t=T / N, the distance traveled according to the T-shaped acceleration and deceleration model is: Then the distance used for the final real filtering is s nip , the solution is: s nip =v ni +p pro (12) The nth segment, Δx corresponding to the i-th filtering ni ,Δy ni The change is: Then the changes of Δx and Δy in any filtering are: After filtering, the curve profiles of velocity, acceleration and jerk are optimized.

8. A single-cycle S-shaped speed planning and improved filtering processing system, characterized in that: The system implements the single-cycle S-shaped speed planning and improved filtering processing method according to any one of claims 1 to 9, and the system comprises: S-shaped Acc / Dec module is used to measure the distance S from the initial speed to the terminal speed during operation. vs_ve , the distance S from the initial speed to the desired speed vs_vr , the operation from the desired speed to the terminal speed S vr_ve The motion state is classified based on the relationship between the speed and the remaining distance, and the classified running state is processed by a simplified processing method to make the speed of the classified running state smooth and uniform; The solution module, based on the simplified classified running state, uses the S-shaped Acc / Dec solution method of a single interpolation cycle to modify and solve the speed of the running states under different conditions in a single cycle to obtain the motion parameters of the interpolation cycle; The filtering module uses the T-shaped acceleration and deceleration method to obtain the motion parameters of each interpolation cycle, and performs filtering processing based on the T-shaped acceleration and deceleration algorithm on the obtained motion parameters to obtain filtered motion parameters, so as to reduce the maximum value of the acceleration and reduce the fluctuation of the acceleration.