JP2010014657A - Map information processing apparatus - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a map information processing apparatus capable of performing route searches and route guidance over maps of new and old versions. <P>SOLUTION: The map information processing apparatus includes both a map data storage part 102 and a route search/guidance part 107. The map data storage part stores map data having a hierarchical structure, and its version is to be upgraded for every area in which the version of an upper-layer map corresponding to a lower-layer map is upgraded according to the upgrade of the version of the lower-layer map; and the route search/guidance part searches for routes through the use of map data of the lower-layer map and the upper-layer map stored in the map data storage part, displays a route on the lower-layer map corresponding to a route on the upper-layer map acquired by the route search in the case that it exists to perform route guidance, and performs simplified guidance indicating the direction to a destination in the case that a route on the lower-layer map corresponding to a route on the upper-layer map does not exist. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a map information processing apparatus that processes map information, and more particularly to a technique for handling a case where map information is partially upgraded.

  The navigation device holds map data including road data, and uses the map data to realize functions such as calculation and display of the vehicle position, route search to the destination, and route guidance.

  The map data used in such a navigation device has a hierarchical structure corresponding to the details of the map. For example, the most detailed map is level 0, and the roughest map is level n-1 (n is an integer of 2 or more). It becomes. A map at each level is composed of a unit map obtained by dividing a creation range such as the entire Japan into a plurality of meshes, and data representing the unit map is referred to as mesh data. The reason why the map is divided into a plurality of meshes and each is represented by mesh data is to divide the map into a plurality of meshes, thereby reducing the data size to be handled and making the navigation device easier to handle. The mesh data includes road data, background data, character data, and the like.

  The road data includes link data that defines a link representing a road and node data that defines a node representing an intersection. The link data includes node record numbers representing nodes at both ends of the link, and the node data includes link record numbers of links connected to the nodes, and these represent road connection relationships.

  A node on the mesh boundary (hereinafter referred to as “boundary node”) includes the node record number of the adjacent mesh to be connected as adjacent information, and realizes connection of road data between the meshes.

  In addition, when an actual road is expanded, renovated, or abolished, upgraded map data is provided by the manufacturer of the navigation device or the map maker. The number or node record number may change. For this reason, when only a part of the area is upgraded, the adjacent information may not be set correctly between the map data of the old and new versions, and as a result, the old and new versions cannot be used together.

  In order to solve this problem, Patent Document 1 has a two-layer structure of map data at an upper layer level and a lower layer level, and when map data of different versions are mixed on the way to the destination, an upper layer map A technique is disclosed that searches to a position near the destination using the data and restarts the search when the version of the map data on the way to the destination becomes equal due to the movement of the vehicle. Patent Document 1 and Patent Document 2 disclose a technique for providing connection data between old and new versions of map data by providing dedicated data indicating connection relationships and updating dedicated data at the time of version upgrade.

JP 2007-101865 A JP 2004-212456 A

  However, in the technique disclosed in Patent Document 1 described above, there is a problem that the search route changes during traveling because a re-search is performed by the movement of the vehicle. In particular, when the map including the destination is an old version, route search and route guidance become impossible, or there is a high possibility that a wrong route is searched and guided. Further, Patent Document 1 and Patent Document 2 described above do not disclose a method for performing a hierarchical search and guidance across new and old versions of a map.

  The present invention has been made to solve the above-described problems, and an object thereof is to provide a map information processing apparatus capable of performing route search and route guidance across new and old versions of maps.

  In order to solve the above-described problem, a map information processing apparatus according to the present invention has a hierarchical structure and is map data that is upgraded for each region, and corresponds to the lower-layer map according to the upgrade of the lower-layer map. A route search is performed using the map data storage unit that stores the upgraded map data of the upper layer map, the map data of the lower layer map and the upper layer map stored in the map data storage unit, and obtained by the route search. If there is a route on the lower layer map corresponding to the route on the upper layer map, the route is displayed and route guidance is performed, and if there is no route on the lower layer map corresponding to the route on the upper layer map, A route search / guidance unit that performs simple guidance indicating the direction of the destination is provided.

  According to the map information processing apparatus of the present invention, a route search is executed using map data of the lower layer map and the upper layer map, and a route on the lower layer map corresponding to the route on the upper layer map obtained by the route search is obtained. When there is a route, the route is displayed and route guidance is performed. When there is no route on the lower layer map corresponding to the route on the upper layer map, simple guidance indicating the direction of the destination is performed. Route search and route guidance will not become impossible, and route search and route guidance can be performed across new and old versions of maps.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In the following, a case where the map information processing apparatus according to the present invention is applied to a navigation apparatus will be described as an example.
