Handling Multiobjectives with Adaptive Mutation Based $$\varepsilon $$ ε -Dominance Differential Evolution

Author(s):  
Qian Shi ◽  
Wei Chen ◽  
Tao Jiang ◽  
Dongmei Shen ◽  
Shangce Gao
2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110144
Author(s):  
Qianqian Zhang ◽  
Daqing Wang ◽  
Lifu Gao

To assess the inverse kinematics (IK) of multiple degree-of-freedom (DOF) serial manipulators, this article proposes a method for solving the IK of manipulators using an improved self-adaptive mutation differential evolution (DE) algorithm. First, based on the self-adaptive DE algorithm, a new adaptive mutation operator and adaptive scaling factor are proposed to change the control parameters and differential strategy of the DE algorithm. Then, an error-related weight coefficient of the objective function is proposed to balance the weight of the position error and orientation error in the objective function. Finally, the proposed method is verified by the benchmark function, the 6-DOF and 7-DOF serial manipulator model. Experimental results show that the improvement of the algorithm and improved objective function can significantly improve the accuracy of the IK. For the specified points and random points in the feasible region, the proportion of accuracy meeting the specified requirements is increased by 22.5% and 28.7%, respectively.


2019 ◽  
Vol 16 (5) ◽  
pp. 172988141987206 ◽  
Author(s):  
Shimeng Fan ◽  
Xihua Xie ◽  
Xuanyi Zhou

A new improved differential evolution constrained optimization algorithm is proposed to determine the optimum path generation of a rock-drilling manipulator with nine degrees of freedom. This algorithm is developed to minimize the total joint displacement without compromising the pose accuracy of the end-effector. Considering the rule for optimal operation time and smooth joint motion, total joint displacement and minimization of the end-effector pose error are respectively taken as the optimization objective and constraints. In the proposed algorithm, the inverse kinematics solution is computed by self-adaptive mutation differential evolution constrained optimization (SAMDECO) algorithm. Unlike conventional differential evolution (DE) algorithms, in the process of selection operation, the proposed algorithm takes full advantages of the information of excellent infeasible solutions in the contemporary population and scales the contribution of position constraint and orientation constraint. Consequently, the search process is guided to approach the optimal solution from both feasible and infeasible regions, which tremendously improves convergence accuracy and convergence rate. Some contrastive experiments are conducted with the basic self-adaptive mutation differential evoluton (SAMDE) algorithm. The results indicate that the proposed algorithm outperforms the basic SAMDE algorithm in terms of compliance of joints, which raises operation efficiency and plays an important role in engineering services value.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Xiaobing Yu ◽  
Jie Cao ◽  
Haiyan Shan ◽  
Li Zhu ◽  
Jun Guo

Particle swarm optimization (PSO) and differential evolution (DE) are both efficient and powerful population-based stochastic search techniques for solving optimization problems, which have been widely applied in many scientific and engineering fields. Unfortunately, both of them can easily fly into local optima and lack the ability of jumping out of local optima. A novel adaptive hybrid algorithm based on PSO and DE (HPSO-DE) is formulated by developing a balanced parameter between PSO and DE. Adaptive mutation is carried out on current population when the population clusters around local optima. The HPSO-DE enjoys the advantages of PSO and DE and maintains diversity of the population. Compared with PSO, DE, and their variants, the performance of HPSO-DE is competitive. The balanced parameter sensitivity is discussed in detail.


Sign in / Sign up

Export Citation Format

Share Document