Shortest time path planning method capable of predicting dynamic space-time environment

Abstract

The invention belongs to the technical field of geographic information systems, and discloses a shortest time path planning method capable of predicting a dynamic space-time environment, which comprises the following steps of: 1, quantifying various environmental factors influencing the advancing speed; 2, comprehensively evaluating the influence of various environment factors on the advancing speed, and constructing a dynamic space-time environment influence rule expression model capable of expressing the whole space-time environment according to the environment influence expression rule of any space at any moment; and 3, on the basis of the constructed dynamic space-time environment influence rule expression model, evaluating the consumed time of linear movement between any two adjacentpoints, and on the basis, planning a continuous movement track from a starting point to a target point according to the principle of minimum cost by adopting a path search algorithm and taking the time as cost. According to the invention, the path planning result can reflect the dynamic influence in the continuous change process of the environment, and the operation burden is not significantly increased.

Description

technical field [0001] The invention belongs to the technical field of geographic information systems, and in particular relates to a shortest time path planning method capable of predicting a dynamic space-time environment. Background technique [0002] The shortest time path planning is an important GIS (Geographic Information System) research, its purpose is to find the shortest time path planning method that can be reached between two points in geographic space. The shortest time has a wide range of applications, especially in road construction problems and military off-road problems. [0003] The shortest time referred to in the present invention refers to the earliest time at which a road can be planned to arrive at the destination starting from the zero moment of planning. The paths selected by different planning schemes are different, and the environment and the corresponding distance length are different, which will affect the final arrival time. Therefore, the nec...

AI Technical Summary

Problems solved by technology

[0007] The present invention aims at the problem that neither the traditional static environment evaluation expression method nor the dynamic adjustment method can cope with the global optimization problem of this kind of environment that changes continuously with time, and cannot meet the requirements of modern applications for fine calculation, and proposes a predictable dynamic space-time Environment shortest time path planning method

Images