Next Article in Journal
Interval-Valued Pythagorean Fuzzy Similarity Measure-Based Complex Proportional Assessment Method for Waste-to-Energy Technology Selection
Next Article in Special Issue
Simulation and Analysis of the Working Process of Soil Covering and Compacting of Precision Seeding Units Based on the Coupling Model of DEM with MBD
Previous Article in Journal
Hybrid ELM and MARS-Based Prediction Model for Bearing Capacity of Shallow Foundation
Previous Article in Special Issue
Structural Analysis and Optimization of Heavy Vehicle Chassis Using Aluminium P100/6061 Al and Al GA 7-230 MMC
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Time-Jerk optimal Trajectory Planning of Industrial Robots Based on a Hybrid WOA-GA Algorithm

Automobile School, Zhejiang Institute of Communications, Hangzhou 311112, China
*
Author to whom correspondence should be addressed.
Submission received: 27 April 2022 / Revised: 12 May 2022 / Accepted: 18 May 2022 / Published: 19 May 2022
(This article belongs to the Special Issue Big Data in Manufacturing, Biology, Healthcare and Life Sciences)

Abstract

:
An optimal and smooth trajectory for industrial robots has a positive impact on reducing the execution time in an operation and the vibration in their joints. In this paper, a methodology for the time-optimal and jerk-continuous trajectory planning of industrial robots is proposed. The entire trajectory is interpolated in the joint space utilizing fifth-order B-splines and then optimized by a hybrid whale optimization algorithm and genetic algorithm (WOA-GA). Two objective functions, including the integral of the squared jerk along the entire trajectory and the total execution time, are minimized to obtain the optimal entire trajectory. A fifth-order B-spline interpolation technique enables the achievement of a jerk-continuous trajectory, while respecting the kinematic limits of jerk, acceleration and velocity. WOA-GA is utilized to solve the time-jerk optimal trajectory planning problem with nonlinear constraints. The proposed hybrid optimization algorithm yielded good results and achieved the time-jerk optimal trajectory better under kinematic constraints compared to the genetic algorithm, whale optimization algorithm, improved whale optimization algorithm with particle swarm optimization and adaptive cuckoo search algorithm. The numerical results show the competent performances of the proposed methodology to generate trajectories with high smooth curves and short total execution time.

1. Introduction

Due to their outstanding performance in accuracy, repeatability and efficiency, industrial robots have become one of the most important equipment to replace human resources in the machinery, automobile, electronics, metal, and other industries [1,2,3]. Generally speaking, an industrial robot is a nonlinear dynamic mechanism, which needs to follow a specific trajectory to avoid any possible collision. Therefore, trajectory planning is an essential technique in automated industrial activities using industrial robots. A reasonable trajectory can reduce the vibration and noise of robots and ensure a high trajectory tracking accuracy and motion stability of robots [4,5,6].
In the relevant literature, trajectories are mainly constructed by polynomial, spline, Bezier, NURBS and other interpolation functions. In order to obtain a smooth trajectory with jerk boundary, Jond et al. used polynomials of the orders 3, 4 and 5 to generate an acceleration-continuous trajectory, in which the acceleration values at the start and end motions are non-zero [7]. Sonja Macfarlane et al. employed a series of fifth-order polynomials to plan a smooth trajectory between two directional points [8]. Similarly, Bureerat et al. used quintic polynomials to connect the initial and intermediate points, to finally the end point [9]. Lin et al. proposed a method of a 7-segment acceleration profile motion model based on a time-optimal trajectory, which divided all waypoints into continuous batches, and each batch had two overlaps of waypoints [10]. Wu et al. proposed a novel point-to-point trajectory planning algorithm (PTPA) to improve the motion efficiency of industrial robots [11]. Moreover, spline functions have been used as trajectory primitives to ensure acceleration continuity or jerk continuity. Since each control point on the B-spline curve will only affect the parameters within a range of the curve, various B-splines were used to construct joint trajectory. For example, the minimum time trajectory is generated by cubic splines for the robotic manipulator [12,13,14]. Muhammad Zeeshan et al. interpolated the entire fifth-order trajectory with B-spline interpolation method to obtain the minimum time trajectory [15,16].
Trajectory optimization is a highly complicated problem due to the nonlinear characteristics of trajectories and the need of motion efficiency, smooth operation and low noise of industrial robots. Many studies take the minimum time [17,18,19,20,21], the minimum acceleration [9,16] and the minimum energy [22,23] as the trajectory planning optimization objectives. In addition, the hybrid optimization methods have become the focus of robot research in recent years. For example, Zhang et al. proposed a multi-objective optimization method for robot trajectory planning under obstacles, including time optimization and acceleration optimization. This method uses quintic B-splines to generate trajectory configurations in the joint space with motion constraints and obstacles constraints [24]. Wang et al. proposed a new algorithm to define the objective function from two aspects of time and speed [14]. Zhang et al. proposed an adaptive cuckoo search (ACS) algorithm to optimize the trajectory of quintic B-spline programming [25]. Ameer adopted an RNN based metaheuristic approach (RNN-MA) to achieve real-time implementation [26]. Cheng proposed beetle antennae search algorithm (BAS) to tackle the formulated optimization function [27]. Hybrid algorithms, such as an improved whale optimization algorithm with differential evolution algorithm or particle swarm optimization (IWOA-DE and IWOA-PSO), and new genetic algorithm and adaptive elite genetic algorithm (AEGA-SA) have been proposed to improve the exploration and exploitation capacities of the original algorithm [21,28,29]. Several optimization methods with their characteristics are shown in Table 1.
This paper proposes a time-optimal and jerk-continuous trajectory planning technique for industrial robots. This technique is based on fifth-order B-spline and hybrid WOA-GA. Fifth-order B-spline is utilized to interpolate the multi-point trajectory. The WOA-GA combining the advantage of GA and WOA is proposed to solve the time-jerk trajectory optimization problem with nonlinear constraints. The rest of this paper is organized as follows. Section 2 defines the problems of trajectory optimization. In Section 3, the fifth-order B-spline is chosen to interpolate the joint trajectory, and the hybrid WOA-GA is presented. In Section 4, we compare the simulation results from different optimization algorithms, and Section 5 is the conclusion.

