JP2012013604A - Navigation system - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a navigation system capable of presenting a summary facilitating the acquisition of the whole image of a route without limiting a guide display or a voice-guided node to a certain zone.SOLUTION: A control unit 7 includes: a route searching section 71 searching a route from a present position of a mobile body to a destination input via an input section based on map information; and a route summary section 72 selecting the arbitrary number of nodes from nodes presenting on the searched route and creating a summary of the searched route. The route summary section 72 includes a node calculation part 73 which refers to an evaluation value set to each node to select the summary node (a node n), subtracts a prescribed value from the evaluation value of a node (an object node A) located in the periphery of the summary node and then selects a next summary node.

Description

  The present invention relates to a navigation system that displays a summary of a route obtained as a result of route search on a screen or provides voice guidance.

  Currently, in a general navigation system, when a route search to a destination is performed, the route selected by the search is highlighted on the map on the display screen, and simple voice guidance such as the estimated time to arrival at the destination. Is made. In this case, when the destination is far away, the user needs to move the map on the display screen by operating the movement direction key or the like to trace the route or to reduce the scale of the map in order to know the outline of the entire route. is there. However, the method of moving the map on the display screen has a problem that it requires a complicated key operation and takes time. In addition, when the map scale is reduced, the content displayed on the display screen becomes coarse, and there is a problem in which it may not be understood where to pass.

  As a countermeasure, in Patent Document 1, a node with a low evaluation value is deleted from all nodes existing on the selected route, and a certain number (for example, 10) nodes with a high evaluation value are displayed on the screen. Alternatively, a voice guidance method is disclosed.

Japanese Patent No. 3196308

  However, in the method disclosed in Patent Document 1 described above, once a route search is performed, the evaluation value set for each node becomes a fixed value, and nodes with a high evaluation value are gathered in a certain area on the selected route. When there is a node, guidance-displayed or voice-guided nodes are also fixed in a certain area, and there is a problem that the entire route cannot be understood.

  The present invention has been made to solve the above-described problems. When presenting a route search result (route summary), a route displayed without guidance or voice guidance is not fixed in a certain area. It is an object of the present invention to provide a navigation system capable of presenting a summary that makes it easy to grasp the overall picture of the system.

  The present invention relates to a position detection unit that detects a current position of a moving body, a storage unit that stores map information including nodes and links, an input unit that receives a user operation, and an input unit from the current position of the moving body. A route search unit that searches for a route to an input destination point based on map information, and a route summary that creates a summary of the searched route by selecting an arbitrary number of nodes from the nodes present on the searched route In the navigation system, the route summarizing unit includes a node that displays a summary of the route created by the route summarizing unit, and a voice output unit that provides voice guidance for the summary of the route created by the route summarizing unit. A node calculation unit that selects a summarization node with reference to the evaluation value set in step S3, subtracts a predetermined value from the evaluation value of a node located around the summarization node, and then selects the next summarization node. One in which was configured to obtain.

  According to the present invention, a summary node is selected with reference to the evaluation value set for each node, a predetermined value is subtracted from evaluation values of nodes located around the summary node, and then the next summary node is selected. It is possible to reduce the evaluation value of the node located in the vicinity of the summary node so that it is difficult to be selected as the next summary node, and the summary node is fixed in a certain area. Can be prevented. This makes it possible to provide a route summary that makes it easy to grasp the overall image of the route.

1 is a block diagram illustrating a configuration of a navigation system according to Embodiment 1. FIG. 3 is a block diagram illustrating a configuration of a control unit according to Embodiment 1. FIG. It is explanatory drawing which shows a route search result. 6 is a flowchart illustrating an operation of a route summarizing unit according to the first embodiment. FIG. 10 is an explanatory diagram illustrating a node selection process result according to the first embodiment. FIG. 10 is an explanatory diagram illustrating a node selection process result according to the first embodiment. FIG. 10 is an explanatory diagram illustrating a node selection process result according to the first embodiment. FIG. 10 is an explanatory diagram illustrating a node selection process result according to the first embodiment. 6 is an explanatory diagram illustrating a display example of a summary of a searched route according to Embodiment 1. FIG. 6 is an explanatory diagram illustrating an example of a voice output of a summary of a search route according to Embodiment 1. FIG. It is explanatory drawing which shows an example of the subtraction value based on the distance between nodes by Embodiment 2. 10 is a flowchart illustrating an operation of a route summarizing unit according to the second embodiment. FIG. 10 is an explanatory diagram showing a node selection process result according to the second embodiment. FIG. 10 is an explanatory diagram showing a node selection process result according to the second embodiment. FIG. 10 is an explanatory diagram showing a node selection process result according to the second embodiment. FIG. 10 is an explanatory diagram showing a node selection process result according to the second embodiment. 10 is a block diagram illustrating a configuration of a control unit according to Embodiment 3. FIG. It is explanatory drawing which shows an example of the subtraction value based on the distance between the nodes by Embodiment 3. 10 is a flowchart illustrating an operation of a route summarizing unit according to the third embodiment. FIG. 10 is a block diagram illustrating a configuration of a control unit according to a fourth embodiment. It is explanatory drawing which shows an example of the subtraction value based on the distance between the nodes by Embodiment 4. 10 is a flowchart illustrating an operation of a route summarizing unit according to the fourth embodiment.

