Device for displaying road navigation track

Abstract

The invention relates to a device for providing road navigation road, especially a road traffic controller, wherein the electric map of its data memory contains the inlet top point from each cross road into said road and the road arc record relative to the inlet top point with steering limit character; the main controller controls the map edit modifier, based on the steering limit information at each port of cross road provided by the input module, to modify the road arc data of relative inlet top point of electric map; and the receiver / sender receives present position and target position information, to send the navigation path to the carrier terminal; the searcher extracts the electric map data and uses the steering limit character of each road arc to use the Di jkStra algorism to calculate out the shortest navigation path in top point serial type.

Description

Technical field [0001] The invention relates to a road traffic control device for transmitting navigation instructions to vehicles. technical background [0002] The currently reported navigation center device that provides road navigation paths for vehicles is equipped with a computer-based main controller, which is used to receive the current location and destination information of the vehicle provided by the vehicle terminal and send and receive the navigation path data to the vehicle terminal Finder, data storage with electronic map, searcher. The transceiver will receive the vehicle’s current location and destination information provided by the vehicle terminal and forward it to the main controller. Under the control of the main controller, the searcher extracts the electronic map data of the data memory and calculates the road node sequence form according to the vehicle’s current location and destination. After the navigation path data is submitted to the main controller; u...

AI Technical Summary

Problems solved by technology

Because according to the generation process of the above-mentioned DijkStra algorithm, vertex S->vertex P->vertex A->vertex O must be the shortest path from the starting point S to the ending point O, that is, the previous point of the vertex O must be the vertex during the calculation process A, so that when the calculation is completed and the path is traced back, it is impossible to obtain a more realistic shortest path vertex S->vertex P->vertex B->vertex O->vertex D->vertex Q->vertex E

Because the existing reported navigation center device that provides road navigation paths for vehicles cannot deal with the search problem of the shortest road navigation path that prohibits turning restrictions, it cannot meet the traffic control requirements that often occur at road intersections in real life. Provide vehicles with the shortest navigation path on the road

Images