Mechanical arm trajectory planning method, system and equipment based on improved particle swarm optimization and storage medium
By improving particle swarm algorithm and combining tent chaos mapping, simulated annealing algorithm and other technologies, the problems of local optimal solutions and low efficiency in traditional robot trajectory planning are solved, and efficient utilization of industrial robot joints and fast and accurate weld detection are achieved. Finish.
Patent Information
- Application Number
- CN202410953203.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-16
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2044-07-16
AI Technical Summary
Traditional robot trajectory planning optimization algorithms are prone to falling into local optimal solutions and have low search efficiency, resulting in inefficient use of joint resources in complex tasks.
The improved particle swarm algorithm is adopted, combined with tent chaos mapping, simulated annealing algorithm, adaptive inertial weights and learning rate, and is used for the motion trajectory planning of the robotic arm. The trajectory is optimized through the 3-5-3 interpolation function to improve joint utilization efficiency.
It significantly improves the utilization efficiency of the overall joints of industrial robots, realizes the optimal time-based robotic arm trajectory planning, improves the efficiency and accuracy of weld detection, and provides support for precision manufacturing in the aerospace field.
Smart Images

Figure CN119017372A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the field of industrial robots and relates to a robot arm trajectory planning method, system, equipment and storage medium based on an improved particle swarm algorithm. Background Art
[0002] Industrial robots play an important role in modern industrial production. With the slowdown of population growth and the decrease of working-age population, the increase of labor costs, the importance of industrial robots has become more prominent. However, most traditional robot trajectory planning optimization algorithms are prone to local optimal solutions and low search efficiency in the process of searching for the optimal solution. Summary of the invention
[0003] The purpose of the present invention is to overcome the shortcomings of the above-mentioned prior art and provide a robot arm trajectory planning method, system, device and storage medium based on an improved particle swarm algorithm, which significantly improves the utilization efficiency of the overall joints of the industrial robot and realizes a time-optimal-oriented robot arm trajectory planning optimization solution.
[0004] In order to achieve the above object, the present invention adopts the following technical solutions:
[0005] A robot arm trajectory planning method based on improved particle swarm algorithm includes the following processes:
[0006] S1, establish robot kinematic model;
[0007] S2, introduces tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm, and uses the improved particle swarm algorithm to solve the running time in the motion trajectory planning of the robot arm based on the robot kinematic model;
[0008] S3, uses the 3-5-3 interpolation function to plan the trajectory of the robot joint space, and brings the optimal value solved by the improved particle swarm algorithm into the 3-5-3 interpolation function to obtain the optimal trajectory of the robotic arm.
[0009] Preferably, the process of S1 is:
[0010] S11, modeling the robot body;
[0011] S12, using the improved DH method to model the robot arm posture;
[0012] S13. Establish a robot kinematic model based on the robot arm posture model.
[0013] Furthermore, the process S12 is as follows: a coordinate system is established for the connecting rods between each joint, and the coordinates of multiple serial connecting rods are transformed using a homogeneous transformation matrix.
[0014] Preferably, the process of solving the time parameters in the motion trajectory planning of the robot arm using the improved particle swarm algorithm is:
[0015] S21, determining three curves between the robot arm working starting point, target point and two interpolation points in the weld inspection task;
[0016] S22, initializing the improved particle algorithm parameters, including standard particle swarm parameters, search space upper limit parameter Ub, lower limit parameter Lb of tent chaotic mapping, start temperature Tstar, end temperature Tend, and current temperature Tcur of simulated annealing algorithm;
[0017] S23. Use tent chaotic mapping to initialize the population position and randomly initialize the vector of each particle.
[0018] S24, traverse each particle, solve the interpolation function of the angular joint in the three-segment curve according to the current particle position, and determine whether the angular joint velocity and angular acceleration meet the constraints according to the physical limitations of the robot;
[0019] S25. If the constraint condition is not met, the point is abandoned; if the constraint condition is met, the current particle fitness is calculated, and if the fitness is less than the particle extreme value, the particle extreme value position and fitness are updated;
[0020] S26, if the fitness is greater than the particle extreme value, then executing the simulated annealing optimization step to determine whether to accept the particle position;
[0021] S27, updating the global optimal value;
[0022] S28, update the particle velocity and next position using adaptive inertia weight and learning rate;
[0023] S29, repeatedly execute S25 to S28, and determine whether the end condition is met, and exit if it is met; obtain the running time of the robot arm joints in the three motion trajectories respectively.
[0024] Further, the specific process of S23 is: use the tent chaotic mapping population to initialize and determine the chaos parameter α; according to the particle population boundary, determine the initial particle generation formula as X=Lb+rand(N,D)*(Ub-Lb), where N is the number of initialized populations, D is the particle dimension, Ub is the particle search upper bound, and Lb is the particle search lower bound. According to the particle generation formula, the tent initialization population general solution is obtained: Where x(n) = x(t) / Lb, x(t) is the position where the last particle was initialized.
[0025] Furthermore, the calculation formula of S28 is:
[0026]
[0027] Where ω is the inertia weight, k is the current iteration number, k max is the maximum number of iterations, c1 and c2 are the individual learning rate and group learning rate respectively.
[0028] Preferably, in S3, the joint time with the longest running time in the three trajectories is selected as the input value of the polynomial interpolation, and the 3-5-3 interpolation trajectory planning is used in the robot joint space to obtain the complete running trajectory of the robot arm.
[0029] A robot arm trajectory planning system based on improved particle swarm algorithm, including:
[0030] Kinematic model building module, used to build the robot kinematic model;
[0031] The runtime solving module is used to bring tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm. Based on the robot kinematic model, the improved particle swarm algorithm is used to solve the runtime in the motion trajectory planning of the robot arm.
[0032] The optimal trajectory acquisition module is used to plan the trajectory of the robot joint space using the 3-5-3 interpolation function, and the optimal value solved by the improved particle swarm algorithm is brought into the 3-5-3 interpolation function to obtain the optimal trajectory of the robotic arm.
[0033] A computer device comprises a memory, a processor and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the steps of the robot arm trajectory planning method based on the improved particle swarm algorithm are implemented.
[0034] A computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of the robot arm trajectory planning method based on the improved particle swarm algorithm are implemented.
[0035] Compared with the prior art, the present invention has the following beneficial effects:
[0036] The present invention improves the standard particle swarm algorithm, introduces the probabilistic jump property in the simulated annealing algorithm to avoid falling into the local optimal solution during the algorithm search process; uses tent chaos mapping to initialize the particle population, makes the initialization particles more evenly distributed, and uses adaptive inertia weights and learning rates to make the algorithm search more efficient and converge faster. The utilization efficiency of the overall joints of the industrial robot is significantly improved, and a time-optimal-oriented robot arm trajectory planning optimization scheme is realized. This not only enhances the motion performance of the robot arm, but also greatly improves the efficiency and accuracy of aerospace workpiece weld detection. Through the application of the present invention, industrial robots can use joint resources more efficiently when performing complex tasks, thereby ensuring the rapid and accurate completion of weld detection, providing strong support for precision manufacturing and quality control in the aerospace field. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 The six joint modeling diagram of the KUKAKR50R2500 type mechanical arm of the present invention;
[0038] Figure 2 It is the flow chart of the improved particle swarm algorithm of the present invention;
[0039] Figure 3 This is an experimental comparison diagram of the improved particle swarm algorithm of the present invention and the standard particle swarm algorithm at the first mechanical arm joint;
[0040] Figure 4 This is an experimental comparison diagram of the improved particle swarm algorithm of the present invention and the standard particle swarm algorithm in the second mechanical arm joint;
[0041] Figure 5 It is an experimental comparison diagram of the improved particle swarm algorithm of the present invention and the standard particle swarm algorithm on the third mechanical arm joint;
[0042] Figure 6 It is an experimental comparison diagram of the improved particle swarm algorithm of the present invention and the standard particle swarm algorithm on the fourth robot arm joint;
[0043] Figure 7 It is an experimental comparison diagram of the improved particle swarm algorithm of the present invention and the standard particle swarm algorithm on the fifth robot arm joint;
[0044] Figure 8 It is an experimental comparison diagram of the improved particle swarm algorithm of the present invention and the standard particle swarm algorithm on the sixth robot arm joint;
[0045] Fig. 9 This is a diagram of the interpolation application of the improved particle swarm algorithm of the present invention in the joint space of the robot trajectory. DETAILED DESCRIPTION
[0046] The technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments; based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.
[0047] It should be noted that the words "front", "rear", "left", "right", "up" and "down" used in the following description refer to directions in the drawings, and the words "inside" and "outside" refer to directions toward or away from the geometric center of a specific component, respectively.
[0048] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as those generally understood by those skilled in the art of the present invention. The terms used herein in the specification of the present invention are only for the purpose of describing specific embodiments and are not intended to limit the present invention. The term "and / or" used herein includes any and all combinations of one or more related listed items.
[0049] Definitions of abbreviations involved in this embodiment:
[0050] PSO: Standard Particle Swarm Optimization, an algorithm for seeking the optimal solution proposed by James Kennedy and Russell Eberhart inspired by the regularity of bird flock foraging behavior.
[0051] The robot arm trajectory planning method based on the improved particle swarm algorithm described in the present invention comprises the following process:
[0052] S1, such as Figure 1 As shown, kinematic modeling of industrial robots is performed;
[0053] This step considers that the traditional six-axis robot pose modeling is to establish a coordinate system on each joint and realize the conversion of multiple joint coordinates through homogeneous coordinate transformation. This method requires six parameters to uniquely represent the robot pose. The improved DH method establishes a coordinate system for each link and uses the homogeneous transformation matrix to realize the coordinate conversion of multiple serial links.
[0054] S11. Use Matlab's robotics toolbox to model the industrial robot.
[0055] S12. Use the improved DH method to model the posture of the six-axis robot arm and establish an improved DH table. In the posture modeling of this sub-step, the homogeneous transformation matrix is used to realize the coordinate transformation of multiple series connecting rods.
[0056]
[0057] S13. Establish a robot kinematic model based on the six-axis robot arm posture model.
[0058] S2, such as Figure 2 As shown in the figure, the improved particle swarm algorithm is used to complete the motion trajectory planning optimization of the robot arm.
[0059] This step is specifically as follows: S21, determining the angles and three-segment curves of the six joints of the robot arm's working starting point, target point and two interpolation points in the weld detection task.
[0060] Waypoints Joint 1 Joint 2 Joint 3 Joint 4 Joint 5 Joint 6 Waypoint 1 0 0 0 0 0 0 Waypoint 2 -0.277 0.8168 -1.0053 0.1309 0.2513 0.231 Waypoint 3 0.143 0.5628 0.6283 0.0157 0.0566 0.1257 Waypoint 4 -1.1347 1.0053 -1.4451 0.0785 0.4398 1.1385
[0061] S22. Determine the particle population size m, particle dimension D, and number of iterations K_max; this example uses the particle population size m=30, particle dimension D=3, and number of iterations N=100; as well as the start temperature Tstar, end temperature Tend, and current temperature Tcur of the simulated annealing algorithm.
[0062] S23. Use the tent chaotic map to initialize the population position and initialize randomly, determine the chaos parameter α, which is selected as 0.5 in this example; according to the particle population boundary, determine the initial particle generation formula as X=Lb+rand(N,D)*(Ub-Lb). Among them, N is the number of initialized populations, and D is the particle dimension. Ub is the upper bound of particle search, which is 4 in this example, and Lb is the lower bound of particle search, which is 0 in this article. According to the particle generation formula, the general solution of the tent initialized population is obtained: Where x(n) = x(t) / Lb, x(t) is the position where the last particle was initialized.
[0063] S24, traverse the current particle and determine whether the current particle satisfies the angle constraint and the angular velocity constraint; if the constraint is not satisfied, the solution is discarded; if the constraint is satisfied, the learning rate is updated.
[0064] S25, using adaptive inertia weight and learning rate to update particle velocity and next position, where
[0065]
[0066] Where ω is the inertia weight, k is the current iteration number, k max is the maximum number of iterations, c1 and c2 are the individual learning rate and group learning rate respectively.
[0067] S26, calculate the current particle fitness x, if x is less than the current particle extreme value, then accept the solution and modify the particle extreme value; if x is greater than the current particle extreme value, do not immediately abandon the solution, but calculate the probability p according to the probability jump characteristic of the simulated annealing algorithm, Where ΔP is the difference between the current particle fitness and the current particle extreme value. If the probability p is greater than the random number r, the solution is accepted; if the probability p is less than the random number r, the solution is abandoned;
[0068] S27. Update the global optimal value.
[0069] S28, loop through S23 to S27 until the exit condition is met (the number of loops meets the set requirement).
[0070] S29, execute the algorithm to obtain the running time of the six joints of the robot arm in the three trajectories, and the maximum running time in the three trajectories. Figures 3 to 8 The experiment of the proposed UPSO algorithm and the standard particle swarm algorithm on the six joints of the robot arm is shown. The experiment shows that the trajectory running time of the six joints of the UPSO algorithm is improved and the convergence times are also optimized.
[0071] S3, use 3-5-3 interpolation to plan the trajectory of the robot joint space, bring the optimal value solved by the improved particle swarm algorithm into the 3-5-3 interpolation function, and obtain the change of the joint angle of the robot during the movement, that is, the optimal trajectory of the robot, such as Fig. 9 shown.
[0072] Through S2, the motion time of the six joints of the robot arm in the three motion trajectories is obtained. The joint time with the longest running time in the three trajectories is selected as the input value of the polynomial interpolation. The 3-5-3 interpolation trajectory planning is used in the robot joint space to obtain the complete running trajectory of the robot arm.
[0073] The following are device embodiments of the present invention, which can be used to perform method embodiments of the present invention. For details not disclosed in the device embodiments, please refer to the method embodiments of the present invention.
[0074] In another embodiment of the present invention, a robotic arm trajectory planning system based on an improved particle swarm algorithm is provided. The robotic arm trajectory planning system based on the improved particle swarm algorithm can be used to implement the above-mentioned robotic arm trajectory planning method based on the improved particle swarm algorithm. Specifically, the robotic arm trajectory planning system based on the improved particle swarm algorithm includes a kinematic model establishment module, a runtime solution module, and an optimal trajectory acquisition module.
[0075] Among them, the kinematic model building module is used to build the robot kinematic model.
[0076] The runtime solving module is used to bring tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm. Based on the robot kinematic model, the improved particle swarm algorithm is used to solve the runtime in the motion trajectory planning of the robot arm.
[0077] The optimal trajectory acquisition module is used to plan the trajectory of the robot joint space using the 3-5-3 interpolation function. The optimal value solved by the improved particle swarm algorithm is brought into the 3-5-3 interpolation function to obtain the optimal trajectory of the robotic arm.
[0078] In another embodiment of the present invention, a terminal device is provided, the terminal device includes a processor and a memory, the memory is used to store a computer program, the computer program includes program instructions, and the processor is used to execute the program instructions stored in the computer storage medium. The processor may be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field-programmable gate arrays (FPGAs), or other processors. GateArray, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc., which are the computing core and control core of the terminal, which are suitable for implementing one or more instructions, and are specifically suitable for loading and executing one or more instructions to implement corresponding method processes or corresponding functions; the processor described in the embodiment of the present invention can be used for the operation of a robot arm trajectory planning method based on an improved particle swarm algorithm, including: S1, establishing a robot kinematic model; S2, bringing tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm, based on the robot kinematic model, using the improved particle swarm algorithm to solve the running time in the motion trajectory planning of the robot arm; S3, using a 3-5-3 interpolation function to plan the trajectory of the robot joint space, bringing the optimal value solved by the improved particle swarm algorithm into the 3-5-3 interpolation function, and obtaining the optimal trajectory of the robot arm.
[0079] In another embodiment, the present invention further provides a computer-readable storage medium (Memory), which is a memory device in a terminal device for storing programs and data. It is understandable that the computer-readable storage medium here can include both the built-in storage medium in the terminal device and the extended storage medium supported by the terminal device. The computer-readable storage medium provides a storage space, which stores the operating system of the terminal. In addition, one or more instructions suitable for being loaded and executed by the processor are also stored in the storage space, and these instructions can be one or more computer programs (including program codes). It should be noted that the computer-readable storage medium here can be a high-speed RAM memory or a non-volatile memory, such as at least one disk memory.
[0080] One or more instructions stored in a computer-readable storage medium can be loaded and executed by a processor to implement the corresponding steps of the robot arm trajectory planning method based on the improved particle swarm algorithm in the above embodiment; one or more instructions in the computer-readable storage medium are loaded by the processor and the following steps are executed: S1, establishing a robot kinematic model; S2, introducing tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm, and based on the robot kinematic model, using the improved particle swarm algorithm to solve the running time in the motion trajectory planning of the robot arm; S3, using the 3-5-3 interpolation function to plan the trajectory of the robot joint space, and bringing the optimal value solved by the improved particle swarm algorithm into the 3-5-3 interpolation function to obtain the optimal trajectory of the robot arm.
[0081] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0082] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0083] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0084] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0085] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device.
[0086] It should be understood that the above description is for illustration and not for limitation. Many embodiments and many applications beyond the examples provided will be apparent to those skilled in the art upon reading the above description. Therefore, the scope of the present teachings should not be determined with reference to the above description, but rather with reference to the foregoing claims and the full scope of equivalents to which such claims are entitled. For the purpose of comprehensiveness, all articles and references, including disclosures of patent applications and publications, are incorporated herein by reference. The omission of any aspect of the subject matter disclosed herein in the foregoing claims is not intended to be a waiver of such subject matter, nor should it be considered that the applicant has not considered such subject matter to be part of the disclosed inventive subject matter.
Claims
1. A robot arm trajectory planning method based on improved particle swarm algorithm, characterized in that: The following procedures are included: S1, establish robot kinematic model; S2, introduces tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm, and uses the improved particle swarm algorithm to solve the running time in the motion trajectory planning of the robot arm based on the robot kinematic model; S3, uses the 3-5-3 interpolation function to plan the trajectory of the robot joint space, and brings the optimal value solved by the improved particle swarm algorithm into the 3-5-3 interpolation function to obtain the optimal trajectory of the robotic arm.
2. The robot arm trajectory planning method based on improved particle swarm algorithm according to claim 1 is characterized in that: The process of S1 is: S11, modeling the robot body; S12, using the improved DH method to model the robot arm posture; S13. Establish a robot kinematic model based on the robot arm posture model.
3. The robot arm trajectory planning method based on improved particle swarm algorithm according to claim 2 is characterized in that: The process of S12 is: establishing a coordinate system for the connecting rod between each joint, and using a homogeneous transformation matrix to transform the coordinates of multiple serial connecting rods.
4. The robot arm trajectory planning method based on improved particle swarm algorithm according to claim 1 is characterized in that: The process of solving the time parameters in the motion trajectory planning of the robot arm using the improved particle swarm algorithm is as follows: S21, determining three curves between the robot arm working starting point, target point and two interpolation points in the weld inspection task; S22, initializing the improved particle algorithm parameters, including standard particle swarm parameters, search space upper limit parameter Ub, lower limit parameter Lb of tent chaotic mapping, start temperature Tstar, end temperature Tend, and current temperature Tcur of simulated annealing algorithm; S23, use tent chaos mapping to initialize the population position and randomly initialize the vector of each particle; S24, traverse each particle, solve the interpolation function of the angular joint in the three-segment curve according to the current particle position, and determine whether the angular joint velocity and angular acceleration meet the constraints according to the physical limitations of the robot; S25. If the constraint condition is not met, the point is abandoned; if the constraint condition is met, the current particle fitness is calculated, and if the fitness is less than the particle extreme value, the particle extreme value position and fitness are updated; S26, if the fitness is greater than the particle extreme value, then executing the simulated annealing optimization step to determine whether to accept the particle position; S27, updating the global optimal value; S28, update the particle velocity and next position using adaptive inertia weight and learning rate; S29, repeatedly execute S25 to S28, and determine whether the end condition is met, and exit if it is met; obtain the running time of the robot arm joints in the three motion trajectories respectively.
5. The robot arm trajectory planning method based on improved particle swarm algorithm according to claim 4 is characterized in that: The specific process of S23 is as follows: use the tent chaotic mapping population to initialize and determine the chaotic parameter α; according to the particle population boundary, determine the initial particle generation formula as X=Lb+rand(N,D)*(Ub-Lb), where N is the number of initialized populations, D is the particle dimension, Ub is the particle search upper bound, and Lb is the particle search lower bound. According to the particle generation formula, the tent initialization population general solution is obtained: Where x(n) = x(t) / Lb, x(t) is the position where the last particle was initialized.
6. The robot arm trajectory planning method based on improved particle swarm algorithm according to claim 4 is characterized in that: The calculation formula of S28 is: Where ω is the inertia weight, k is the current iteration number, k max is the maximum number of iterations, c1 and c2 are the individual learning rate and group learning rate respectively.
7. The robot arm trajectory planning method based on improved particle swarm algorithm according to claim 1, characterized in that: In S3, the joint time with the longest running time in the three trajectories is selected as the input value of the polynomial interpolation, and the 3-5-3 interpolation trajectory planning is used in the robot joint space to obtain the complete running trajectory of the robot arm.
8. A robot arm trajectory planning system based on improved particle swarm algorithm, characterized in that: Include: Kinematic model building module, used to build the robot kinematic model; The runtime solving module is used to bring tent chaos mapping, simulated annealing algorithm, adaptive inertia weight and learning rate into the standard particle swarm algorithm. Based on the robot kinematic model, the improved particle swarm algorithm is used to solve the runtime in the motion trajectory planning of the robot arm. The optimal trajectory acquisition module is used to plan the trajectory of the robot joint space using the 3-5-3 interpolation function, and the optimal value solved by the improved particle swarm algorithm is brought into the 3-5-3 interpolation function to obtain the optimal trajectory of the robotic arm.
9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the robot arm trajectory planning method based on the improved particle swarm algorithm as described in any one of claims 1 to 7 are implemented.
10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the robot trajectory planning method based on the improved particle swarm algorithm as described in any one of claims 1 to 7 are implemented.
Citation Information
Patent Citations
Mechanical arm space trajectory optimization method for optimal time under multiple constraint conditions
CN108656117A
Industrial robot multi-target trajectory optimization method based on improved particle swarm optimization
CN115570565A
Mechanical arm time optimal trajectory planning method based on improved particle swarm optimization
CN117901115A
Cited By
Robot trajectory planning method and system based on improved particle swarm optimization
CN119897868A