FIG. 1 is a block diagram showing a configuration of a navigation system according to the first embodiment.
The navigation system 10 is used by being mounted on a vehicle, and includes a position detection unit 1, a media interface unit 2, a storage unit 3, an input unit 4, a display unit 5, a speaker (audio output unit) 6, and a control unit 7. Yes.
The position detection unit 1 includes a GPS, a direction sensor, a vehicle speed sensor, and the like, and detects a current position and a traveling direction of the vehicle. The media interface unit 2 outputs data such as video and audio. It consists of broadcasting, wireless antennas, Blu-ray, DVD and other disk drives, memory card drives, or portable music player interfaces.

The storage unit 3 includes a storage medium such as a hard disk and driving means thereof, and stores data such as a CPU control program, map information, a voice guidance database, video and voice. Further, in the map information stored in the storage unit 3, an evaluation value is set as information for each map-like node. This evaluation value is determined based on various factors such as the type of road such as an expressway, a national road, a prefectural road, and a city road, the width of the road, and the traffic volume. Further, as a result of the route search, a certain value is added to the evaluation value of the node such as an intersection that becomes an entrance and an intersection that makes a right or left turn.
The input unit 4 includes an operation panel, a screen touch panel, a remote control receiving unit, and the like, and receives an input instruction from a user. The display unit 5 displays the map, the searched guide route, and the video resource as images. The speaker 6 performs voice guidance and voice output of music resources.

  The control unit 7 is mainly composed of, for example, a CPU, a RAM, a ROM, etc., and performs calculations such as specifying the current location and route search, and controls peripheral blocks such as map display, voice guidance, video / voice switching, The entire navigation system 10 is controlled. FIG. 2 is a block diagram showing a functional configuration of the control unit in the navigation system of the first embodiment. The control unit 7 includes a route summarizing unit 72 having a route searching unit 71, a node calculating unit 73, and a distance calculating unit 74.

  The route search unit 71 searches for a route from the current location detected by the position detection unit 1 to the destination designated by the user via the input unit 4. The route summarizing unit 72 creates a summary of the route from the current location searched for by the route searching unit 71 to the destination. The node calculation unit 73 selects the node having the highest evaluation value or the target node, and performs subtraction of the evaluation value of each node. The distance calculation unit 74 calculates the distance between nodes.

FIG. 3 shows the route searched by the route search unit 71.
When the current location X is input from the position detection unit 1 and the destination Y is input from the input unit 4, a route from the current location X to the destination Y via a plurality of nodes N01 to N18 as shown in FIG. Explored. Each node N01 to N18 has an evaluation value. For example, the node N01 has an evaluation value “10”, the node N02 has an evaluation value “8”, the node N03 has an evaluation value “15”,. The evaluation value is “12”. A node that is an interchange or an intersection is set to have a high evaluation value by adding a constant value to the evaluation value.

Next, processing for summarizing the route searched by the route search unit 71 will be described in detail.
For example, when the search result shown in FIG. 3 is calculated and five nodes are selected from a plurality of nodes constituting the search route to create a summary of the search route, the node N08 is simply selected by selecting a node having a high evaluation value. , Node N09, node N10, node N12, and node N13 are selected, and a summary using nodes in the biased area is created. Therefore, the node calculation unit 73 of the route summarizing unit 72 subtracts the evaluation value of the node according to a predetermined rule, thereby creating a summary of the search route without any bias.

FIG. 4 is a flowchart showing the operation of the route summarizing unit of the navigation system according to the first embodiment. The operation of creating a search route summary will be described with reference to the flowchart of FIG.
The node calculating unit 73 of the route summarizing unit 72 selects the node n having the highest evaluation value from all the nodes m included in the search result acquired from the route searching unit 71, and excludes the selected node n from all the nodes m. (Step ST1). Further, the target node A is selected from all target nodes (mn) excluding the node n (step ST2). The distance calculation unit 74 calculates the distance between the node n and the target node A, and whether the calculated distance by the node calculation unit 73 is 1/10 or less of the total distance from the current location X to the destination Y. It is determined whether or not (step ST3). In addition, the ratio with respect to the distance of the whole path | route does not necessarily need to be 1/10, and can be changed suitably.

  If it is determined in step ST3 that the distance is 1/10 or less, the node calculation unit 73 subtracts “5” from the evaluation value of the target node A (step ST4). When the evaluation value before subtraction is “5” or less, the evaluation value is “0”. Further, the evaluation value subtracted in step ST4 is held so as not to return to the original value until at least all the nodes that create the summary of the search route are selected. The node calculation unit 73 determines whether or not the determination process in step ST3 has been performed for all target nodes (mn) (step ST4). If it is determined in step ST4 that determination processing has not been performed for all target nodes (mn), the process returns to step ST2, and it is determined that determination processing has been performed for all target nodes (mn). If YES, the process proceeds to step ST6.

  Next, it is determined whether or not the node calculation unit 73 has selected five nodes n having a high evaluation value (step ST6). If it is determined that all five nodes have been selected, the process ends. On the other hand, if it is determined that all five nodes have not been selected, all the target nodes (mn) in step ST5 are set as target nodes m, and the process returns to step ST1 to repeat the above-described process.

