JP2004177318A - Navigation apparatus, update method of route searching data and update program for route searching data - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a navigation apparatus capable of performing route calculation which reflects a road a user frequently travels in a learned result. <P>SOLUTION: The navigation system 100 capable of performing route search to a destination has a memory part 2 for storing data for route search which are hierarchized from a lower level having more information of a road network to a higher level having less information of the road network and a control part 11 for reflecting information of the road on the upper level data for route search in the case that a road corresponding to a route stored in the memory part 2 exists in data for route search of the lower level but does not exist in data for route search of the upper level. <P>COPYRIGHT: (C)2004,JPO

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a navigation device, a route search data update method, and a route search data update program, and more specifically, is hierarchized from a lower level having a large amount of information of a road network to an upper level having a small amount of information of a road network. The present invention relates to a technique using data for route search.
[0002]
[Prior art]
In general, an in-vehicle navigation device detects the current position of a vehicle, reads map data near the current position from a data storage medium such as a CD or DVD, and displays the data on a screen. In addition, a vehicle position mark indicating the position of the vehicle is displayed on the screen, and a map of the vicinity is scrolled according to the progress of the vehicle around the vehicle position mark, and the map information around the position of the vehicle is always known. It has become.
[0003]
In addition, most of the recent in-vehicle navigation devices have a route search / guidance function that enables a user to travel to a desired destination without making a mistake on a road. According to the route search / guidance function, a route with the smallest cost from the starting point to the destination is searched for by performing a simulation such as the horizontal search (BFS) method or the Dijkstra method using the map data, and is searched. Route guidance is performed based on the route that has been set. Conventionally, in such a route guidance, for example, searching all data in the whole of Japan would require a huge amount of calculation. Therefore, a method of performing a high-speed route search using hierarchically structured map data. Has been proposed.
[0004]
FIG. 10 is a diagram for explaining a conventional route search using map data having a hierarchical structure. Note that FIG. 10 shows map data having a hierarchical structure having three layers of an upper level (upper layer), a middle level (middle layer), and a lower level (lower layer). As shown in FIG. 10, in the hierarchically structured map data, the map data divided into smaller areas is set as the map data at a lower level. The map data corresponding to each of these maps includes detailed road information for a large number of roads including general roads and prefectural roads in addition to expressways and national roads.
[0005]
Further, the map data divided into larger areas is set as the map data at a higher level. In the vicinity of the departure point and the destination, a lower-level map data including more detailed road information is used to search for a route to a national road, which is also commonly included in the middle-level map data. You.
[0006]
Next, using the middle-level map data, a route to a national road, a highway, or the like, which is also commonly included in the higher-level map data, is searched. When a route up to a road included in the upper level map data is searched, a route search is performed using the upper level map data with the main road as a search target. In this manner, a high-speed route search from the departure point to the destination can be performed by reducing the entire search amount.
[0007]
Further, in the conventional navigation, there is proposed a function of learning (recording) a road that a driver often passes through and making it easy to select the road as a route when calculating a route (Patent Document 1). The navigation device of Patent Document 1 includes storage means for storing a route in an unguided area where the vehicle has traveled, reads out the stored travel route, and stores the route to the destination input by the destination input means. Since the route stored in the search is upgraded to a search candidate and searched by the search means, the route of the unguided area where the vehicle has traveled can be stored, and the stored route of the unguided area can be stored. Can be used as search candidates.
[0008]
[Patent Document 1]
JP-A-2000-205884
[Problems to be solved by the invention]
However, the navigation device of Patent Literature 1 can store the route of the unguided area where the vehicle has traveled, and can use the stored route of the unguided area as a search candidate. Since the search does not use the above-described hierarchically structured map data, there is a problem that a route cannot be searched at high speed.
[0009]
Further, even if the learning function is applied to a conventional navigation device that uses hierarchically structured map data, the following problem occurs. FIG. 11 is a diagram for describing map data having a two-layered structure of a lower level and an upper level. FIG. 11A is a diagram for explaining map data having a hierarchical structure at a higher level. FIG. 11B is a diagram for explaining map data having a hierarchical structure at a lower level. Note that, in FIG. 11, for convenience of description, unlike FIG. As shown in FIG. 11A, only the road A and the road B are shown in the map data having the hierarchical structure of the upper level. On the other hand, as shown in FIG. 11B, the map data of the lower-level hierarchical structure shows a road A, a road B, and more specifically, a road C connecting the road A and the road B. I have.
[0010]
FIG. 12 is a diagram for explaining a problem when a learning function is applied to map data having a hierarchical structure and a route search is performed using the learning function. FIG. 12A is a diagram for explaining the learning function. FIG. 12B is a diagram for explaining the relationship between the map data having the hierarchical structure of the upper level and the learning function. As shown in FIG. 12A, it is assumed that the navigation device learns that the route a → b → c → d is a route that the user often uses because the driver frequently uses the road C.
[0011]
However, since the road C is defined in the data of the hierarchical structure at the lower level, the navigation device can store a → b → c → d as a road through which the user passes well. As shown in FIG. 11B, since the road C shown in FIG. 11A is not defined in the map data having the hierarchical structure of the upper level, even if the user searches for a route, the road C that the user often travels along the route C Will not be chosen as In other words, even if a driver learns a road that he or she frequently travels on, if this road is not included in the map data of the higher-level hierarchical structure, the road will not be selected as a route in a long-distance search or the like. There's a problem.
[0012]
In view of the above, the present invention solves the above-described problems of the related art, and provides a navigation device, a route search data update method, and a route search data update program capable of calculating a route by reflecting a road that a user frequently passes in a learning result. The purpose is to do.
[0013]
[Means for Solving the Problems]
In order to solve the above-mentioned problem, a navigation device according to claim 1 is a navigation device capable of searching for a route to a destination, from a lower level having a large amount of information of a road network to an upper level having a small amount of information of a road network. A first storage unit that stores hierarchical route search data, and a route in which the vehicle travels is stored in a second storage unit, and corresponds to the route stored in the second storage unit. When a road exists in the lower-level route search data stored in the first storage unit but does not exist in the upper-level route search data, information on the road is stored in the upper-level route search data. And a control unit that reflects the data on the route search data.
[0014]
According to the first aspect of the present invention, the control unit determines that the road corresponding to the route stored in the second storage unit exists in the lower-level route search data stored in the first storage unit. If the road does not exist in the upper-level route search data, this road is reflected in the upper-level route search data. Therefore, a road through which the vehicle travels well is registered in the upper-level route search data. You. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0015]
According to a second aspect of the present invention, in the navigation device according to the first aspect, the control unit stores the route on which the vehicle has traveled once in the second storage unit. According to the navigation device of the second aspect, the control unit stores the route that the vehicle has traveled once in the second storage unit, so that the vehicle has passed the higher-level route search data. The route is registered. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0016]
Further, in the navigation device according to the third aspect, in the navigation device according to the first aspect, the control unit may store, in the second storage unit, a route that has deviated from a route guided to the own vehicle. Features. According to the navigation device of the third aspect, the control unit stores the route deviating from the route guided to the own vehicle in the second storage unit. Is registered in this route. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0017]
According to a fourth aspect of the present invention, in the navigation device according to any one of the first to third aspects, the control unit measures the number of times the own vehicle has passed through the route, and the measured number of times is When the number of times exceeds a predetermined number, the path is stored in the second storage unit. According to the navigation device of the fourth aspect, the number of times the vehicle has traveled through the route is measured, and when the measured number exceeds a predetermined number, the route is stored in the second storage unit. As a result, only the route that the vehicle frequently travels is registered in the higher-level route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0018]
Further, according to a fifth aspect of the present invention, there is provided a route search data updating method for updating route search data hierarchized from a lower level having a large amount of information of a road network to an upper level having a small amount of information of a road network. In a data updating method, a first stage of storing a route on which a vehicle travels in a storage unit, and a road corresponding to the route stored in the first stage is included in the lower-level route search data. A second step of reflecting information on the road in the upper-level route search data when the data exists but is not present in the upper-level route search data.
[0019]
According to the route search data updating method of the fifth aspect, the control unit determines that the road corresponding to the route traveled by the own vehicle exists in the lower level route search data, but the upper level route search data. When the vehicle does not exist, this road is reflected in the upper-level route search data, so that the road through which the vehicle travels well is registered in the upper-level route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0020]
According to a sixth aspect of the present invention, in the method of updating a route search data according to the fifth aspect, the first step stores, in the storage unit, a route that the vehicle has traveled once. It is characterized by doing. According to the route search data updating method of the present invention, since the route that the vehicle has traveled once is stored in the storage unit, the road corresponding to this route is stored in the upper-level route search data. The route that the car has passed is registered. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0021]
In the route search data updating method according to a seventh aspect, in the route search data updating method according to the fifth aspect, the first step includes storing a route that has deviated from a route guided to the own vehicle in the storage unit. Is stored. According to the route search data updating method of the present invention, the route that has deviated from the route being guided to the own vehicle is stored in the storage unit, so that the road corresponding to this route has a higher level. This route is registered in the route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0022]
According to an eighth aspect of the present invention, in the route update data updating method according to any one of the fifth to seventh aspects, the first step includes the step of determining the number of travels of the route traveled by the own vehicle. It is characterized in that the route is stored in the storage unit when the measured and measured number of runs exceeds a predetermined number. According to the route search data updating method of the eighth aspect, the number of times the own vehicle has passed the route is measured, and when the measured number exceeds a predetermined number, the route is stored in the storage unit. Therefore, only the route frequently traveled by the vehicle is registered in the upper level route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0023]
The route search data updating method according to claim 9 is the route search data updating method according to any one of claims 5 to 8, wherein the second step is a road reflected in the upper level. A third step of adding and dividing a node to a road to which is connected, and a fourth step of connecting a link corresponding to the road to be added to the node added in the third step. Features.
[0024]
According to the route search data updating method of the ninth aspect, in the second stage, a node is added to the road to which the road reflected in the upper level is connected, and the road is connected to the added node. Since the link corresponding to the road to be added is connected, the road that actually corresponds to the route is registered in the higher-level route search data, and the route calculation that reliably reflects the learning result is performed. be able to.
[0025]
A route search data updating program according to claim 10 is a computer for updating route search data hierarchized from a lower level having a large amount of information of a road network to an upper level having a small amount of information of a road network. Is stored in the storage unit, and a road corresponding to the route stored by the first unit is present in the lower-level route search data, If the information does not exist in the route search data at the higher level, the information on the road is made to function as second means for reflecting the information on the route search data at the higher level.
[0026]
According to the route search data updating program, the road corresponding to the route on which the vehicle travels exists in the lower-level route search data, but does not exist in the upper-level route search data. In this case, since this road is reflected in the upper-level route search data, a road through which the vehicle travels well is registered in the upper-level route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0027]
BEST MODE FOR CARRYING OUT THE INVENTION
Hereinafter, a navigation device according to an embodiment of the present invention will be described with reference to the drawings. In the present embodiment, for convenience of description, as in the case of FIG. 11, description will be made using map data having a two-layered structure of a lower level and an upper level.
[0028]
FIG. 1 is a block diagram of a navigation device according to the present embodiment. As shown in FIG. 1, the navigation device 100 includes a navigation controller 1, a storage unit 2, a disk reader 3, a remote control (remote control) unit 4, a GPS receiver 5, an autonomous navigation sensor 6, a display, and the like. Device 7. The navigation controller 1 controls the entire navigation device 100.
[0029]
The storage unit 2 stores map data having the above-described hierarchical structure, route search data, and the like. Here, the route search data corresponds to the hierarchically structured map data, and refers to data hierarchized from a lower level having a large amount of information of the road network to an upper level having a small amount of information of the road network. . The storage unit 2 is configured to be writable, and for example, a hard disk or the like can be used. The storage unit 2 may be a removable unit such as a DVD-RW (DVD rewritable).
[0030]
The disk reading device 3 reads the map data and the route search data recorded in the storage unit 2. The remote control unit 4 is an operation unit where a user inputs various instructions. The remote control unit 4 includes a search key for giving a route search instruction, a route guidance mode key used for setting a route guidance mode, a destination input key, up / down / left / right cursor keys, a map reduction / enlargement key, and a display screen. Various operation keys such as a setting key for fixing an item at a cursor position are provided, and an infrared signal corresponding to an operation state of the key is transmitted to the navigation controller 1.
[0031]
The GPS receiver 5 and the autonomous navigation sensor 6 detect the own vehicle position and the own vehicle direction. The GPS receiver 5 receives radio waves transmitted from a plurality of GPS satellites, performs three-dimensional positioning processing or two-dimensional positioning processing, calculates the absolute position and direction of the vehicle, and outputs these with the positioning time. I do. The autonomous navigation sensor 6 includes an angle sensor such as a vibrating gyroscope that detects the vehicle rotation angle as a relative bearing, and a distance sensor that outputs one pulse for each predetermined traveling distance. Calculate the bearing.
[0032]
The display device 7 displays a map image, a guidance route, and the like. The display device 7 displays a map image around the own vehicle together with a vehicle position mark, a departure point mark, a destination mark, and the like based on drawing data output from the navigation controller 1, and displays a guidance route and the like on the map. Or display.
[0033]
Next, the navigation controller 1 will be described. As shown in FIG. 1, the navigation controller 1 includes a data buffer 10, a control unit 11, a map drawing unit 12, a VRAM 13, an image synthesis unit 14, a vehicle position calculation unit 15, a route search processing unit 16, , A guidance route memory 17, a guidance route drawing unit 18, a mark image drawing unit 19, a remote control unit 20, a cursor position calculation unit 21, and an operation screen generation unit 22. The data buffer 10 temporarily stores the hierarchically structured map data read from the storage unit 2 by the disk reader 3.
[0034]
The control unit 11 has the following functions in addition to adjusting the route search data optimally. The adjustment here means that a road that exists only in the lower level is reflected in the upper level. When the vehicle position is calculated by the vehicle position calculation unit 15, the control unit 11 outputs to the disk reading device 3 a request to read map data in a predetermined range including the vehicle position.
[0035]
In addition, in response to a request from the route search processing unit 16, the control unit 11 outputs to the disk reading device 3 a request to read map data having a hierarchical structure necessary for performing a route search. Further, the control unit 11 stores the route traveled by the own vehicle in the storage unit 2 based on the own vehicle position calculated by the vehicle position calculating unit 15. In addition, the control unit 11 determines that the road corresponding to the route stored in the storage unit 2 exists in the lower-level route search data stored in the storage unit 2 but does not exist in the upper-level route search data. In this case, the upper-level route search data is rewritten to reflect this road in the upper-level route search data.
[0036]
Further, the control unit 11 may store, in the storage unit 11, the route that the vehicle has traveled once. Further, the control unit 11 may store only the route that has deviated from the route guided to the user of the own vehicle by the navigation device in the storage unit 2. Further, when storing the route in the storage unit 2, the control unit 11 measures the number of times the own vehicle has passed the route, and stores the route in the storage unit 2 when the measured number exceeds a predetermined number. You may do so. Further, the control unit 11 reads the route search data update program from the storage unit 11 and executes a process of updating the route search data.
[0037]
The map drawing unit 12 creates map drawing data necessary for display based on drawing units included in the map data stored in the data buffer 10. The created map drawing data is stored in the VRAM 13. The image synthesizing unit 14 superimposes the map drawing data read from the VRAM 13 and the drawing data output from each of the guidance route drawing unit 18, the mark image drawing unit 19, and the operation screen generating unit 22, and performs image synthesis. The data is output to the display device 7.
[0038]
The vehicle position calculation unit 15 calculates the position of the own vehicle based on each detection data of the GPS receiver 5 and the autonomous navigation sensor 6, and, if the calculated own position is not on the road of the map data, A map matching process for correcting the position is performed. Further, the vehicle position calculation unit 15 outputs the calculated own vehicle position to the control unit 11. The route search processing unit 16 searches for a traveling route that connects a preset destination and departure place under predetermined conditions.
[0039]
For example, under various conditions such as the shortest distance and the shortest time, the traveling route with the minimum cost is set as the guidance route. As a typical route search method, the Dijkstra method and the horizontal search method are known. The guidance route set by the route search processing unit 16 in this way is represented as a set of nodes from the departure point to the destination and stored in the guidance route memory 17.
[0040]
The guidance route drawing unit 18 selects, from the guidance route data set by the route search processing unit 16 and stored in the guidance route memory 17, those included in the map area drawn in the VRAM 13 at that time, and selects the guidance route. Is created to display the route information superimposed on the map image. The mark image drawing unit 19 generates drawing data for generating a vehicle position mark at the own vehicle position after the map matching processing or generating a cursor mark having a predetermined shape.
[0041]
Next, the above-described route search data stored in the storage unit 2 will be described. FIG. 2 is a diagram showing the contents of various tables included in the route search data. In the following, a line connecting any two points on a road is called a link, an adjacent point connecting two or more links is called a node, an intersection corresponds to a node, and a road corresponds to a link. As shown in FIG. 2A, the route search data includes route calculation data frames A, B, C, D,... Corresponding to each figure.
[0042]
Further, as shown in FIG. 2B, each route calculation data frame includes a. A node data frame including basic information on each node included in the target leaf; b. A link data frame including basic information on each link included in the figure of interest; c. A link cost data frame including cost information of each link included in the target leaf; d. An upper-level node correspondence data frame indicating correspondence information on nodes included in the route calculation data frame that also exist in common in the upper hierarchy; e. A traffic code data frame including the regulation information included in the route calculation data frame; f. And a node coordinate data frame including coordinate information of nodes included in the route calculation data frame.
[0043]
Next, the operation of the control unit 11 will be described. As described above, the control unit 11 determines that the road corresponding to the route stored in the storage unit 2 is present in the lower-level route search data stored in the storage unit 2 but is included in the upper-level route search data. Is not present, the upper-level route search data is rewritten to reflect the road information on this road in the upper-level route search data, and is reflected in the upper-level route search data. A route calculation is performed that surely reflects the road that the user passes well in the learning result.
[0044]
Next, an operation of updating the route search data by the control unit 11 will be described with reference to FIG. FIG. 9 is a diagram for explaining the operation of the control unit 11 for updating the route search data. In step S101, the control unit 11 specifies a road to be reflected on the higher-level search data. In step S102, the control unit 11 adds a node to a high-level road to which a road to be reflected in the high-level route search data is connected, and divides the road. In step S103, the control unit 11 connects a link between the divided nodes and adds a road to be upgraded to the higher-level route search data. In step S104, the control unit 11 determines whether the target route search data is the highest-order route search data.
[0045]
When the control unit 11 determines in step 104 that the target route search data is the highest-order route search data, the control unit 11 ends the process. On the other hand, if the control unit 11 determines in step S104 that the target route search data is not the highest-order route search data, the process returns to step S102, and the control unit 11 determines that the target route search data is the highest-order route search data. The processes of S102 to S104 are repeated from the lower level to the upper level until the route search data is obtained. Accordingly, when the hierarchy of the route search data is three or more, the processes at S102 to S104 of the second stage are repeated for the lowest level road to the highest level, so that the route search data at the highest level is at once. Can be upgraded.
[0046]
Hereinafter, the operation of the control unit 11 will be described with reference to the drawings. FIG. 3 is a diagram for explaining the operation of the control unit 11, and shows upper-level route search data before reflecting a road that a user frequently travels on the upper-level route search data. As shown in FIG. 3, the upper level route search data includes a link # 1 representing the road A, and nodes # 1 and # 2, which are intersections, at both ends of the link # 1. Also, a link # 2 representing the road B, and nodes # 3 and # 4, which are intersections, are provided at both ends of the link # 2.
[0047]
FIG. 4 shows a link list and a node list of the route search data at the higher level shown in FIG. Note that the route search data is stored in the storage unit 2 as described above. FIG. 4A is a diagram for explaining a link list of route search data at a higher level. FIG. 4B is a diagram for explaining a node list of route search data at a higher level. As shown in FIG. 4A, the link list of the higher-level route search data stores link # 1 information corresponding to road A and link # 2 information corresponding to road B.
[0048]
The link # 1 information includes a link length that determines the length of the link: 1000 m, a link attribute that indicates the attribute of the link, a node # 1 as a connection node representing a node connected to the link # 1, such as a national road or a two-lane. , Node # 2. Also, as shown in FIG. 4B, the node list of the higher-level route search data stores node # 1 information,..., Node # 4 information. In the node # 1 information, east longitude xxxx and north latitude yyyy are stored as coordinates representing the coordinates of the node, and link # 1 is stored as a connection link representing a link connected to the node such as an intersection as a node attribute representing the attribute of the node. Have been.
[0049]
Next, an operation in which the control unit 11 reflects a road that a user frequently passes on route search data at a higher level will be described. First, in the first stage, the control unit 11 specifies a road to be reflected in the higher-level route search data. Specifically, the control unit 11 stores the driving results of the driver from the vehicle position calculating unit 15 in the storage unit 2, and specifies a road that the user often travels based on the driving results of the driver.
[0050]
Here, as means for specifying a road that the user often passes, for example, a road that a vehicle has once passed is simply specified, or a road that the vehicle has deviated from the route being guided is specified. Alternatively, it may be determined that a road that frequently passes through a road on which these conditions are repeated a plurality of times is specified and that the road is reflected. Further, when this condition is used for each level, for example, map data having a three-level hierarchical structure, a target to be reflected stepwise, such as an intermediate level or an upper level, may be specified. For example, when a lower-level road is upgraded to an intermediate level, a road that a user has traveled ten times is specified as an upgrade target, or when a middle-level road is upgraded to an upper level, the user is upgraded. Roads that have passed 30 times can be upgraded.
[0051]
Next, in the second stage, the control unit 11 determines that the road corresponding to the route stored in the storage unit 2 exists in the lower-level route search data stored in the storage unit 2, but the higher-level route search If it does not exist in the route data, the road information on this road is reflected in the route search data at a higher level. More specifically, the control unit 11 accesses the storage unit 2 and reflects the roads to be upgraded in the first stage in the route search data in the following procedure. Adds a node to the higher-level road to which it connects to break the link. This will be described with reference to FIG.
[0052]
FIG. 5 is a diagram for explaining link division by adding a node to the higher-level route search data. As shown in FIG. 5, the control unit 11 adds the node # 5 to the link # 1 of the higher-level route search data shown in FIG. 3, and sets the link # 1 ′ and the link # 1 ″. Divide. In addition, the control unit 11 adds the node # 6 to the link # 2 of the higher-level route search data illustrated in FIG. 3 and divides the link # 2 ′ into the link # 2 ″.
[0053]
FIG. 6 is a diagram for explaining the link list and the node list of the higher-level route search data shown in FIG. FIG. 6A is a diagram for explaining a higher-level link list. As shown in FIG. 6A, the control unit 11 adds a node # 5 to the link # 1 of the higher-level route search data, and divides the link # 1 ′ into a link # 1 ′ and a link # 1 ″. The node # 6 is added to the link # 2 of the higher-level route search data, and is divided into the link # 2 ′ and the link # 2 ″, so that the link # 1 ′ is added to the upper-level link list. Information, link # 2 ′ information, link # 1 ″ information, and link # 2 ″ information are added. Further, the control unit 11 stores, in the link # 1 ′ information, a link length of 600 m, a link attribute such as a national road or a two-lane road, and node # 1 and node # 5 as connection nodes. The control unit 11 also stores each information in the link # 2 ′ information, the link # 1 ″ information, and the link # 2 ″ information in the same manner as the link # 1 ′ information.
[0054]
FIG. 6B is a diagram for explaining an upper-level node list. As shown in FIG. 6B, the control unit 11 adds the node # 5 to the link # 1 of the higher-level route search data, and divides the link # 1 ′ into the link # 1 ″. By adding the node # 6 to the link # 2 of the higher-level route search data and dividing the link # 2 ′ into the link # 2 ″, the node # 5 information is added to the upper-level node list. , Node # 6 information. The control unit 11 also stores, in the node # 5 information, east longitude xxxx and north latitude yyyy as coordinates, and link # 1 ′ and link # 1 ″ as connection links such as intersections as node attributes. The control unit 11 also stores each information in the node # 6 information.
[0055]
Next, the control unit 11 adds (link # 3) the road C to be upgraded. Then, a node used for division in link information at the time of addition and a link to be added to node information used for division are set as respective connection information. This operation will be described with reference to FIGS. FIG. 7 is a diagram for explaining the addition of information on the road C to the higher-level route search data. As shown in FIG. 7, the control unit 11 adds a link # 3 corresponding to the road C between the nodes # 5 and # 6 in order to add the road C to the higher-level route search data.
[0056]
FIG. 8 is a diagram for explaining a link list and a node list when the road C is added to the higher-level route search data. FIG. 8A is a diagram illustrating a link list of route search data at a higher level. As shown in FIG. 8A, the control unit 11 stores the link # 3 information in the link list of the high-level route search data in order to add the road C to the high-level route search data. . Further, the control unit 11 stores, in the link # 3 'information, a link length of 500 m, a link attribute such as a national road or a two-lane road, and node # 5 and node # 6 as connection nodes.
[0057]
FIG. 8B is a diagram for explaining a higher-level node list. As shown in FIG. 8B, the control unit 11 adds a link C as a connection link to the node # 5 information of the upper-level route search data in order to add the road C to the upper-level route search data. Add # 3. Further, the control unit 11 adds the link # 3 to the node # 6 information of the higher-level route search data. As a result, the road information can be added to the higher-level route search data.
[0058]
As described above, according to the present embodiment, the control unit 11 determines that the road corresponding to the route stored in the storage unit 2 exists in the lower-level route search data, but the higher-level route search If the data does not exist in the data, this road is reflected in the upper-level route search data, and therefore, the road through which the vehicle travels well is registered in the upper-level route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[0059]
Each process performed by the control unit 11 shown in FIG. 9 is executed by a route search data update program. The route search data update program cooperates with the hardware and performs a process of updating the route search data integrally with the hardware. In the route search data update method, a route search data update program is stored in a storage medium such as an FD, an HD, or a CD-ROM, each of which is mounted on a corresponding external storage device and read out at the time of execution. And loaded into the RAM. The storage medium storing the route search data update program may be a semiconductor memory such as a ROM.
[0060]
The embodiment of the present invention has been described above. The present invention is not limited to the above embodiments, and various modifications can be made within the scope of the present invention.
[0061]
【The invention's effect】
According to the present invention described above, if a road corresponding to the route on which the vehicle travels exists in the lower-level route search data but does not exist in the upper-level route search data, the road Since this is reflected in the upper-level route search data, a road through which the own vehicle passes well is registered in the upper-level route search data. As a result, it is possible to perform a route calculation that reliably reflects the learning result.
[Brief description of the drawings]
FIG. 1 is a block diagram of a navigation device according to the present embodiment.
FIG. 2 is a diagram showing contents of various tables included in route search data.
FIG. 3 is a diagram illustrating upper-level route search data before reflecting a road that a user frequently travels on higher-level route search data;
FIG. 4 is a diagram showing a link list of route search data at a higher level and a node list.
FIG. 5 is a diagram for explaining link disconnection by adding a node to the higher-level route search data;
FIG. 6 is a diagram for explaining a link list of route search data at a higher level and a node list.
FIG. 7 is a diagram for explaining addition of information on a road C to higher-level route search data;
FIG. 8 is a diagram for explaining a link list and a node list when a road C is added to route search data at a higher level;
FIG. 9 is a diagram illustrating an operation of updating route search data by the control unit.
FIG. 10 is a diagram illustrating a conventional route search using hierarchically structured map data.
FIG. 11 is a diagram for explaining map data having a two-layered structure of a lower level and an upper level.
FIG. 12 is a diagram for explaining a problem in a case where a learning function is applied to map data having a hierarchical structure and a route search is performed using the learning function.
[Explanation of symbols]
1 Navigation controller
11 Control part
15 Vehicle position calculation unit
100 navigation device

Claims (10)

In a navigation device that can search for a route to a destination,
A first storage unit for storing route search data hierarchized from a lower level having a large amount of information of the road network to an upper level having a small amount of information of the road network;
A route in which the vehicle travels is stored in a second storage unit, and a road corresponding to the route stored in the second storage unit is a lower-level route search stored in the first storage unit. A control unit for reflecting information on the road to the upper-level route search data when the data is present in the upper-level route search data but not in the higher-level route search data. apparatus. The navigation device according to claim 1, wherein the control unit stores a route that the vehicle has traveled once in the second storage unit. The navigation device according to claim 1, wherein the control unit stores a route that has deviated from a route guided to the own vehicle in the second storage unit. The said control part measures the frequency | count that the own vehicle passed through the said route, and when the measured frequency | count exceeds predetermined frequency | count, the said memory | storage part stores the said route. The navigation device according to any one of claims 1 to 3. A route search data updating method for updating route search data hierarchized from a lower level having a larger amount of information of a road network to an upper level having a smaller amount of information of a road network,
A first stage of storing a route along which the vehicle travels in a storage unit;
When a road corresponding to the route stored in the first step is present in the lower-level route search data but not in the upper-level route search data, information on the road is stored in the upper-level route search data. A second step of reflecting the data on the level of the route search data; and a route search data updating method, comprising: 6. The route search data updating method according to claim 5, wherein in the first step, a route on which the vehicle has traveled once is stored in the storage unit. 6. The route search data updating method according to claim 5, wherein in the first step, a route that has deviated from a route guided to the own vehicle is stored in the storage unit. The method according to claim 1, wherein the first step measures the number of travels of the route traveled by the own vehicle, and stores the route in the storage unit when the measured number of travels exceeds a predetermined number. 8. The route search data updating method according to any one of 5 to 7. A second step of adding and dividing a node to a road to which a road reflected in the upper level is connected; and
9. The route search data according to claim 5, further comprising: a fourth step of connecting a link corresponding to a road to be added to the node added in the third step. Update method. A computer for updating route search data hierarchized from a lower level with a large amount of information on the road network to an upper level with a small amount of information on the road network,
First means for storing a route on which the vehicle travels in a storage unit;
When a road corresponding to the route stored by the first means is present in the lower-level route search data but not in the upper-level route search data, information on the road is stored in the upper-level route search data. A route search data update program for functioning as second means to be reflected in the level route search data.

Images