# Solving the Time-Jerk Optimal Trajectory Planning Problem of a Robot Using Augmented Lagrange Constrained Particle Swarm Optimization

Authors: Shaotian Lu; Jingdong Zhao; Li Jiang; Hong Liu
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

The problem of minimum time-jerk trajectory planning for a robot is discussed in this paper. The optimal objective function is composed of two segments along the trajectory, which are the proportional to the total execution time and the proportional to the integral of the squared jerk (which denotes the derivative of the acceleration). The augmented Lagrange constrained particle swarm optimization (ALCPSO) algorithm, which combines the constrained particle swarm optimization (CPSO) with the augmented Lagrange multiplier (ALM) method, is proposed to optimize the objective function. In this algorithm, falling into a local best value can be avoided because a new particle swarm is generated per initial procedure, and the best value gained from the former generation is saved and delivered to the next generation during the iterative search procedure to enable the best value to be found more easily and more quickly. Finally, the proposed algorithm is tested on a planar 3-degree-of-freedom (DOF) robot; the simulation results show that the algorithm is effective, offering a solution to the time-jerk optimal trajectory planning problem of a robot under nonlinear constraints.


---

## Body

## 1. Introduction

Trajectory planning is the foundation of robot trajectory control. The aim of trajectory planning is to generate trajectory points and plan a smooth trajectory. Optimal trajectory planning has been a focus of robot research studies in recent years because its performance is important for the efficiency and motion stability of a robot. The major steps in optimal trajectory planning are as follows. First, several points along a given geometric path are given. Then, the inverse kinematic solutions of the given trajectory points are obtained. Next, interpolating functions are used to perform trajectory planning in the joint space. Finally, an optimal method is used to optimize the trajectory in order to make it smooth and continuous. Boundary condition constraints, such as those on the velocity, acceleration, jerk, and time, need to be considered in the optimization procedure.Reasonable trajectory planning can reduce vibration and ensure the long joint life and high path tracking accuracy of a robot. The minimum-time trajectory planning approach was first proposed in the literature to improve the efficiency of robots; the study of such planning has become an important field in trajectory optimization. The purpose of minimum-time trajectory planning is to plan the shortest execution time trajectory according to the given points while the boundary constraints are satisfied. Examples of minimum-time trajectory planning are provided in [1–5]. In fact, vibration may appear when a robot is in the moving process or when it is stopped, which will negatively impact the tracking accuracy of the robot; therefore, minimum vibration is an important performance index, and many researchers have studied how to utilize minimum-jerk trajectory planning to reduce vibration [6–8]. The minimum-time and minimum-jerk trajectory planning studies are often considered together to improve the efficiency and smoothness of the trajectory and reduce the vibration of a robot; the combination of these two methods is referred to as time-jerk optimal trajectory planning. Examples of such trajectory planning are provided in [9–13].In the many aforementioned optimal trajectory planning studies, the main research procedure can be summarized as follows. First, the optimal objective function is transformed into a mathematic expression. Second, relational optimization methods are adopted to optimize the mathematic expression. Finally, the optimal results are compared, and a conclusion is reached considering the requirements. Currently, the major interpolated functions used in joint space include cubic splines and fifth-order B-splines, and the major optimal methods include genetic algorithms, PSO, and the sequential quadratic programming (SQP) strategies. The current literature regarding time-jerk optimal trajectory planning suffers from two problems. First, few studies have been performed on this topic, and further in-depth study is required. Second, because optimal trajectory planning is an optimization problem with constraints, the penalty function method is typically used when considering these issues. In the penalty function method, in certain cases, the nonlinear constrained problem can only converge to the optimal solution when the penalty factor becomes infinitely large (according to the exterior penalty function method) or infinitely small (according to the interior penalty function method). Moreover, a large number of tests need to be performed to determine a reasonable initial penalty factor. Therefore, although some optimal algorithms adopted in the prior literature have been improved, it is difficult to achieve a balance in terms of the quality and efficiency of the optimal solution because of the condition restrictions.This paper proposes a new approach for time-jerk optimal trajectory planning in order to increase the efficiency and reduce the vibration of the robot. The new approach, named augmented Lagrange constrained particle swarm optimization (ALCPSO), combines the constriction factor method from the basic PSO algorithm with the ALM. In contrast to previous research, a new particle swarm is generated for each initial procedure of the PSO; this process can avoid falling into the local best value, and the best value of the prior generation is saved and delivered to the next generation during the iterative search for procedure to allow the best value to be found more easily and quickly. This approach enables the best value to be obtained even for finite penalty factors. The new approach does not require an accurate dynamic model or a continuously differentiable objective function; thus, it has stronger robustness.The remainder of this paper is organized as follows. The minimum time-jerk trajectory planning problem is described in Section2. Application of the technique based on the CPSO and ALM methods to solve the nonlinear constrained optimization problem is described in Section 3. Section 4 presents the simulation results of the ALCPSO algorithm. Section 5 presents the conclusions of this study.


