首页|基于改进A*算法的多AGV路径规划及避障研究

基于改进A*算法的多AGV路径规划及避障研究

扫码查看
针对多自动导引运输车(automated guided vehicle,AGV)路径规划与避障问题,考虑AGV行驶中启、制动速度与转弯角度对行驶时间的影响,根据不同冲突类型制定避障策略,以所有AGV行驶总时间最短为目标,建立多AGV路径规划与避障模型,并设计改进A*算法进行求解.对两组数量不同的多AGV进行路径规划与避障仿真,结果表明:相较于一般A*算法,基于改进A*算法的多AGV路径规划及避障总时间优化率分别为10.0%和10.5%,总路径长度优化率分别为7.1%和7.8%.与其他改进智能算法的进一步比较证实,改进A*算法在缩短路径规划用时和路径长度方面具有明显优势.本文提出的改进A*算法可高效地规划出多AGV运行的无碰撞路径,其改进思路也贴切反映了 AGV的实际运行工况.
Multi-AGV based on improved A*algorithm path planning and obstacle avoidance research
In response to the path planning and obstacle avoidance problem by the multiple auto-mated guided vehicles(AGVs),this study considers the impact of starting,braking speeds and turning angles on the travel time of AGVs.It formulates obstacle avoidance strategies based on different types of conflicts and aims to minimize the total travel time of all AGVs.A multi-AGV path planning and obstacle avoidance model is established,with an improved A*algorithm de-signed for solving it.Path planning and obstacle avoidance simulations are conducted for two groups of AGVs with different quantities.The results indicate that compared with the general A*algorithm,the total time optimization rates for multi-AGV path planning and obstacle avoidance based on the improved A*algorithm are 10.0%and 10.5%,respectively.The total path length optimization rates are 7.1%and 7.8%,respectively.Further comparisons with other improved intelligent algorithms confirm that the improved A*algorithm demonstrates significant advantages in reducing both path planning time and path length.The proposed improved A*al-gorithm efficiently plans collision-free paths for multiple AGV operations,with its improvement approach reflecting the practical operating conditions of AGVs accurately.

AGVA*algorithmpath optimizationtime factorobstacle avoidance strategy

孙军艳、吴焕钦、王子豪

展开 >

陕西科技大学机电工程学院,陕西西安 710021

自动导引运输车 A*算法 路径优化 时间因素 避障策略

陕西省重点研发计划项目陕西省社会科学基金项目西安市科技计划项目

2023-YBGY-4082020R04323RKYJ0026

2024

西安理工大学学报
西安理工大学

西安理工大学学报

CSTPCD北大核心
影响因子:0.382
ISSN:1006-4710
年,卷(期):2024.40(2)
  • 8