Next, the processing operation shown in the flowchart of FIG. 4 will be described with a specific example. Assume that the route shown in FIG. 3 is searched by the route search unit 71, and FIGS. 5 to 8 show specific processing results. The route summarization process will be described in order in five steps.
<First processing>
As step ST1, the node n (N10) having the highest evaluation value is selected from all the target nodes (N01 to N18) in FIG. 3, and the node N10 is excluded from the target nodes. Further, the target node A is selected from all target nodes (mn) (N01 to 09, N11 to N18) excluding the node N10. As step ST3, the distance between the node N10 and the target node A (N01 to 09, N11 to N18) is calculated, and it is determined whether or not the calculated distance is 1/10 or less of the distance of the entire route. As shown in FIG. 5, in this example, it is determined that the target node A (N08, N09, N11, N12) is 1/10 or less, and the evaluation value is subtracted by 5 in step ST4.

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to 09, N11 to N18), and the process proceeds to step ST6. Here, since the node n is not selected, the process returns to step ST1. FIG. 5 shows the evaluation value of each node after the end of the first process. In FIG. 5, node N10 has the highest evaluation value and is the node selected for use in summarization. Further, the evaluation value “5” is subtracted from the nodes N08, N09, N11, and N12.

<Second processing>
Again, as step ST1, the node n (N13) having the highest evaluation value is selected from all the target nodes excluding the node N10, and the node N13 is excluded from the target nodes. Further, the target node A is selected from all the target nodes (mn) excluding the node N13 (N01 to 09, N11, N12, and N14 to N18). As step ST3, the distance between the node N13 and the target node A (N01-09, N11, N12, N14-N18) is calculated, and it is determined whether or not the calculated distance is 1/10 or less of the distance of the entire route. To do. As shown in FIG. 6, in this example, it is determined that the target node A (N12, N14, N15) is 1/10 or less, and the evaluation value is subtracted by “5” as step ST4.

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to 09, N11, N12, and N14 to N18), and the process proceeds to step ST6. Here, since the node n is not selected, the process returns to step ST1. The evaluation value of each node after the end of the second process is shown in FIG. In FIG. 6, the node N13 has the highest evaluation value and is the node selected for use in the summary. In addition, the evaluation value “5” is subtracted from the nodes N12, N14, and N15.

<Third process>
Again, as step ST1, the node n (N04) having the highest evaluation value is selected from all the target nodes excluding the nodes N10 and N13, and the node N04 is excluded from the target nodes. Further, the target node A is selected from all target nodes (mn) (N01 to 03, N05 to 09, N11, N12, and N14 to N18) excluding the node N04. As step ST3, the distance between the node N04 and the target node A (N01-03, N05-09, N11, N12, N14-N18) is calculated, and the calculated distance is 1/10 or less of the entire route distance. It is determined whether or not. As shown in FIG. 7, in this example, it is determined that the target node A (N03, N05) is 1/10 or less, and the evaluation value is subtracted by “5” as step ST4.

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to 03, N05 to 09, N11, N12, and N14 to N18), and the process proceeds to step ST6. . Here, since the node n is not selected, the process returns to step ST1. The evaluation value of each node after the end of the third process is shown in FIG. In FIG. 7, node N04 has the highest evaluation value and is the node selected for use in summarization. In addition, the evaluation value “5” is subtracted from the nodes N03 and N05.