## 2. The Minimum Time-Jerk Trajectory Planning Problem

The optimal trajectory planning premise of this paper is that the geometric path has been given. Thus, the joint space position points corresponding to the discrete operative space (Cartesian space) can be obtained according to inverse kinematics; subsequently, the joint trajectory of the robot can also be obtained via the polynomial or the cubic splines method by connecting the relevant position points. The use of cubic splines in trajectory planning is ordinary because the generated trajectories have continuous acceleration values. In addition, in contrast to higher-order polynomials, the cubic splines can overcome excessive oscillations and overshoot problems between any pair of reference points. In this paper, we implement the joint trajectory planning by utilizing the cubic splines described in [10, 11, 14]. The trajectory planning performance depends largely on the objective function. The objective function [9] is defined as follows:(1)minfh=KTN∑i=1n-1hi+αKJ∑i=1N∑i-1n-1Q¨j,i+1-Q¨j,i2his.t.max⁡Q˙j,iti,Q˙j,iti∗,Q˙j,iti+1-Vjm≤0max⁡Q¨j,1t1,Q¨j,2t2,…,Q¨j,ntn-Ajm≤0max⁡Q¨j,iti+1-Q¨j,itihi-Jjm≤0∑i=1n-1hi-Tm≤0j=1,…,N∀i=1,…,n-1.In (1), KT+KJ=1, through adjusting the values of KT and KJ to allow the total execution time and jerk effect to reach the optimum. Because the total execution time and the proportional to the integral of the squared jerk may have a large difference in quantity grade, the elastic coefficient is introduced to balance the effects of them. The meanings of the symbols in (1) are presented in the Symbols.Therefore, the optimal trajectory planning problem under constraints can be solved by using (1) to search for the optimum solution of time interval hi.


## 3. Solving the Nonlinear Constrained Optimization Problem

References [15–17] presented the PSO algorithm, which is a theory that explains the origins of the performance of individuals for bird flocks or fish schools about their collective behavior. The ALM method has numerous advantages, such as its numerical stability and calculated efficiency surpassing the penalty function.


### 3.1. Constrained Particle Swarm Optimization

In [18, 19], the constriction factor χ of PSO was introduced to ensure the convergence of the PSO as follows:(2)χ=22-φ-φ2-4φ.The particle velocity and position of the PSO are updated as follows:(3)vjik+1=χvjik+c1r1pjik-xjik+c2r2gj-xjik,xjik+1=xjik+vjik+11≤i≤n∀1≤j≤Nd,max.In (2), researchers commonly define φ=c1+c2 and set c1=c2=2.05; thus, φ becomes 4.1 and χ=0.729. In (3), k denotes the number of iterations; c1 and c2 are nonnegative values named acceleration factors; r1 and r2 are two random values distributed in the range 0,1; pjik describes the individual best position; gj describes the global best position. Now, the PSO can be referred to as the constrained particle swarm optimization (CPSO) algorithm, which can realize an effective balance between the global search and the local search.


### 3.2. Augmented Lagrange Multiplier (ALM) Method

