FINDING THE OPTIMAL PATH IN AN ENVIRONMENT WITH STATIC AND DYNAMIC OBSTACLES

Abstract

The problem of transport routing in dynamically changing environments has been studied for many years. The construction of the optimal path-finding problem is essential in reality. Especially, when the delivery cost tends to increase steadily and is often equal to the cost of goods. The study highlights that the minimum delivery time is considered the optimization criterion, not the travel distance as in most previous research works. We have used the optical-geometric method proposed by the authors A.L.Kazakov and A.A.Lempert to develop the application, based on the similarity between light propagation in optically heterogeneous environments. This paper proposes an algorithm for constructing routes that avoid static and dynamic obstacles in environments with many changes. Several computational test models have been implemented, showing the effectiveness of the proposed modeling tools and algorithms.