<4th process>
Again, as step ST1, the node n (N09) having the highest evaluation value is selected from all the target nodes excluding the nodes N04, N10, and N13, and the node N09 is excluded from the target nodes. Further, the target node A is selected from all the target nodes (mn) excluding the node N09 (N01 to 03, N05 to 08, N11, N12, and N14 to N18). As step ST3, the distance between the node N09 and the target node A (N01-03, N05-08, N11, N12, N14-N18) is calculated, and the calculated distance is 1/10 or less of the entire route distance. It is determined whether or not. As shown in FIG. 8, in this example, it is determined that the target node A (nodes N07, N08 and N11) is 1/10 or less, and the evaluation value is subtracted by “5” as step ST4.

  In step ST5, it is determined whether or not the determination process of step ST3 has been performed for all target nodes (mn) (N01 to 03, N05 to 08, N11, N12, and N14 to N18), and the process proceeds to step ST6. . Here, since the node n is not selected, the process returns to step ST1. FIG. 8 shows the evaluation value of each node after the completion of the fourth process. In FIG. 8, node N09 has the highest evaluation value and is the node selected for use in summarization. Further, the evaluation value “5” is subtracted from the nodes N07, N08, and N11.

<Fifth process>
The fifth node n (N17) with the highest evaluation value is selected and the same processing as described above is performed. As a result, five nodes n are selected, and the process ends through the determination process of step ST6.

  FIG. 9 shows a display example of the summary of the search route that passes through the selected node after the above five processes are completed. A summary node display frame 901 and a map display frame 902 are displayed on the display screen 900 of the display unit 5. The summary node display frame 901 includes a departure point name 903, an intersection name 904 of the node N04, an intersection name 905 of the node N10, an intersection name 906 of the node N11, an intersection name 907 of the node N13, an intersection name 908 of the node N17, and a destination name. 909 is displayed. The summary node display frame 901 may display a distance between each node, a required time, a road name, and a congestion state in addition to displaying the node. On the other hand, the map display frame 902 displays the route from the departure point to the destination via the summary node, and the route display is displayed so that the whole image of the route is clear without being biased to a predetermined range. Has been.

  FIG. 10 shows an example of the structure of a message when a summary of the searched route passing through the selected node is output from the speaker 6. Notifying that the route passes through the selected node N04, node N10, node N11, node N13, and node N17, and in the case of a node that is an intersection where a right turn or a left turn occurs, a notification of a right turn or a left turn is also given. .

  As described above, according to the first embodiment, the route summarizing unit 72 selects a node having a high evaluation value from all the nodes on the searched route, and the evaluation value of the node whose distance is close to the selected node. Therefore, it is difficult to select a node whose evaluation value is lowered, and it is possible to suppress the nodes selected as the summary of the search route from being concentrated in a certain area.

Embodiment 2. FIG.
In the first embodiment, a configuration is shown in which nodes with high evaluation values are selected in order, and the evaluation value of a node existing at a short distance from the selected nodes is temporarily lowered. However, in this second embodiment, as a summary, The structure which changes the ratio which subtracts an evaluation value according to the distance from the selected node is shown. Since the navigation system according to the second embodiment is the same as the configuration of the navigation system 10 and the control unit 7 according to the first embodiment shown in FIGS. 1 and 2, the description thereof will be omitted or simplified.
The distance calculation unit 74 calculates the distance between nodes. The node calculation unit 73 selects a node or a target node having the highest evaluation value and determines a subtraction value to be subtracted from the evaluation value of the target node A based on the distance calculated by the distance calculation unit 74.

  FIG. 11 shows an example of a subtraction value of the evaluation value with respect to the distance from the node n according to the second embodiment. In FIG. 11, the basic value to be subtracted from the evaluation value is “10”, and the subtraction value is decreased by “1” every time the distance n is 1/100 away from the node n having the highest evaluation value. If the subtraction result is negative, the evaluation value is “0”.

  FIG. 12 is a flowchart showing the operation of the route summarizing unit of the navigation system according to the second embodiment. The operation of creating a search route summary will be described with reference to the flowchart of FIG. 12, but the same steps as those in the navigation system according to the first embodiment are denoted by the same reference numerals as those used in FIG. Or simplify.

  In step ST3, when it is determined that the distance between the node n and the target node A is equal to or less than 1/10 of the total distance from the current location X to the destination Y, the node n calculated by the distance calculation unit 74 A subtraction value is calculated based on the distance to the target node A, and the subtraction value is subtracted from the evaluation value of the target node A (step ST11). In addition, the ratio with respect to the distance of the whole path | route does not necessarily need to be 1/10, and can be changed suitably. Further, the evaluation value subtracted in step ST11 is held so as not to return to the original value at least until all the nodes that create the summary of the search route are selected.

  The node calculation unit 73 determines whether or not the determination process of step ST3 has been performed for all target nodes (mn) (step ST5). If it is determined in step ST5 that the determination process has not been performed for all target nodes (mn), the process returns to step ST2, and it is determined that the determination process has been performed for all target nodes (mn). If so, the process proceeds to step ST6.

