scholarly journals Time-Optimal Trajectory Optimization of Serial Robotic Manipulator With Kinematic and Dynamic Limits Based On Improved Particle Swarm Optimization

Author(s):  
Yu Yang ◽  
Hongze Xu ◽  
Shaohua Li ◽  
Lingling Zhang ◽  
Xiuming Yao

Abstract Effective motion control can achieve accurate and fast positioning and movement of industrial robotics and improve industrial productivity significantly. Time-optimal trajectory optimization (TO) is a great concern in the motion control of robotics and can improve motion efficiency by providing high-speed and reasonable motion references to the motion controller. In this study, a new time-optimal TO strategy, polynomial interpolation function (PIF) combined with improved particle swarm optimization (PSO) considering kinematic and dynamic limits, successfully optimizes the movement time of the PUMA 560 serial manipulator along a randomly assigned path. The 4-3-4 PIF is first used to generate the smooth and 3-order continuous movement trajectories of six joints in joint space. The PSO with cosine decreasing weight (CDW-PSO) algorithm further reduces the trajectories movement time considering the limits of the angular displacement, angular velocity, angular acceleration, angular jerk, and joint torque. Experimental results show that the CDW-PSO algorithm achieves a better convergence rate of 23 and a better fitness value of 2.46 compared with the PSO with constant weight and linearly decreasing weight algorithms. The CDW-PSO optimized movement time is reduced by 83.6% compared to the manually setting movement time value of 15. The proposed time-optimal TO strategy can be conducted easily and directly search for global optimal solutions without approximation of the limits. The optimized trajectories could be incorporated in the motion controller of the actual manipulators due to considering the kinematic and dynamic limits.

2015 ◽  
Vol 734 ◽  
pp. 482-486
Author(s):  
Bo Yang ◽  
Hai Xiao Wang

A new time-domain improved PSO algorithm is proposed to solve the problem of reentry trajectory optimization. The approach uses time-domain basis functions fitting the control variables, solves free final time optimal control directly, and sets parameters by using vehicle's dynamic characteristics. Simulation of a reentry vehicle with no-fly zone constraints is used to demonstrate the effectiveness and veracity of algorithm in reentry trajectory optimization. The final condition error is less than 1%.


2013 ◽  
Vol 394 ◽  
pp. 505-508 ◽  
Author(s):  
Guan Yu Zhang ◽  
Xiao Ming Wang ◽  
Rui Guo ◽  
Guo Qiang Wang

This paper presents an improved particle swarm optimization (PSO) algorithm based on genetic algorithm (GA) and Tabu algorithm. The improved PSO algorithm adds the characteristics of genetic, mutation, and tabu search into the standard PSO to help it overcome the weaknesses of falling into the local optimum and avoids the repeat of the optimum path. By contrasting the improved and standard PSO algorithms through testing classic functions, the improved PSO is found to have better global search characteristics.


2011 ◽  
Vol 50-51 ◽  
pp. 3-7 ◽  
Author(s):  
Nan Ping Liu ◽  
Fei Zheng ◽  
Ke Wen Xia

CDMA multiuser detection (MUD) is a crucial technique to mobile communication. We adopt improved particle swarm optimization (PSO) algorithm in MUD which incorporates factor and utilizes function to discrete PSO. Comparison of BER and near-far effect has verified its effectiveness on multi-access interference (MAI). The algorithm accelerates the convergent speed meanwhile it also displays feasibility and superiority in case simulation.


2014 ◽  
Vol 2014 ◽  
pp. 1-14 ◽  
Author(s):  
Shouwen Chen ◽  
Zhuoming Xu ◽  
Yan Tang ◽  
Shun Liu

Particle swarm optimization algorithm (PSO) is a global stochastic tool, which has ability to search the global optima. However, PSO algorithm is easily trapped into local optima with low accuracy in convergence. In this paper, in order to overcome the shortcoming of PSO algorithm, an improved particle swarm optimization algorithm (IPSO), based on two forms of exponential inertia weight and two types of centroids, is proposed. By means of comparing the optimization ability of IPSO algorithm with BPSO, EPSO, CPSO, and ACL-PSO algorithms, experimental results show that the proposed IPSO algorithm is more efficient; it also outperforms other four baseline PSO algorithms in accuracy.


Sign in / Sign up

Export Citation Format

Share Document