Email this article Algorithm for constructing the graph adjacency matrix of the obstacles surface to finding the shortest path the movement of truck crane cargo
- Authors: Korytov M.S1
-
Affiliations:
- Sibirskaya State Avtomobilno-Dorozhnaya Akademiya
- Issue: Vol 19, No 1 (2011)
- Pages: 27-31
- Section: Articles
- URL: https://journals.eco-vector.com/1991-8542/article/view/19519
- DOI: https://doi.org/10.14498/tech.2011.1.%25u
- ID: 19519
Cite item
Full Text
Abstract
A way of describing the environment with obstacles, and the results of solving the problem of finding the shortest path of movement of the cargo truck with the help of algorithms on graphs is presented. A comparison of ways to create a graph adjacency matrix that describes the environment, on labor and on the accuracy of the subsequent search trajectory is given.
About the authors
Mihail S Korytov
Sibirskaya State Avtomobilno-Dorozhnaya Akademiya
Email: E-mail: kms142@mail.ru
к.т.н., доцент; Сибирская государственная автомобильно-дорожная академия (СибАДИ); Sibirskaya State Avtomobilno-Dorozhnaya Akademiya
References
- Правила устройства и безопасной эксплуатации грузоподъемных кранов и кранов-манипуляторов: ПБ 10-382-00 и ПБ 10-257-98. - Новосибирск: Сиб. унив. изд-во, 2007. - 335 с.
- Правила техники безопасности при эксплуатации стреловых самоходных кранов: ВСН 274-88. - М.: СтройИнфо, 2007. - 22 с.
- Dijkstra E.W. A note on two problems in connexion with graphs / Numerische Mathematik 1, 1959. - pp. 269-271.
- Siek J.G., Lee L-Q, and Lumsdaine A. (2002). The Boost Graph Library User Guide and Reference Manual (Upper Saddle River, NJ:Pearson Education).
Supplementary files