Next, the processing operation shown in the flowchart of FIG. 12 will be described with a specific example. It is assumed that the route shown in FIG. 3 has been searched by the route search unit 71, and specific processing results are shown in FIGS. The route summarization process will be described in order in five steps.
<First processing>
As step ST1, the node n (N10) having the highest evaluation value is selected from all the target nodes (N01 to N18) in FIG. 3, and the node N10 is excluded from the target nodes. As step ST2, the target node A is selected from all target nodes (mn) (N01 to 09, N11 to N18) excluding the node N10. As step ST3, the distance between the node N10 and the target node A (N01 to 09, N11 to N18) is calculated, and it is determined whether or not the calculated distance is 1/10 or less of the distance of the entire route. As shown in FIG. 13, in this example, it is determined that the target node A (N08, N09, N11, N12) is 1/10 or less. In step ST11, a subtraction value is calculated based on the distance between the node N10 calculated by the distance calculation unit 74 and the target node A (N08, N09, N11, N12), and evaluation of the target node A (N08, N09, N11, N12). Subtracts the subtraction value from the value.

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to 09, N11 to N18), and the process proceeds to step ST6. Here, since the node n is not selected, the process returns to step ST1. The evaluation value of each node after the end of the first process is shown in FIG. In FIG. 13, node N10 has the highest evaluation value and is the node selected for use in summarization. Further, the evaluation values of the nodes N09 and N11 are subtracted by “6”, and the evaluation values of the nodes N08 and N12 are subtracted by “2”.

<Second processing>
Again, as step ST1, the node n (N13) having the highest evaluation value is selected from all the target nodes excluding the node N10, and the node N13 is excluded from the target nodes. In step ST2, the target node A is selected from all target nodes (mn) (N01 to 09, N11, N12, N14 to N18) excluding the node N13. As step ST3, the distance between the node N13 and the target node A (N01-09, N11, N12, N14-N18) is calculated, and it is determined whether or not the calculated distance is 1/10 or less of the distance of the entire route. To do. As shown in FIG. 14, in this example, it is determined that the target node A (N12, N14, N15) is 1/10 or less. As step ST11, a subtraction value is calculated based on the distance between the node N13 calculated by the distance calculation unit 74 and the target node A (N12, N14, N15), and subtracted from the evaluation value of the target node A (N12, N14, N15). Subtract the value.

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to 09, N11, N12, and N14 to N18), and the process proceeds to step ST6. Here, since the node n is not selected, the process returns to step ST1. The evaluation value of each node after the end of the second process is shown in FIG. In FIG. 14, node N13 has the highest evaluation value and is the node selected for use in summarization. Further, the evaluation value of the node N14 is subtracted by “6”, the evaluation value of the node N12 is subtracted by “4”, and the evaluation value of the node 15 is subtracted by “2”.

<Third process>
Again, as step ST1, the node n (N08) having the highest evaluation value is selected from all the target nodes excluding the nodes N10 and N13, and the node N08 is excluded from the target nodes. In step ST2, the target node A is selected from all target nodes (mn) (N01 to 07, N09, N11, N12, and N14 to N18) excluding the node N08. In step ST3, it is determined whether or not the distance between the node N08 and the target node A (N01 to 07, N09, N11, N12, N14 to N18) is 1/10 or less of the distance of the entire route. As shown in FIG. 15, in this example, it is determined that the target node A (N06, N07, N09) is 1/10 or less. As step ST11, a subtraction value is calculated based on the distance between the node N08 calculated by the distance calculation unit 74 and the target node A (N06, N07, N09), and subtracted from the evaluation value of the target node A (N06, N07, N09). Subtract the value.

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to 07, N09, N11, N12, and N14 to N18), and the process proceeds to step ST6. Here, since the node n is not selected, the process returns to step ST1. FIG. 15 shows the evaluation value of each node after the end of the third process. In FIG. 15, node N08 has the highest evaluation value and is the node selected for use in summarization. Further, the evaluation value of the nodes N07 and N09 is subtracted by “6”, and the evaluation value of the node N06 is subtracted by “1”.

<4th process>
Again, as step ST1, the node n (N04) having the highest evaluation value is selected from all the target nodes excluding the nodes N08, N10, and N13, and the node N04 is excluded from the target nodes. In step ST2, the target node A is selected from all target nodes (mn) (N01 to N03, N05 to 07, N09, N11, N12, N14 to N18) excluding the node N08. As Step ST3, it is determined whether or not the distance between the node N04 and the target node A (N01 to N03, N05 to 07, N09, N11, N12, and N14 to N18) is 1/10 or less of the entire route distance. To do. As shown in FIG. 16, in this example, it is determined that the target node A (N03, N05) is 1/10 or less. In step ST11, a subtraction value is calculated based on the distance between the node N04 calculated by the distance calculation unit 74 and the target node A (N03, N05), and the subtraction value is subtracted from the evaluation value of the target node A (N03, N05). .

  In step ST5, it is determined whether or not the determination process in step ST3 has been performed for all target nodes (mn) (N01 to N03, N05 to 07, N09, N11, N12, and N14 to N18). Proceed to Here, since the node n is not selected, the process returns to step ST1. FIG. 16 shows the evaluation value of each node after the end of the fourth process. In FIG. 16, node N04 has the highest evaluation value and is the node selected for use in summarization. Also, the evaluation values of the nodes N03 and N05 are subtracted by “4”.