Embodiment 1 FIG.
1 is a block diagram showing a configuration of a map information processing apparatus according to Embodiment 1 of the present invention. The map information processing apparatus includes a navigation control unit 100, a map data input unit 101, a map data storage unit 102, a GPS (Global Positioning System) receiver 103, and a self-supporting sensor 104.

  The navigation control unit 100 corresponds to the “control unit” of the present invention, and executes various processes for realizing the navigation function. Details of the navigation control unit 100 will be described later.

  The map data input unit 101 includes, for example, a recording medium such as an upgrade disk or a memory card, or a mobile phone that acquires map data by communication from a center (not shown), and inputs a new version of map data. The map data input from the map data input unit 101 is sent to the map data storage unit 102.

  The map data storage unit 102 includes a rewritable storage device such as an HDD (Hard Disk Drive), and stores map data. The map data storage unit 102 stores map data stored at the time of shipment of the navigation device, as well as new version map data input by the map data input unit 101. The map data stored in the map data storage unit 102 is read out by the navigation control unit 100.

  The GPS receiver 103 receives a radio wave transmitted from a GPS satellite and detects its current position. The current position detected by the GPS receiver 103 is sent to the navigation control unit 100 as current position data.

  The self-supporting sensor 104 includes a speed sensor and a direction sensor (both not shown). The own moving speed detected by the speed sensor is sent to the navigation control unit 100 as speed data. The traveling direction detected by the direction sensor is sent to the navigation control unit 100 as direction data.

  Next, details of the navigation control unit 100 will be described. The navigation control unit 100 includes a display control unit 105, a vehicle position calculation unit 106, a route search / guidance unit 107, and an operation control unit 108. The display control unit 105 executes processing for displaying a map, a recommended route, various messages, and the like on a monitor (not shown).

  The vehicle position calculation unit 106 is indicated by vehicle position data calculated by autonomous navigation based on current position data sent from the GPS receiver 103 or speed data and direction data sent from the self-supporting sensor 104. The coordinates of the vehicle position to be calculated are calculated, and further, the road on the map on which the vehicle is located is calculated using the map data stored in the map data storage unit 102. The own vehicle position calculated by the own vehicle position calculation unit 106 is used as a starting point in the route search / guidance unit 107 and also used by the display control unit 105 to display the own vehicle position mark on the map. The

  The route search / guidance unit 107 performs a route search from the current position (departure point) calculated by the own vehicle position calculation unit 106 to the destination input by the control of the operation control unit 108 and represents a recommended route. While calculating data, the process for performing route guidance along the recommended route shown by this calculated route data is performed.

  The operation control unit 108 controls, for example, an operation panel, a remote controller (remote controller), a touch panel or a voice input device (all of which are not shown), and thereby various information (for example, a destination) corresponding to these operations. Execute the process for entering.

  Next, map data stored in the map data storage unit 102 will be described. FIG. 2 is a diagram showing a format of map data of each layer. The map data format is the same as the conventional map data format except for the road data format described later. That is, the map data includes a data header, the number of hierarchical levels: n, and level data of levels 0 to n-1 (hereinafter referred to as “level 0 to n−1 data”).

  The data header includes data representing a data version, a data size, and a creation range. The creation range includes data representing the creation area left end Xs, the creation area upper end Ys, the creation area right end Xe, and the creation area lower end Ye.

  The level m data includes X direction data number: Xm, Y direction data number: Ym, and mesh data (0, 0) to mesh data (Xm-1, Ym-1). The mesh data (Xm-1, 0) includes a mesh coordinate (Xm-1, 0), a data version, a header, road data, background data, and character data.

  FIG. 3 is a diagram showing an example of a mesh represented by the level m data of the map data defined as described above. A map corresponding to one mesh is referred to as a “unit map” in this specification. FIG. 4 is a diagram for explaining the hierarchical structure of the map data, and each hierarchy is configured by dividing the upper mesh into a plurality of layers. In the example shown in FIG. 4, the map data is composed of three layers, level 0 (lowermost layer) to level 2 (uppermost layer), and the level 1 mesh divides the level 2 mesh into 4 × 4. The mesh is configured by dividing a level 1 mesh into 4 × 4.

  FIG. 5 shows the format of the road data shown in FIG. As shown in FIG. 5A, the road data includes node data representing nodes such as intersections and link data representing links that are roads between nodes.

  As shown in FIG. 5B, the node data is composed of the number of node records and a plurality of node records # 0 to # n-1. Each of the node records # 0 to # n−1 includes node coordinates indicating the position of the node, node attributes indicating whether the node is an intersection or a boundary node, an adjacent unit map (hereinafter simply referred to as “adjacent map”). Information), the number of connection links indicating the number of links connected to the node, and the link record number corresponding to the number of connection links. The adjacency information is valid information only when the node attribute represents a boundary node. The adjacent information can be configured not to hold the adjacent information in the road data when the node attribute is not a boundary node. According to this configuration, the total amount of road data can be reduced.

  As shown in FIG. 5C, the link data includes the number of link records and a plurality of link records # 0 to # n-1. Each of the link records # 0 to # n-1 includes a start point node record number and an end point node record number indicating the link start point and end point node, a link type indicating the link type, a link attribute indicating the link attribute, and all A link ID number added as a unique value to the link, a link length representing the length of the link, and a link shape representing the shape of the link. The link shape includes the number of shape coordinates and shape coordinates # 0 to # n-1.

  As shown in FIG. 5D, the adjacency information includes a link ID number. As shown in FIG. 5E, the link ID number includes a start point side link ID number on the start point node record side and an end point side link ID number on the end point node record side, and has a predetermined width. When the link is divided due to version upgrade, the link ID number is reassigned within the range of the start side link ID number and the end point side link ID number.

  FIG. 6 is an example showing the structure of the background data shown in FIG. 2, and is composed of the number of background data records and background data records # 0 to # n-1. Each of the background data records # 0 to # n-1 includes a background data type representing the type of river or green space, the number of shape coordinates, and shape coordinates # 0 to # m-1 representing the background shape. Yes.

  FIG. 7 is a diagram showing a format of route data calculated by the route search / guidance unit 107. This route data includes departure point coordinates indicating the departure point of route search, destination coordinates indicating the destination, number of route links, and route links # 0 to # n-1. Each of the route links # 0 to # n-1 is a route level indicating the hierarchical level of the map to which the link belongs, the mesh coordinates (X, Y), the link ID number that identifies the link, and the direction of the link and the direction of the route. It consists of.

  Using the map data described above, the road connection relationship between adjacent unit maps (mesh) is expressed as follows. In FIG. 8, the link ID number of the link 603 is the start point side “10” and the end point side “19” (hereinafter referred to as “10:19”), and the link ID number of the link 604 is “20:29”. If there are, the adjacent information of the boundary nodes 601 and 602 is “20:29” and “10:19”, respectively.

  As shown in FIG. 9, when the link 604 shown in FIG. 8 is divided into a link 702 and a link 703, “20:24” and “25:29” are assigned as link ID numbers, respectively.

  Next, the operation of the map information processing apparatus configured as described above according to Embodiment 1 of the present invention will be described with reference to the flowcharts shown in FIGS. Below, it demonstrates centering on the process which acquires the link of an adjacent map from a boundary node. This process is executed in the navigation control unit 100 in response to a map data acquisition request from the display control unit 105, the vehicle position calculation unit 106, or the route search / guidance unit 107.

  In the process of acquiring the link of the adjacent map from the boundary node, first, the node attribute is acquired (step ST11). That is, the navigation control unit 100 reads the requested map data from the map data storage unit 102, and acquires the node attribute from the node data of the road data included in the read map data.

  Next, it is checked whether or not the node attribute acquired in step ST11 is a boundary node (step ST12). If it is determined in step ST12 that the node attribute is not a boundary node, the process of acquiring the link of the adjacent map from the boundary node ends. On the other hand, if it is determined in step ST12 that the node attribute is a boundary node, then adjacent information is acquired (step ST13). That is, the link ID number of the adjacent map stored as the adjacent information is acquired from the node record of the node data.

  Next, the adjacent map is read (step ST14). That is, the map data of the mesh next to the mesh is read. Next, adjacent link acquisition processing is executed (step ST15). In this adjacent link acquisition process, a process of acquiring a link ID number that matches the adjacent information from the adjacent map is performed. Details of this adjacent link acquisition processing will be described later.

  Next, it is checked whether the acquisition of the adjacent link is successful (step ST16). If it is determined in this step ST16 that the acquisition of the adjacent link is successful, the process of acquiring the link of the adjacent map from the boundary node ends. On the other hand, if it is determined in step ST16 that the acquisition of the adjacent link has not been successful, it is determined that the node is a dead end node, and that is set (step ST17). Thereby, even if the road data is not connected due to a difference in version, the navigation operation can be performed correctly. Thereafter, the process of acquiring the link of the adjacent map from the boundary node ends.

  Next, the adjacent link acquisition process executed in step ST15 will be described with reference to the flowchart shown in FIG.

  In the adjacent link acquisition process, first, the first link record in the link data is acquired (step ST21). Next, a link ID number is acquired from the link records acquired in step ST21 (step ST22). Next, it is checked whether or not the link ID number acquired in step ST22 is within the range of the adjacent information acquired in step ST13 described above (step ST23).

  If it is determined in step ST23 that it is within the range of the adjacent information, then the start point side node is acquired (step ST24). Next, it is checked whether or not the start point side node acquired in step ST24 is a boundary node (step ST25). In step ST25, when it is determined that the starting point side node is a boundary node, it is recognized that the acquisition is successful, and the sequence proceeds to step ST28.

  On the other hand, if it is determined in step ST25 that the start point side node is not a boundary node, then the end point side node is acquired (step ST26). Next, it is checked whether or not the end node obtained in step ST26 is a boundary node (step ST27). In this step ST27, when it is determined that the end node is a boundary node, it is recognized that the acquisition is successful, and the sequence proceeds to step ST28. In step ST28, the acquisition success is set. Thereafter, the adjacent link acquisition process ends, and the process returns to the process shown in FIG.

  If it is determined in step ST23 that it is not within the range of the adjacency information, and if it is determined in step ST27 that the end node is not a boundary node, is it the last link record? It is checked whether or not (step ST29). If it is determined in this step ST29 that it is not the last link record, the next link record is acquired (step ST30). Thereafter, the sequence returns to step ST22, and the above-described processing is repeated.

  If it is determined in step ST29 that it is the last link record, it is recognized that the acquisition has failed, and that fact is set (step ST31). Thereafter, the adjacent link acquisition process ends, and the process returns to the process shown in FIG.

  Next, hierarchical search and guidance will be described. Usually, in the navigation device, the route link indicated by the route data is expanded into the lowest layer (level 0) link, and a screen as shown in FIG. The reason why the link is expanded to the lowest layer is that a link having low importance is omitted in the upper layer, so that a node existing in the lower layer may not exist in the upper layer, and correct guidance cannot be performed.

  FIG. 13 is a diagram for explaining the correspondence relationship of hierarchized links. The correspondence relationship of the links is defined by the inclusion relationship of the link ID numbers. In FIG. 13, the upper layer link 801 corresponds to the lower layer links 804 and 805. This state is called “existing”. When only the upper layer is upgraded, there may be a case where some or none of the links corresponding to the upper layer link exist in the lower layer due to the construction or extension of a road. A state in which the lower layer link 806 corresponding to the upper layer link 802 partially corresponds to “partially new”, and a state in which no lower layer link corresponding to the link 803 exists is referred to as “newly established”.

  FIG. 14 is a flowchart showing route guidance processing when traveling on a route. This guidance process is mainly executed in the route search / guidance unit 107.

  In the route guidance process, first, a running link is acquired (step ST41). That is, the route search / guidance unit 107 acquires link data of a road where the vehicle position calculated by the vehicle position calculation unit 106 exists. Next, a link ID number is acquired (step ST42). That is, the link ID number included in the link data acquired in step ST41 is acquired.

  Next, the head route link is acquired (step ST43). That is, the head link data constituting the route indicated by the route data is acquired. Next, the link ID number of the route link is acquired (step ST44). That is, the link ID number of the route link acquired in step ST43 is acquired.

  Next, it is checked whether or not the link ID number of the running link is included (step ST45). That is, it is checked whether or not the link ID number acquired in step ST42 is included in the link ID number having the width acquired in step ST44. If it is determined in step ST45 that the link ID number of the running link is included, it is recognized that the vehicle is traveling on the route, and guidance A is implemented (step ST46). That is, a screen as shown in FIG. 12 is displayed, and left / right turn guidance is performed. Thereafter, the route guidance process ends.

  On the other hand, if it is determined in step ST45 that the link ID number of the running link is not included, it is then checked whether it is the last route link (step ST47). If it is determined in step ST47 that it is not the last route link, the next route link is acquired (step ST48). Thereafter, the sequence returns to step ST44, and the above-described processing is repeated.

  If it is determined in step ST47 that the route link is at the end, it is recognized that the vehicle is traveling outside the route, and guidance B is implemented (step ST49). That is, a screen as shown in FIG. 15 is displayed, and guidance indicating the direction of the destination is performed. Thereafter, the route guidance process ends.

  As described above, according to the map information processing apparatus according to Embodiment 1 of the present invention, as shown in FIG. 9, a link record can be correctly acquired from adjacent information of boundary nodes. It is possible to connect to a road of a new map, and thereby route guidance similar to that of the new map can be performed.