2. Problem Formulation

Trajectory planning is mostly carried out in the joint space, which can ensure the stability of joint motion and avoid motion jump of the manipulator, while planning trajectories in the operation space. Thus, this paper focus on planning trajectories in the joint space.
We define the optimal planning problem similarly to Ref. [12]. Two objective functions, including the integral of the squared jerk along the whole trajectory and the total execution time, are minimized to obtain the optimal whole trajectory. These two terms have opposite effects. This implies that reducing the total execution time will lead to trajectories with large values of the kinematic quantities, while reducing the integral of the squared jerk along the whole trajectory will lead to a smoother trajectory with low efficiency. The trade-off between these two objectives can be achieved by legitimately adjusting the weights of the two objectives. Therefore, the optimization problem can be formulated as:
find : min w T N i = 1 N p 1 T i + w J j = 1 N 0 T f ( J j ( t ) ) 2 d t s u b j e c t t o : P j lower P j ( t ) P j upper , j = 1 , , N V j ( t ) V L j , j = 1 , , N A j ( t ) A L j , j = 1 , , N J j ( t ) J L j , j = 1 , , N .
The meaning of the symbols in Equation (1) is described in Table 2.

3. Proposed Method

3.1. Multiple B-Splines

Multiple B-spline curves are widely used in the trajectory planning algorithms of robots with good local support and continuous smoothness. A B-spline curve can be expressed mathematically as follows:
p ( u ) = i = 0 n d i N i , k ( u ) .
where p(u) is the joint position, di is the ith control points of the B-spline, k is the degree of the B-spline, Ni,k(u) is the ith basis function of the kth order B-spline, n is the total number of the control points and u is the normalized knot vector variable. Ni,k(u) can be obtained using the Cox–de Boor recursion formula.
N i , 0 ( u ) = 1 , if t i t < t i + 1 0 , others N j , k ( u ) = t t i t i + k t i N j , k 1 ( u ) + t i + k 1 t t i + k 1 t i + 1 N j + 1 , k 1 ( u ) d e f i n e 0 0 = 0 .
The trajectory of an industrial robot is discretized to some designed points on the time scale. Two virtual points are adopted at the second and the second–last positions of the designed point sequence, due to the consideration of zero jerk at the initial and final movements. Normalized knot vector u is generated from the sequence of t corresponding to the designed points [16].
u = [ u 0 , u 1 , , u n + 2 k ]
where
u 0 = u 1 = = u k = 0 u i = u i 1 + | h i k 1 | / j = 0 n 1 | h j | u n + k = u n + k + 1 = = u n + 2 k = 1 .
The lth order derivatives can be described as
p l ( u ) = j = i k + r i d j r N i , k r ( u ) ,
where
d j l = d j , l = 0 ( k + 1 l ) d j l 1 d j 1 l 1 u j + k + 1 l u j , l = 1 , 2 , , r ; j = i k + l , , i .

3.2. Whale Optimization Algorithm

Whale Optimization Algorithm (WOA) is a recently proposed population-based optimization algorithm inspired by the hunting behavior of humpback whales [30]. The WOA algorithm starts with a set of random solutions, including three kinds of hunting behaviors: encircling prey, exploration and exploitation. At each iteration, the location of individuals in the population is updated according to the most promising solution [31].

3.2.1. Encircling Prey