<Fifth process>
The fifth node n (N17) with the highest evaluation value is selected and the same processing as described above is performed. As a result, five nodes n are selected, and the process ends through the determination process of step ST6.
When all the processes are completed, the route passing through the nodes N04, N08, N10, N13, and N17 selected as the summary of the searched route is presented to the user via the display unit 5 or the speaker 6 as in the first embodiment. The

  As described above, according to the second embodiment, the subtraction value of the evaluation value of the target node A is changed according to the distance between the node n calculated by the distance calculation unit 74 and the target node A. For example, the evaluation value of the target node A closer to the distance can be greatly subtracted, and the width of the subtraction can be reduced as the distance is longer. It becomes possible.

Embodiment 3 FIG.
In the third embodiment, the evaluation value of the target node A is determined according to the distance from the node selected as a summary depending on whether the target node A exists on the expressway or the general road. The structure which changes the ratio which subtracts is shown.
The expressway has fewer branches than ordinary roads, and the level of recognition for each node such as interchanges and junctions is high. Interchanges at the entrance and exit for users are the nodes with the highest evaluation values. Junctions (except for complex routes such as the Metropolitan Expressway) are not very important. Therefore, in the third embodiment, a configuration in which the range of subtraction of evaluation values on a highway is increased with respect to a general road.

  FIG. 17 is a block diagram illustrating a configuration of a control unit in the navigation system according to the third embodiment. A highway determination unit 75 is additionally provided in the route summarization unit 72 of the first and second embodiments shown in FIG. The same components as those in the control unit 7 of the first and second embodiments are denoted by the same reference numerals as those used in FIG. 2, and the description thereof is omitted or simplified.

  The highway determination unit 75 determines whether the target node A selected by the node calculation unit 73 exists on the highway, and returns the determination result to the node calculation unit 73. The distance calculation unit 74 calculates the distance between nodes.

The node calculation unit 73 selects the node n or the target node A having the highest evaluation value.
In addition, referring to the determination result of the highway determination unit 75, when the target node A exists on the highway, the range in which the evaluation value is subtracted is expanded. On the other hand, when the target node A exists on a general road, the evaluation value is subtracted within a normal range.
Specifically, when the target node A exists on the expressway, the evaluation value is subtracted based on whether the distance between the node n having the maximum evaluation value and the target node A is, for example, 1/5 or less. If it is on a general road, for example, the evaluation value is subtracted based on whether it is 1/10 or less. As a result, the extraction range of the target node A that exists on the expressway and from which the evaluation value is subtracted can be expanded, and processing can be performed so that unimportant nodes (such as unimportant interchanges) do not remain.
Further, the node calculation unit 73 determines a subtraction value to be subtracted from the evaluation value of the target node A based on the distance calculated by the distance calculation unit 74 as in the second embodiment.

  FIG. 18 shows an example of the subtraction value of the evaluation value with respect to the distance from the node n according to the third embodiment. In FIG. 18, the basic value to be subtracted from the evaluation value is “20”, and the subtraction value is decreased by “1” every time 1/100 of the total distance from the node n having the highest evaluation value. If the subtraction result is negative, the evaluation value is “0”.

  Next, the search route summarization process will be described according to the flowchart of FIG. FIG. 19 is a flowchart showing the operation of the route summarizing unit according to the third embodiment. The same steps as those in the navigation system according to the second embodiment are denoted by the same reference numerals as those used in FIG. 12, and the description thereof is omitted or simplified.

  The node calculating unit 73 of the route summarizing unit 72 selects the node n having the highest evaluation value from all the nodes m included in the search result acquired from the route searching unit 71, and excludes the selected node n from all the nodes m. (Step ST1). Further, the target node A is selected from all target nodes (mn) excluding the node n (step ST2). The highway determination unit 75 determines whether or not the target node A selected in step ST2 exists on the highway (step ST21).

  If it is determined in step ST21 that the target node A does not exist on the expressway, the distance calculation unit 74 calculates the distance between the node n and the target node A, and the node calculation unit 73 determines that the calculated distance is the current location. It is determined whether or not it is 1/10 or less of the entire distance from X to the destination Y (step ST3). If it is determined in step ST3 that the distance is 1/10 or less, a subtraction value is calculated based on the distance between the node n calculated by the distance calculation unit 74 and the target node A, and the evaluation value of the target node A is calculated. The subtracted value is subtracted from (step ST11). The example shown in FIG. 13 is applied to the subtraction value in step ST11. The basic value to be subtracted is “10”, and the subtracted value is decreased by “1” every time 1/100 of the total distance from the node n.

