Mobile Robot Path Planning Optimization Based on Integration of Firefly Algorithm and Quadratic Polynomial Equation

Author(s):  
Noor Alhuda F. Abbas
2020 ◽  
Vol 34 (29) ◽  
pp. 2050322
Author(s):  
Guanghui Xu ◽  
Ting-Wei Zhang ◽  
Qiang Lai ◽  
Jian Pan ◽  
Bo Fu ◽  
...  

Path planning has always been a hot topic in the field of mobile robot research. At present, the mainstream issues of the mobile robot path planning are combined with the swarm intelligence algorithms. Among them, the firefly algorithm is more typical. The firefly algorithm has the advantages of simple concepts and easy implementation, but it also has the disadvantages of being easily trapped into a local optimal solution, with slow convergence speed and low accuracy. To better combine the path planning of mobile robot with firefly algorithm, this paper studies the optimization firefly algorithm for the path planning of mobile robot. By using the strategies of optimizing the adaptive parameters in the firefly algorithm, an adaptive firefly algorithm is designed to solve the problem that the firefly algorithm is easy to get into the local optimal solution and improves the performance of firefly algorithm. The optimized algorithm with high performance can improve the computing ability and reaction speed of the mobile robot in the path planning. Finally, the theoretical and experimental results have verified the effectiveness and superiority of the proposed algorithm, which can meet the requirements of the mobile robot path planning.


2018 ◽  
Vol 26 (7) ◽  
pp. 309-320 ◽  
Author(s):  
Alia Karim Abdul Hassan ◽  
Duaa Jaafar Fadhil

 In this paper, a new method is proposed to solve the problem of path planning for a mobile robot in a dynamic-partially knew three-dimensional sphere environment by using a modified version of the Firefly Algorithm that successfully finds near optimal and collision-free path while maintaining quick, easy and completely safe navigation throughout the path to the goal.


2021 ◽  
Vol 18 (3) ◽  
pp. 172988142110192
Author(s):  
Songcan Zhang ◽  
Jiexin Pu ◽  
Yanna Si ◽  
Lifan Sun

Path planning of mobile robots in complex environments is the most challenging research. A hybrid approach combining the enhanced ant colony system with the local optimization algorithm based on path geometric features, called EACSPGO, has been presented in this study for mobile robot path planning. Firstly, the simplified model of pheromone diffusion, the pheromone initialization strategy of unequal allocation, and the adaptive pheromone update mechanism have been simultaneously introduced to enhance the classical ant colony algorithm, thus providing a significant improvement in the computation efficiency and the quality of the solutions. A local optimization method based on path geometric features has been designed to further optimize the initial path and achieve a good convergence rate. Finally, the performance and advantages of the proposed approach have been verified by a series of tests in the mobile robot path planning. The simulation results demonstrate that the presented EACSPGO approach provides better solutions, adaptability, stability, and faster convergence rate compared to the other tested optimization algorithms.


Sign in / Sign up

Export Citation Format

Share Document