ROUTE SEARCHING METHOD OF NAVIGATION SYSTEM AND APPARATUS THEREFOR

• US 20150153189A1
• Filed: 07/01/2014
• Published: 06/04/2015
• Est. Priority Date: 12/03/2013
• Status: Active Grant

• Current Assignee: Hyundai Motor Company (Hyundai Motor Group)
• Original Assignee: Hyundai Motor Company (Hyundai Motor Group)
• Inventors: Kim, Chi Hwan
• Granted Patent: US 9,671,240 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G01C 21/3453 Special cost functions, i.e. other than distance or default speed limit of road segments

Abstract

A route searching method of a navigation system is provided and includes calculating, by a processor, a turning cost from an i-th node to an (i+1)-th node and a turning cost from the (i+1)-th node to an (i+2)-th node. The processor determines whether the turning costs are different between the sets of nodes . In addition, the processor calculates a driving risk degree from the i-th node to the (i+1)-th node when the turning direction from the i-th node to the (i+1)-th node is different from the turning direction from the (i+1)-th node to the (i+2)-th node.

Claims

1. A route searching method of a navigation system, comprising:

calculating, by a processor, a turning cost from an i-th node to an (i+1)-th node;

calculating, by the processor, a turning cost from the (i+1)-th node to an (i+2)-th node;

determining, by the processor, whether the turning cost from the i-th node to the (i+1)-th node is different from the turning cost from the (i+1)-th node to the (i+2)-th node;

determining, by the processor, whether the turning direction from the i-th node to the (i+1)-th node is different from the turning direction from the (i+1)-th node to the (i+2)-th node when the turning cost from the i-th node to the (i+1)-th node is different from the turning cost from the (i+1)-th node to the (i+2)-th node; and

calculating, by the processor, a driving risk degree from the i-th node to the (i+1)-th node when the turning direction from the i-th node to the (i+1)-th node is different from the turning direction from the (i+1)-th node to the (i+2)-th node.

2. The route searching method of claim 1, further comprising, after calculating the driving risk degree from the i-th node to the (i+1)-th node when the turning direction from the i-th node to the (i+1)-th node is different from the turning direction from the (i+1)-th node to the (i+2)-th node, re-calculating, by the processor, the turning cost from the i-th node to the (i+1)-th node after 1 is added to i.

3. The route searching method of claim 2, further comprising, after the calculating the driving risk degree from the i-th node to the (i+1)-th node when the turning direction from the i-th node to the (i+1)-th node is different from the turning direction from the (i+1)-th node to the (i+2)-th node, excluding, by the processor, the route from the (i+1)-th node to the (i+2)-th node from route searching when the driving risk degree from the i-th node to the (i+1)-th node is greater than a predetermined reference value.

4. The route searching method of claim 3, further comprising:

after the excluding the route from the (i+1)-th node to the (i+2)-th node from the route searching when the driving risk degree from the i-th node to the (i+1)-th node is greater than the predetermined reference value,

storing, by the processor, the route from the (i+1)-th node to the (i+2)-th node in a memory;

determining, by the processor, whether a vehicle is being driven toward the route from the (i+1)-th node to the (i+2)-th node; and

increasing, by the processor, the predetermined reference value when the vehicle is being driven toward the route from the (i+1)-th node to the (i+2)-th node.

5. The route searching method of claim 1, further comprising:

after the calculating the driving risk degree from the i-th node to the (i+1)-th node when the turning direction from the i-th node to the (i+1)-th node is different from the turning direction from the (i+1)-th node to the (i+2)-th node,

storing, by the processor, the route from the (i+1)-th node to the (i+2)-th node in a memory when the driving risk degree from the i-th node to the (i+1)-th node is less than the predetermined reference value;

determining, by the processor, whether the vehicle is being driven toward the route from the (i+1)-th node to the (i+2)-th node; and

decreasing, by the processor, the predetermined reference value when the vehicle is not being driven toward the route from the (i+1)-th node to the (i+2)-th node.

6. The route searching method of claim 1, wherein the driving risk degree is calculated by multiplying the number of lanes between the (i+1)-th and (i+2)-th nodes by a road speed limit or road grade and then dividing the distance between the (i+1)-th and (i+2)-th nodes into the multiplied value.

7. The route searching method of claim 6, wherein the number of lanes is the number of lanes on an actual road or the number of lanes required to move to a next point along the route.

8. The route searching method of claim 6, wherein a weight value is applied to the number of lanes, the road speed limit, the road grade, or the distance.

9. A route searching apparatus of a navigation system, comprising:

a memory configured to store program instructions; and

a processor configured to execute the program instructions, the program instructions when executed configured to;

produce nodes on a route between a starting point and a destination of a vehicle;

calculate turning costs between the produced nodes produced;

calculate turning directions between the produced nodes;

calculate a driving risk degree, using the calculated turning directions and the calculated turning costs;

compare whether the calculated driving risk degree is greater than or less than a predetermined reference value; and

determine nodes to be excluded from the nodes between the route between the starting point and the destination of the vehicle, based on the comparison,

wherein, the predetermined reference value of the route between the excluded nodes is increased when the vehicle is driven toward the route between the corresponding nodes when the driving risk degree is greater than the predetermined reference value by comparing an actual driving route of the vehicle with a route provided from the navigation system, and

wherein the predetermined reference value of a route between the nodes except the excluded nodes is decreased even though the driving risk degree is greater than the predetermined reference value.

10. A non-transitory computer readable medium containing program instructions executed by a processor, the computer readable medium comprising:

program instructions that produce nodes on a route between a starting point and a destination of a vehicle;

program instructions that calculate turning costs between the produced nodes produced;

program instructions that calculate turning directions between the produced nodes;

program instructions that calculate a driving risk degree, using the calculated turning directions and the calculated turning costs;

program instructions that compare whether the calculated driving risk degree is greater than or less than a predetermined reference value; and

program instructions that determine nodes to be excluded from the nodes between the route between the starting point and the destination of the vehicle, based on the comparison,

wherein, the predetermined reference value of the route between the excluded nodes is increased when the vehicle is driven toward the route between the corresponding nodes when the driving risk degree is greater than the predetermined reference value by comparing an actual driving route of the vehicle with a route provided from the navigation system, and

wherein the predetermined reference value of a route between the nodes except the excluded nodes is decreased even though the driving risk degree is greater than the predetermined reference value.