Since the prey in the search space is not known, the WOA assumes that the current best-so-far solution is the target prey. Then, the other individuals will try to update their positions towards the target prey. This behavior is represented by the following equations:
X ( g + 1 ) = X best ( g ) A C X best ( g ) X ( g ) .
where A and C are coefficient vectors, Xbest is the current best-so-far solution, X is an individual, g is the current iteration and | | denotes the absolute value.
The vectors A and C are calculated as follows.
A = ( 2 r 1 ) a
C = 2 r
where a is linearly decreased from 2 to 0 over the iterations and r is a random set in [0, 1].
The selection of this operator depends on the coefficient vector A and a random number Po, where Po is a random number in [0, 1]. For each individual, if Po < 0.5 and |A| < 1, the position is updated by encircling prey.

3.2.2. Bubble-Net Attacking Phase

If Po > 0.5, the bubble-net predation stage begins. The mathematical model of the search is as follows.
X ( g + 1 ) = X best ( g ) X ( g ) e b m cos ( 2 π m ) + X best ( g )
where b is a constant for defining the shape of the logarithmic spiral and m is a random number in [−1, 1].

3.2.3. Searching for Prey

If Po < 0.5 and |A| ≥ 1, the individuals need to expand their exploration areas. This phase uses a randomly generated set of solutions Xrand to update the individuals’ locations, which allow the WOA algorithm to perform a global search. The rules of the update solution are as follows.
X ( g + 1 ) = X rand ( g ) A C X rand ( g ) X ( g ) .

3.3. Genetic Algorithm

Genetic algorithm (GA) is a random global search and optimization method developed by imitating the biological evolution mechanism of nature [32]. It can automatically obtain and accumulate knowledge about the search space in the search process, and adaptively control the search process to obtain the best solution. Each individual in the population represents a possible solution to the optimization problem. The adaptation ability of individual is judged by the fitness function. The individuals with poor fitness are eliminated, and the individuals with good fitness can continue to reproduce. In the process of reproduction, it needs selection, crossover and variation to form a new population. Then, the better solution will finally be obtained.

3.4. Proposed Hybrid WOA-GA Algorithm

The flowchart of the proposed WOA-GA algorithm is shown in Figure 1, and detailed introductions are as follows:
  • Step 1: Define the initial parameters, such as Pop_quantity, MaxGen, Pc, Pm and Er. Then, an initial population is obtained randomly.
  • Step 2: Calculate the fitness value of each individual using Equation (1) and find Xglobal_best and Xlocal_best.
  • Step 3: Update the populations by WOA. If Po < 0.5 and |A| < 1, individuals are updated by encircling prey using Equations (9)–(11). If Po < 0.5 and |A| ≥ 1, individuals are updated by searching for prey using Equation (13). If Po > 0.5, individuals are updated by bubble-net attacking using Equation (12).
  • Step 4: Update the binary-encoded population by GA. Roulette wheel selection method, single-point crossover and bitwise mutation are utilized in the corresponding operators.
  • Step 5: Calculate the fitness value of each individual and update Xglobal_best and Xlocal_best.
  • Step 6: If t < MaxGen, then t = t + 1, update a, A, C, m, b and Po, and return to step 3. If t = MaxGen, then the best fitness and Xglobal_best are obtained.
Since finding a suitable constraint handling method for WOA-GA is out of the scope of this work, a constraint handling technique named static penalty is employed [33].

4. Results and Discussion

In order to verify the feasibility of the proposed method, the numerical simulations were tested by solving six unconstrainted optimization problems and a time-optimal trajectory planning problem using 5th-order B-splines. WOA-GA was programed in MATLAB R2018b, as well as WOA, GA, IWOA-PSO [29] and ACS [25], which were utilized for comparative analysis. The configurations of the personal computer were a Core i5-1035G1 CPU with 16 GB of RAM. The parameter configuration of each algorithm are presented in Table 3. All the algorithms were initialized with the same population for each run. For WOA-GA and GA, we utilized 14 bits to code each time interval. The best-so-far feasible solution in the population obtained at the end of generations was utilized to evaluate WOA-GA on effectiveness and stability. The mean (‘MEAN’) and standard deviations (‘STD’) of the best-so-far solutions are utilized as evaluation indices, formulated as follows:
MEAN = 1 N r i = 1 N r f i best
STD = 1 N r i = 1 N r ( f i best M E A N ) 2
where fibest is the best-so-far feasible solution obtained in the ith run and Nr is the number of runs. Note that the smaller the values of MEAN and STD, the more reliable and stable the solutions that the algorithm can provide [34].

4.1. Application 1: WOA-GA for Test Functions

