2017 29th Chinese Control and Decision Conference (CCDC) 2017
DOI: 10.1109/ccdc.2017.7978471
|View full text |Cite
|
Sign up to set email alerts
|

Path-planning of automated guided vehicle based on improved Dijkstra algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
48
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 91 publications
(48 citation statements)
references
References 2 publications
0
48
0
Order By: Relevance
“…As the ability to perform self-localization and navigating are of crucial importance for several industrial robots, path planning is currently a research challenge in the manufacturing domain [ 51 , 55 , 56 ], and different algorithms are being studied to resolve this issue, such as Bellman–Ford [ 63 ], Dijkstra [ 64 ], and Floyd Warshall [ 65 ] algorithms. Furthermore, industrial manipulators provided with visual guidance can further enhance path planning systems, as a vision-based approach gives more awareness to detect and avoid obstacles [ 50 , 58 ].…”
Section: Smart Domains and Applications In The Iort Systemsmentioning
confidence: 99%
“…As the ability to perform self-localization and navigating are of crucial importance for several industrial robots, path planning is currently a research challenge in the manufacturing domain [ 51 , 55 , 56 ], and different algorithms are being studied to resolve this issue, such as Bellman–Ford [ 63 ], Dijkstra [ 64 ], and Floyd Warshall [ 65 ] algorithms. Furthermore, industrial manipulators provided with visual guidance can further enhance path planning systems, as a vision-based approach gives more awareness to detect and avoid obstacles [ 50 , 58 ].…”
Section: Smart Domains and Applications In The Iort Systemsmentioning
confidence: 99%
“…In this method, the following procedure, which is illustrated in Figure , should be followed: Step 1: Starting from the SB, find the shortest path (with lowest impedance) to a nearest generator (from step 1). To this purpose, Dijkstra algorithm may be used Step 2: Calculate the impedance of the shortest path found in step 1.…”
Section: Improved Lsz Indicatorsmentioning
confidence: 99%
“…Human-machine interactive navigation refers to the process through which machines and operator cooperate with each other to control the movement of devices and realize interactive navigation [1]. This type of navigation has been widely used in indoor service robots [2,3], self-driving cars [4,5], automatic guided vehicles (AGV) [6,7], and so on [8,9]. Among them, the most important part between the operator and machines is the map.…”
Section: Introductionmentioning
confidence: 99%