Methods for constructing routes outside of settlements on the basis of GPS data

Route building methods include the task of finding the shortest trajectory between two or more objects, which may vary depending on weather conditions, altitude coordinates, and other parameters. The methods discussed in the article allow building routes using GPS tracks for various fields of knowledge: designing routes within a city, region, country, or with remote sensing of the earth. The considered algorithms are used in the field of environmental monitoring in emergency situations, to search for optimal data transmission routes in satellite systems and their validation, as well as in organizational and economic systems. The most widely used approaches for building routes are graph theory and search in the state space, where any trajectory between objects is given its own weight. However, there is still no system that allows you to make a tourist route over rough terrain. The most widely used approaches are graph theory and search in the state space, where any trajectory between objects has its own weight. The article discusses such methods as the Dijkstra, Levitt, Floyd-Warshell algorithm, and also compares their effectiveness in terms of running time and complexity. The aim of the work is to develop an algorithm for finding the shortest path and building a tourist route from a given point A to point B. This development will open up new opportunities for citizens to independently visit new interesting areas, actively spend their free time and get to know the surroundings of the city. The system has been tested on the territory of the Torgashinsky ridge, includes more than 38 route points located at a distance of more than 25 kilometers, and allows you to build the desired routes within less than 15 milliseconds. At the same time, the system allows you to enter your own coordinates, which are considered when building routes.