The first six unconstrainted optimization problems are classical benchmark functions shown in Table 4. These functions include unimodal (F1F2), variable-dimension multimodal (F3F4) and fixed-dimension multimodal (F5F6) benchmarks. Table 4 shows the details of the test functions. Note that only one optimal solution exists in the unimodal functions to evaluate the convergence rate and exploitation capacity of the algorithm, and a global optimal solution with several local ones exist in the multimodal functions to evaluate the exploration capacity of the algorithm. For each test function, WOA-GA was performed 20 times as well as WOA, GA, IWOA-PSO and ACS. For all algorithm, the test population size and the maximum iteration were set to 30 and 500, respectively.
Table 5 reports the statistical results for the unimodal function and shows that WOA-GA can obtain the global optimal solution for F1 and F2. Table 6 reports the statistical results for the variable-dimension multimodal and fixed-dimension multimodal functions. WOA-GA can obtain the near-optimal solution for F3 and F4, and the global optimal solution for F5 and F6. Table 5 and Table 6 indicate that WOA-GA has advantages in global searching and can prevent falling into a local optimum, and demonstrate that WOA-GA is competitive with other algorithms. Hence, although the time consumption is high, the proposed WOA-GA can provide good exploration and exploitation capabilities.
Figure 2 shows the convergence curves from WOA-GA, WOA, GA, IWOA-PSO and ACS. WOA, IWOA-PSO and ACS have an advantage on the local space search and can converge rapidly, but they are easily to trap in a local optimum in low iterations. GA has the advantage on global space search, but it converges slowly and needs more generations to obtain the best fitness. In each iteration of WOA-GA, WOA follows several generations of GA. Thus, the global search capacity of WOA is enhanced by GA, and the local search ability of GA is improved by WOA. With the positive interaction between WOA and GA, the exploration and exploitation abilities of WOA-GA are improved. The proposed WOA-GA can converge rapidly and obtain the best fitness compared with WOA, GA, IWOA-PSO and ACS.

4.2. Application 2: WOA-GA for Time-Optimal Trajectory Planning Problem

A typical multi-point trajectory task for a 6-DOF industrial robot was employed [12]. The desired positions and kinematic constraints of test task are listed in Table 7 and Table 8, respectively. Since the order of magnitudes of the integral of the squared jerk is much greater than that of the total execution time, wT and wJ were set as 0.9999 and 0.0001 to achieve the trade-off between two objectives. For all algorithms, a test population size of 30 and the maximum iteration of 100 and 500 were utilized to solve this problem. WOA-GA was performed 10 times as well as WOA, GA, IWOA-PSO and ACS.
Table 9 shows the comparisons of the optimization results obtained using WOA-GA, WOA, GA, IWOA-PSO and ACS. WOA-GA is able to converge best in the test task, and the mean and standard deviations are also the smallest, which implies that WOA-GA has a good stability. Figure 3 shows the distributions of the best-so-far solutions from WOA-GA, WOA, GA, IWOA-PSO and ACS. Additionally, the percentage of performance rank in Table 9 indicates that WOA-GA mostly achieves a better performance than other benchmark algorithms.
The travelling time of the best solution from WOA-GA is 29.9930 s, where T1 = 0.0030 s, T2 = 10.8240 s, T3 = 8.9690 s, T4 = 10.1850 s and T5 = 0.0120 s. Figure 4, Figure 5, Figure 6 and Figure 7 illustrate the trajectory curves of the industrial robot and their derivatives, including jerk, acceleration and velocity. As shown in Figure 7, the jerk curves of all joints were continuous, which resulted in the smoothness of the optimized trajectories. Furthermore, the values of jerk, acceleration and velocity were zero at the start and end movement. The motion curves were all bound under the kinematic constraints all the time. Therefore, the proposed method is an effective time-jerk optimal trajectory planning tool for industrial robots.

5. Conclusions

In this article, we proposed a new methodology for time-optimal and jerk-continuous trajectory planning of industrial robots. Fifth-order B-spline was adopted to interpolate the multi-point trajectory in the joint space. The proposed WOA-GA combining the advantages of WOA and GA is utilized to solve the time-jerk optimal trajectory planning problem with nonlinear constraints. Simulations were carried out to verify the effectiveness of the proposed methodology. The comparison results of the best-so-far feasible solutions showed that WOA-GA provides the best results compared with WOA, GA, IWOA-PSO and ACS. Furthermore, the proposed WOA-GA algorithm has good stability. The optimized motion curves obtained by the proposed methodology were all bound under the kinematic constraints all the time. Therefore, these results demonstrate that the proposed methodology is an effective tool for industrial robots to generate time-jerk optimal trajectories.
Future work will be devoted to extending WOA-GA to optimize other trajectory models based on polynomial and NURBS. The effectiveness of the proposed technique may further be investigated by experiments.

Author Contributions

