KR100705140B1 - A method for searching the best path of vehicle using traffic information - Google Patents

Abstract

The present invention provides a route search method for a vehicle using traffic information, the method comprising: setting a driving destination of the vehicle; An electronic map data loading step of connecting the current starting point and the set destination; Calculating travel costs on each link on all routes connecting the starting point and the destination using the traffic information; A traffic cost calculation step of each path obtained by summing the traffic cost of each link calculated; A route searching step of the least cost of the entire route; A route storage step of least cost of travel; And a stored path display step.

Route, navigation, map, link, node

Description

A method for searching the best path of vehicle using traffic information}

1 is a flowchart of a route search method according to the present invention;

Figure 2 is a road speed traffic speed table of the route search method according to the present invention.

3 is a correlation graph between link traffic speed and traffic information weight according to the present invention;

Figure 4a is a diagram illustrating a route search without traffic information.

Figure 4b is an exemplary route search reflected traffic information.

The present invention relates to a route search method of a vehicle using traffic information, and more particularly, a route of a vehicle using traffic information that allows the route search to be performed using the surrounding traffic information when searching for a route from a vehicle starting point to a destination. To search methods.

In the conventional methods of searching for a driving route of a vehicle using traffic information around a vehicle, a route search except for a link of a congestion section having a low communication speed has been performed. That is, the search was performed only as a path in which the driving path search of the vehicle simply bypasses the congestion section.

Therefore, excessive rotation, that is, left / right turns may occur when the vehicle is driven by the path searched through the prior art, and the driving is performed in the searched bypass path, so that driving on a narrow road is often performed, resulting in inconvenience in driving.

The present invention has been made to solve the problems of the prior art, an object of the present invention is to search for a route from the starting point to the destination by a route other than a simple bypass when a traffic congestion occurs while using the traffic information of the surroundings when searching the driving route of the vehicle It is to provide a route search method of the vehicle using the traffic information to be made.

In order to achieve the above object, the route search method according to the present invention comprises: a driving destination setting step of a vehicle; An electronic map data loading step of connecting the current starting point and the set destination; Calculating travel costs on each link on all routes connecting the starting point and the destination using the traffic information; A traffic cost calculation step of each path obtained by summing the traffic cost of each link calculated; A route searching step of the least cost of the entire route; A route storage step of least cost of travel; And a stored path display step.

delete

delete

delete

delete

delete

delete

delete

Hereinafter, with reference to the drawings will be described a preferred embodiment according to the present invention.

A route search method for a vehicle using traffic information according to the present embodiment will be described with reference to FIG. 1.

As shown in FIG. 1, in the vehicle route searching method according to the present embodiment, when a driver sets a driving destination [S10], an electronic map, that is, a route from a starting point to a destination is connected to a node (intersection point) and a link (intersection). Map data represented by the intersection of the intersections) is loaded [S20].

After the electronic map data is loaded in step S20, the calculation of the travel cost of each link on each route is performed in order to calculate the travel costs on all routes from the starting point to the destination based on the surrounding traffic information from the starting point to the destination. This is done [S30]. In addition, the traffic cost of each path is calculated through the sum of the traffic costs of each link in each path calculated in step S30 [S40]. Computation of the travel cost of each link in each of the paths in steps S30 and S40 and the calculation of the travel cost in each path through the sum of the calculated travel costs of each link are performed as follows.

First, a method of calculating a travel cost in each route among all routes from a departure point to a destination is expressed by Equation 1 below.

Total Cost = Link Cost + Turn Cost + Signal Cost + Road Change Cost

In the above,

Link costs are distances converted from the cost of going through each link (intersections and intersections).

Turn cost is the distance converted from the cost of turning left and right at the intersection.

Signal cost is the distance converted from the cost of traffic light at the intersection

The road class change cost refers to a value obtained by converting a road class, that is, the cost of changing a highway, a national road, and a local road into a distance.

In Equation 1, the most influential speed of the vehicle is the link cost. That is, a method of calculating a travel cost of each link (intersection and intersection road) on each path is shown in Equation 2 below.

Link Cost = Link Length × Driver Weight × Road Type Weight × Link Type Weight × Traffic Weight

In the above,

Link length is the length of the connecting road between intersections

Number of lanes on lanes

Road classification is road grade

Link type means road characteristics such as a connecting road and a ramp ramp.

For reference, in Equation 2, the weight values of the car, road, and link types are stored using the data stored on the electronic map, that is, the weight values stored according to the car, road, and link types, respectively.

Meanwhile, the traffic information weight not described in Equation 2 is calculated in the same manner as Equation 3 below.

Ⅰ) When there is no traffic information of link [road without traffic information such as national road]

Traffic weight (Wti) = 1

Ii) When there is traffic information of link [road with traffic information]

