An Efficient End-to-End Obstacle Avoidance Path Planning Algorithm for Intelligent Vehicles Based on Improved Whale Optimization Algorithm

Abstract

End-to-end obstacle avoidance path planning for intelligent vehicles has been a widely studied topic. To resolve the typical issues of the solving algorithms, which are weak global optimization ability, ease in falling into local optimization and slow convergence speed, an efficient optimization method is proposed in this paper, based on the whale optimization algorithm. We present an adaptive adjustment mechanism which can dynamically modify search behavior during the iteration process of the whale optimization algorithm. Meanwhile, in order to coordinate the global optimum and local optimum of the solving algorithm, we introduce a controllable variable which can be reset according to specific routing scenarios. The evolutionary strategy of differential variation is also applied in the algorithm presented to further update the location of search individuals. In numerical experiments, we compared the proposed algorithm with the following six well-known swarm intelligence optimization algorithms: Particle Swarm Optimization (PSO), Bat Algorithm (BA), Gray Wolf Optimization Algorithm (GWO), Dragonfly Algorithm (DA), Ant Lion Algorithm (ALO), and the traditional Whale Optimization Algorithm (WOA). Our method gave rise to better results for the typical twenty-three benchmark functions. In regard to path planning problems, we observed an average improvement of 18.95% in achieving optimal solutions and 77.86% in stability. Moreover, our method exhibited faster convergence compared to some existing approaches.

Keywords

• path planning
• end-to-end routing
• obstacle avoidance method
• swarm intelligence algorithms
• heuristic random search