The ALM method is similar to the Lagrange multiplier method; however, in contrast to the latter, the former does not require many tests to determine a reasonable initial penalty factor, and the dynamic penalty factor does not tend to infinity; that is, the former surpasses the latter in terms of numerical stability and computational efficiency [20–22]. For general inequality constraints, the optimization model can be described as(4)minfXs.t.gjX≤0j=1,…,m.Its ALM method can be defined as follows:(5)LX,λ,r=fX+∑j=1mλjφj+rjφj2,where X=x1,…,xn denotes the independent variable, fX denotes the objective function, gj(X)≤0j=1,…,m denotes the inequality constraints, λj denotes the Lagrange multiplier, and rj denotes the penalty factor. φj is described as follows:(6)φj=max⁡gjx,-λj2rjj=1,…,m.The solution of the original constrained problem (4) can be obtained by solving (5). The Lagrange multiplier iterative formula is expressed as(7)λjv+1=λjv+2rjφj,where ν denotes the number of times that the Lagrange multiplier is updated. The penalty factor updated formula is expressed as follows:(8)riv+1=2rjvgjXv>gjXv-1∧gjXv>εgrjv2gjXv≤εgrjvelse,where εg denotes the constraint error accuracy.Whenν=1, the termination criterions are as follows:(9)c=max⁡max0,gjXv≤ε;j=1,…,m∀i=1,…,vmax.Whenν=2,…,vmax, the termination criterions are defined as follows: (10)fXv-fXv-1∧c≤ε,where ε denotes the convergence accuracy and vmax denotes the update maximal times.The ALM method can guarantee that the optimal solution can be found when the penalty factor does not reach infinity, which cannot be guaranteed by either the interior or the exterior penalty function method.


### 3.3. Augmented Lagrange Constrained Particle Swarm Optimization (ALCPSO) Algorithm

Because the CPSO and ALM enjoy their respective advantages, in this paper, we propose an algorithm named ALCPSO algorithm which combines the CPSO with the ALM in order to make use of their respective advantages to provide a new approach for solving nonlinear constrained optimization problems. Time-jerk optimal trajectory planning is such a problem. The ALCPSO algorithm comprises the following steps.[ALCPSO1]. Set vmax, kmax, Nd,max, ε, εg, λj0, rj0, n,k=0, and v=1. Transform the constrained problem (4) into the unconstrained problem (5).[ALCPSO2]. Initialize Nd,max particles with randomly chosen positions and velocities and evaluate the corresponding fitness values at each position.[ALCPSO3]. Check the termination criterions (9). If they are satisfied, the algorithm terminates with the best value x∗=xswarmbest; if they are not satisfied, the obtained best value x∗ is saved. Initialize Nd,max particles with randomly chosen positions and velocities and set k=1.[ALCPSO4]. Utilize the obtained best value of former generation to replace one group of particles.[ALCPSO5]. Apply (3) to update the particles, evaluate the corresponding fitness values at each position, and find the best pkg-best.[ALCPSO6]. Check the updated number of times of the Lagrange multiplier/penalty factor. If it is satisfied, check the termination criterions (10); if the termination criterions (10) are satisfied, the best value x∗=xswarmbest is obtained; if they are not satisfied, update the Lagrange multipliers and the penalty factors according to (7) and (8) and set v=v+1. If the updated number of times of the Lagrange multiplier/penalty factor is not satisfied, proceed with step [ALCPSO5].In this algorithm, a new particle swarm is freshly generated in each initial procedure to avoid falling into the local best value, and the best value can be found more easily and quickly because the best value of the prior generation is saved and delivered to the next generation during the iterative search for procedure.


## 3.1. Constrained Particle Swarm Optimization

