Resumen
The article deals with algorithm for linking the coordinates of an object to a road graph. Similar algorithms are used in every application due to the widespread use of electronic devices. Such algorithms may have some inaccuracies, which makes it difficult to determine the exact location of the object. In this paper, we search for the reasons for the inaccuracies of the algorithm using previously existing approaches, and propose an algorithm that eliminates some inaccuracies and time delays. The presented algorithm has estimates of similarity, proximity, and orientation. For the estimates, methods are considered that allow you to determine the location on each graph more accurately and quickly. The formulas for finding the exact GPS-coordinates which are used in this algorithm are presented. All the data obtained were compared with the reference solution. The algorithm showed the greatest improvement - 90% - that occurred during the turn. Previously, the maximum position error was 88 m, while the solution of the new algorithm differed only by 8 m from the reference trajectory. Studies have shown that the data received from the GPS receiver coincides almost everywhere with the road graph. The proposed algorithm showed improvements of an average of 50% compared to the algorithm, which is based on previously existing approaches. The algorithm works well even with relatively poor or busy GPS data. The algorithm in question was implemented in C# using the platform .NET and Unity3D, as well as Visual Studio development environments