Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification
An automated warehouse system contains a number of materials, workstations, and multiple Automated Guided Vehicles (AGVs). The automated warehouse is server-controlled. This paper proposes a collision-free routing method for AGVs based on collision classification. This method can deal with collision...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2018-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8325291/ |
id |
doaj-1db9c8a069044010afbe757172d67583 |
---|---|
record_format |
Article |
spelling |
doaj-1db9c8a069044010afbe757172d675832021-03-29T21:09:09ZengIEEEIEEE Access2169-35362018-01-016260222603510.1109/ACCESS.2018.28191998325291Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision ClassificationZheng Zhang0https://orcid.org/0000-0002-5572-2401Qing Guo1Juan Chen2Peijiang Yuan3College of Information Science and Technology, Beijing University of Chemical Technology, Beijing, ChinaCollege of Information Science and Technology, Beijing University of Chemical Technology, Beijing, ChinaCollege of Information Science and Technology, Beijing University of Chemical Technology, Beijing, ChinaIntelligent Technology and Robotics Research Center, Beihang University, Beijing, ChinaAn automated warehouse system contains a number of materials, workstations, and multiple Automated Guided Vehicles (AGVs). The automated warehouse is server-controlled. This paper proposes a collision-free routing method for AGVs based on collision classification. This method can deal with collisions arising in the automated warehouse. It first divides the warehouse environment into five areas, and then performs route planning. In this paper, the environment map for AGVs is described by using the grid method. The initial route of each task is predetermined by improved Dijkstra's algorithm. The server detects the potential collisions by comparing each workstation's ID and corresponding time window in every route. This paper presents four collision classifications and three solutions. Based upon the analyses and experiments, we select the corresponding solution for each type of collision. Presented case studies demonstrate the efficiency of the proposed collision-free route planning approach.https://ieeexplore.ieee.org/document/8325291/Multiple AGVsroute planningtime windowthe status of AGVcollision classification |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Zheng Zhang Qing Guo Juan Chen Peijiang Yuan |
spellingShingle |
Zheng Zhang Qing Guo Juan Chen Peijiang Yuan Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification IEEE Access Multiple AGVs route planning time window the status of AGV collision classification |
author_facet |
Zheng Zhang Qing Guo Juan Chen Peijiang Yuan |
author_sort |
Zheng Zhang |
title |
Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification |
title_short |
Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification |
title_full |
Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification |
title_fullStr |
Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification |
title_full_unstemmed |
Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification |
title_sort |
collision-free route planning for multiple agvs in an automated warehouse based on collision classification |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2018-01-01 |
description |
An automated warehouse system contains a number of materials, workstations, and multiple Automated Guided Vehicles (AGVs). The automated warehouse is server-controlled. This paper proposes a collision-free routing method for AGVs based on collision classification. This method can deal with collisions arising in the automated warehouse. It first divides the warehouse environment into five areas, and then performs route planning. In this paper, the environment map for AGVs is described by using the grid method. The initial route of each task is predetermined by improved Dijkstra's algorithm. The server detects the potential collisions by comparing each workstation's ID and corresponding time window in every route. This paper presents four collision classifications and three solutions. Based upon the analyses and experiments, we select the corresponding solution for each type of collision. Presented case studies demonstrate the efficiency of the proposed collision-free route planning approach. |
topic |
Multiple AGVs route planning time window the status of AGV collision classification |
url |
https://ieeexplore.ieee.org/document/8325291/ |
work_keys_str_mv |
AT zhengzhang collisionfreerouteplanningformultipleagvsinanautomatedwarehousebasedoncollisionclassification AT qingguo collisionfreerouteplanningformultipleagvsinanautomatedwarehousebasedoncollisionclassification AT juanchen collisionfreerouteplanningformultipleagvsinanautomatedwarehousebasedoncollisionclassification AT peijiangyuan collisionfreerouteplanningformultipleagvsinanautomatedwarehousebasedoncollisionclassification |
_version_ |
1724193381898256384 |