返回
GPU-based Global Path Planning Using Genetic Algorithm with Near Corner Initialization
DOI:10.1007/s10846-022-01576-6.png)
摘要
En 中文
This paper presents a global path planning framework and method that utilizes genetic algorithm (GA) optimization on a highly parallelized Graphics Processing Unit (GPU) platform to achieve salient computing performance. A method to randomly initialize waypoints in the free space near obstacle corners is proposed, which in conjunction with mutation in the free space shows great advantages over other methods in reaching low fitness value. Furthermore, the migration process is introduced into the GA to mitigate the issue of premature convergence. To determine best GA configurations, a tradeoff analysis is conducted, and it is found that the runtime is minimized and optimization accuracy is preserved when the number of populations and individuals are selected as 640 and 64. The number of generations is selected as 1,000 based on the convergence rate of GA optimization. An objective function enabling differential consideration of the path length, smoothness, safety, and feasibility through individual weights is also presented. Numerical experiments demonstrate that different optimal paths can be obtained from the same terrain by tuning the weights. Compared to its serial CPU counterpart, the average speedup achieved by GPU is 83x .
Keyword:
Mobile robot
Genetic algorithm
Path planning
Genetic algorithm
GPU
期刊
J
IF:
2.8
论文数:
3.9K
被引数:
6.9K
机构
引用论文
Multi-objective multi-robot path planning in continuous environment using an enhanced genetic algorithm基于改进遗传算法的连续环境多目标多机器人路径规划
Robot path planning in uncertain environment using multi-objective particle swarm optimization基于多目标粒子群算法的不确定环境下机器人路径规划
NEUROCOMPUTING
IF6.5
A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization基于多目标粒子群优化的移动机器人分层全局路径规划方法
A review: On path planning strategies for navigation of mobile robot移动机器人导航路径规划策略研究综述
DEFENCE TECHNOLOGY
IF5.9

