Improved Grey Wolf Optimization Algorithm and Application

This paper proposed an improved Grey Wolf Optimizer (GWO) to resolve the problem of instability and convergence accuracy when GWO is used as a meta-heuristic algorithm with strong optimal search capability in the path planning for mobile robots. We improved chaotic tent mapping to initialize the wolves to enhance the global search ability and used a nonlinear convergence factor based on the Gaussian distribution change curve to balance the global and local searchability. In addition, an improved dynamic proportional weighting strategy is proposed that can update the positions of grey wolves so that the convergence of this algorithm can be accelerated. The proposed improved GWO algorithm results are compared with the other eight algorithms through several benchmark function test experiments and path planning experiments. The experimental results show that the improved GWO has higher accuracy and faster convergence speed.

Automated summary

This paper proposes an improved GWO algorithm to address the issues of instability and convergence accuracy in mobile robot path planning when GWO is used as a meta-heuristic algorithm. By enhancing the initialization method, convergence factor, and weighting strategy, the improved GWO algorithm demonstrates higher accuracy and faster convergence speed in experiments.