In [18, 19], the constriction factor χ of PSO was introduced to ensure the convergence of the PSO as follows:(2)χ=22-φ-φ2-4φ.The particle velocity and position of the PSO are updated as follows:(3)vjik+1=χvjik+c1r1pjik-xjik+c2r2gj-xjik,xjik+1=xjik+vjik+11≤i≤n∀1≤j≤Nd,max.In (2), researchers commonly define φ=c1+c2 and set c1=c2=2.05; thus, φ becomes 4.1 and χ=0.729. In (3), k denotes the number of iterations; c1 and c2 are nonnegative values named acceleration factors; r1 and r2 are two random values distributed in the range 0,1; pjik describes the individual best position; gj describes the global best position. Now, the PSO can be referred to as the constrained particle swarm optimization (CPSO) algorithm, which can realize an effective balance between the global search and the local search.


## 3.2. Augmented Lagrange Multiplier (ALM) Method

The ALM method is similar to the Lagrange multiplier method; however, in contrast to the latter, the former does not require many tests to determine a reasonable initial penalty factor, and the dynamic penalty factor does not tend to infinity; that is, the former surpasses the latter in terms of numerical stability and computational efficiency [20–22]. For general inequality constraints, the optimization model can be described as(4)minfXs.t.gjX≤0j=1,…,m.Its ALM method can be defined as follows:(5)LX,λ,r=fX+∑j=1mλjφj+rjφj2,where X=x1,…,xn denotes the independent variable, fX denotes the objective function, gj(X)≤0j=1,…,m denotes the inequality constraints, λj denotes the Lagrange multiplier, and rj denotes the penalty factor. φj is described as follows:(6)φj=max⁡gjx,-λj2rjj=1,…,m.The solution of the original constrained problem (4) can be obtained by solving (5). The Lagrange multiplier iterative formula is expressed as(7)λjv+1=λjv+2rjφj,where ν denotes the number of times that the Lagrange multiplier is updated. The penalty factor updated formula is expressed as follows:(8)riv+1=2rjvgjXv>gjXv-1∧gjXv>εgrjv2gjXv≤εgrjvelse,where εg denotes the constraint error accuracy.Whenν=1, the termination criterions are as follows:(9)c=max⁡max0,gjXv≤ε;j=1,…,m∀i=1,…,vmax.Whenν=2,…,vmax, the termination criterions are defined as follows: (10)fXv-fXv-1∧c≤ε,where ε denotes the convergence accuracy and vmax denotes the update maximal times.The ALM method can guarantee that the optimal solution can be found when the penalty factor does not reach infinity, which cannot be guaranteed by either the interior or the exterior penalty function method.


## 3.3. Augmented Lagrange Constrained Particle Swarm Optimization (ALCPSO) Algorithm

Because the CPSO and ALM enjoy their respective advantages, in this paper, we propose an algorithm named ALCPSO algorithm which combines the CPSO with the ALM in order to make use of their respective advantages to provide a new approach for solving nonlinear constrained optimization problems. Time-jerk optimal trajectory planning is such a problem. The ALCPSO algorithm comprises the following steps.[ALCPSO1]. Set vmax, kmax, Nd,max, ε, εg, λj0, rj0, n,k=0, and v=1. Transform the constrained problem (4) into the unconstrained problem (5).[ALCPSO2]. Initialize Nd,max particles with randomly chosen positions and velocities and evaluate the corresponding fitness values at each position.[ALCPSO3]. Check the termination criterions (9). If they are satisfied, the algorithm terminates with the best value x∗=xswarmbest; if they are not satisfied, the obtained best value x∗ is saved. Initialize Nd,max particles with randomly chosen positions and velocities and set k=1.[ALCPSO4]. Utilize the obtained best value of former generation to replace one group of particles.[ALCPSO5]. Apply (3) to update the particles, evaluate the corresponding fitness values at each position, and find the best pkg-best.[ALCPSO6]. Check the updated number of times of the Lagrange multiplier/penalty factor. If it is satisfied, check the termination criterions (10); if the termination criterions (10) are satisfied, the best value x∗=xswarmbest is obtained; if they are not satisfied, update the Lagrange multipliers and the penalty factors according to (7) and (8) and set v=v+1. If the updated number of times of the Lagrange multiplier/penalty factor is not satisfied, proceed with step [ALCPSO5].In this algorithm, a new particle swarm is freshly generated in each initial procedure to avoid falling into the local best value, and the best value can be found more easily and quickly because the best value of the prior generation is saved and delivered to the next generation during the iterative search for procedure.