On the other hand, when it is determined in step ST21 that the target node A exists on the expressway, the distance calculation unit 74 calculates the distance between the node n and the target node A, and the node calculation unit 73 calculates the calculated distance. It is determined whether or not the distance from the current location X to the destination Y is 1/5 or less of the entire distance (step ST22). When it is determined in step ST22 that the distance is 1/5 or less, a subtraction value is calculated based on the distance between the node n and the target node A calculated by the distance calculation unit 74, and the evaluation value of the target node A is calculated. The subtracted value is subtracted from (step ST23). The example shown in FIG. 18 is applied to the subtraction value in step ST23. The basic value to be subtracted is “20”, and the subtracted value is decreased by “1” every 1/100 of the total distance from the node n. When the target node A exists on the expressway, the basic value to be subtracted is as large as “20”, so the subtracted value is also large.
Note that the ratio of the entire route to the distance is not necessarily 1/10 and 1/5, and can be changed as appropriate. The evaluation value subtracted in step ST11 and step ST23 is at least a summary of the searched route. Until all the nodes to be created are selected, they are held so as not to return to the original values.

  The node calculation unit 73 determines whether or not the processing after step ST21 has been performed for all target nodes (mn) (step ST5). If it is determined in step ST5 that the process after step ST21 has not been performed for all target nodes (mn), the process returns to step ST2, and the determination process is performed for all target nodes (mn). If it is determined that the process has been performed, the process proceeds to step ST6.

  As described above, according to the third embodiment, the highway determination unit 75 that determines whether or not the target node A exists on the highway is provided, and subtraction is performed by subtracting from the evaluation value of the target node A on the highway. Since the size of the value and the range to be subtracted are set to be large, a summary of the search route can be created so that nodes such as interchanges that are not very important remain.

  In the third embodiment described above, the configuration in which the magnitude of the subtraction value and the range to be subtracted are set to be large at the same time is shown.

Embodiment 4 FIG.
In the fourth embodiment, a configuration in which the ratio of subtracting the evaluation value of the target node A is changed according to the distance from the node selected as the summary according to whether the target node A exists in the specific area. Show.
The area that is local to the user can easily recognize where the name of the intersection serving as the node exists, and there is often a need to change a part of the search result according to the user's preference. On the other hand, in areas without land intuition, users tend to follow the navigation. Therefore, the fourth embodiment shows a configuration in which the size of the subtraction value subtracted from the evaluation value can be changed in the specific area and other areas.

  FIG. 20 is a block diagram illustrating a configuration of a control unit in the navigation system according to the fourth embodiment. A specific area determination unit 76 is provided instead of the highway determination unit 75 of the route summarization unit 72 of the third embodiment shown in FIG. Note that the same components as those of the control unit 7 of the third embodiment are denoted by the same reference numerals as those used in FIG. 17, and the description thereof is omitted or simplified.

  The specific area determination unit 76 determines whether the target node A calculated by the node calculation unit 73 exists in the specific area, and returns the determination result to the node calculation unit 73. The specific area is set by the user via the input unit 4 and stored in the storage unit 3. For example, the north-south and the east-west within 30 km are set as the specific area around a point set as a home or a point designated by the user. The range of this specific area can be changed as appropriate. The distance calculation unit 74 calculates the distance between nodes.

  The node calculation unit 73 selects the node n or the target node A having the highest evaluation value. Further, a subtraction value to be subtracted from the evaluation value of the target node A is determined based on the distance calculated by the distance calculation unit 74. At this time, the determination result of the specific area determination unit 76 is referred to, and if the target node A exists in the specific area, the subtraction value is decreased. On the other hand, when the target node A exists outside the specific area, the subtraction value is set as usual.

