2018
DOI: 10.1109/access.2018.2819199
|View full text |Cite
|
Sign up to set email alerts
|

Collision-Free Route Planning for Multiple AGVs in an Automated Warehouse Based on Collision Classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
47
0
1

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
4

Relationship

2
8

Authors

Journals

citations
Cited by 100 publications
(52 citation statements)
references
References 18 publications
0
47
0
1
Order By: Relevance
“…The type of collision-free routes can be classified into four types [25] with three suggested solutions, namely (a): Schedule each AGV; (b): Select the desired route; and (c) AGV goes according to its purpose. Each collision classification is followed by one or two cases.…”
Section: Methodsmentioning
confidence: 99%
“…The type of collision-free routes can be classified into four types [25] with three suggested solutions, namely (a): Schedule each AGV; (b): Select the desired route; and (c) AGV goes according to its purpose. Each collision classification is followed by one or two cases.…”
Section: Methodsmentioning
confidence: 99%
“…k 12 (β) 1. Under this condition, there is 1-[k 12 (β)] 2 ≈ 1 in (15). In addition, ignoring the second-order small quantity, the coupled mode equation of the system is finally obtained…”
Section: Modeling and Analysis Of System A Coupled-mode Modelingmentioning
confidence: 99%
“…Besides, operational cost is also investigated by researchers [21]. Reference [22] proposes a collision free path planning algorithm, to generate feasible paths for mobile robots. In [8], a nested semi-open queueing network (SOQN) is developed to evaluate performance of different battery recovery strategies, and a decomposition method is presented to solve the SOQN models.…”
Section: Literature Reviewmentioning
confidence: 99%