GIS Plugin for Planning Movement on Various Types of Roads

The paper is devoted to developing a Geographic Information System (GIS) algorithm for constructing a connected road graph based on data obtained from OpenStreetMaps. The paper describes the operating principles of the algorithm, the required input data, the structure and description of the resulting connected weighted graph, and the results of testing the obtained graph for generating route points. In constructing the road map, various types of roads are used, ranging from highways and main roads to secondary and unclassified roads, as represented in the QGIS v3.2x data library for working with OpenStreetMaps. To use the proposed algorithm, only a vector layer of roads is required, extracted using the QuickOSM tool directly from OpenStreetMap maps. The pathfinding capability was tested using Dijkstra's algorithm in comparison with the services of Google Maps and Yandex Maps, and the proposed graph allowed us to find the shorter path. The total time to create the connected weighted graph for the experimental area of 83 km<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> was approximately 50 seconds.