Embodiment 2. FIG.
The map information processing apparatus according to Embodiment 2 of the present invention displays a route shape on an upper layer map. The configuration of the map information processing apparatus according to the second embodiment is the same as the configuration of the map information processing apparatus according to the first embodiment (see FIG. 1).

  16 and 17 are diagrams for explaining the operation of the map information processing apparatus according to the second embodiment. FIG. 16 shows a lower layer map in which the shape of the route link of the upper layer map (hereinafter referred to as “upper layer route link”) in which there is no link corresponding to the lower layer map (hereinafter referred to as “lower layer link”) differs from the road display. It is a figure which shows the example displayed by overlapping. FIG. 12 is a diagram illustrating an example in which the shape of the upper layer route link in which no lower layer link exists is displayed superimposed on the lower layer map with a line 1201 similar to a normal road marking.

  Next, the operation of the map information processing apparatus according to the second embodiment of the present invention will be described with reference to the flowcharts shown in FIGS. 18 to 20, focusing on the processing shown in FIGS. explain.

  First, a selection process for selecting a route link to be displayed will be described with reference to a flowchart shown in FIG. In this selection process, a process of selecting new and partially new route links as display targets and storing them in a list (not shown) is performed.

  In this selection process, first, a head route link is acquired (step ST51). That is, the head link data constituting the route indicated by the route data is acquired. Next, it is checked whether or not it is within the display area (step ST52). That is, it is checked whether or not the link indicated by the link data acquired in step ST51 described above or step ST61 described later is a link to be displayed in the display area of the monitor.

  If it is determined in step ST52 that it is not within the display area, the sequence proceeds to step ST60. On the other hand, if it is determined in step ST52 that it is within the display area, then the link state is determined (step ST53). That is, it is checked whether the route link indicated by the link record acquired in step ST51 or step ST61 is “new”, “partially new”, or “existing”.

  If it is determined in step ST53 that the route link is “new”, then a map including the route link is read (step ST54). That is, map data including a route link is read from the map data storage unit 102. Next, a link record is taken out (step ST55). That is, the link record corresponding to the route link is extracted from the link data constituting the road data included in the map data read in step ST54. Then, it is added to a new list (step ST56). That is, the link record extracted in step ST55 is added to a new list (not shown). Thereafter, the sequence proceeds to step ST60.

  If it is determined in step ST53 that the route link is “partially new”, then a map including this route link is read (step ST57). That is, map data including a route link is read from the map data storage unit 102. Next, a link record is taken out (step ST58). That is, the link record corresponding to the route link is extracted from the link data constituting the road data included in the map data read in step ST57.

  Next, a part is added to the new list (step ST59). That is, the link record extracted in step ST58 is added to a partially new list (not shown). Thereafter, the sequence proceeds to step ST60. If it is determined in step ST53 that the link is “existing”, the sequence proceeds to step ST60.

  In step ST60, it is checked whether it is the last link record. If it is determined in step ST60 that it is not the last link record, the next link record is acquired (step ST61). Thereafter, the sequence returns to step ST52, and the above-described processing is repeated. On the other hand, if it is determined in step ST60 that it is the last link record, the selection process ends.

  Next, the new link display process for displaying the shape of the new link based on the link record stored in the new list in the selection process described above will be described with reference to the flowchart shown in FIG. In the new link display process, first, a list record is extracted from the list (step ST71). That is, the link record stored in the new list is extracted.

  Next, the link shape is taken out (step ST72). That is, data representing the link shape included in the link record, more specifically, the shape coordinates are extracted. Next, a process of displaying as a line segment is performed (step ST73). That is, the shape of the new road is created by connecting the shape coordinates extracted in step ST72 with a line, and is displayed on the monitor under the control of the display control unit 105. Thus, the new link display process ends.

  Next, a partially new link display process for displaying a shape based on the link record stored in the partially new list in the selection process described above will be described with reference to the flowchart shown in FIG. In the partially new link display process, first, a list record is extracted from the list (step ST81). That is, a link record that is partially stored in the new list is extracted.

  Next, the link shape is taken out (step ST82). That is, data representing the link shape included in the link record, more specifically, the shape coordinates are extracted. Next, the display target shape is narrowed down (step ST83). In narrowing down the display target shape, as shown in FIG. 21, the lower layer link shape 1302 is subtracted from the upper layer link shape 1301, and the result is used as the display target shape 1303.

  Next, a process of displaying as a line segment is performed (step ST84). That is, based on the display target shape 1303 obtained in step ST83, a part of a new road shape is created and displayed on the monitor under the control of the display control unit 105. As described above, the partially new link display process ends.

  As described above, according to the map information processing apparatus according to Embodiment 2 of the present invention, the shape of the searched route can be grasped even on a road that does not exist on an old map.