## 4. Trajectory Planning Simulation and Discussion

Before optimizing the robot’s trajectory, its inverse kinematics should be obtained. In [23, 24], the configuration control approach is proposed to solve the inverse kinematics of the redundant robot; this approach ensures that the inverse kinematics is unique and enables the robot to perform cyclic motion, which is an essential requirement for repetitive operations. Moreover, this approach requires little computational time, making it particularly favorable for the real-time control of a redundant robot. In this paper, we use the damped least squares (DLS) of the configuration control approach to determine the inverse kinematics of a redundant robot. Its formulation can be written in the following form: (11)q˙=Wv-1JTJWv-1JT+λ2W-1-1X˙d+Ke,whereW is a symmetric positive-definite weighting matrix, W=diag⁡We,Wc, where We and Wc are symmetric positive-definite weighting matrices in accordance with the basic task and an additional task, respectively;Wv is a symmetric positive-definite weighting matrix;λ is a positive scalar constant;K is a symmetric positive-definite feedback gain (constant);e is error, e=Xd-X.Next, the position solution of inverse kinematics can be obtained by integrating (11). We use the proposed ALCPSO method to perform a trajectory planning simulation of a robot to verify the accuracy and reliability of the method. The program is compiled in Matlab™ R2014. The test object is a space robot under the condition that the position and pose of the associated carrying platform are under control; it is a 3-DOF planar robot shown in Figure 2. The tested mission is tracking a circular path in plane. In Figure 1, q1, q2, and q3 are joint angles. The robot geometric parameters are defined as l1 = 2,080 mm, l2 = 2,080 mm, and l3 = 430 mm. Because the robot has a redundant degree of freedom, the configuration control approach is utilized to determine its inverse kinematics. The initial position of the end effector is (4000, 0) (mm), with corresponding joint angles of (30°, −49.03°, −38.27°), and the radius r and the center of the track circle are 400 mm and (3600, 0) (mm), respectively. The following procedure is used to obtain the inverse kinematics of the robot:(1)
Set the planned trajectory points in the circular path as a function of timet, mean αt, which is used to plan the desired trajectory points.(2)
ChooseΦ=q1+q2 as the additional task.(3)
Lete=[xd-x;yd-y;q1d-q1].(4)
Put the corresponding values into (11) and perform integration to obtain the position solution of inverse kinematics.Figure 1
Schematic diagram of the planar 3-DOF robot.Figure 2
The joint trajectories prior to optimization.
(a)
(b)
(c)
(d)In this paper,αt indicates the circular central angle; it is divided into uniform acceleration, uniform velocity, and uniform deceleration for a total of three sections along the counterclockwise rotation. The robot starts from an initial position with the angular acceleration from the value of 120/(1/80 ×n)2°/s2 (n denotes the number of planned via-points). When the robot along the circle moves by 60°, the uniform acceleration section is completed, and it enters the uniform velocity section, moving along the circle by 240°; finally, the robot with value of 120/(1/80 ×n)2°/s2 enters the uniform deceleration section and returns to the initial point, thus completing the entire motion. In this paper, set n=8. Other values are defined as follows:n
=
8, We=diag⁡1,1, Wc=1, Wv=diag⁡[1,1,1], K=diag⁡[1,1,1], λ=1, and X˙d=diag⁡[1,1,1].The values of the plan-points of the trajectory are shown in Table1. As shown in Table 1, the 1-point coincides with the 9-point when the end effector completes a cyclic motion. Thus, there are 9 plan-points and 8 via-points. The kinematic constraints of the velocity, acceleration, and jerk of the joints are 3 deg/s, 3 deg/s2, and 5 deg/s3, respectively.Table 1
Input data for trajectory planning.
Joint
Plan-points (deg)
1
2
3
4
5
6
7
8
9
1
30.00
Virtual
39.94
49.24
47.66
37.60
29.48
Virtual
30.04
2
−49.03
−57.25
−72.45
−79.89
−72.42
−57.16
−49.14
3
−38.27
−42.00
−49.16
−52.48
−49.25
−42.30
−37.96We set the robot’s execution time constraintt=60 s, the initial Langrage multiplier λ0=0,0,…,0, the initial penalty factor r0=1000,1000,…,1000, the convergence accuracy ε=0.0001, the constraint error accuracy εg=0.0001, the Lagrange multiplier update maximal times vmax=100, the maximum number of iterations in the CPSO kmax=100, the swarm particle number Nd,max=40, and the elastic coefficient α=100. The weighting coefficients are adjusted as follows: KT is 1, 0.8, 0.5, 0.2, and 0, and the corresponding KJ can be determined via calculation. We performed the proposed optimal method using the five weighting coefficient values, and the corresponding results are shown in Table 2. The execution time gradually increases when KT gradually decreases from 1 to 0. The joint trajectories prior to optimization are shown in Figure 2.Table 2
Results of trajectory optimization when utilizing the ALCPSO algorithm.
Parameters
Numerical results (α=100)
Initial
K
T
=
1
K
T
=
0.8
K
T
=
0.5
K
T
=
0.2
K
T
=
0
K
J
=
0
K
J
=
0.2
K
J
=
0.5
K
J
=
0.8
K
J
=
1
h
1
7.5
0.2527
2.8834
3.5899
5.0726
4.9810
h
2
7.5
4.8729
5.4128
6.7907
8.1513
8.9584
h
3
7.5
5.2656
6.1875
6.5949
8.3171
8.7707
h
4
7.5
3.2660
5.2699
5.8325
7.4311
7.6433
h
5
7.5
5.1017
4.8675
6.4061
7.9223
8.4227
h
6
7.5
5.2044
5.5472
6.6090
8.2754
8.7030
h
7
7.5
3.9063
4.2672
7.2471
8.9705
9.5342
h
8
7.5
0.2826
2.7232
2.4045
3.0351
2.9867
∑
h
i
60
28.1523
37.1587
45.4748
57.1754
60.0000
∑
j
=
1
N
∑
i
=
1
n
-
1
α
j
,
i
+
1
-
α
j
,
i
2
h
i
0.1119
22.6147
0.8664
0.2714
0.0861
0.0678
min
⁡
f
h
/
84.4568
106.508
81.7840
41.1919
6.783
Time (sec)
1.749
82.125
33.130
30.369
29.0513
40.212The simulation results whenKT is 1, 0.5, and 0 are shown in Figures 3–5, respectively. When KT is 1, the objective function contains only the minimum-time function. The joints’ velocities, accelerations, and jerks shown in Figure 3 are generally larger than those in Figure 2; the joint maximum jerk reaches the upper bounds on the absolute value at the initial moment, which corresponds to a rough trajectory, resulting in a comparatively larger vibration and lower path tracking accuracy of the robot during the moving process. If the robot operates in such a condition for an excessive period of time, its lifespan will be reduced. However, the working efficiency of the robot can increase because the execution time is reduced; this condition suits a robot with strict working efficiency requirement. The execution time in Figure 4 is longer than that in Figure 3; however, the jerks on the whole are smaller than that in Figure 3. In Figure 5, the execution time is equal to the set constraintt, and compared to the results in Figure 2, the joints’ velocities, accelerations, and jerks are generally smaller than those in Figure 2, indicating that, under the same execution time condition, it is beneficial for a robot during the moving process compared with that before performing optimization because of the lower velocities, accelerations, and jerks.Figure 3
Time-jerk optimal joint trajectories whenKT=1 and KJ=0.
(a)
(b)
(c)
(d)Figure 4
Time-jerk optimal joint trajectories whenKT=0.5 and KJ=0.5.
(a)
(b)
(c)
(d)Figure 5
Time-jerk optimal joint trajectories whenKT=0 and KJ=1.
(a)
(b)
(c)
(d)From analyzing Table2 and Figures 2–5, we can achieve relevant objects by adjusting elastic and weighting coefficients according to different requirements.When we combine the CPSO with the interior penalty function method, the constrained problem (4) can be expressed as follows:(12)LX,r=fX-r∑j=1mln⁡-gjx,where r denotes the penalty factor. We set the initial penalty factor r0 = 100000 and the convergence accuracy ε=0.001; other corresponding values are referred to in the aforementioned ALCPSO method.The termination criterions are defined as follows:(13)lx∗rv,rv-fx∗rv≤εv=1,…,vmax,where v denotes the number of iterations. The simulation results are shown in Table 3 for typical values of KT and KJ. After comparing the corresponding results with those of the ALCPSO method, we can find that the ALCPSO method indeed has some advantages, such as the calculated velocity and some obtained best values. In Table 3, when KT is set as 0, the obtained time is shorter than that of the ALCPSO method. This implies that when KT is set as 0, the CPSO and interior penalty function methods can be used to perform time-jerk optimal trajectory planning because they can get better time.Table 3
Results of the trajectory optimization when combining the CPSO with the interior penalty function method.
Parameters
Numerical results (α=100)
K
T
=
1
K
T
=
0
K
J
=
0
K
J
=
1
h
1
4.8291
6.6197
h
2
6.1574
7.0985
h
3
8.0744
7.9880
h
4
4.9833
6.0594
h
5
7.7239
8.0459
h
6
7.8541
7.9070
h
7
4.6968
5.6325
h
8
4.2933
4.2614
∑
h
i
48.6122
53.6122
∑
j
=
1
N
∑
i
=
1
n
-
1
α
j
,
i
+
1
-
α
j
,
i
2
h
i
0.2986
0.1422
min
⁡
f
h
145.8367
14.2223
Time (sec)
10534.807
10648.469When we utilize the SQP method (e.g., the fmincon function of Matlab) described in [9, 10], the initial input is the same as the aforementioned ALCPSO method to perform time-jerk optimal trajectory planning. The simulation results are shown in Table 4. After comparing the corresponding results with those of the ALCPSO method, we can find that the ALCPSO method generally surpasses the SQP method in the obtained best values.Table 4
Simulation results when utilizing the SQP algorithm.
Parameters
Numerical results (α=100)
Initial
K
T
=
1
K
T
=
0.8
K
T
=
0.5
K
T
=
0.2
K
T
=
0
K
J
=
0
K
J
=
0.2
K
J
=
0.5
K
J
=
0.8
K
J
=
1
∑
h
i
60
28.4283
37.3813
45.6751
57.2908
59.9794
∑
j
=
1
N
∑
i
=
1
n
-
1
α
j
,
i
+
1
-
α
j
,
i
2
h
i
0.1119
16.6042
0.8090
0.2678
0.0873
0.0689
min
⁡
f
h
/
85.2850
105.896
81.9050
41.3599
6.8931


## 5. Conclusion

This paper proposed an ALCPSO algorithm, which is based on the CPSO and the ALM methods, to realize the time-jerk optimal trajectory planning of a robot. In this algorithm, a new particle swarm is generated each time in the initial process in order to avoid falling into a local best value. In this manner, the best value can be found more easily and quickly because the best value of the previous generation is saved and delivered to the next generation during the iterative search for procedure. The optimal objective function considers both the total execution time and the integral of the squared jerk along the entire trajectory and then varies the values of two weighting coefficients and the elastic coefficient to achieve such requirements as rapid execution, a smooth trajectory, or both. The algorithm is implemented on a planar 3-DOF robot. The simulation results illustrate that the time-jerk optimal trajectory that meets both the kinematics and the execution time constraints can be obtained. The proposed algorithm is developed without performing an experiment; thus, future work will be devoted to performing experiments to verify the present algorithm’s effectiveness.



---

*Source: 1921479-2017-06-15.xml*