Traffic information weight (Wti) = Vd / Vmin (V <Vmin)

                       Vd / V (Vmin ≤V ≤Vmax)

                       Vd / Vmax (V> Vmax)

In the above,

V: Current traffic speed of the link

Vd: Standard speed by road type of link

Vmin: Lower limit of the speed of communication on the link (road)

Vmax: Upper limit of the speed of traffic on the link (road)

For reference, Vd, Vmin, and Vmax values according to the road type (grade) in Equation 3 are set to the same values as in FIG. 2, but are not limited thereto.

And, as shown in Figure 3, the traffic information weight described in Equation 3 is, if the current traffic speed (V) of the link is small, the traffic information weight (Wti) becomes large, while the current traffic speed of the link ( As V) increases, the traffic information weight Wti becomes small, so that the link cost of a link (road) with a high communication speed (V) becomes small, so that a route search for avoiding congestion is possible.

That is, returning to the flow chart of FIG. 1 again, after calculating the travel cost of each route in step S40, after searching for the route with the least travel cost among all the routes, storing and displaying the searched route, the congestion section is displayed. The optimal path search avoided is made [S50 ~ S70].

An example of route search using the above method is illustrated in FIG. 4B, and FIG. 4A is an example of route search without traffic information according to the present embodiment. For reference, in FIGS. 4A and 4B, 'green' means a smooth communication section, 'orange' means a slow motion section, and 'red' means a congestion section.

As shown, in the route search from the origin (out) to the destination (Thurs), the route search shown in FIG. 4A without traffic information according to the present embodiment indicates that there is a severe red section. As shown in FIG. 4B, the route search according to the present embodiment shown in FIG. 4B has eliminated many congestion sections of 'red', and also, from the starting point (outbound) to the destination (Thu) rather than the simple bypass route shown in FIG. 4A. You can see that the path to) has been searched again.

As described above, in the present invention, after calculating the traffic information of the vehicle, that is, the traveling costs of all the driving routes from the starting point of the vehicle to the target point, respectively, the search is performed by the driving route having the least traveling cost. By searching for a new route from the starting point to the target point rather than a simple bypass in the congestion section, the search is performed to the route with less congestion as a whole without excessive left and right turns when driving.

In interpreting the technical scope of the present invention, it should not be construed as being limited to the embodiments described above, and the technical scope of the present invention should be determined by reasonable interpretation of the matters described in the claims.

According to the route search method of the vehicle using the traffic information of the present invention, since the search is performed by the route with less congestion as a whole without excessive left and right turns during the optimal route search of the vehicle, it is possible to effectively avoid congestion. There is an effect of improving the merchandise of the vehicle model equipped with the applied navigation.

Claims (6)

In the route search method using the surrounding traffic information when searching the driving route of the vehicle, Setting a driving destination of the vehicle; An electronic map data loading step of connecting the current starting point and the set destination; Calculating travel costs on all routes connecting the starting point and the destination using the traffic information; Calculating a travel cost of each route by adding the calculated travel costs on all routes in each route unit; A route searching step of the least cost of each route in the entire route; A route storing step of having the least passage cost of each route; And It consists of a saved route display step, The passage cost of each route mentioned above, Toll cost = link cost + turn cost + signal cost + road class change cost for each route. In the above, Link costs are the distances in terms of the cost of going through each link. Turn cost is the distance converted from the cost of turning left and right at the intersection. Signal cost is the distance converted from the cost of traffic light at the intersection Road class change cost is the distance converted from the cost of road class change. Route search method of a vehicle using the traffic information, characterized in that. According to claim 1, In order to use the traffic information, Receiving surrounding traffic information between a starting point and a destination of the vehicle; Storing the received surrounding traffic information on a memory; And The method of claim 1, further comprising accessing the stored traffic information. delete The method of claim 1, Each link cost is Link cost = link length × driver weight × road type weight × link type weight × traffic weight In the above, Link length is the length of the connecting road between intersections Number of lanes on lanes Road classification is road grade Link type is characteristic of road such as connecting road and ramp ramp Route search method of a vehicle using the traffic information, characterized in that. The method of claim 4, wherein The weight of each vehicle and the road type and the link type for calculating the link cost is calculated by using data stored on the electronic map. The method of claim 4, wherein Traffic information weight for each link cost calculation, (Iii) When there is no traffic information of link Traffic weight (Wti) = 1 (Ii) When there is traffic information of link Traffic information weight (Wti) = Vd / Vmin (V <Vmin)                        Vd / V (Vmin ≤V ≤Vmax)                        Vd / Vmax (V> Vmax) In the above, V: current traffic speed of the link Vd: reference speed by road type of link Vmin: Lower limit of communication speed Vmax: upper limit of the speed of communication Route search method of a vehicle using the traffic information, characterized in that.

Images