Conceptualization, F.W. and Z.W.; methodology, F.W. and Z.W.; writing—original draft preparation, F.W., Z.W. and T.B.; writing—review and editing, F.W., Z.W. and T.B.; supervision, T.B.; project administration, Z.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by [General Scientific Research Project of Education Department of Zhejiang Province] grant number [Y202147343] and [Research on Public Welfare Technology Application Projects of Zhejiang Province] grant number [GG19E050005].

Acknowledgments

The authors acknowledge the support and inspiration of the research on public welfare technology application projects of Zhejiang province and the general scientific research project of the education department of Zhejiang province.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Paryanto; Brossog, M.; Bornschleg, M.; Franke, J. Reducing the energy consumption of industrial robots in manufacturing systems. Int. J. Adv. Manuf. Technol. 2015, 78, 1315–1328. [Google Scholar] [CrossRef]
  2. Lin, W.Y.; Ren, X.Y.; Zhou, T.T.; Cheng, X.J.; Tong, M.S. A novel robust algorithm for position and orientation detection based on cascaded deep neural network. Neurocomputing 2018, 308, 138–146. [Google Scholar] [CrossRef]
  3. Yin, G.T.; Zhu, Z.H.; Gong, H.; Lu, Z.F.; Yong, H.S.; Liu, L.; He, W. Flexible punching system using industrial robots for automotive panels. Robot. Comput. Integr. Manuf. 2018, 52, 92–99. [Google Scholar] [CrossRef]
  4. Rubioa, F.; Llopis-Albert, C.; Valero, F.; Suñer, J.L. Industrial robot efficient trajectory generation without collision through the evolution of the optimal trajectory. Robot. Auton. Syst. 2016, 86, 106–112. [Google Scholar] [CrossRef] [Green Version]
  5. Ha, C.W.; Lee, D. Analysis of embedded prefilters in motion profiles. IEEE Trans. Ind. Electron. 2018, 65, 1481–1489. [Google Scholar] [CrossRef]
  6. Gasparetto, A.; Zanotto, V. A new method for smooth trajectory planning of robot manipulators. Mech. Mach. Theory 2007, 42, 455–471. [Google Scholar] [CrossRef]
  7. Jond, H.B.; Nabiyev, V.V.; Benveniste, R. Trajectory planning using high-order polynomials under acceleration constraint. J. Optim. Ind. Eng. 2017, 21, 1–6. [Google Scholar] [CrossRef]
  8. Macfarlane, S.; Croft, E.A. Jerk-Bounded Manipulator Trajectory Planning: Design for Real-Time Applications. IEEE Trans. Robot. Autom. 2003, 19, 42–52. [Google Scholar] [CrossRef] [Green Version]
  9. Bureerat, S.; Pholdee, N.; Radpukdee, T.; Jaroenapibal, P. Self-adaptive MRPBIL-DE for 6D robot multi-objective trajectory planning. Expert Syst. Appl. 2019, 136, 133–144. [Google Scholar] [CrossRef]
  10. Lin, J.; Somani, N.; Hu, B.; Rickert, M.; Knoll, A. An Efficient and Time-Optimal Trajectory Generation Approach for Waypoints under Kinematic Constraints and Error Bounds. In Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Madrid, Spain, 1–5 October 2018. [Google Scholar] [CrossRef] [Green Version]
  11. Wu, Z.; Chen, J.; Bao, T.; Wang, J.; Zhang, L.; Xu, F. A Novel Point-to-Point Trajectory Planning Algorithm for Industrial Robots Based on a Locally Asymmetrical Jerk Motion Profile. Processes 2022, 10, 728. [Google Scholar] [CrossRef]
  12. Gasparetto, A.; Zanotto, V. A technique for time-jerk optimal planning of robot trajectories. Robot. Comput. Integr. Manuf. 2008, 24, 415–426. [Google Scholar] [CrossRef]
  13. Chettibi, T.; Lehtihet, H.E.; Haddad, M.; Hanchi, S. Minimum cost trajectory planning for industrial robots. Eur. J. Mech. A Solids 2004, 23, 703–715. [Google Scholar] [CrossRef]
  14. Wang, T.; Xin, Z.; Miao, H.; Zhang, H.; Chen, Z.; Du, Y. Optimal Trajectory Planning of Grinding Robot Based on Improved Whale Optimization Algorithm. Math. Probl. Eng. 2020, 4, 3424313. [Google Scholar] [CrossRef]
  15. Zeeshan, M.; Xu, H. Jerk-Bounded Trajectory Planning of Industrial Manipulators. In Proceedings of the IEEE International Conference on Robotics and Biomimetics, Dali, China, 6–8 December 2019. [Google Scholar] [CrossRef]
  16. Huang, J.S.; Hu, P.F.; Wu, K.Y.; Zeng, M. Optimal time-jerk trajectory planning for industrial robots. Mech. Mach. Theory 2018, 121, 530–544. [Google Scholar] [CrossRef]
  17. Fang, Y.; Liu, W.; Shao, Q.; Qi, J.; Peng, Y.H. Smooth and time-optimal s-curve trajectory planning for automated robots and machines. Mech. Mach. Theory 2019, 137, 127–153. [Google Scholar] [CrossRef]
  18. Fang, Y.; Hu, J.; Qi, J.; Liu, W.H.; Wang, W.M.; Peng, Y.H. Planning trigonometric frequency central pattern generator trajectory for cyclic tasks of robot manipulators. Arch. Proc. Inst. Mech. Eng. Part C J. Mech. Eng. Sci. 2019, 233, 4014–4031. [Google Scholar] [CrossRef]
  19. Rymansaib, Z.; Iravani, P.; Sahinkaya, M.N. Exponential trajectory generation for point to point motions. In Proceedings of the 2013 IEEE/ASME International Conference on Advanced Intelligent Mechatronics, Wollongong, Australia, 9–12 July 2013. [Google Scholar] [CrossRef]
  20. Boryga, M.; Graboś, A. Planning of manipulator motion trajectory with higher-degree polynomials use. Mech. Mach. Theory 2009, 44, 1400–1419. [Google Scholar] [CrossRef]
  21. Abu-Dakka, F.J.; Valero, F.J.; Suner, J.L.; Mata, V. A direct approach to solving trajectory planning problems using genetic algorithms with dynamics considerations in complex environments. Robotica 2015, 33, 669–683. [Google Scholar] [CrossRef] [Green Version]
  22. Bailón, W.P.; Cardiel, E.B.; Campos, I.J.; Paz, A.R. Mechanical energy optimization in trajectory planning for six DOF robot manipulators based on eighth-degree polynomial functions and a genetic algorithm. In Proceedings of the 2010 7th International Conference on Electrical Engineering Computing Science and Automatic Control, Tuxtla Gutierrez, Mexico, 8–10 September 2010. [Google Scholar] [CrossRef]
  23. Fung, R.F.; Cheng, Y.H. Trajectory planning based on minimum absolute input energy for an LCD glass-handling robot. Appl. Math. Model. 2014, 38, 2837–2847. [Google Scholar] [CrossRef]
  24. Zhang, X.; Shi, G. Multi-objective optimal trajectory planning for manipulators in the presence of obstacles. Robotica 2022, 40, 888–906. [Google Scholar] [CrossRef]
  25. Liu, Y.; Guo, C.; Weng, Y. Online time-optimal trajectory planning for robotic manipulators using adaptive elite genetic algorithm with singularity avoidance. IEEE Access 2019, 7, 146301–146308. [Google Scholar] [CrossRef]
  26. Zhang, L.; Wang, Y.; Zhao, X. Time-optimal trajectory planning of serial manipulator based on adaptive cuckoo search algorithm. J. Mech. Sci. Technol. 2021, 35, 3171–3181. [Google Scholar] [CrossRef]
  27. Zhao, J.; Zhu, X.; Song, T. Serial Manipulator Time-Jerk Optimal Trajectory Planning Based on Hybrid IWOA-PSO Algorithm. IEEE Access 2022, 10, 6592–6604. [Google Scholar] [CrossRef]
  28. Khan, A.H.; Li, S.; Chen, D.; Liao, L. Tracking control of redundant mobile manipulator: An RNN based metaheuristic approach. Neurocomputing 2020, 400, 272–284. [Google Scholar] [CrossRef]
  29. Cheng, Y.; Li, C.; Li, S.; Li, Z. Motion Planning of Redundant Manipulator with Variable Joint Velocity Limit Based on Beetle Antennae Search Algorithm. IEEE Access 2020, 8, 138788–138799. [Google Scholar] [CrossRef]
  30. Mirjalili, S.; Lewis, A. The whale optimization algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  31. Zhang, L.; Wang, J.; Chen, J.; Chen, K.; Lin, B.; Xu, F. Dynamic modeling for a 6-DOF robot manipulator based on a centrosymmetric static friction model and whale genetic optimization algorithm. Adv. Eng. Softw. 2019, 135, 102684. [Google Scholar] [CrossRef]
  32. Holland, J.H. Adaptation in Natural and Artificial Systems; MIT Press: London, UK, 1992. [Google Scholar]
  33. Coello, A.C. Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: A survey of the state of the art. Comput. Method. Appl. Mech. Eng. 2002, 191, 1245–1287. [Google Scholar] [CrossRef]
  34. Zhao, W.; Wang, L.; Mirjalili, S. Artificial hummingbird algorithm: A new bio-inspired optimizer with its engineering applications. Comput. Method. Appl. Mech. Eng. 2022, 388, 114194. [Google Scholar] [CrossRef]
