Grey wolf optimization approach for searching critical failure surface in soil slopes

Author(s):  
N. Himanshu ◽  
V. Kumar ◽  
A. Burman ◽  
D. Maity ◽  
B. Gordan
2020 ◽  
Vol 97 (1) ◽  
pp. 97-110
Author(s):  
Kin Meng Wong ◽  
Hio Kuan Tai ◽  
Shirley W. I. Siu

2020 ◽  
Vol 48 (4) ◽  
pp. 596-612
Author(s):  
Hany. F. S. Abu-Seada ◽  
Mohamed M.M. Slama ◽  
Mohamed A. M. Hassan ◽  
M. A. Ebrahim

2021 ◽  
pp. 1-18
Author(s):  
Rajeev Kumar ◽  
Laxman Singh ◽  
Rajdev Tiwari

Path planning for robots plays a vital role to seek the most feasible path due to power requirement, environmental factors and other limitations. The path planning for the autonomous robots is tedious task as the robot needs to locate a suitable path to move between the source and destination points with multifaceted nature. In this paper, we introduced a new technique named modified grey wolf optimization (MGWO) algorithm to solve the path planning problem for multi-robots. MGWO is modified version of conventional grey wolf optimization (GWO) that belongs to the category of metaheuristic algorithms. This has gained wide popularity for an optimization of different parameters in the discrete search space to solve various problems. The prime goal of the proposed methodology is to determine the optimal path while maintaining a sufficient distance from other objects and moving robots. In MGWO method, omega wolves are treated equally as those of delta wolves in exploration process that helps in escalating the convergence speed and minimizing the execution time. The simulation results show that MGWO gives satisfactory performance than other state of art methods for path planning of multiple mobile robots. The performance of the proposed method is compared with the standard evolutionary algorithms viz., Particle Swarm Optimization (PSO), Intelligent BAT Algorithm (IBA), Grey Wolf Optimization (GWO), and Variable Weight Grey Wolf Optimization (VW-GWO) and yielded better results than all of these.


2020 ◽  
Author(s):  
Kin Meng Wong ◽  
Shirley Siu

Protein-ligand docking programs are indispensable tools for predicting the binding pose of a ligand to the receptor protein in current structure-based drug design. In this paper, we evaluate the performance of grey wolf optimization (GWO) in protein-ligand docking. Two versions of the GWO docking program – the original GWO and the modified one with random walk – were implemented based on AutoDock Vina. Our rigid docking experiments show that the GWO programs have enhanced exploration capability leading to significant speedup in the search while maintaining comparable binding pose prediction accuracy to AutoDock Vina. For flexible receptor docking, the GWO methods are competitive in pose ranking but lower in success rates than AutoDockFR. Successful redocking of all the flexible cases to their holo structures reveals that inaccurate scoring function and lack of proper treatment of backbone are the major causes of docking failures.


Sign in / Sign up

Export Citation Format

Share Document