Embodiment 3 FIG.
The map information processing apparatus according to Embodiment 3 of the present invention is such that the route on the upper layer map is added to the road data of the lower layer in the map information processing apparatus according to Embodiment 1 or Embodiment 2. is there.

  FIG. 22 is a block diagram showing the configuration of the map information processing apparatus according to Embodiment 3 of the present invention. This map information processing apparatus is configured by adding a road data adding unit 201 to the map information processing apparatus according to the first embodiment. When the route search / guidance unit 107 determines that the route on the lower layer map corresponding to the route on the upper layer map obtained by the route search does not exist, the road data adding unit 201 determines the route of the upper layer map. Road data of the lower layer map is generated from the shape of the link to be configured and added to the map data storage unit 102.

  Next, the operation of the map information processing apparatus according to Embodiment 3 of the present invention will be described with reference to the flowcharts shown in FIGS. 23 and 24, focusing on the process of adding route links as road data. First, a new link addition process for adding a new link as road data will be described with reference to the flowchart shown in FIG.

  In the new link addition process, first, a link record is extracted from the list (step ST91). That is, the link record is extracted from the new list. Subsequently, the process added to road data is performed (step ST92). That is, the road data adding unit 201 generates road data of the lower-level map from the link shape formed by the link record extracted in step ST91 and adds it to the map data storage unit 102. Thereafter, the new link addition process ends.

  Next, partial new link addition processing for adding a partial new link as road data will be described with reference to the flowchart shown in FIG. In the partial new link addition process, first, a link record is extracted from the list (step ST101). That is, a link record is extracted from a partially new list. Next, the display target shape is narrowed down (step ST102). The display target shape narrowing process performed in step ST102 is the same as the display target shape narrowing process (step ST83 of the flowchart shown in FIG. 20) performed in the partially new link display process of the map information processing apparatus according to the second embodiment. It is.

  Subsequently, the process added to road data is performed (step ST103). That is, the road data adding unit 201 generates road data of the lower layer map from the link shape obtained by performing the display target shape narrowing process in step ST102 and adds it to the map data storage unit 102. Thereafter, the partial new link addition process ends.

  As described above, according to the map information processing apparatus according to Embodiment 3 of the present invention, road data of a new road once used for route search is stored in the map data storage unit 102 even for an old map. Therefore, the correct route guidance can be performed from the next time.

Embodiment 4 FIG.
The map information processing apparatus according to Embodiment 4 of the present invention is such that the route on the upper layer map is added to the background data of the lower layer map in the map information processing apparatus according to Embodiment 1 or 2. It is.

  FIG. 25 is a block diagram showing a configuration of a map information processing apparatus according to Embodiment 4 of the present invention. This map information processing apparatus is configured by adding a background data adding unit 301 to the map information processing apparatus according to the first embodiment. When the route search / guidance unit 107 determines that there is no route on the lower layer map corresponding to the route on the upper layer map obtained by the route search, the background data adding unit 301 determines from the shape of the upper layer link. Background data of the lower layer map is generated and added to the map data storage unit 102.

  Next, the operation of the map information processing apparatus according to Embodiment 4 of the present invention will be described with reference to the flowcharts shown in FIGS. 26 and 27, focusing on the process of adding route links as road data. First, a new link addition process for adding a new link as background data will be described with reference to the flowchart shown in FIG.

  In the new link addition process, first, a link record is extracted from the list (step ST111). That is, the link record is extracted from the new list. Next, processing to add to the background data is performed (step ST112). That is, the background data adding unit 301 generates background data of the lower-level map from the link shape formed by the link record extracted in step ST111 and adds it to the map data storage unit 102. Thereafter, the new link addition process ends.

  Next, partial new link addition processing for adding a partial new link as background data will be described with reference to the flowchart shown in FIG. In the partial new link addition process, first, a link record is extracted from the list (step ST121). That is, a link record is extracted from a partially new list. Next, the display target shape is narrowed down (step ST122). The display target shape narrowing process performed in step ST122 is the same as the display target shape narrowing process (step ST83 in the flowchart shown in FIG. 20) performed in the partially new link display process of the map information processing apparatus according to the second embodiment. It is.

  Next, processing to add to the background data is performed (step ST123). That is, the road data adding unit 201 generates background data of the lower layer map from the link shape obtained by performing the display target shape narrowing process in step ST102 and adds it to the map data storage unit 102. Thereafter, the partial new link addition process ends.

  As described above, according to the map information processing apparatus of the fourth embodiment of the present invention, even if an old map is used, the new road display data once used for route search is stored in the map data storage unit 102 as background data. From the next time, the shape of the new road can be displayed using this background data.

Embodiment 5 FIG.
The map information processing apparatus according to Embodiment 5 of the present invention embodies the determination processing of road data or background data to be added in the map information processing apparatus according to Embodiment 3 or Embodiment 4 described above. Is.

  The configuration of the map information processing apparatus according to Embodiment 5 of the present invention is that of the map information processing apparatus according to Embodiment 3 shown in FIG. 22 or the map information processing apparatus according to Embodiment 4 shown in FIG. Is the same.

  Next, the operation of the map information processing apparatus according to Embodiment 5 of the present invention will be described with reference to the flowchart shown in FIG. 28, centering on the process of determining the addition target of road data and display data.

  In this process, first, the right end of the creation range is acquired (step ST131). That is, the creation area right end: Xe in the creation range included in the header of the map data is acquired. Next, the left end of the creation range is acquired (step ST132). That is, the creation area left end: Xs in the creation range included in the header of the map data is acquired. Next, the X-direction distance of the creation range is calculated (step ST133). That is, the absolute value of the value obtained by subtracting the creation area left end: Xs acquired in step ST132 from the creation area right end: Xe acquired in step ST131 is calculated as the X-direction distance Xd.

  Next, the number of X direction data of level n1 is acquired (step ST134). That is, the X direction data number Xmn1 included in the level n1 data is acquired. Next, the size of the level n1 mesh in the X direction is calculated (step ST135). That is, the X direction size Sn1 of the level n1 mesh is calculated by dividing the X direction distance Xd calculated in step ST133 by the X direction data number Xmn1 calculated in step ST135.

  Next, the number of X-direction data at level n2 above level n1 is acquired (step ST136). That is, the X direction data number Xmn2 included in the level n2 data is acquired. Next, the size of the level n2 mesh in the X direction is calculated (step ST137). That is, the X-direction size Sn2 of the level n2 mesh is calculated by dividing the X-direction distance Xd calculated in step ST133 by the X-direction data number Xmn2 calculated in step ST136.

  Next, the ratio of the X size of the mesh is calculated (step ST138). That is, the ratio DIV is calculated by dividing the size Sn2 in the X direction calculated in step ST137 by the size Sn1 in the X direction calculated in step ST135. Next, it is checked whether or not the ratio DIV calculated in step ST138 is equal to or less than a predetermined value (step ST139). If it is determined in step ST139 that the ratio DIV is equal to or smaller than the predetermined value, the level n2 is targeted (step ST140). Thereafter, the process ends. On the other hand, if it is determined in step ST139 that the ratio DIV is not less than or equal to the predetermined value, the level n2 is excluded (step ST141). Thereafter, the process ends.

  As a result of the above processing, whether or not the link of the upper hierarchy level n2 is added to the hierarchy level n1 depends on whether the ratio DIV of the size of the mesh in the X direction, that is, the accuracy ratio between the upper map and the lower map is less than the specified value. If it is determined depending on whether or not it is equal to or less than the specified value, the link of the upper hierarchy level n2 is added to the hierarchy level n1.

  As described above, according to the map information processing apparatus according to the fifth embodiment of the present invention, road data or background data that may greatly differ from the actual road shape is not added to the map data storage unit 102. Can be configured.

  The map information processing apparatus according to the fifth embodiment can also be applied to the display of the shape of the upper layer route performed in the map information processing apparatus according to the second embodiment.

Embodiment 6 FIG.
The map information processing apparatus according to the sixth embodiment of the present invention displays the old and new version areas on the upper layer map. The configuration of the map information processing apparatus according to Embodiment 6 of the present invention is the same as that of the map information processing apparatus according to Embodiment 1 shown in FIG.

  29 and 30 are diagrams for explaining the operation of the map information processing apparatus according to the sixth embodiment. FIG. 29A shows an upper layer mesh, and FIG. 29B shows a range of a plurality of lower layer meshes (4 × 4) corresponding to the upper layer mesh. The lower layer meshes 1401 to 1404 are the latest version meshes, and the other meshes are the old version meshes.

  Next, the operation of the map information processing apparatus according to Embodiment 6 of the present invention will be described with reference to the flowchart shown in FIG. This process is performed under the control of the display control unit 105.

  In this process, first, the lower layer mesh within the range is added to the list (step ST151). That is, the range of the lower layer mesh as shown in FIG. 29 (b) corresponding to the upper layer mesh as shown in FIG. 29 (a) is added to the list (not shown).

  Next, one lower layer mesh is acquired from the list (step ST152). Next, it is checked whether or not the lower layer mesh extracted in step ST153 is the latest version (step ST153). If it is determined in step ST153 that it is the latest version, the sequence proceeds to step ST156.

  On the other hand, if it is determined in step ST153 that the version is not the latest version, a drawing range is calculated (step ST154). That is, a map drawing range corresponding to the lower layer mesh is calculated. Next, a shaded display is superimposed (step ST155). That is, the drawing range calculated in step ST154 is shaded. Thereafter, the sequence proceeds to step ST156.

  In step ST156, it is checked whether all the meshes have been extracted. That is, in step ST151, it is checked whether or not the processing for all lower layer meshes added to the list has been completed. If it is determined in step ST156 that all the meshes have not been extracted, the sequence returns to step ST152, and the above-described processing is repeated. On the other hand, when it is determined in step ST156 that all the meshes have been extracted, the process of displaying the old and new version areas ends.

  By the above processing, the version of the lower layer mesh corresponding to the range of the upper layer mesh is checked, the range of the lower layer mesh that is not the latest version is shaded, and displayed in a different form from the others, so the upper layer map As shown in FIG. 30, the old and new version areas can be distinguished and displayed, and it can be easily understood which area is the new version map.

Embodiment 7 FIG.
The map information processing apparatus according to Embodiment 7 of the present invention adds a new road of the upper layer map to the lower layer map regardless of whether or not a route is set.

  Although the illustration of the configuration of the map information processing apparatus according to Embodiment 7 of the present invention is omitted, the configuration of the map information processing apparatus according to Embodiment 1 is similar to the configuration of the map information processing apparatus according to Embodiment 3 shown in FIG. A road information adding unit 201 is added to the map information processing apparatus. The road data addition unit 201 generates road data of the lower layer map from the shape of the link constituting the road of the upper layer map at a predetermined timing, and adds it to the map data storage unit 102.

  Next, the operation of the map information processing apparatus according to Embodiment 7 of the present invention will be described with reference to the flowchart shown in FIG. 32, focusing on selection processing for selecting a link to be displayed. In this selection processing, processing for selecting new and partially new links as display objects and storing them in a list (not shown) is performed.

  In this selection process, first, an upper layer map is read (step ST161). That is, the upper layer map of the hierarchy map currently being processed is read from the map data storage unit 102. Next, the head route link is acquired (step ST162). That is, the top link data included in the map read in step ST161 is acquired. Next, it is checked whether or not it is in the area of the lower layer map (step ST163). That is, it is checked whether or not the link indicated by the link data acquired in step ST162 or step ST168 described later is a link existing in the lower layer area.

  If it is determined in step ST163 that it is not in the area of the lower layer map, the sequence proceeds to step ST167. On the other hand, if it is determined in step ST163 that it is within the area of the lower layer map, then the link state is determined (step ST164). That is, it is checked whether the link indicated by the link record acquired in step ST162 or step ST168 is “new”, “partially new”, or “existing”.

  If it is determined in step ST164 that the link is “new”, it is then added to the new list (step ST165). That is, the link record extracted in step ST162 or step ST168 is added to a new list (not shown). Thereafter, the sequence proceeds to step ST167.

  If it is determined in step ST164 that the link is “partially new”, it is then added to the partly new list (step ST166). That is, the link record extracted in step ST162 or step ST168 is added to a partially new list (not shown). Thereafter, the sequence proceeds to step ST167. If it is determined in step ST164 that the link is “existing”, the sequence proceeds to step ST167.

  In step ST167, it is checked whether it is the last link record. If it is determined in step ST167 that it is not the last link record, the next link record is acquired (step ST168). Thereafter, the sequence returns to step ST163, and the above-described processing is repeated. On the other hand, if it is determined in step ST167 that it is the last link record, the selection process ends. The above processing is performed for all lower layer meshes.

  After the above selection processing is performed, the road data adding unit 201 determines, based on the link records read from the new list and the partial new list, at a predetermined timing from the shape of the link constituting the road of the upper layer map. Map road data is generated and added to the map data storage unit 102. Thereby, the new road of the upper layer map can be added to the lower layer map.

It is a block diagram which shows the structure of the map information processing apparatus which concerns on Embodiment 1 of this invention. It is a figure which shows the format of the map data of each hierarchy used with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure which shows the example of the mesh represented by the level data of the map data of each hierarchy used with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure for demonstrating the hierarchical structure of the map data used with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure which shows the format of the road data used with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure which shows the format of the background data used with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure which shows the format of the route data used with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure for demonstrating the connection relation of two maps handled in the map information processing apparatus which concerns on Embodiment 1 of this invention. It is explanatory drawing which shows the example when one of the two maps handled in the map information processing apparatus concerning Embodiment 1 of this invention is upgraded. It is a flowchart which shows the process which acquires the link of an adjacent map from the boundary node performed with the map information processing apparatus concerning Embodiment 1 of this invention. It is a flowchart which shows the adjacent link acquisition process performed with the map information processing apparatus concerning Embodiment 1 of this invention. It is a figure which shows the example of a display of the conventional navigation apparatus for comparing with the display of the navigation apparatus to which the map information processing apparatus which concerns on Embodiment 1 of this invention was applied. It is a figure for demonstrating the correspondence of the hierarchical link of the map data handled with the map information processing apparatus which concerns on Embodiment 1 of this invention. It is a flowchart which shows the route guidance process in the case of drive | working on the route performed with the map information processing apparatus which concerns on Embodiment 1 of this invention. It is a figure which shows the example of a display at the time of driving | running | working off-route of the navigation apparatus with which the map information processing apparatus which concerns on Embodiment 1 of this invention was applied. It is a figure which shows the example of a display at the time of the route travel of the navigation apparatus to which the map information processing apparatus concerning Embodiment 2 of this invention was applied. It is a figure which shows the other example of a display at the time of the route travel of the navigation apparatus with which the map information processing apparatus which concerns on Embodiment 2 of this invention was applied. It is a flowchart which shows the selection process which selects the route link used as the display object performed with the map information processing apparatus concerning Embodiment 2 of this invention. It is a flowchart which shows the new link display process performed with the map information processing apparatus concerning Embodiment 2 of this invention. It is a flowchart which shows the partially new link display process performed with the map information processing apparatus concerning Embodiment 2 of this invention. It is a figure for demonstrating the display object shape narrowing-down process performed with the map information processing apparatus concerning Embodiment 2 of this invention. It is a block diagram which shows the structure of the map information processing apparatus concerning Embodiment 3 of this invention. It is a flowchart which shows the new link addition process performed with the map information processing apparatus concerning Embodiment 3 of this invention. It is a flowchart which shows the partially new link addition process performed with the map information processing apparatus concerning Embodiment 3 of this invention. It is a block diagram which shows the structure of the map information processing apparatus concerning Embodiment 4 of this invention. It is a flowchart which shows the new link addition process performed with the map information processing apparatus concerning Embodiment 4 of this invention. It is a flowchart which shows the partially new link addition process performed with the map information processing apparatus concerning Embodiment 4 of this invention. It is a flowchart which shows the process which determines the addition object of the road data and display data performed with the map information processing apparatus concerning Embodiment 5 of this invention. It is a figure for demonstrating the process which displays an old and new version area | region with the upper layer map performed with the map information processing apparatus concerning Embodiment 6 of this invention. It is a figure which shows the example of an old and new version area | region by the upper layer map displayed with the map information processing apparatus concerning Embodiment 6 of this invention. It is a flowchart which shows the process which displays the old and new version area | region performed with the map information processing apparatus concerning Embodiment 6 of this invention. It is a flowchart which shows the selection process which selects the link used as the display object performed with the map information processing apparatus concerning Embodiment 7 of this invention.

Explanation of symbols

  100 navigation control unit, 101 map data input unit, 102 map data storage unit, 103 GPS receiver, 104 autonomous sensor, 105 display control unit, 106 own vehicle position calculation unit, 107 route search / guide unit, 108 operation control unit, 201 road data addition unit, 301 background data addition unit.

Claims (9)

A map data storage unit that has a hierarchical structure and is upgraded for each region, and stores map data in which an upper layer map corresponding to the lower layer map is upgraded in accordance with a version upgrade of the lower layer map; ,
The route search is executed using the map data of the lower layer map and the upper layer map stored in the map data storage unit, and there is a route on the lower layer map corresponding to the route on the upper layer map obtained by the route search. If there is no route on the lower layer map that corresponds to the route on the upper layer map, the route search / guidance unit that performs simple guidance indicating the direction of the destination is displayed. Map information processing device provided. The map information processing apparatus according to claim 1, wherein the route search / guidance unit performs simple guidance by displaying the shape of the route on the upper layer map superimposed on the lower layer map. 3. The map information processing apparatus according to claim 2, wherein whether or not the shape of the route on the upper layer map is displayed on the lower layer map is determined based on a ratio of accuracy between the upper layer map and the lower layer map. A map data storage unit that has a hierarchical structure and is map data that is upgraded for each region, and that stores map data in which the upper layer map corresponding to the lower layer map is upgraded in accordance with the version upgrade of the lower layer map; ,
The route search is executed using the map data of the lower layer map and the upper layer map stored in the map data storage unit, and there is a route on the lower layer map corresponding to the route on the upper layer map obtained by the route search. In this case, a route search / guide unit that displays the route and provides route guidance,
In the route search / guidance unit, when it is determined that there is no route on the lower layer map corresponding to the route on the upper layer map obtained by the route search, the shape of the link constituting the route of the upper layer map is used as the lower layer. A map information processing apparatus comprising: a road data adding unit that generates road data of a map and adds the road data to the map data storage unit. Whether or not road data of a lower layer map is generated from the shape of a link constituting the route of the upper layer map and added to the map data storage unit is determined based on a ratio of accuracy between the upper layer map and the lower layer map. The map information processing apparatus according to claim 4. A map data storage unit that has a hierarchical structure and is map data that is upgraded for each region, and that stores map data in which the upper layer map corresponding to the lower layer map is upgraded in accordance with the version upgrade of the lower layer map; ,
The route search is executed using the map data of the lower layer map and the upper layer map stored in the map data storage unit, and there is a route on the lower layer map corresponding to the route on the upper layer map obtained by the route search. In this case, a route search / guide unit that displays the route and provides route guidance,
In the route search / guidance unit, when it is determined that there is no route on the lower layer map corresponding to the route on the upper layer map obtained by the route search, the display is made from the shape of the link constituting the route of the upper layer map. A map information processing apparatus comprising: a background data adding unit that generates data for use and adds it as background data to the map data storage unit. Whether or not display data is generated from the shape of the link constituting the route of the upper layer map and added as background data to the map data storage unit is determined based on the accuracy ratio between the upper layer map and the lower layer map. The map information processing apparatus according to claim 6. A map data storage unit that has a hierarchical structure and is map data that is upgraded for each region, and that stores map data in which the upper layer map corresponding to the lower layer map is upgraded in accordance with the version upgrade of the lower layer map; ,
A map information processing apparatus comprising: a display control unit that displays an area of an older version of a lower layer map in a different form from the others when displaying an upper layer map based on map data stored in the map data storage unit. A map data storage unit that has a hierarchical structure and is map data that is upgraded for each region, and that stores map data in which the upper layer map corresponding to the lower layer map is upgraded in accordance with the version upgrade of the lower layer map; ,
When it is determined that there is no road on the lower map corresponding to the road on the upper map based on the map data stored in the map data storage unit, the shape of the link constituting the road of the upper map is used as the lower layer. A map information processing apparatus comprising: a road data adding unit that generates road data of a map and adds the road data to the map data storage unit.

Images