Grey wolf optimization (GWO) is a meta-heuristic algorithm inspired by the hierarchy and hunting behavior of grey wolves. GWO has the superiorities of simpler concept and fewer adjustment parameters, and has been widely used in different fields. However, there are some disadvantages in avoiding prematurity and falling into local optimum. This paper presents an improved grey wolf optimization (IGWO) to ameliorate these drawbacks. Firstly, a modified position update mechanism for pursuing high quality solutions is developed. By designing an ameliorative position update formula, a proper balance between the exploration and exploitation is achieved. Moreover, the leadership hierarchy is strengthened by proposing adaptive weights of α, β and δ. Then, a dynamic local optimum escape strategy is proposed to reinforce the ability of the algorithm to escape from the local stagnations. Finally, some individuals are repositioned with the aid of the positions of the leaders. These individuals are pulled to new positions near the leaders, helping to accelerate the convergence of the algorithm. To verify the effectiveness of IGWO, a series of contrast experiments are conducted. On the one hand, IGWO is compared with some state-of-the-art GWO variants and several promising meta-heuristic algorithms on 20 benchmark functions. Experimental results indicate that IGWO performs better than other competitors. On the other hand, the applicability of IGWO is verified by a robot global path planning problem, and simulation results demonstrate that IGWO can plan shorter and safer paths. Therefore, IGWO is successfully applied to the path planning as a new method.
Keywords: exploitation and exploration; grey wolf optimization; multi-strategy ensemble; path planning.