JP2004177246A - Map information processor, and map information processing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a map information processor and a map information processing program that enable sure correspondence between a road before updating and a road after the updating, even when map data are updated partially. <P>SOLUTION: In a navigation system, an updating data are acquired to update one portion of the map data used for navigation processing, the map data are updated based on the acquired updating data, a correspondence table for a link number before the updating and a link number after the updating is provided as to the link numbers for specifying the road when updating the map data, and the link number stored in a recommended route data is processed to be updated to the link number after the updating, using the correspondence table. <P>COPYRIGHT: (C)2004,JPO

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a map information processing device.
[0002]
[Prior art]
A technique for partially updating map data such as a road map used in a navigation device is known.
[0003]
[Patent Document 1]
JP-A-11-24554 [Patent Document 2]
JP-A-11-95657 [Patent Document 3]
JP 2001-75967 A [Patent Document 4]
JP 2001-109373 A
[Problems to be solved by the invention]
However, there has been a problem that roads cannot be handled due to partial updating of map data.
[0005]
The present invention provides a map information processing apparatus and a map information processing program capable of reliably associating a road before an update with a road after an update even when map data is partially updated.
[0006]
[Means for Solving the Problems]
The invention according to claim 1 is applied to a map information processing apparatus that processes information about a map, and obtains update information for updating a part of map data used for processing information about the map. And updating means for updating data using the acquired update information, and map information processing means for processing information relating to the map using the updated map data, wherein the map data is a predetermined management of roads. The map information processing means has identification information for specifying a unit, and the map information processing means has a correspondence table between the identification information before and after the change regarding the identification information for specifying the management unit of the road accompanying the update of the map data. , And processes information relating to the map using the correspondence table.
According to a second aspect of the present invention, in the map information processing apparatus according to the first aspect, the map information processing unit uses a correspondence table to manage roads included in data generated as a result of processing of information related to the map. Is changed to the changed identification information.
According to a third aspect of the present invention, in the map information processing apparatus according to the second aspect, the data generated as a result of the processing of the information related to the map is data relating to a recommended route generated as a result of the route calculation. is there.
According to a fourth aspect of the present invention, in the map information processing apparatus according to any one of the second to third aspects, the data generated as a result of the processing of the information relating to the map is data relating to a current position. It is.
According to a fifth aspect of the present invention, in the map information processing apparatus according to any one of the second to fourth aspects, the map information processing means manages a road included in data generated as a result of processing of information related to the map. When the identification information specifying the unit is changed to the changed identification information, the internal position based on the road management unit of the changed identification information is calculated again.
According to a sixth aspect of the present invention, in the map information processing apparatus according to the first aspect, the map information processing means stores the first data having identification information for specifying a road management unit, the data being different from the map data. Further, when the first data is used by processing information relating to the map, and the first data is used, it is determined whether or not the identification information for specifying the road management unit included in the first data has been changed with the update of the map data. Is determined using the correspondence table, and when it is determined that the identification information for specifying the management unit of the road included in the first data has been changed along with the update of the map data, the correspondence table is used. The identification information specifying the road management unit included in the first data is changed to the changed identification information and used.
The invention of claim 7 is applied to a map information processing apparatus that processes information related to a map, and obtains update information for updating a part of map data used for processing information related to the map. Means for updating map data using the acquired update information, and map information processing means for processing information relating to the map using the updated map data. When the identification information for specifying the management unit of the road is changed due to the update of the map data, the map information processing means generates the result of the processing of the information related to the map. The identification information specifying the road management unit included in the data is changed to the changed identification information.
According to an eighth aspect of the present invention, in the map information processing apparatus according to any one of the first to seventh aspects, a point on a road is represented as a node, and a road between adjacent nodes is represented as a link, and a road management unit is provided. Corresponds to the link, and the identification information for specifying the road management unit corresponds to the link number.
According to a ninth aspect of the present invention, in the map information processing apparatus according to any one of the first to eighth aspects, the map information processing means performs at least one of a map display process and a route calculation process. It is to be.
The invention according to claim 10 is applied to a map information processing program, and causes a computer to execute the function of the map information processing apparatus according to any one of claims 1 to 9.
[0007]
BEST MODE FOR CARRYING OUT THE INVENTION
FIG. 1 is a diagram illustrating a system for updating map data such as map display data and route calculation data. The in-vehicle navigation device 1 (hereinafter simply referred to as the navigation device 1) includes a hard disk 12 for storing map data, and a control device 11 for performing a navigation process using the map data stored in the hard disk 12.
[0008]
The navigation device 1 can also be connected to a communication device 2 such as a mobile phone. The navigation device 1 can connect to the Internet 3 via the communication device 2 and further connect to the map server 4 via the Internet 3. The map server 4 holds from the old map data to the latest map data in the map database 5. Therefore, the map server 4 can provide update data for updating a part of the map data to the navigation device 1 via the Internet 3.
[0009]
FIG. 2 is a block diagram of the navigation device 1. The navigation device 1 includes a control device 11, a hard disk 12, a current position detection device 13, an input device 14, a memory 15, a communication interface 16, and a monitor 17.
[0010]
The control device 11 includes a microprocessor and its peripheral circuits. The hard disk 12 stores map data when the navigation device 1 is shipped. The map data is appropriately updated according to update data transmitted later. The hard disk 12 is a nonvolatile storage device in which written data is not erased even when the power of the navigation device 1 is turned off.
[0011]
The current position detection device 13 is a current position detection device that detects the current position of the vehicle. For example, a direction sensor that detects the traveling direction of the vehicle, a vehicle speed sensor that detects the vehicle speed, and a GPS that detects a GPS signal from a GPS (Global Positioning System) satellite. It consists of sensors and the like. The input device 14 is an input device for inputting a destination of a vehicle or the like when searching for a route. The remote control may be used, or a touch panel provided on the screen of the monitor 17 may be used.
[0012]
The memory 15 is a memory that stores vehicle position information and the like detected by the current position detection device 13 and stores node information and link information on a recommended route calculated by the control device 11. It is. The communication interface 16 is an interface for connecting the communication device 2. Use of a mobile phone and connection to the Internet are possible via the communication interface 16. The monitor 17 is a display device that displays a map, a recommended route, and various information. The monitor 17 may be provided integrally as a part of the navigation device 1 or may be provided separately as a housing. Further, only the monitor 17 may be connected to the navigation apparatus main body by a cable or the like and provided at a separated position.
[0013]
The control device 11 uses the current position information of the vehicle detected by the current position detection device 13 and the map data stored in the hard disk 12 to display various road maps, calculate a route (search for a route), and perform various types of route guidance. Perform navigation processing. Note that various processing programs executed by the control device 11 are incorporated in a ROM (not shown) provided in the control device 11.
[0014]
−Map data−
The data structure of the above-described map data will be described in more detail. The map data is information related to a map, and includes road data, guidance data, background data, name data, route calculation data, and the like. The road data is data used for displaying a road, identifying the current location of a vehicle, and performing map matching. The guidance data includes an intersection name, a road name, a direction name, direction guide facility information, and the like, and is used when guiding a recommended route to a driver or the like based on the calculated recommended route. The background data is data for displaying a background of a road or a road map. The name data includes a place name, a building name, and the like, and is data used when displaying a road map. The route calculation data is network data including branch information that is not directly related to the road shape, and is mainly used when calculating a recommended route (route search).
[0015]
The map data of the present embodiment is managed by the navigation device 1 using the concept of level, block, and mesh. In the present embodiment, map data is divided into seven levels having different scales, the level of the most detailed scale is set to level 0, and the level of the widest area map is set to level 6. Although each level includes map data with different scales, the target area is the same for each level. That is, if the whole country is the target, the map data of the whole Japan having different scales for each level is provided. For example, at level 0, the scale is 1/6250, at level 1, the scale is 1/25000, at level 2, the scale is 1/100000, at level 3, the scale is 1/400000, at level 4, the scale is 1/16000, and at level 5, At a scale of 1/6400000 and at a level of 6, the map data has a scale of 1/12800000 in Japan. That is, there are seven sets of map data corresponding to levels 0 to 6. The level 0 side is a lower level, and the level 6 side is an upper level.
[0016]
FIG. 3 is a conceptual diagram illustrating the relationship among the levels, blocks, and meshes of map data. Representatively, levels 1 and 2 are shown. Reference numeral 101 indicates a target area of the main map data. Assuming that map data of the whole of Japan is handled, the area 101 is a range including the whole of Japan. Both level 1 and level 2 cover the same area. At level 1, the area 101 is managed by being divided into a plurality of 4 × 4 = 16 blocks 102. One block 102 is divided into a plurality of meshes 103 and managed. In the present embodiment, management is performed using m × n meshes. The number of divided meshes between the blocks 102 is the same number m × n at the same level.
[0017]
At level 2, the area 101 is managed by being divided into a plurality of 2 × 2 = 4 blocks 104. One block 104 is divided into a plurality of meshes 105 and managed. In the present embodiment, management is performed using p × q meshes. The number of divided meshes between the blocks 104 is the same number p × q at the same level.
[0018]
At level 1 and level 2, the number of blocks obtained by dividing the area 101 and the number of meshes obtained by dividing each block are different. This is a level 2 that handles a wide-area map when the scale is small (the value of the denominator is large), and a level 1 that handles a narrow-area (detailed) map when the scale is large (the value of the denominator is small) compared to the level 2. This is because the amount of data to be handled differs. That is, appropriate division is performed according to the amount of data handled at each level. However, within the same level, the size of one block and the size of one mesh are the same. Note that the number of divided blocks at each level in FIG. 3 is one example, and is not necessarily limited to this number. In the present embodiment, the map data at level 1 is narrow-area map data, the map data at level 2 is middle-range map data, and the map data at level 4 is wide-area map data.
[0019]
The vertical direction of the division corresponds to the latitude direction, and the horizontal direction corresponds to the longitude direction. The names of the blocks and meshes are given for convenience in the present embodiment. Therefore, it is not necessarily limited to these names. The mesh may be simply referred to as a partition or a parcel, the block may be referred to as a first division unit, and the mesh may be referred to as a second division unit. In addition, these blocks and meshes may be referred to as geographically divided units.
[0020]
In the present embodiment, a road is represented by the concept of a link, a node, and a link string. A node is an intersection or a specially designated point on a road. A link corresponds to a road between adjacent nodes, and a link string represents one road by a plurality of continuous links. Between nodes, position information and the like are interpolated by interpolation points. Note that the navigation device 1 and the map server 4 differ in the format of the stored map data. In the present embodiment, various formats are prepared so that the map data can be partially updated efficiently. The navigation device 1 and the map server 4 store map data and management tables in a format suitable for each device.
[0021]
−Format−
FIG. 4 is a diagram illustrating a data format in the navigation device 1 and the map server 4. In this specification, a format is used synonymously with a data format or a data structure determined by a certain rule. Various formats are a format of map data and a format of a management table. The map server 4 performs the map update processing 201 and the difference transmission processing 202 using the data of the formats B to F. The navigation device 1 performs a partial update request process 203, performs a partial update process 204 and an inverse conversion process 205 using the communication format G and the data of the format A, the format B, and the format E, and updates the map of the updated format B. A navigation process 206 is performed using the data, and data of format H is generated as appropriate.
[0022]
Various formats in updating the map data will be further described. In the following description, in the navigation device 1, updating of road data used for displaying a road, specifying the current position of a vehicle, and the like, and updating route calculation data used for a route search will be described as an example. The road data and the route calculation data are collectively referred to as map data. There are three levels of map data: a narrow level (corresponding to level 1), a middle level (corresponding to level 2), and a wide level (corresponding to level 4).
[0023]
FIG. 5 is a diagram illustrating a manner of updating the map data. FIG. 5A shows a case where a road is added. When a new road connected to a position (other than both ends) of the existing link number 4 is created, the link 4 is deleted, and links 3002 and 3003 are added instead. In addition, a link 411 for a new road is added. FIG. 5B shows a case where the shape of the road is changed. When correcting the shape of the link with the link number 2 which has already existed, the link 2 is deleted and a link 1001 is added instead. FIG. 5C shows a case where a road is deleted. When deleting the link of the link number 102 that already exists, the link 102 is deleted from the data.
[0024]
In FIG. 5, the link number is represented by a number such as 4 or 3002 or 3003 for convenience. In this embodiment, it is necessary to keep the same node number and link number of the road which does not substantially change even if different versions of map data are input by partial update. Conversely, changed nodes must always change coordinates. Therefore, in the present embodiment, the node number is updated with the universal two-dimensional position coordinates, the parameters in the height direction so that the nodes of roads not connected by a three-dimensional intersection do not have the same coordinates, and the version upgrade. In this case, the coordinates are represented by four-dimensional coordinates including the time axis parameters so that the coordinates do not become the same. The link number is obtained by arranging the start point node number and the end point node number. Direction characteristics are also given by the arrangement order of the start node number and the end node number. As described above, the node number and the link number are kept unique.
[0025]
FIG. 11 is a diagram showing a state in which the node numbers are represented in four dimensions and the link numbers are represented by combinations of the node numbers represented in four dimensions. The node number is obtained by arranging the coordinates of x, y, z, and t, and the link number is obtained by arranging the start node number and the end node number. Specifically, the x and y coordinates are universal position coordinates expressed by normalizing the latitude and longitude, the z coordinate is height information on the node, and the t coordinate is data representing the date and time of data update. . As described above, in the present embodiment, the node number and the link number are data having a long number of digits, and the values are discrete values. However, in the following description, the link numbers 1, 2,. . . And so on.
[0026]
FIG. 6 is a diagram illustrating a configuration of a communication format G between the navigation device 1 and the map server 4. FIG. 6A shows a communication format G1 when the navigation device 1 performs a map data partial update request process 203 (FIG. 4) to the map server 4. FIG. 6B shows a communication format G2 when transmitting partial update data of map data from the map server 4 to the navigation device 1. FIG. 7 is a diagram illustrating a configuration of a format A of map data used in the navigation device 1. FIG. 8 is a diagram illustrating the configuration of the format B of map data used in the navigation device 1. The format A in FIG. 7 is a format provided so that the map data can be easily updated. The format B in FIG. 8 is a format provided to facilitate navigation processing. The format B map data is generated from the format A map data. That is, the map data is updated in the format A, and then the format B map data is generated from the updated format A map data.
[0027]
-Communication format G-
The communication format G of FIG. 6 will be described in detail. When the user of the navigation device 1 performs a map data update request operation by designating a predetermined area, the navigation device 1 transmits data in the communication format G1 shown in FIG. The predetermined area is a rectangular area formed by one or more meshes specified for each mesh. The user specifies using the input device 14.
[0028]
The update area 301 in FIG. 6A is information on the area designated in this way, and is composed of a lower left coordinate 304 and an upper right coordinate 305 of the rectangular area. The number of links 302 is the number of all links in the designated area, and the link information 303 is information of each link. The link information includes a mesh number 306 and a link number 307. The link number 302 and the link information 303 are extracted by the navigation device 1 using the data of the format B.
[0029]
The communication format G2 in FIG. 6B defines update data transmitted from the map server 4 in response to an update request from the navigation device 1. A flowchart for generating the update data will be described later. Here, the communication format G2 will be described. The communication format G2 includes difference information 311, link information 312, and node information 313. In the map server 4, for example, the map data is updated every year, the first update, the second update, the third update,. . . It holds updated data every year. If there is a difference between the link information 303 of the communication format G1 of FIG. 6A sent from the navigation device 1 and the updated link information in the map server 4, the map server 4 uses the difference as update data. Send.
[0030]
The difference information 311 is grouped for each renewal year, and in the example of FIG. 6B, is divided into a first (first year) update 321 to a third (third year) update 323. The updates 321 to 323 of each year have change ID1 (331) to change IDn (332) of each year. The change IDs 1 (331) to n (332) are from the link number before change 341, the update type 342, the link number after change 1 (343), the link number after change 2 (344), the additional link number 345, and the division position 346. Be composed. That is, the difference information 311 has information on the correspondence relationship between the link before and after the change, and corresponds to a link number conversion table of format E described later.
[0031]
The link information 312 is the updated link information, and includes link 1 (351) to link m (352) in the example of FIG. Each of the links 1 (351) to m (352) includes a mesh number 361, a link number 362, a road type 363, a link type 364, narrow area map information 365, middle area map information 366, and wide area map information 367. The narrow area map information 365, the middle area map information 366, and the wide area map information 367 include a link number 371, start point coordinates 372, end point coordinates 373, the number of interpolation points 374,. . . And interpolation point coordinates 375. The link information 312 stores all updated link information such as the post-change link number 1 (343), the post-change link number 2 (344), and the additional link number 345 in the difference information 311.
[0032]
The node information 313 is updated node information, and includes the node 1 (381) to the node I (382) in the example of FIG. Each of the nodes 1 (381) to I (382) includes a node number 391, an adjacent node number 392, a connection node number 1 (393), a connection node number k (394), and traffic regulation information 395.
[0033]
In this way, when receiving the update request from the navigation device 1, the map server 4 sends the difference information 311 of the corresponding area, the link information 312 and the node information 313 updated in the area to the navigation device 1. Send.
[0034]
-Format A-
The format A in FIG. 7 will be described in detail. As described above, format A in FIG. 7 is a format provided to facilitate updating of map data, and format B in FIG. 8 is a format provided to facilitate navigation processing. When the navigation device 1 performs the navigation processing, only the data of the format B is stored in the navigation device 1. Then, when the data of the communication format G2 in FIG. 6B is transmitted to the navigation device 1, the navigation device 1 generates the data of the format A by performing the inverse conversion from the data of the format B for the target area. . Specifically, the data of the format B is inversely converted into the data of the format A for all the meshes including the link to be updated. The mesh referred to here is a mesh at a narrow level.
[0035]
Each of the mesh data 1 (401) to mesh data n (404) has link information 411 and node information 412. The link information 411 has information on all links existing in the mesh. The link number 1 information 421 to the link number 102 information 425 in FIG. 7 are link information that already exists when the data of the format B to the format A are generated by the inverse conversion, and also indicate those that are deleted by the update. Have been. The link number 3002 information 426 to the link number 1001 information 429 are link information added to the format A data by updating. Data deletion and addition by updating will be described later.
[0036]
Each link number x information 421 to 429 includes a road type 431, a link type 432, a narrow area map information 433, a middle area map information 434, and a wide area map information 435. Each of the narrow area map information 433, the middle area map information 434, and the wide area map information 435 has a link number 441, start point coordinates 442, end point coordinates 443, number of interpolation points 444, interpolation point coordinates 445, and interpolation point coordinates 446. The road type 431 has type information such as an expressway, a national road, and a prefectural road. The link type 432 has information such as one-way traffic, road width, main line, connecting road, and ramp road.
[0037]
The link number 1 information 421 to the link number 1001 information 429 in FIG. 7 manage data by using all link numbers included in the mesh at the narrow area level as keys. For example, regarding the narrow area level link number 1, the map information of the narrow area level link number 1 is included in the narrow area map information 433, and the link of the middle area level including the narrow area level link number 1 is included. The map information is included in the middle-range map information 434, and the map information regarding the wide-area level link including the narrow-area level link number 1 is included in the wide-area map information 434. In this way, all levels of link information are stored in format A.
[0038]
If the link exists in the narrow area map but does not exist in the middle area map or the wide area map, the middle area map information 434 and the wide area map information 435 have no data. In addition, the information on the links in the medium-range map and the wide-area map composed of a plurality of links in the narrow-area map includes the middle-range map information and the link information in the link number information of any one of the plurality of links in the narrow-area map. The wide area map information and the middle area map information and the wide area map information in the link number information of other links of the plurality of links are stored in an overlapping manner. However, this problem can be solved by performing software processing on the assumption that the data is stored in duplicate.
[0039]
The node information 412 has information of all the nodes existing in the mesh, and the node 1 information 431 to the node h information 433 already exist when the data from the format B to the format A is generated by the inverse conversion. Node information. The added node information 435 is node information added by updating. In the example of FIG. 5, one node is added in FIG. 5A and no node is deleted. Each of the node x information 431 to 435 has node coordinates 441, the number of connection nodes 442, the connection node number 1 (443), the connection node number j (444), the start traffic regulation information 445, and the end traffic regulation information 446. . Each of the start point side traffic regulation information 445 and the end point side traffic regulation information 446 has information of regulation 1 (451) to regulation f (452).
[0040]
FIG. 9 is a diagram for explaining information of regulation 1 (451) to regulation f (452). Assuming that the own node is 0 at the intersection of the four difference roads and the connection nodes appearing in the counterclockwise direction from east are numbers 1 to 4, the restrictions 1 (451) to f (452) include the following: Is stored as information on whether or not traffic is possible in the order of progress. 1 → 0 → 1,1 → 0 → 2,1 → 0 → 3,1 → 0 → 4,2 → 0 → 1,2 → 0 → 2,2 → 0 → 3,2 → 0 → 4,3 → 0 → 1, 3 → 0 → 2, 3 → 0 → 3, 3 → 0 → 4, 4 → 0 → 1, 4 → 0 → 2, 4 → 0 → 3, 4 → 0 → 4.
[0041]
-Format B-
The format B of FIG. 8 will be described in detail. As described above, the format B in FIG. 8 is a format provided to facilitate navigation processing. The format B includes a format B1 of the road data for calculating the current position for map display shown in FIG. 8A and a format B2 of the route calculation data shown in FIG. 8B. The navigation device 1 generates format B data from the partially updated format A data. Only the mesh data updated in the format A is newly generated and becomes the format B data.
[0042]
The format B1 in FIG. 8A is classified into the wide area data 501, the middle area data 502, and the narrow area data 503 and stored in the hard disk 12. Each of the wide area data 501, the middle area data 502, and the narrow area data 503 has mesh data 1 (511) to mesh data n (514) corresponding to a mesh divided according to each level. Each of the mesh data 1 (511) to mesh data n (514) has link string 1 information 521 to link string d information (524). The link string represents one road by a plurality of continuous links. The navigation device 1 extracts consecutive links of the same road type and the same link type from the data of the format A to generate data of a link string. Each of the link string x information 521 to 524 includes a road type 531, a link type 532, a node / interpolation point number 533, link 1 information 534,. . . It has a link m above 535.
[0043]
Each link x information 534 to 535 includes a link number 541, the number of connected links 542, a storage location 543 of the connected link 1,. . . The connection link g storage location 544, the number of interpolation points 545, the point coordinates 1 (546),. . . It has point coordinates L (546). The connection link is a link connected to a node on the forward side of each link constituting the link row. In this embodiment, since the storage location of the connection link data is stored for the connection link, the connection link data can be accessed immediately. If the information is stored by a link number, a search is required and access takes time.
[0044]
The format B2 of FIG. 8B is classified into the wide area data 551, the middle area data 552, and the narrow area data 553 and stored in the hard disk 12, as in the format B1. Each of the wide area data 551, the middle area data 552, and the narrow area data 553 has mesh data 1 (561) to mesh data n (564) corresponding to a mesh divided according to each level. Each of the mesh data 1 (561) to mesh data n (564) has node 1 information 571 to node c information (574). Each of the node x information 571 to 574 includes the number of connection nodes 581, a connection node number 1 (582), a connection node number k (583), and traffic regulation information 584.
[0045]
The road data in the format B1 in FIG. 8A and the route calculation data in the format B2 in FIG. 8B are managed separately in wide area, middle area, and narrow area data. The format A data has information on links relating to the wide area, the medium area, and the narrow area, but is not managed separately for the wide area, the medium area, and the narrow area. This is because when data is updated, it is easier to perform update processing if the data is not managed in a wide area, a medium area, and a narrow area. On the other hand, since the navigation device 1 performs the navigation process for each level according to the scale, the efficiency of the navigation process is improved by dividing and managing the wide area, the middle area, and the narrow area data.
[0046]
The entirety of the road data in the format B1 and the route calculation data in the format B2 are stored in the hard disk 12. With the navigation processing, only the necessary mesh map data can be read into the memory 15. As a result, the capacity of the memory 15 composed of a DRAM or the like can be reduced.
[0047]
The data for each of the wide area, middle area, and narrow area level of the format B is generated with reference to the narrow area map information 433, the middle area map information 434, and the wide area map information 435 of the format A. Data that overlaps with the middle-range map information 434 and the wide-range map information 435 is processed so as not to overlap. As described above, when updating data using the format A, the data is updated in link units, and information corresponding to the level (wide area, middle area, narrow area) is included in the information in link units. Then, when the data of the format B is generated, the map data according to the level is generated. The map data of each level is called a map data set. That is, the hard disk 12 of the navigation device 1 stores a map data set of a wide area level, a map data set of a medium level, a map data set of a narrow area level, and three map data sets of the format B.
[0048]
The navigation device 1 performs various navigation processes such as display of a road map, route calculation (route search), and route guidance, using the format B map data generated as described above.
[0049]
-Format H-
FIG. 10 is a diagram illustrating a format H relating to information associated with the navigation processing in the navigation device 1. The format H1 in FIG. 10A is a format of the recommended route information calculated by the route calculation. When the control device 11 of the navigation device 1 calculates the route using the route calculation data of the format B2, the control device 11 generates recommended route information of the format H1. The generated recommended route information is stored in the memory 15 and the hard disk 12, and includes the number of links 601, link 1 information 602, link 2 information 603,. . . It has link n information 605. Each link x information 602 to 605 has a mesh number 611, a link number 612, guidance information 613, a road type 614, and a road name 615. That is, link arrangement information is stored.
[0050]
Here, it is assumed that the link 4 has been updated as shown in FIG. It is assumed that link 4 is on the calculated recommended route. The control device 11 also updates the data of the format H1 for which the route has been calculated, along with the update of the map data in the navigation device 1 accompanying the transmission of the update data from the map server 4. Specifically, the number of links 601 is updated, and the link 4 information 604 is replaced with link 3002 information 621 and link 3003 information 622. By doing so, there is no need to perform route calculation again, and consistency with the updated road data can be obtained.
[0051]
The format H2 in FIG. 10B is a format of the current position management information of the vehicle. In the process of obtaining the current position of the vehicle, a process called normal map matching is performed using the position information detected by the current position detection device 13. This is to correct the current position on the road data, since a normal car travels on the road. As a result of the map matching, the road on which the own vehicle position is located is stored as a link number. However, when the link number changes due to the data update, even if the road data corresponding to the link number is referred to, the contents have changed and correct processing cannot be performed. Therefore, when the map is updated, it is necessary to discard all the link number information in the processing, and there is a problem that the map matching cannot be performed for a while when the vehicle starts traveling next time. Therefore, in the present embodiment, when the map data is updated in the current location management information of the format H2 containing the information of the map matching, the corresponding link number is also updated. By doing so, the consistency between the current position information and the updated road data is always maintained.
[0052]
The current position management information in the format H2 is stored in the memory 15 and the hard disk 12, and has a mesh number 631, a link 2 number 632, an internal division position 633, a road type 634, and a vehicle direction 635. Here, it is assumed that the link 2 is updated as shown in FIG. The information of the link 2 number is stored under the mesh number 631, but is replaced by the link 1001 information 641 with the update.
[0053]
Next, formats C to F in the map server 4 will be described.
[0054]
-Format C-
Format C in FIG. 12 is the format of the update management table. As described above, the map server 4 updates the map data, for example, every year. The first version is the base version, the first year update is the first update, the second year update is the second update, and the third year update is the third update. It is not necessary to renew every year. The interval may be shorter or longer than one year. Further, the update may not be performed periodically, but may be performed as soon as the update data is obtained.
[0055]
As shown in FIG. 5, there are three types of updates (referred to as update types): addition, change, and deletion. Since the link number changes with each update, the history is managed in this table. FIG. 12 shows the following contents. The link number 1 of the base version does not change after the third update. Link number 2 has been changed to link number 1001 in the first update. The link number 3 is changed to the link number 2001 in the second update, and is changed to the link number 3001 in the third update. The link number 4 is divided into a link number 3002 and a link number 3003 in the third update, and a link number 411 is added. The link number 99 is not changed by the third update. The link number 100 has been added in the first update. The link number 101 has been added in the first update. The link number 102 has been added in the first update and has been deleted in the second update. The link number 225 has been added in the second update. The link number 226 has been added in the second update. The link number 422 has been added in the third update. By having such an update management table, the update history for each link can be immediately grasped.
[0056]
-Format D-
The format D in FIG. 13 is a format of the link information table and the node information table held in the map server 4. The format corresponds to the format A in the navigation device 1 (FIG. 7). The format D1 in FIG. 13A is managed corresponding to the link number 701 of each link of the narrow area map information, and has a road type 702 and a link type 703. The link number 704, the start point coordinates 705, the end point coordinates 706, the number of interpolation points 707, and the interpolation point coordinates 708 are data on a link of the narrow area map information. Reference numeral 709 denotes data related to the link of the middle-range map information, and stores the same data as the link number 704, the start point coordinates 705, the end point coordinates 706, the number of interpolation points 707, and the interpolation point coordinates 708 of the narrow area map information. Similarly, reference numeral 710 is data relating to links of wide area map information.
[0057]
The format D2 in FIG. 13B corresponds to the node number 711 of each node, and corresponds to the number of connection nodes 712, the connection node number 1 (713), the connection node number 2 (714), the connection node number 3 (715), It has data of traffic regulation information 716. Update data to be transmitted is generated with reference to the link information table of format D1 and the node information table of format D2.
[0058]
-Format E-
FIG. 14 is a diagram showing a link number conversion table of format E. The link number conversion table is a correspondence table of link numbers to be transmitted to the navigation device 1. The parameters that need to be sent vary according to the three types of update (change, delete, add) shown in FIG. The map server 4 sends the oldest updates in order, and the terminal also processes the oldest updates. The navigation device 1 also generates and stores a format E link number conversion table based on the transmitted data.
[0059]
The link number conversion table has a change ID 801, a link number before change 802, an update type 803, a link number after change 1 (804), a link number after change 2 (805), an additional link number (806), and a division position 807. A correspondence table is compiled for each of the first update, the second update, the third update, and the like. FIG. 14A is a conversion table for the first update, and shows an example in which the update type is changed. FIG. 14B is a conversion table of the second update, in which the update type is an example of deletion. FIG. 14C shows a conversion table for the third update, in which an update type is added.
[0060]
-Format F-
When the user specifies a predetermined area and operates an update request of map data, an appropriate road may not be selected as a route even if the map data of the specified area is updated. FIG. 15 is a diagram for explaining this state. Road 21 and road 22 are existing roads. It is assumed that a bypass 23 is newly provided there. When the user specifies the mesh 25 as the update area, the update data relating to the link included only in the mesh 25 of the new bypass 23 is transmitted to the navigation device 1, and the navigation device 1 updates the map data. However, since the map data of the mesh adjacent to the mesh 25 is not updated, the new bypass 23 cannot be selected as a road connected to the existing roads 22 and 23.
[0061]
Therefore, in the present embodiment, the updated road is held as a single data group up to the portion connected to the existing arterial road, and even if update is specified for only some of the roads, the data group is maintained. Be sure to update all roads. As a result, an appropriate road can be selected as a route. Even if the update range is specified for each link, information on the entire related road can be transmitted using this data group.
[0062]
FIG. 16 is a diagram showing a data group table in the format F. The data group table can store a plurality of data groups, and includes the number of data groups 901, the data group 1 (902), the data group 2 (903),. . . It has a data group n (904). Each data group x902 to 904 has the number of links 911 and link information 1 (912) to link information e (913). Each link information x912-913 has a mesh number 921 and a link number 922.
[0063]
Next, a flowchart of processing in the navigation device 1 and the map server 4 using data in the format described above will be described.
[0064]
-Processing of map server 4-
FIG. 17 is a diagram illustrating a flowchart of the map update process performed by the map server 4. The map server 4 performs this process after adding new roads, correcting unusual regulation information, correcting an incorrect location, and the like. In step S11, format B data is generated using the updated data, and stored in the map database 5. This is because it is conceivable to partially update the map data using a large-capacity medium such as a CD-ROM. It is also possible to provide, for example, data of a format B in a mesh unit stored in a CD-ROM or the like to the navigation device 1, read data from a recording medium such as a CD-ROM in the navigation device 1, and directly replace the data in a mesh unit. It becomes possible. As a result, the updating process can be easily performed.
[0065]
In step S12, an update management table in format C is created which indicates the correspondence between the link units before and after the change. In step S13, a link information table of all the links in the format D1 and a node information table of all the nodes in the format D2 are created. In step S14, a data group table of format F is created. The data group table is created based on the following criteria. (1) Newly connected roads are basically grouped together. (2) Considering the appearance when the map is displayed and the quality of the route when the route is calculated (not detouring, etc.), the groups are grouped. (3) When all long roads are included in one data group, if the data size becomes too large, division is performed.
[0066]
The parameters such as the appearance when the map is displayed and the quality of the route when the route is calculated may be determined by the operator and input to the map server 4. The route calculation without a sense of discomfort or the ease of the route calculation may be used as the parameter. Further, the operator may appropriately perform grouping.
[0067]
FIG. 18 is a diagram illustrating a flowchart of the difference transmission process performed by the map server 4. This process is started in the map server 4 when a partial update request is issued from the navigation device 1. In step S21, link information and area information transmitted from the navigation device 1 are read. If the link sent is old, it must be converted to a new one. Looking at the update management table of the format C, if there is a link number transmitted from the navigation device 1 in the latest version column, there is no need to do anything because it is the latest version. If not, it has been changed or deleted, so it is registered in the format E link number conversion table while looking at the update management table.
[0068]
In step S22, it is determined whether all transmitted links have been checked. If it is determined in step S22 that all links have been checked, the process proceeds to step S27. If it is determined that all links have not been checked, the process proceeds to step S23. In step S23, it is determined whether or not the link number to be checked exists in the latest version. If it is determined that the latest version exists, the process returns to step S22 to check the next link number. If it is determined in step S23 that the latest version does not exist, the process proceeds to step S24.
[0069]
In step S24, it is determined whether the link number has been changed. If it is determined that the link number has been changed, the process proceeds to step S25. In step S25, the update type is registered as a change in the link number conversion table of format E. Thereafter, the process returns to step S22. If it is determined in step S24 that the link number has not been changed, the process proceeds to step S26. In step S26, the update type is registered as deleted in the link number conversion table. Thereafter, the process returns to step S22.
[0070]
For example, an example of the update management table shown in FIG. 12 will be described. In the map server 4, the update up to the third time has been completed. When the link number 1 is sent from the navigation apparatus 1, there is no need to do anything because the link number 1 is included in the data of the latest version (the third update). When the link number 102 is sent from the navigation device 1, it is added in the first update and deleted in the second update, so that the content is stored in the link number conversion table. When the link number 2 is sent from the navigation device 1, it has been changed to 1001 by the first update, and the content is stored in the link number conversion table. When the link number 4 is sent from the navigation device 1, since it is divided into 3002 and 3003 by the third update and 411 is newly added, the content is stored in the link number conversion table.
[0071]
In step S27, it is determined whether there is no new road in the user request area. The determination is made with reference to the format C update management table and the format D1 link information table. If it is determined that there is no new road in the user request area, the process proceeds to step S30, and if it is determined that there is a new road in the user request area, the process proceeds to step S28. In step S28, the update type is additionally registered in the link number conversion table. For example, when there is a link 422 in the area requested by the navigation device 1, this is registered in the link number conversion table. In the case of a newly established link that starts or ends from an already existing node, the link need not be divided. In step S29, it is determined whether or not all links have been added. If it is determined that all the links have been added, the process proceeds to step S30. If it is determined that all the links have not been added, the process returns to step S28 and the process is repeated.
[0072]
In step S30, if the additional link number is in the format F data group table, a link number belonging to the same data group is extracted. In step S31, all the extracted link numbers are registered in the link number conversion table as additional update types. This is because even if the data is out of the area designated by the user, a link existing in the same data group as the additional link is transmitted to the navigation device 1. If the data amount becomes too large, the user may select whether to send this data.
[0073]
In step S32, the link number conversion table of the format E is completed. In step S33, the link and node information to be transmitted are extracted from the link information table of format D1 and the node information table of format D2 while looking at the link number conversion table. Since only the link number conversion table does not have information such as the link type and the coordinates, necessary information is extracted from the link information table D1 and the node information table D2. In step S34, the link number conversion table and the link information and node information extracted in step S32 are converted into the communication format G2. In step S35, the data converted into the communication format G2 is transmitted to the navigation device 1.
[0074]
-Processing of navigation device 1-
FIG. 19 is a diagram illustrating a flowchart of the partial update request process performed by the navigation device 1. The navigation device 1 is activated when the user inputs a command to update the map. The processing performed by the navigation device 1 is executed by the control device 11.
[0075]
In step S41, the control device 11 prompts an input of an update area. Specifically, an input screen is displayed. In step S42, it is determined whether or not the user has already entered the update area. If it is determined that the input has been completed, the process proceeds to step S43, and if it is determined that the input has not been completed, the process returns to step S41 and the process is repeated. In step S43, all links in the area specified by the user are extracted. In step S44, the information indicating the designated update area and the information indicating the extracted link are converted into the communication format G1 described above. In step S45, the converted data of the communication format G1 is transmitted to the map server 4.
[0076]
FIG. 20 is a diagram illustrating a flowchart of the partial update process performed by the navigation device 1. The partial update processing is started when partial update data is transmitted from the map server 4. In step S51, the transmitted data is read. The transmitted data is the data of the communication format G2 described above. The navigation device 1 also generates a format E link number conversion table based on the difference information 311 of the communication format G2. In step S52, the inverse conversion process shown in FIG. 21 is performed.
[0077]
FIG. 21 is a diagram showing a flowchart of the inverse conversion process. In step S71,
A mesh for updating at least one link is extracted. In step S72, format A data is generated by inverse conversion from format B data corresponding to the extracted mesh. By doing so, it is not necessary to hold the data of the format A nationwide area. By generating the format A data only for the necessary area at the time of updating, it is possible to use the format A which is easy to update and to reduce the storage capacity of the hard disk 12. If the storage capacity of the hard disk 12 is sufficiently large, the inverse conversion processing may be omitted. That is, all data of format A (data of the whole country area) may be always stored in the hard disk 12.
[0078]
Returning to FIG. 20, the description will be continued. In the step S53, it is determined whether or not all the change IDs have been checked. When it is determined that all the change IDs have been checked, the process proceeds to step S62, and when it is determined that all the change IDs have not been checked, the process proceeds to step S54. In step S54, the data of the format A of the mesh including the link of the corresponding change ID is read into the memory 15. That is, the original data of the mesh to be updated (data before updating) is read. In step S55, the type of update is determined. There are three types of update. In the case of deletion, the process proceeds to step S56, in the case of change, the process proceeds to step S59, and in the case of deletion, the process proceeds to step S61.
[0079]
If the update type is added, the link before the change is deleted in step S56, the link after the change is added in step S57, and the additional link is added in step S58. In the example of FIG. 5A and FIG. 7, the link number 4 information before the change is deleted, the link number 3002 information after the change, the link number 3003 information is added, and the additional link number 411 information is added. .
[0080]
If the update type is change, the link before change is deleted in step S59, and the link after change is added in step S60. In the example of FIG. 5B and FIG. 7, the link number 2 information before the change is deleted, and the link number 1001 information after the change is added.
[0081]
If the update type is delete, the link before the change is deleted in step S61. In the example of FIG. 5C and FIG. 7, the information of the link number 102 before the change is deleted. See also FIG. When the processing of steps S58, S60, and S61 ends, the process returns to step S53 and repeats the processing.
[0082]
In step S62, all the updated mesh data is converted to format B. As shown in FIG. 8, the conversion is performed by dividing into wide-area, middle-area, and narrow-area management units. In addition, the data is separated into road data necessary for map display and position detection, and route calculation data used for route calculation. This is to improve the efficiency of the map display navigation process and the route search navigation process. That is, the data of format A that is easy to update is converted into the data of format B that is easy to perform navigation. In the road data, data is collected in units (link row units) in which connected links can be drawn with one stroke, and the data size is reduced. Specifically, successive links of the same road type and the same link type are extracted and used as a link string.
[0083]
In step S63, the data converted to the format B on the memory 15 is replaced with old data on the hard disk 12. Processed on a mesh basis. In step S64, inter-mesh connection information is created. In the updated mesh, the information of the connection link storage location of the format B may have changed at the boundary portion with the mesh that has not been updated (it is not necessary). Therefore, if the four-dimensional coordinates are the same, it is regarded as the same point, and the information of the connection link storage location is generated and stored in the format B.
[0084]
In step S65, the data of the format A on the hard disk 12 is deleted. In step S72 of FIG. 21, the data of format A is inversely converted from the data of format B and generated, so that the data of format A is unnecessary when the update is completed. Thereby, it is not necessary to hold data of the format A nationwide area, and the storage capacity of the hard disk 12 can be reduced. If the storage capacity of the hard disk 12 is sufficiently large, the above-described inverse conversion processing is omitted, and the processing in step S65 is also omitted.
[0085]
FIG. 22 is a diagram illustrating a flowchart of the navigation process performed by the navigation device 1. Although there are various types of navigation processing, the navigation processing referred to here is processing performed immediately after updating the map data. It is started after the update data of the format B is generated by the processing of FIG. When the recommended route is calculated, the navigation device 1 stores the route information in the memory 15 and the hard disk 12. The current location information is also stored in the memory 15 and the hard disk 12. At this time, if the map data is partially updated, data consistency cannot be obtained in the route guidance processing and the map display processing, causing inconvenience. Therefore, the present process is executed to match the updated map data with the result of the arithmetic processing.
[0086]
In step S81, it is determined whether or not a link before update exists in the recommended route information of the format H1. If it is determined that the link before update does not exist, the process proceeds to step S84, and if it is determined that the link before update exists, the process proceeds to step S82. In step S82, the link number in the recommended route information of format H1 is converted using the link number conversion table of format E. For example, in the case of FIG. 5A, it is necessary to replace the link 4 information with the link 3002 information and the link 3003 information as shown in FIG. Since the number of links increases, the content of the number of links 601 is also rewritten. In step S83, the internal division position is calculated again. The start point position and the end point position of the recommended route information may exist in the middle of the link. Therefore, when the link related to the start point position and the end point position is updated, it is necessary to recalculate the internal division position.
[0087]
In step S84, it is determined whether or not a link before update exists in the current position management information of the format H2. If it is determined that the link before the update does not exist, the process ends. If it is determined that the link before the update exists, the process proceeds to step S84. In step S84, the link number in the current position management information of the format H2 is converted using the link number conversion table of the format E. For example, in the case of FIG. 5B, as shown in FIG. 10B, the link 2 information is replaced with the link 1001 information. In step S86, the internal division position is recalculated, and the process ends.
[0088]
The calculation of the internal division position when a new node is added to the link where the current position is on will be described. FIG. 23 is a diagram illustrating the calculation of the internal division position. In FIG. 23, a is a new node occurrence position (represented by an internal dividing point from 0 to 100 of the original link), and b is a position on the link of the current position (an internal dividing point from 0 to 100 of the original link) ).
If a <b,
The internal division position in the updated new link is (ba) / (100-a),
If a> b,
The internal division position in the updated new link is b / a
Is required.
[0089]
-Processing of search data-
FIG. 24 is a diagram illustrating a flowchart of a search process performed by the navigation device 1. The navigation device 1 has search data and expressway information data in addition to road data and route calculation data. The search data is data in which various types of information regarding the property are stored. FIG. 25 is a diagram illustrating an example of the search data. In the search data, each property is sorted, for example, in ascending order. Each property 1001 includes a category 1002 in which a category number of a category such as a restaurant or a station is entered, a link number 1003 of a road on which the property exists, a subdivision position (between 0 and 100) 1004 in the link, a property address 1005, It has a property telephone number 1006 and a flag 1007 indicating whether the link is to the right or left of the link.
[0090]
As described above, each property information of the search data has the link number. As described above, when the link is updated and the link number is changed, the link number in the search data also needs to be updated. However, the number of search data is large, and updating the search data every time the update is performed is inefficient. Therefore, in the present embodiment, processing as shown in FIG. 24 is performed.
[0091]
In step S91, normal search processing is performed using the search data. In step S92, it is determined whether the link number of the property detected in step S91 has been updated. Whether or not it has been updated is checked by referring to the link number conversion table of format E. If it is determined that the information has not been updated, the process ends. If it is determined that the information has been updated, the process proceeds to step S93. In step S93, the link number is converted using the link number conversion table. In step S94, the internal division position on the converted link is calculated again. Recalculation of the internal division position is performed in the same manner as in FIG.
[0092]
As described above, when the link information is actually used, it is determined whether the corresponding link information has been updated using the link number conversion table. If updated, the updated link information is used. Thus, it is not necessary to update a large amount of data each time, and at the same time, consistency with the updated data can be ensured.
[0093]
The present embodiment as described above has the following effects.
(1) Since there are two types of data, format A for updating map data and format B, which is easy for software to realize the navigation function to process, both partial updating and navigation processing can be performed efficiently. It is possible to prevent the efficiency of the navigation process from being reduced by using data in a format convenient for updating, and to prevent the efficiency of the updating process from being reduced by using data in a format convenient for navigation processing.
(2) The navigation device 1 does not normally hold the format A data, but generates the data from the format B by inverse conversion at the time of updating. As a result, the capacity of the hard disk 12 can be reduced.
(3) When the link is updated, the link number of the recommended route is also updated, so that it is not necessary to recalculate the route search using the updated data. Data consistency can be obtained.
(4) When the link is updated, the link number in the current position management information is also updated, so that data consistency can be ensured.
(5) Since the link number conversion table is provided, the correspondence between the link before update and the link after update can be easily grasped.
(6) When handling large data such as search data, the link number conversion table is first determined to determine whether there has been an update. Thus, it is not necessary to update large data each time, and the latest data can be acquired and processed when needed. As a result, processing efficiency is improved. Even when the position set by the user is stored in association with the link, it may be handled in the same manner as the search data.
(7) The newly created road has a link to be connected as a data group. Even if a user requests to update a part of the area, information on a series of links stored in the data group is transmitted, so that the route is not interrupted. As a result, even when the user issues an update instruction for only a part of the area, an appropriate route search can be performed, and the appearance of the map display can be improved.
(8) In the navigation device 1, map data is divided into levels and used properly, but only data of format A need be prepared at the time of updating, and it is not necessary to prepare updated data of all levels.
(9) Since the four-dimensional coordinates are used for specifying the node, it is possible to reliably specify the point where the intersection crosses or the data is updated.
(10) Since the transmission of the update data is performed on a link basis, the transmission capacity can be reduced. In the navigation device 1, processing is performed in mesh units, so that the efficiency is high.
(11) Since the update data is provided by communication via the Internet, the latest update data can be provided quickly and at low cost.
(12) Since two-dimensional coordinate values corresponding to latitude and longitude are used for the node position information, it is possible to prevent the data update method from depending on the model or the standard. . That is, since the two-dimensional coordinates corresponding to the latitude and longitude can be said to be universal data, the data update method can be standardized by using these data.
[0094]
In the above embodiment, the control program executed by the control device 11 of the navigation device has been described as an example stored in the ROM. However, the present invention is not limited to this. It is also possible to provide the control program and its installation program via a transmission medium such as a communication line represented by the Internet. That is, it is also possible to convert the program into a signal on a carrier wave that carries the transmission medium and transmit the signal. When the program is provided on the Internet, the program may be provided in the same configuration as in FIG. For example, the map server 4 may be a server that provides an application program.
[0095]
Further, the above-described control program may be executed on a personal computer to realize a car navigation device. FIG. 26 is a diagram showing this state. In this case, the current position detection device 13 and the input device 14 may be connected to a predetermined I / O port or interface of the personal computer 30. The program may be provided on a recording medium such as the Internet 31 or a CD-ROM. The recording medium need not be limited to a CD-ROM, but may be a DVD, a magnetic tape, or any other recording medium. When providing the program via the Internet 31, the application program server 32 reads out the program stored in the database 33 and provides the program. The database 33 can also be said to be a recording medium.
[0096]
In the above-described embodiment, an example has been described in which update data is provided via the Internet. However, the present invention is not limited to this. The update data may be written on a CD-ROM, a DVD-ROM, or the like, and provided on a recording medium. In this case, the navigation device 1 needs to be equipped with a recording medium driving device.
[0097]
In the above embodiment, the example of the in-vehicle navigation device 1 has been described, but it is not necessary to limit to this content. It is also applicable to portable navigation devices. Also, the present invention can be applied to a case where navigation is realized by a mobile phone, a PDA, or the like. That is, the present invention can be applied to any device that performs navigation.
[0098]
In the above embodiment, an example in which map data is stored in the hard disk 12 in the navigation device 1 has been described, but it is not necessary to limit to this content. It may be stored in another rewritable nonvolatile memory.
[0099]
In the above embodiment, an example in which the road data and the route calculation data are updated has been described, but the present invention is not limited to this. For example, the present invention can be applied to guidance data and other map data.
[0100]
In the above-described embodiment, an example has been described in which the update information is provided from the map server 4 in response to an update request from the user in the navigation device 1, but the present invention is not limited to this. If the map server 4 updates the map data, the map data may be transmitted from the map server 4 as appropriate. That is, the map data of the navigation device 1 may be automatically updated.
[0101]
Although various embodiments and modifications have been described above, the present invention is not limited to these contents. Other embodiments that can be considered within the scope of the technical idea of the present invention are also included in the scope of the present invention.
[0102]
【The invention's effect】
ADVANTAGE OF THE INVENTION According to this invention, even if there exists partial update of map data, the correspondence between the road before update and the road after update can be taken reliably.
[Brief description of the drawings]
FIG. 1 is a diagram illustrating a system for updating map data such as map display data and route calculation data.
FIG. 2 is a block diagram of an on-vehicle navigation device.
FIG. 3 is a conceptual diagram illustrating a relationship among levels, blocks, and meshes of map data.
FIG. 4 is a diagram illustrating a data format in a navigation device and a map server.
FIG. 5 is a diagram illustrating a manner of updating map data.
FIG. 6 is a diagram illustrating a configuration of a communication format G between a navigation device and a map server.
FIG. 7 is a diagram illustrating a configuration of a format A of map data used in the navigation device.
FIG. 8 is a diagram illustrating a configuration of a format B of map data used in the navigation device.
FIG. 9 is a diagram illustrating regulation information.
FIG. 10 is a diagram illustrating a format H relating to information accompanying a navigation process in the navigation device.
FIG. 11 is a diagram illustrating a state in which node numbers are represented in four dimensions, and link numbers are represented by combinations of node numbers.
FIG. 12 is a diagram illustrating a configuration of a format C of an update management table.
FIG. 13 is a diagram illustrating a configuration of a format D of a link information table and a node information table held in a map server.
FIG. 14 is a diagram showing a link number conversion table of format E;
FIG. 15 is a diagram illustrating a case where the user specifies a predetermined area and performs an operation of requesting update of map data.
FIG. 16 is a diagram showing a data group table in a format F.
FIG. 17 is a diagram showing a flowchart of a map update process performed by the map server.
FIG. 18 is a diagram illustrating a flowchart of a difference transmission process performed by the map server.
FIG. 19 is a diagram illustrating a flowchart of a partial update request process performed by the navigation device.
FIG. 20 is a diagram illustrating a flowchart of a partial update process performed by the navigation device.
FIG. 21 is a diagram illustrating a flowchart of an inverse conversion process performed by the navigation device.
FIG. 22 is a diagram illustrating a flowchart of a navigation process performed by the navigation device.
FIG. 23 is a diagram illustrating calculation of an internal division position.
FIG. 24 is a diagram showing a flowchart of a search process performed by the navigation device.
FIG. 25 is a diagram showing an example of search data.
FIG. 26 is a diagram showing a state where a control program is executed on a personal computer.
[Explanation of symbols]
DESCRIPTION OF SYMBOLS 1 Navigation device 2 Communication device 3 Internet 4 Map server 5 Map database 11 Control device 12 Hard disk 13 Current position detection device 14 Input device 15 Memory 16 Communication interface 17 Monitor 19 Input device

Claims (10)

A map information processing device for processing information related to a map,
Update information acquiring means for acquiring update information for updating a part of the map data used for processing information relating to the map;
Updating means for updating the map data using the obtained update information;
Map information processing means for processing information about the map using the updated map data,
The map data has identification information that specifies a predetermined management unit of a road,
The map information processing means has a correspondence table between identification information before change and identification information after change regarding identification information that specifies the management unit of the road in accordance with updating of the map data, and uses the correspondence table. A map information processing apparatus for processing information related to a map. The map information processing apparatus according to claim 1,
The map information processing means uses the correspondence table to change the identification information for specifying the road management unit included in the data generated as a result of the processing of the information on the map to the changed identification information. A map information processing apparatus, characterized in that: The map information processing apparatus according to claim 2,
The map information processing apparatus, wherein the data generated as a result of the processing of the information on the map is data on a recommended route generated as a result of a route calculation. The map information processing apparatus according to any one of claims 2 to 3,
A map information processing apparatus, wherein the data generated as a result of the processing of the information on the map is data on a current position. The map information processing apparatus according to any one of claims 2 to 4,
The map information processing means, when changing the identification information for specifying the management unit of the road included in the data generated as a result of the processing of the information on the map to the identification information after the change, the identification information after the change A map information processing apparatus for recalculating an internal division position based on a road management unit. The map information processing apparatus according to claim 1,
The map information processing means includes:
Performing information processing on the map by further using first data having identification information for specifying the road management unit, the data being different from the map data;
When the first data is used, the correspondence table is used to determine whether or not the identification information for specifying the road management unit included in the first data has been changed with the update of the map data. And judge,
When it is determined that the identification information that specifies the management unit of the road included in the first data has been changed with the update of the map data, the identification information is included in the first data using the correspondence table. A map information processing apparatus, wherein the identification information for specifying the road management unit is changed to the changed identification information and used. A map information processing device for processing information related to a map,
Update information acquiring means for acquiring update information for updating a part of the map data used for processing information relating to the map;
Updating means for updating the map data using the obtained update information;
Map information processing means for processing information about the map using the updated map data,
The map data has identification information that specifies a predetermined management unit of a road,
When the identification information that specifies the management unit of the road is changed in accordance with the update of the map data, the map information processing unit performs management of the road included in the data generated as a result of processing the information related to the map. A map information processing apparatus, wherein identification information for specifying a unit is changed to changed identification information. The map information processing apparatus according to any one of claims 1 to 7,
Points on the road are represented as nodes, roads between adjacent nodes are represented as links,
The management unit of the road corresponds to the link,
2. The map information processing apparatus according to claim 1, wherein the identification information for specifying the road management unit corresponds to a link number. The map information processing apparatus according to any one of claims 1 to 8,
The map information processing apparatus performs at least one of a map display process and a route calculation process. A map information processing program for causing a computer to execute the functions of the map information processing apparatus according to claim 1.

Images