KR960007840B1 - Method for displaying the shortest distance in navigation apparatus - Google Patents

Abstract

The method displays the shortest distance from a departure to a destination on a digitized map in a geometry information system(GIS) by using a database including information of cross points. It comprises the steps of: determining the departure(Cox,Coy) and the destination(Cnx,Cny); initializing a start cross point(Ci); obtaining a tangent from the departure(Cox,Coy) to the destination(Cnx,Cny); selecting a group of cross points(Cj), which may be passed through, from the start cross point(Ci); obtaining a tangent from the selected cross point(Cj) to the destination(Cnx,Cny); determining if the selected cross point is the shortest to the destination; obtaining other tangent by incrementing the coordinate value(j) if the selected cross point is not the shortest to the destination; connecting a line between the departure and the selected cross point; determining if the selected cross point is the destination.

Description

How to display the shortest distance for vehicle autopilot

1 is an exemplary diagram of a digital road map.

2 is a flowchart illustrating the shortest distance display method of the present invention.

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a vehicle autonomous navigation apparatus in a geometry information system (hereinafter referred to as a GIS). In particular, the vehicle autonomous navigation system has a deadlock point in which the shortest distance from any starting point to a destination is optimized and optimized. The present invention relates to a method for displaying the shortest distance of an autonomous vehicle navigation system for displaying and guiding on a digital road map of a communication network.

In general, the autopilot displays only arithmetic operations for the straightest line segment distance from the starting point to the destination, which does not actually tell the driver which road to select.

That is, the existing algorithm does not measure and calculate the distance that the vehicle must actually move along the road, and displays only the linear distance from the starting point to the destination.

In addition, such a system does not provide information through a deadlock, which is the actual shortest distance, to a database built on a digital road map, thereby failing to provide guidance.

In view of such a conventional problem, the present invention is characterized in that the computer calculates and displays the fastest and most efficient road with only static data in the vehicle autonomous navigation device to the driver.

That is, by constructing a database of the intersections of the digital road map and the communication network about the roads, it is possible to distinguish the roads between the deadlocks displayed on one screen, and select the roads between the deadlocks displayed on the screen. It is made possible to display.

When described in detail with reference to the drawings as follows.

Assuming that the database of the digital road map for the present invention is composed of the dead point Ci and its communication network Nij as shown in FIG. 1, the starting point Cox, Coy at the destination Cnx, Cny The slope of the line segment up to

Becomes

In other words, the selection of the first deadlock point (C ₁ x, C ₁ y) connected from the starting point (Cox, Coy) to the next network to be passed is determined by the starting point (Cox, Coy) and the network connection possible deadlock point (Ci). to a line segment slope closest to interweave points (C ₁₎ by selecting, in the same way the second standoff point (C2) of the first standoff point (C ₁₎ destination among possible deadlock point (Cij) passing in (Cnx, Cny) It is necessary to select a deadlock point _where the slope of M _1-n is most similar to the slope of.

If you keep repeating this to the destination (Cnx, Cny), you can see the actual shortest road from the starting point (Cox, Coy) to the destination (Cnx, Cny) with a networked database between the deadlock and the deadlock, This can be provided graphically to the driver.

For example, the slope similar to the slope M _1-n from the second deadlock point C ₂ to the destination Cnx, Cny among the network connection traversable dead ends C ₂₁ , C ₂₂ , C ₂₃ , C ₂₄ . The deadlock point is C ₂₁ , and this deadlock point C ₂₁ becomes the third deadlock point C ₃ .

When the operation is shown in a flow chart, as shown in FIG. 2, a step S ₁ of determining a starting point Cox, Coy and a destination Cnx, Cny and a value of the determined starting deadlock Ci are set to zero. Initializing by S2; Obtaining a slope M _in from the starting point to the destination S ₃ ; Selecting a network connection passable deadlock point Cj from the deadlock point Ci to obtain a deadlock point in a traveling direction among the deadlock points S ₄ and S ₄ ; Initializing by setting the value of the selected deadlock point Cj to 0 (S ₅ ), and obtaining a slope M _ij from the deadlock point to the destination (S ₆ ); Investigating whether the deadlock point obtained in the step (S ₆ ) is the shortest distance to the destination (S ₇ ), and if it is not the shortest distance, increasing the coordinate value (j) of the deadlock point to obtain the slope of another dead point ( S ₈ ) and; Step S ₉ connecting the starting point to the deadlock in the case of the shortest distance; Determining whether the connected deadlock is a destination (S ₁₀ ), and if the destination is not the destination, and if the destination is not the destination to increase the coordinate value (i) of the deadlock to obtain the next deadlock, the step (S) _3- S ₁₀ ) to repeat the step (S ₁₁ ) to perform sequentially.

As described in detail above, the present invention can directly calculate the distance that the vehicle should actually travel by using a database of maps, and thus, calculate and display the available distance with respect to the remaining fuel amount. There is an effect that can be provided as basic data that facilitates the development into a guidance system.

Claims (1)

Determining a starting point (Cox, Coy) and a destination (Cnx, Cny) (S1), and initializing by setting the value of the determined starting point deadlock (Ci) to 0 (S ₂ ); Step S3 of obtaining the slope Mi-n from the starting point to the destination, and selecting a group of possible interworking dead points Cj at the intersecting point Ci to obtain a dead point in the traveling direction among them (S4). )Wow ; Initializing by setting the value of the selected deadlock point Cj to 0 (S5); Obtaining a slope Mi-j from the deadlock to the destination (S6); Checking whether the deadlock obtained in the step S6 is the shortest distance to the destination (S7); If it is not the shortest distance, increasing the inter-coordinate j of the dead point to obtain the slope of another dead point (S8); Step S9 connecting lines from the starting point to the deadlock in the case of the shortest distance; Determining whether the connected deadlock is a destination (S10); If the destination is terminated, if the destination is not the destination to increase the coordinates (i) of the deadlock point to obtain the next deadlock, and then repeat the steps (S3-S10), perform the step (S11) Method for displaying the shortest distance of the vehicle automatic navigation device characterized in that.