Proceedings of the 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)

Research on Optimal Path based on Dijkstra Algorithms

Authors
Minhang Zhou, Nina Gao
Corresponding Author
Minhang Zhou
Available Online April 2019.
DOI
https://doi.org/10.2991/icmeit-19.2019.141How to use a DOI?
Keywords
optimal path, Dijkstra algorithm, optimization.
Abstract
The optimal path selection is a practical problem, and the application frequency in daily life is very high, which has practical research significance. The Dijkstra algorithm is one of the most classical algorithms in the algorithm of optimal path selection. It is also the theoretical basis of many experimental designs when solving the optimal path problem. When the traditional Dijkstra algorithm calculates and selects the optimal path between nodes, a large number of nodes need to be calculated. The selection of the optimal path will be affected by many conditions. In the actual application, the selection conditions will often present multiple different priority conditions and comprehensive influence path selection. In this paper, the optimization algorithm is implemented and verified by experiments and practical applications.
Open Access
This is an open access article distributed under the CC BY-NC license.

Download article (PDF)

Proceedings
3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)
Part of series
Advances in Computer Science Research
Publication Date
April 2019
ISBN
978-94-6252-708-9
ISSN
2352-538X
DOI
https://doi.org/10.2991/icmeit-19.2019.141How to use a DOI?
Open Access
This is an open access article distributed under the CC BY-NC license.

Cite this article

TY  - CONF
AU  - Minhang Zhou
AU  - Nina Gao
PY  - 2019/04
DA  - 2019/04
TI  - Research on Optimal Path based on Dijkstra Algorithms
BT  - 3rd International Conference on Mechatronics Engineering and Information Technology (ICMEIT 2019)
PB  - Atlantis Press
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmeit-19.2019.141
DO  - https://doi.org/10.2991/icmeit-19.2019.141
ID  - Zhou2019/04
ER  -