arrow
返回

A Novel Path Planning Algorithm for Warehouse Robots Based on a Two-Dimensional Grid Model

delete2020-01-01
delete14
delete
OA
AI
杨
杨波 (Bo Yang)
W
Wentao Li *
J
Jianrong Wang
J
Jingjie Yang
T
Tiantian Wang
X
Xin Liu
DOI:10.1109/ACCESS.2020.2991076delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
In this paper, the path planning problem of goods transportation is formulated as a traveling salesman problem (TSP). A novel path planning algorithm for warehouse robots based on a two-dimensional (2D) grid model is proposed to solve this type of TSP. Firstly, we simplified the traditional pile type warehouse as a node-based 2D grid model. Then, a new concept called the largest convex polygon (LCP) is introduced to illustrate the shortest path to traverse all goods locations in an ideal condition. Next, the remaining locations are classified by their relationship with LCP and designed path planning rules separately. Finally, we merged the paths of different types of cargo locations to get the final path. The experimental results show that, compared with ant colony optimization (ACO) and genetic algorithm (GA), our proposed algorithm could effectively reduce the computation time and total path length.
Keyword:
Warehouse robots
path planning
TSP
2D grid model
largest convex polygon
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

S
Shanxi University
学者数:
1.3W
论文数: 8.4K
被引数: 1.2W
引用论文

引用论文

Biomimetic torene shells
err2023-01-06
err0
PREAI
errMaziyar Bazmara; Roger A Sauer; Ashutosh Agrawal
err分享
err收藏
err分享
err收藏
A Self-Heuristic Ant-Based Method for Path Planning of Unmanned Aerial Vehicle in Complex 3-D Space With Dense U-Type Obstacles
err2019-01-01
err18
errOAAI
errZhang, Chao; Hu, Chenxi; Feng, Jianrui; Liu, Zhenbao; Zhou, Yong; Zhang, Zexu
err分享
err收藏
err分享
err收藏
学者 查看更多内容