Figure 1. Flowchart of the WOA-GA optimization algorithm.
Figure 1. Flowchart of the WOA-GA optimization algorithm.
Processes 10 01014 g001
Figure 2. Convergence curves from WOA-GA, WOA, GA, IWOA-PSO and ACS.
Figure 2. Convergence curves from WOA-GA, WOA, GA, IWOA-PSO and ACS.
Processes 10 01014 g002
Figure 3. Best-so-far feasible solution from WOA-GA, WOA, GA, IWOA-PSO and ACS.
Figure 3. Best-so-far feasible solution from WOA-GA, WOA, GA, IWOA-PSO and ACS.
Processes 10 01014 g003
Figure 4. Position curves of all joints by the proposed technique (Tf = 29.9930 s).
Figure 4. Position curves of all joints by the proposed technique (Tf = 29.9930 s).
Processes 10 01014 g004
Figure 5. Velocity curves of all joints by the proposed technique (Tf = 29.9930 s).
Figure 5. Velocity curves of all joints by the proposed technique (Tf = 29.9930 s).
Processes 10 01014 g005
Figure 6. Acceleration curves of all joints by the proposed technique (Tf = 29.9930 s).
Figure 6. Acceleration curves of all joints by the proposed technique (Tf = 29.9930 s).
Processes 10 01014 g006
Figure 7. Jerk curves of all joints by the proposed technique (Tf = 29.9930 s).
Figure 7. Jerk curves of all joints by the proposed technique (Tf = 29.9930 s).
Processes 10 01014 g007
Table 1. Several optimization methods with their characteristics.
Table 1. Several optimization methods with their characteristics.
NameCharacteristics
IWOA-DE [21]Good global optimization ability, strong robustness and slow convergence speed.
ACS [25]Faster convergence degree, higher accuracy and better global search ability, but the final accuracy needs to be improved.
RNN-MA [26]Fast convergence speed and suitable for real-time implementation.
BAS [27]Fast convergence speed with low searching precision and convergence speed, and sometimes it is prone to local optimum.
AEGA-SA [28]Superior to the original genetic algorithm in terms of trajectory smoothness and trajectory efficiency, but it is highly dependent on population size, and is prone to low convergence speed or fall into local optimum.
IWOA-PSO [29]Good global exploration ability and slow convergence speed.
Table 2. Meaning of the symbols in Equation (1).
Table 2. Meaning of the symbols in Equation (1).
SymbolMeaning
NNumber of robot joints
wTWeight of the term proportional to the execution time
NpNumber of via-points
TiTime interval between two via-points
Pj(t)Position of the jth joint
Vj(t)Velocity of the jth joint
Aj(t)Acceleration of the jth joint
Jj(t)Jerk of the jth joint
wJWeight of the term proportional to the jerk
TfTotal execution time of the trajectory
PjupperUpper-bound position of the jth joint
PjlowerLower-bound position of the jth joint
VLjVelocity limit for the jth joint (symmetrical)
ALjAcceleration limit for the jth joint (symmetrical)
JLjJerk limit for the jth joint (symmetrical)
Table 3. Parameter configuration of each algorithm.
Table 3. Parameter configuration of each algorithm.
AlgorithmParameter Configuration
WOA-GAPc = 0.85, Pm = 0.01, Er = 0.05
GAPc = 0.85, Pm = 0.01, Er = 0.05
IWOA-PSO [29]Pc = 0.85, k = 0.4, c1 = 2.0, c2 = 2.0
ACS [25]a = 0.7, b = 0.5, Pa = 0.25
Table 4. Details of the test functions.
Table 4. Details of the test functions.
FunctionDimRangeMin
F 1 ( x ) = i = 1 n x i 2 30[−100, 100]0
F 2 ( x ) = i = 1 n x i + i = 1 n x i 30[−10, 10]0
F 3 ( x ) = π n 10 sin π y 1 + i = 1 n y i 1 2 [ 1 + 10 sin 2 ( π y i + 1 ) + y n 1 2 ] + i = 1 n u x i , 10 , 100 , 4
y i = 1 + x i + 1 4 , u x i , a , k , m = k x i a m , x i > a 0 , a < x i < a k x i a m , x i < a
30[−50, 50]0
F 4 ( x ) = 0.1 sin 2 3 π x 1 + i = 1 n x i 1 2 [ 1 + sin 2 3 π x i + 1 ] + x n 1 2 [ 1 + sin 2 2 π x n ] + i = 1 n u x i , 5 , 100 , 4 30[0, π]0
F 5 ( x ) = 4 x 1 2 + 2.1 x 1 4 + 1 3 x 1 6 + x 1 x 2 4 x 2 2 + 4 x 2 4 2[−5, 5]−1.0316
F 6 ( x ) = [ 1 + x 1 + x 2 + 1 2 19 14 x 1 + 3 x 1 2 14 x 2 + 6 x 1 x 2 + 3 x 2 2 ]
× [ 30 + 2 x 1 3 x 2 2 18 32 x 1 + 12 x 1 2 + 48 x 2 36 x 1 x 2 + 27 x 2 2 ]
2[−2, 2]3
Table 5. Comparisons of the optimization results for the unimodal functions.
Table 5. Comparisons of the optimization results for the unimodal functions.
Function WOA-GAWOAGAIWOA-PSO [29]ACS [25]
F1BEST01.21 × 10−807.33542.83 × 10−2936.8232
WORST3.61 × 10−46.08 × 10−701.22 × 1037.1957 × 10−1771.4722
MEAN3.45 × 10−53.91 × 10−71434.71164.84 × 10−1852.3215
STD7.76 × 10−51.36 × 10−70395.98141.62 × 10−1711.4114
Time consumption60.32910.155635.00990.44670.8789
F2BEST08.11 × 10−593.10507.54 × 10−32214.1185
WORST0.00609.9 × 10−5116.53001.79 × 10−201.00 × 1010
MEAN3.00 × 10−43.36 × 10−526.49729.83 × 10−229.50 × 109
STD0.00132.16 × 10−513.36793.90 × 10−212.18 × 109
Time consumption60.89240.186836.16900.55201.0567
Table 6. Comparisons of the optimization results for the multimodal functions.
Table 6. Comparisons of the optimization results for the multimodal functions.
Function WOA-GAWOAGAIWOA-PSO [29]ACS [25]
F3BEST4.88 × 10−50.00751.29740.11392.7302
WORST1.72 × 10−40.05762.77 × 1060.70587.7002
MEAN1.14 × 10−40.02111.88 × 1050.27404.8696
STD3.39 × 10−50.01356.16 × 1060.15281.3589
Time consumption60.89240.186836.16900.55201.0567
F4BEST7.13 × 10−40.11610.58661.32461.00 × 1010
WORST0.01361.05801.07 × 1072.33901.00 × 1010
MEAN0.00470.53271.05 × 1061.84821.00 × 1010
STD0.00490.22212.95 × 1060.25690
Time consumption56.55460.735735.95642.44732.0157
F5BEST−1.0316−1.0316−1.0299−1.0316−1.0316
WORST−1.0316−1.0316−0.8077−1.0316−1.0316
MEAN−1.0316−1.0316−0.9549−1.0316−1.0316
STD2.22 × 10−162.83 × 10−90.07345.03 × 10−94.55 × 10−16
Time consumption20.69150.175118.06970.49820.6485
F6BEST33333
WORST33.002544.9507303
MEAN33.000120.677811.10413
STD05.34 × 10−414.292212.37033.12 × 10−15
Time consumption7.93000.06627.09140.16890.2644
Table 7. Desired positions of the test trajectory planning task.
Table 7. Desired positions of the test trajectory planning task.
Position No.Joint No. (°)
123456
1−10201515030120
2Virtual point
3605010010011060
420120−104090100
5Virtual point
6553530107025
Table 8. Kinematic constraints of the test trajectory planning task.
Table 8. Kinematic constraints of the test trajectory planning task.
Kinematic ConstraintsJoint No.
123456
Velocity (°/s)10095100150130110
Acceleration (°/s2)606075709080
Jerk (°/s3)606685707570
Table 9. Comparisons of the optimization results for the test trajectory planning task.
Table 9. Comparisons of the optimization results for the test trajectory planning task.
AlgorithmBESTWORSTMEANSTDRank 1stRank 2ndRank 3rdRank 4thRank 5th
WOA-GA39.977839.983739.98090.002080%20%///
WOA39.986542.603140.97220.8536//20%80%/
GA40.001841.656640.45760.5605//80%20%/
IWOA-PSO [29]41.008046.030943.17471.5323////100%
ACS [25]93.978039.995239.98610.006420%80%///
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, F.; Wu, Z.; Bao, T. Time-Jerk optimal Trajectory Planning of Industrial Robots Based on a Hybrid WOA-GA Algorithm. Processes 2022, 10, 1014. https://0-doi-org.brum.beds.ac.uk/10.3390/pr10051014

AMA Style

Wang F, Wu Z, Bao T. Time-Jerk optimal Trajectory Planning of Industrial Robots Based on a Hybrid WOA-GA Algorithm. Processes. 2022; 10(5):1014. https://0-doi-org.brum.beds.ac.uk/10.3390/pr10051014

Chicago/Turabian Style

Wang, Fang, Zhijun Wu, and Tingting Bao. 2022. "Time-Jerk optimal Trajectory Planning of Industrial Robots Based on a Hybrid WOA-GA Algorithm" Processes 10, no. 5: 1014. https://0-doi-org.brum.beds.ac.uk/10.3390/pr10051014

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop