| 基于物流机器人的路径规划研究 |
| |
| 引用本文： | 亢程博,闫娟,杨慧斌,陆文超.基于物流机器人的路径规划研究[J].软件,2020(3):144-148. |
| |
| 作者姓名： | 亢程博 闫娟 杨慧斌 陆文超 |
| |
| 作者单位： | 上海工程技术大学机械与汽车工程学院 |
| |
| 摘 要： | 本文描绘了物流机器人的路径规划问题。针对标准A*算法的路径规划时间长、计算节点多的问题,提出了在标准A*算法的基础山,使用改进的双向搜索的A*算法。通过使用MATLAB进行仿真和实验平台进行实验对标准A*算法和优化后的A*算法进行了对比,结果表明:改进的A*算法比标准的A*算法进行路径规划的时间更短,并且使用的节点更少。
|
| 关 键 词： | 物流机器人 路径规划 A*算法 |
Research on Path Planning Based on Logistics Robot |
| |
| KANG Cheng-bo,YAN Juan,YANG Hui-bin,LU Wen-chao.Research on Path Planning Based on Logistics Robot[J].Software,2020(3):144-148. |
| |
| Authors: | KANG Cheng-bo YAN Juan YANG Hui-bin LU Wen-chao |
| |
| Affiliation: | (Shanghai University of Engineering Science,College of Mechanical and automotive Engineering,Shanghai 201620,China) |
| |
| Abstract: | This paper describes the path planning problem of logistics robots. Aiming at the problem of long path planning time and many computing nodes for the standard A* algorithm, this paper proposes the A* algorithm using the improved bidirectional search in the basic mountain of the standard A* algorithm. By comparing the standard A* algorithm with the optimized A* algorithm by using MATLAB simulation and experimental platform, The results showed that the improved A* algorithm had shorter time for path planning and fewer nodes than the standard A* algorithm. |
| |
| Keywords: | Logistics robot Path planning A* algorithm |
| 本文献已被 维普 等数据库收录！ |
|
