2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC) 2017
DOI: 10.1109/smc.2017.8122819
|View full text |Cite
|
Sign up to set email alerts
|

Conflict-free route planning of automated guided vehicles based on conflict classification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
12
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 9 publications
0
12
0
Order By: Relevance
“…Thus, classical A* algorithm may not be suitable for path planning applications in complex environments such as a future FoF environment that may have changing layouts and dynamic arrangements. Dijkstra algorithm was used for AGVs path planning in [96], while improved Dijkstra algorithm was applied to path planning in [97] and [98]. Specifically, Dijkstra algorithm was used to resolve AGV conflict in [98] where authors classified conflicts that AGVs may experience as cross conflict, path-occupancy conflict and head-on conflict.…”
Section: A Localization Scheduling and Path Planning Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Thus, classical A* algorithm may not be suitable for path planning applications in complex environments such as a future FoF environment that may have changing layouts and dynamic arrangements. Dijkstra algorithm was used for AGVs path planning in [96], while improved Dijkstra algorithm was applied to path planning in [97] and [98]. Specifically, Dijkstra algorithm was used to resolve AGV conflict in [98] where authors classified conflicts that AGVs may experience as cross conflict, path-occupancy conflict and head-on conflict.…”
Section: A Localization Scheduling and Path Planning Algorithmsmentioning
confidence: 99%
“…Dijkstra algorithm was used for AGVs path planning in [96], while improved Dijkstra algorithm was applied to path planning in [97] and [98]. Specifically, Dijkstra algorithm was used to resolve AGV conflict in [98] where authors classified conflicts that AGVs may experience as cross conflict, path-occupancy conflict and head-on conflict. Cross conflict can occur when a single path node falls into the navigation path of two AGVs.…”
Section: A Localization Scheduling and Path Planning Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…Demesure et al 22 proposed a navigation scheme based on predetermined path planning and priority, avoiding conflicts when AGVs approach each other or moving toward the same target. Zhang et al 23 proposed a conflict-free path planning method for the multi-AGV system in the warehouse system. Candidate routes are planned by the improved Dijkstra algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Research on conflict-free path planning is still on-going and time-window based method is commonly used for multi-AGV conflict-free path planning [3] - [10]. In [4], Zhang and Yuan proposed to find all the equidistance shortest paths in a rectangular environment map by the improved Dijkstra algorithm (as proposed in [3]) and then the path which does not conflict with other planned AGV paths will be selected. In [5], Yan et al proposed some rules and online control strategies to avoid AGV collision and deadlock with both unidirectional and bidirectional paths.…”
Section: Introductionmentioning
confidence: 99%