Specifically, when the target node A exists in a specific area, the basic subtraction value is “5”, and the subtraction value is decreased by “1” every 1/50 of the total distance from the node n. (See FIG. 21). On the other hand, when the target node A exists outside the specific area, the basic subtraction value is set to “10”, and the subtraction value is decreased by “1” every 1/100 of the total distance from the node n (see FIG. 11).
As described above, by reducing the subtraction value in the specific area, it is possible to increase the ratio of the nodes around the specific area to the nodes selected for summarization.

  Next, the search route summary process will be described with reference to the flowchart of FIG. FIG. 22 is a flowchart showing the operation of the route summarizing unit according to the fourth embodiment. The same steps as those in the navigation system according to the third embodiment are denoted by the same reference numerals as those used in FIG. 19, and the description thereof is omitted or simplified.

  The node calculating unit 73 of the route summarizing unit 72 selects the node n having the highest evaluation value from all the nodes m included in the search result acquired from the route searching unit 71, and excludes the selected node n from all the nodes m. (Step ST1). Further, the target node A is selected from all target nodes (mn) excluding the node n (step ST2). The specific area determination unit 76 determines whether or not the target node A selected in step ST2 exists in the specific area (step ST31).

  If it is determined in step ST31 that the target node A does not exist within the specific area, the distance calculation unit 74 calculates the distance between the node n and the target node A, and the node calculation unit 73 determines that the calculated distance is the current location. It is determined whether or not it is 1/10 or less of the entire distance from X to the destination Y (step ST3). If it is determined in step ST3 that the distance is 1/10 or less, a subtraction value is calculated based on the distance between the node n calculated by the distance calculation unit 74 and the target node A, and the evaluation value of the target node A is calculated. The subtracted value is subtracted from (step ST11). The example shown in FIG. 11 is applied to the subtraction value in step ST11. The basic value to be subtracted is “10”, and the subtraction value is decreased by “1” for every distance that is 1/100 of the total distance from the node n.

  On the other hand, if it is determined in step ST31 that the target node A is present in the specific area, the distance calculation unit 74 calculates the distance between the node n and the target node A, and the node calculation unit 73 determines that the calculated distance is It is determined whether or not it is 1/10 or less of the entire distance from the current location X to the destination Y (step ST32). When it is determined in step ST32 that the distance is 1/10 or less, a subtraction value is calculated based on the distance between the node n and the target node A calculated by the distance calculation unit 74, and the evaluation value of the target node A is calculated. The subtracted value is subtracted from (step ST33). The example shown in FIG. 21 is applied to the subtraction value in step ST33. The basic value to be subtracted is "5", and the subtracted value is decreased by "1" every time 1/50 of the total distance from the node n. When the target node A exists in the specific area, the basic value to be subtracted is as small as “5”, and the subtraction ratio with respect to the distance is also small, so the subtraction value is small.

  The ratio of the entire route to the distance is not necessarily 1/10 and 1/5, and can be changed as appropriate. The evaluation value subtracted in step ST11 and step ST33 is at least a summary of the searched route. Until all the nodes to be created are selected, they are held so as not to return to the original values.

  The node calculation unit 73 determines whether or not the processing after step ST31 has been performed for all target nodes (mn) (step ST5). If it is determined in step ST5 that the process after step ST31 is not performed for all target nodes (mn), the process returns to the process of step ST2, and the determination process is performed for all target nodes (mn). If it is determined that the process has been performed, the process proceeds to step ST6.

  As described above, according to the fourth embodiment, the specific area determination unit 76 that determines whether or not the target node A exists in the specific area is provided, and is subtracted from the evaluation value of the target node A in the specific area. Since the subtraction value is configured to be small, for example, the reduction amount of the subtraction value in the area around the home can be made smaller than the reduction amount in the other areas, and the home occupying all the nodes selected for summarization The ratio of peripheral nodes can be increased.

  1 position detection unit, 2 media interface unit, 3 storage unit, 4 input unit, 5 display unit, 6 speaker, 7 control unit, 10 navigation system, 71 route search unit, 72 route summarization unit, 73 node calculation unit, 74 distance Calculation unit, 75 highway determination unit, 76 specific area determination unit.

Claims (5)

A position detection unit that detects the current position of the moving body, a storage unit that stores map information including nodes and links, an input unit that receives user operations, and an input from the current position of the moving body via the input unit A route search unit for searching for a route to a destination point based on the map information, and a route for selecting an arbitrary number of nodes from nodes existing on the searched route and creating a summary of the searched route In a navigation system comprising: a summary unit; a display unit that displays a summary of the route created by the route summary unit; and a voice output unit that provides voice guidance for the summary of the route created by the route summary unit;
The route summarization unit selects a summarization node with reference to the evaluation value set for each node, subtracts a predetermined value from the evaluation values of nodes located around the summarization node, and then selects the next summarization node. A navigation system comprising a node calculation unit to be selected. The route summarization unit includes a distance calculation unit that calculates a distance between nodes,
The node calculation unit determines a subtraction value of an evaluation value based on a distance between a summary node and a node located around the summary node calculated by the distance calculation unit. Navigation system. The route summary unit includes a highway determination unit that determines whether a node exists on the highway,
3. The navigation system according to claim 2, wherein when the highway determination unit determines that a node located around the summary node exists on the highway, a range in which the evaluation value is subtracted is set large. The route summary unit includes a highway determination unit that determines whether a node exists on the highway,
4. The navigation system according to claim 2, wherein when the highway determination unit determines that a node located around the summary node exists on the highway, a subtraction value of the evaluation value is increased. . The route summarization unit includes a specific area determination unit that determines whether a node exists in a specific area,
The navigation system according to claim 2, wherein when the specific area determination unit determines that a node located around the summary node exists in the specific area, the subtraction value of the evaluation value is decreased.

Images