当前位置:
X-MOL 学术
›
Mod. Phys. Lett. B
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A new path planning method of mobile robot based on adaptive dynamic firefly algorithm
Modern Physics Letters B ( IF 1.9 ) Pub Date : 2020-07-30 , DOI: 10.1142/s0217984920503224 Guanghui Xu 1, 2 , Ting-Wei Zhang 2 , Qiang Lai 3 , Jian Pan 2 , Bo Fu 2 , Xilin Zhao 2
Modern Physics Letters B ( IF 1.9 ) Pub Date : 2020-07-30 , DOI: 10.1142/s0217984920503224 Guanghui Xu 1, 2 , Ting-Wei Zhang 2 , Qiang Lai 3 , Jian Pan 2 , Bo Fu 2 , Xilin Zhao 2
Affiliation
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.
中文翻译:
基于自适应动态萤火虫算法的移动机器人路径规划新方法
路径规划一直是移动机器人研究领域的热门话题。目前,移动机器人路径规划的主流问题与群体智能算法相结合。其中,萤火虫算法较为典型。萤火虫算法具有概念简单、易于实现的优点,但也存在容易陷入局部最优解、收敛速度慢、准确率低的缺点。为更好地将移动机器人路径规划与萤火虫算法相结合,研究了移动机器人路径规划的优化萤火虫算法。通过使用萤火虫算法中的自适应参数优化策略,为了解决萤火虫算法容易陷入局部最优解的问题,提高萤火虫算法的性能,设计了一种自适应萤火虫算法。优化后的高性能算法可以提高移动机器人在路径规划中的计算能力和反应速度。最后,理论和实验结果验证了所提算法的有效性和优越性,能够满足移动机器人路径规划的要求。
更新日期:2020-07-30
中文翻译:
基于自适应动态萤火虫算法的移动机器人路径规划新方法
路径规划一直是移动机器人研究领域的热门话题。目前,移动机器人路径规划的主流问题与群体智能算法相结合。其中,萤火虫算法较为典型。萤火虫算法具有概念简单、易于实现的优点,但也存在容易陷入局部最优解、收敛速度慢、准确率低的缺点。为更好地将移动机器人路径规划与萤火虫算法相结合,研究了移动机器人路径规划的优化萤火虫算法。通过使用萤火虫算法中的自适应参数优化策略,为了解决萤火虫算法容易陷入局部最优解的问题,提高萤火虫算法的性能,设计了一种自适应萤火虫算法。优化后的高性能算法可以提高移动机器人在路径规划中的计算能力和反应速度。最后,理论和实验结果验证了所提算法的有效性和优越性,能够满足移动机器人路径规划的要求。