JP2007121311A - Map data joining device and navigation device - Google Patents

Abstract

Disclosed is a navigation device that joins distributed map data and prestored map data, and can search for an optimum guide route and guide guidance using the joined map data.
Guide information storage means for storing guide information 103, distribution information storage means for storing distribution information and search data, and search and guidance of a guide route based on any information of the guide information and the distribution information. Adjacent map data is joined by adopting a configuration including an information determination unit 109 that determines whether to perform guidance and an arithmetic processing unit 110 that processes information related to vehicle guidance.
[Selection] Figure 1

Description

  The present invention relates to a map data joining device and a navigation device. More specifically, for example, the present invention includes a map data joining device that joins map data distributed from an information center and map data stored in advance, and takes the vehicle from the departure place. The present invention relates to a navigation device for guiding and guiding to a destination.

  Conventionally, as this type of navigation apparatus, one shown in FIG. 18 is known. The navigation apparatus 10 shown in FIG. 18 requests information from an input unit 1 for a user to input information, a current location detection unit 2 for detecting the current location of a vehicle, a storage unit 3 for storing map data, and an information center. An information requesting unit 4 for receiving information, an information receiving unit 5 for receiving information distributed from the information center, an analyzing unit 6 for analyzing the received information, and an arithmetic processing unit 7 for performing processing necessary for vehicle guidance. A presentation information creating unit 8 that creates presentation information based on processing information of the arithmetic processing unit 7 and an information presentation unit 9 that presents the presentation information are provided.

  In the conventional navigation device 10, first, the destination of the vehicle is input by the input unit 1, and the starting point of the vehicle is determined by the current location detection unit 2. Next, the map data is read out from the storage unit 3 in which the map data is stored in advance by the arithmetic processing unit 7. Further, the information request unit 4 requests information related to the guide route from the departure point of the vehicle to the destination. Then, the information receiving unit 5 receives information related to the guidance route from the information center, for example, the latest map data, and the information is analyzed by the analyzing unit 6 and then input to the arithmetic processing unit 7. Subsequently, the arithmetic processing unit 7 searches for a guide route from the departure point of the vehicle to the destination based on the map data read from the storage unit 3 and the map data received by the information receiving unit 5. Information related to the guidance route is created by the presentation information creation unit 8, information related to the guidance route is presented by the information presentation unit 9, and the guidance route is guided and guided by the arithmetic processing unit 7.

As described above, the conventional navigation device 10 searches the guidance route based on the latest map data distributed from the information center and the map data stored in advance in the recording unit 3, thereby Guide guidance to the ground can be performed (see, for example, Patent Document 1).
JP 2001-41759 (page 6-7, FIG. 2)

  However, in such a conventional navigation device, the map data distributed from the information center or the like and the map data stored in advance in the navigation device cannot be joined, and search for the optimum guidance route and guidance guidance may not be possible. there were. For example, when map data of an area is updated, road position data on the boundary of the area may not match position data before update. Therefore, when updated map data is distributed, road data cannot be joined at the boundary between the area of the updated map data and the area of the map data before update adjacent to this area. Cannot be used, and there is a problem that an optimum guide route cannot be searched and guided.

  The present invention has been made to solve such a problem, and provides a map data joining device capable of joining distributed map data and prestored map data, and joined together. The present invention provides a navigation device capable of searching for an optimum guide route and guiding guidance using map data.

  The map data joining device of the present invention includes a map data receiving means for receiving map data including a link and a node of a road network, a map data storing means for storing the map data, and a first area by the map data receiving means. On the boundary between the first area and the second area adjacent to the first area related to the map data stored by the map data storage means, The link connected to the node on the boundary included in the map data in one area is connected to the link connected to the node on the boundary included in the map data in the second area A boundary passage link connection determination means for determining whether or not the first area can be determined based on a determination result of the boundary passage link connection determination means. Serial has a configuration which is characterized by bonding the map data and the map data of the second area.

  With this configuration, the boundary passing link connection determination means determines whether or not the links can be connected on the boundary between the first area and the second area adjacent to the first area. Map data and map data stored in advance can be joined.

  Moreover, the map data joining device of the present invention includes the first data included in the map data stored in the map data storage means based on the map data of the first area received by the map data receiving means. A map data updating means for updating the map data in the same area as the area is provided.

  With this configuration, the map data update unit updates the map data stored in advance based on the distributed map data, and therefore can include the latest map data.

  Further, in the map data joining device of the present invention, the boundary passing link connection determination means includes the link and the second area respectively connected to all the nodes on the boundary included in the map data of the first area. It is determined for each link whether or not the link connected to all the nodes on the boundary included in the map data can be connected.

  With this configuration, the boundary passing link connection determination means determines whether or not links connected to all the nodes on the boundary of the area can be connected to each other, and therefore connects all the links that pass on the boundary of the area. Can do.

  The navigation apparatus according to the present invention includes a map data receiving unit that receives map data including a link and a node of a road network, a map data storage unit that stores the map data, and the map data receiving unit. When map data is received, on the boundary between the first area and the second area adjacent to the first area related to the map data stored by the map data storage means, the first area Whether the link connected to the node on the boundary included in the map data of the area and the link connected to the node on the boundary included in the map data of the second area can be connected Map data joining device having boundary passing link connection determining means for determining whether or not, and a guide route from the departure point of the vehicle to the destination of the vehicle And a guide route search means for searching, the guidance route search section has a configuration which is characterized by searching the guide route based on map data that are joined by said map data bonding apparatus.

  With this configuration, the guide route searching means searches for the guide route based on the map data joined by the map data joining device, so that the optimum guide route search and guidance guidance are performed using the latest joined map data. It can be performed.

  Further, the navigation device of the present invention includes a map data receiving means for receiving map data including road network links and nodes, a map data storing means for storing the map data, and a first area by the map data receiving means. On the boundary between the first area and the second area adjacent to the first area related to the map data stored by the map data storage means, The link connected to the node on the boundary included in the map data in one area is connected to the link connected to the node on the boundary included in the map data in the second area Map data joining apparatus having boundary passing link connection determining means for determining whether or not it is possible, and vehicle position detecting means for detecting the current position of the vehicle The boundary passing link connection determining means includes the first area when a distance from the current position of the vehicle detected by the vehicle position detecting means to the node on the boundary is within a distance threshold. Whether or not the link connected to the node on the boundary included in the map data and the link connected to the node on the boundary included in the map data of the second area can be connected. It has the structure characterized by determining.

  With this configuration, the boundary passing link connection determination means determines whether or not the links on the boundary can be connected when the distance from the current position of the vehicle to the node on the boundary is within the distance threshold. It is possible to continuously detect the vehicle position and guide the guidance route without losing sight of the current position at the boundary.

  Further, in the navigation device of the present invention, the boundary passing link connection determining means is located on the boundary of the first area and connected to the node searched by the guide route searching means and the first link. It is determined whether or not it is possible to connect to the link that exists on the boundary of the area 2 and is connected to the node.

  With this configuration, the boundary passing link connection determination unit determines whether or not the links connected to the nodes on the boundary can be connected to each other. Therefore, even if the adjacent connection relation is not recorded in the map data, the optimum guidance is provided. Route search and guidance can be performed.

  In the navigation device of the present invention, when the map data receiving unit receives the map data of the area, the navigation device generates search data for the guide route in the area based on the received map data of the area. And the guide route searching means searches for the guide route using the search data created by the search data creating means.

  With this configuration, the search data creation means creates the search data for the guide route in the area from the received map data of the area, so that the optimum guide route search and guidance guidance can be performed in a short time.

  The map data joining method of the present invention includes a step of receiving map data of a first area, a step of storing map data of the first area in map data storage means, the first area and the map data On the boundary with the second area adjacent to the first area stored in the storage means, the link connected to the node on the boundary included in the map data of the first area, and the first A boundary passing link connection determining step for determining whether or not the link connected to the node on the boundary included in the map data of area 2 is connectable. .

  By this method, in the boundary passing link connection determination step, it is determined whether or not a link passing on the boundary between the received first area and the second area stored in advance can be connected.

  In the map data joining method of the present invention, in the boundary passing link connection determination step, can the links connected to all nodes on the boundary between the first area and the second area be connected to each other? A method characterized by determining whether or not each link.

  By this method, in the boundary passing link connection determination step, it is determined whether or not the links connected to all the nodes on the boundary can be connected.

  In the navigation method of the present invention, on the boundary between the first area and the second area, the link connected to the node on the boundary included in the map data of the first area and the second area Boundary passing link connection determining step for determining whether or not the link connected to the node on the boundary included in the map data of the area can be connected, and a vehicle departure place based on the joined map data And a guide route search step for searching for a guide route from the vehicle to the destination of the vehicle.

  By this method, in the guidance route search step, the guide route is searched based on the determination result in the boundary passing link connection determination step even if the maps are joined.

  According to the present invention, the distributed map data and the previously stored map data can be joined.

  Embodiments of the present invention will be described below with reference to the drawings.

(First embodiment)
First, the structure of the navigation apparatus provided with the map data joining apparatus of the 1st Embodiment of this invention is demonstrated.

  As shown in FIG. 1, the navigation apparatus 100 according to the present embodiment includes an input unit 101 through which a user inputs information such as a starting point and a destination of a vehicle, and a vehicle position detecting unit 102 that detects a current position of the vehicle. , Guidance information storage means 103 for storing guidance information relating to a guidance route including map data from the departure point of the vehicle to the destination, and a distribution information request for requesting distribution information distributed by an information center (not shown) to the information center Means 104, distribution information receiving means 105 for receiving distribution information distributed by the information center, distribution information analyzing means 106 for analyzing distribution information received by distribution information receiving means 105, and guide information storage means 103. Search data creation for creating guide route search data based on the guidance information and the distribution information analyzed by the distribution information analysis means 106 Any information of the means 107, the distribution information storage means 108 for storing the analysis result of the distribution information and the search data, the guide information stored in the guide information storage means 103 and the distribution information stored in the distribution information storage means 108 Based on information processing means 110 for determining whether to search for guidance routes and guide guidance based on the information, arithmetic processing means 110 for processing information related to the guidance guidance of the vehicle, and information processed by the arithmetic processing means 110 A presentation information creation unit 111 that creates presentation information and an information presentation unit 112 that presents presentation information are provided.

  The input unit 101 includes, for example, a remote controller, a touch sensor, a keyboard, a mouse, and the like, and the user of the present apparatus operates the input unit 101 to input a desired starting point and destination of a vehicle and a desired screen from a menu screen. Items can be selected. The vehicle position detection unit 102 includes, for example, a GPS signal receiving unit, a vehicle speed sensor, an angular velocity sensor, an absolute direction sensor, and the like, and detects the current position of the vehicle.

  The guide information storage means 103 includes, for example, a magnetic disk, an optical disk, a semiconductor memory, etc., and map information regarding road networks such as intersections and road connections, coordinates, shapes, attributes, and regulatory information, and an index for setting points. Various information necessary for navigation, such as information, is stored.

  The distribution information request unit 104 includes, for example, a communication module, and requests distribution information from the information center in response to a request from the arithmetic processing unit 110. In addition, distribution information means map information, POI information, search information, etc., for example. POI (Place of Interest) information refers to point information such as sightseeing spots, hotels, restaurants, etc. that the user is interested in. The search information refers to information for the user to search for information related to the guide route, information obtained as a result of the user search, and the like.

  The distribution information receiving unit 105 includes, for example, a tuner, a dedicated communication module, and the like, and receives distribution information distributed from the information center. The distribution information requesting unit 104 and the distribution information receiving unit 105 may be connected to a mobile phone, a wireless device, etc., and communicate with the information center.

  The distribution information analyzing unit 106 includes, for example, a CPU, a RAM, a ROM, and the like, and analyzes the distribution information received by the distribution information receiving unit 105. For example, the received distribution information is analyzed by the distribution information analysis means 106 and classified into map data, point data, search data, POI information, and the like.

  The search data creating unit 107 creates guide route search data based on the guide information stored in the guide information storage unit 103 and the received distribution information. The distribution information storage means 108 includes, for example, a magnetic disk, an optical disk, a semiconductor memory, and the like, and stores distribution information analysis results and search data.

  The information determination unit 109 determines which information of the guide information stored in the guide information storage unit 103 and the distribution information stored in the distribution information storage unit 108 to use in response to a request from the arithmetic processing unit 110. It is supposed to be. For example, when there is a request for map data from the arithmetic processing unit 110, the information determination unit 109 stores the map data stored in the guide information storage unit 103 and the map data included in the distribution information stored in the distribution information storage unit 108. Which map data is to be used is determined.

  The arithmetic processing means 110 is constituted by a CPU, a RAM, a ROM, and the like, and processes information related to vehicle guidance. For example, a process for specifying the current position based on the current position information of the vehicle detected by the vehicle position detection means 102, a search process for a guidance route for guiding the vehicle from the departure point to the destination of the vehicle, a guidance guidance process, and a user input Data processing for search results based on information input to the means 101, map data acquisition processing for a desired area, processing for acquiring the latest route information, map data, and the like via the distribution information request means 104 are performed. ing.

  The presentation information creation unit 111 is configured by a CPU, a RAM, a ROM, and the like, and creates presentation information to be presented to the information presentation unit 112 based on information processed by the arithmetic processing unit 110. The information presentation unit 112 includes, for example, a liquid crystal display, a speaker, and the like, and presents the current position of the vehicle, presents a guidance route and voice guidance, presents search information, and the like.

  Next, the configuration of the arithmetic processing means 110 will be described with reference to FIG.

  In FIG. 2, the arithmetic processing unit 110 according to the present embodiment includes a processing selection unit 201 that selects processing according to information input by the user, an information acquisition unit 202 that acquires POI information, search information, and the like, A map information acquisition unit 203 that acquires information, a position calculation unit 204 that calculates the current position of the vehicle, a route selection unit 205 that selects a guide route, a route guide unit 206 that guides and guides a guide route, and output information An output information generation unit 207 to be generated, and an all-node adjacent connection determination unit 208 that determines whether or not links connected to all the nodes on the boundary of adjacent areas can be connected.

  The process selection unit 201 performs, for example, vehicle position detection, guidance route search, guidance route guidance guidance, map display, various information searches, information requests, and the like according to information input by the user using the input unit 101. Of the processes, which process is to be executed is selected. The information acquisition unit 202 acquires various information other than the map data obtained from the guide information storage unit 103 or the distribution information storage unit 108, for example, POI information, search information, and the like. The map information acquisition unit 203 acquires the map information to be used determined by the information determination unit 109 among the map information stored in the guide information storage unit 103 or the distribution information storage unit 108. The map information acquisition unit 203 may acquire the map information stored in the guidance information storage unit 103 or the distribution information storage unit 108 without using the information determination unit 109.

  The position calculation unit 204 obtains information on the vehicle position that is changing every moment detected by the vehicle position detection unit 102, for example, information such as a change angle of the vehicle traveling direction, a vehicle traveling distance, an absolute position, and the like. The current position of the vehicle is calculated based on the map information acquired by the acquisition unit 203. The absolute position refers to position data such as latitude, longitude, and altitude calculated based on GPS satellite signals.

  Based on the map information acquired by the map information acquisition unit 203, the route selection unit 205 uses a route search method such as the A * (A star) method or the Dijkstra method to guide the vehicle from the departure point to the destination. Among them, the guide route that minimizes the cost on the route is selected. The departure point of the vehicle may be the current position calculated by the position calculation unit 204. Moreover, you may comprise so that the departure place and destination of a vehicle may be determined by the positional information based on search results, such as POI information. Further, a plurality of guide routes may be obtained.

  The route guidance unit 206 uses the guidance route selected by the route selection unit 205, the map information acquired by the map information acquisition unit 203, the current position information calculated by the position calculation unit 204, and the like from the departure point of the vehicle. The guide route to the ground is guided by images and voices.

  The output information generation unit 207 generates optimal output information according to the process selected by the user. For example, when the user requests acquisition of map data of a specific area by the input unit 101, the output information generation unit 207 generates a request signal for map information of the corresponding area and sends this request signal to the distribution information request unit 104. It is supposed to be. When the user requests guidance guidance on the guidance route by the input unit 101, the output information generation unit 207 acquires guidance guidance information related to travel on the guidance route from the route guidance unit 206 and presents it to the presentation information creation unit 111. It is supposed to be.

  When the map information acquisition unit 203 acquires the map information of the first area, the all-node adjacent connection determination unit 208 first area related to the map data stored in the first area and the guide information storage unit 103 All the nodes on the boundary included in the map data of the second area and the links respectively connected to all the nodes on the boundary included in the map data of the first area on the boundary with the second area adjacent to It is determined for each link whether or not it can be connected to each link.

  Here, with reference to FIG. 3, nodes and links in two adjacent areas will be described. In FIG. 3, a first area 301 and a second area 311 adjacent to the first area 301 are shown. The first area 301 includes a node A 302 and a node B 303 on the boundary between the first area 301 and the second area 311, a link A 304 connected to the node A 302, and a link B 305 connected to the node B 303. Is shown.

  On the other hand, the second area 311 is connected to the node C312 and the node D313 on the boundary between the second area 311 and the first area 301, the link C314 connected to the node C312 and the node D313. A link D315 is shown. The all-node adjacent connection determination unit 208 is connected to all nodes on the boundary between the first area 301 and the second area 311, that is, the node A 302, the node B 303, the node C 312, and the node D 313. Whether or not the link A304 and the link C314 and the link B305 and the link D315 can be connected is determined for each link.

  A node on an area boundary is hereinafter referred to as an “adjacent node”. Further, whether each node included in the map data is an adjacent node is determined by, for example, a list in which flag information indicating whether the node is an adjacent node as a part of the node attribute in advance or a list in which adjacent nodes are listed in advance. It can be determined by a list or the like.

  Further, the distribution information receiving means 105, the route selection section 205, and the all-node adjacent connection determination section 208 constitute map data reception means, guidance route search means, and boundary passing link connection determination means, respectively. The guide information storage unit 103 and the distribution information storage unit 108 constitute a map data storage unit.

  Next, the operation of the navigation device 100 of the present embodiment will be described.

  In FIG. 4, first, the user operates the input means 101 to input the starting point and the destination of the vehicle (step S401). Next, the map information for guiding the vehicle from the departure point to the destination is read out and acquired from the information determination unit 109 by the information acquisition unit 202 and the map information acquisition unit 203 of the arithmetic processing unit 110 (step S402). Here, the map information acquisition unit 203 acquires new guide information from the guide information stored in the guide information storage unit 103 and the distribution information storage unit 108. The steps of storing the distribution information distributed from the information center in the distribution information storage unit 108 will be described later. Subsequently, the route selection unit 205 of the arithmetic processing unit 110 searches for a guidance route (step S403). Then, the route guidance unit 206 of the arithmetic processing unit 110 performs guidance guidance on the guidance route from the departure point of the vehicle to the destination (step S404).

  Next, steps from when the navigation apparatus 100 according to the present embodiment requests distribution information distributed from the information center until it is stored in the distribution information storage means 108 will be described with reference to FIG.

  In FIG. 5, first, distribution information is requested by the distribution information request means 104 (step S501). Next, the distribution information receiving means 105 receives the distribution information distributed from the information center (step S502). Subsequently, the distribution information analyzing unit 106 analyzes the distribution information received by the distribution information receiving unit 105 (step S503). Further, the search data creation means 107 creates search data to be referred to when searching for a guide route (step S504). Then, the distribution information storage means 108 stores the analyzed distribution information and search data (step S505).

  In step S402 shown in FIG. 4 described above, when the map information included in the distribution information is acquired from the distribution information storage means 108, the above steps S501 to S505 are executed. Alternatively, the distribution information may be received from the information center at any time or periodically, and the steps from step S501 to step S505 may be executed. Further, the guide information stored in the guide information storage unit 103 is referred to, and the guide information newer than the guide information is received by the distribution information receiving unit 105 and stored in the distribution information storage unit 108. Good.

  Next, the all-node adjacent connection determination process executed by the all-node adjacent connection determination unit 208 will be described with reference to FIG.

  In FIG. 6, first, regarding the area of the acquired map data, all adjacent nodes on the boundary of the area are detected from the node attribute and coordinate information, and are set as target candidate nodes (step S601). Next, an unselected one of the target candidate nodes is selected (step S602). Further, it is determined whether or not the link connected to the selected adjacent node is a search target (step S603). When it is determined in step S603 that the link connected to the selected adjacent node is a search target, a specific node adjacent connection determination process described later is executed (step S604), and Neighbor connection information is required.

  On the other hand, if it is not determined in step S603 that the link connected to the selected adjacent node is a search target, it is determined whether there is an adjacent node that is a target candidate that is not selected ( Step S605).

  If it is determined in step S605 that there is an adjacent node that has not been selected, the process returns to step S602. On the other hand, if it is not determined in step S605 that there is an unselected adjacent node, the all-node adjacent connection determination process ends.

  Next, the specific node adjacent connection determination process in step S604 described above will be described with reference to FIG.

  In FIG. 7, first, an area having a distance α (for example, α = 50 m) from a specific adjacent node is determined, and a range included in this area is specified (step S701). Next, an unselected adjacent range is selected (step S702). Here, when there is no map data including an unselected adjacent range in the memory, the corresponding map data is acquired. Further, it is determined whether or not there is an adjacent node that is within a distance α from the specific adjacent node in the selected adjacent range (step S703). If it is determined in step S703 that the corresponding adjacent node exists, it is determined as an adjacent candidate node (step S704).

  On the other hand, if it is not determined in step S703 that the corresponding adjacent node exists, it is determined whether there is an unselected adjacent range (step S705). If it is determined in step S705 that there is an unselected adjacent range, the process returns to step S702. If it is not determined that an unselected adjacent range exists, there is a possibility that a plurality of adjacent candidate nodes are connected. An adjacent connection determination process in which a node having a higher value is selected is executed (step S706), and the specific node adjacent connection determination process is terminated.

  Next, the adjacent connection determination process in step S706 described above will be described with reference to FIG.

  In FIG. 8, it is first determined whether or not there is an adjacent candidate node (step S801). If it is not determined that there is an adjacent candidate node, it is determined that connection is not possible (step S810), and the adjacent connection determination process is performed. finish. On the other hand, if it is determined that there is an adjacent candidate node, it is determined whether or not the road type, for example, the type of highway, national road, prefectural road, etc., matches before and after the boundary (step S802).

  If it is not determined in step S802 that the road types match, the adjacent connection determination process ends after the process in step S810 described above. On the other hand, if it is determined that the road types match, it is determined whether or not the partner adjacent node can be uniquely identified (step S803).

  If it is determined in step S803 that the adjacent node on the other side can be uniquely identified, it is determined that the links connected to the corresponding adjacent node can be connected to each other, and this adjacent connection relationship is recorded (step S811). ), The adjacent connection determination process is terminated. On the other hand, if it is not determined in step S803 that the partner adjacent node can be uniquely identified, it is determined whether or not the link types, for example, main line, side road, junction, and the like match before and after the boundary. (Step S804).

  If it is not determined in step S804 that the link types match, the adjacent connection determination process ends after the process in step S810 described above. On the other hand, if it is determined in step S804 that the link types match, it is determined whether or not the partner adjacent node can be uniquely identified (step S805).

  If it is determined in step S805 that the partner adjacent node can be uniquely identified, the adjacent connection determination process ends after the process in step S811 described above. On the other hand, if it is not determined in step S805 that the partner adjacent node can be uniquely identified, it is determined whether the one-way information matches before and after the boundary (step S806).

  If it is not determined in step S806 that the one-way information matches, the adjacent connection determination process ends after the process in step S810 described above. On the other hand, if it is determined in step S806 that the one-way information matches, it is determined whether or not the adjacent node on the other side can be uniquely identified (step S807).

  If it is determined in step S807 that the adjacent node on the other side can be uniquely identified, the adjacent connection determination process is terminated after the process in step S811 described above. On the other hand, if it is not determined in step S807 that the partner adjacent node can be uniquely identified, it is determined whether the link angle difference before and after the boundary is equal to or less than β (for example, β = 10 degrees). (Step S808).

  If it is not determined in step S808 that the link angle difference is equal to or less than β, the adjacent connection determination process ends after the process in step S810 described above. On the other hand, if it is determined in step S808 that the link angle difference is equal to or less than β, it is determined whether or not the partner adjacent node can be uniquely identified (step S809).

  If it is determined in step S809 that the adjacent node on the other side can be uniquely specified, the adjacent connection determination process is terminated after the process in step S811 described above. On the other hand, if it is not determined in step S809 that the adjacent node on the other side can be uniquely identified, the adjacent connection determination process ends after the process in step S810 described above.

  As described above, on the boundary between the area of the map data received via the distribution information receiving means 105 and the area of the map data stored in advance in the guidance information storage means 103 by the all-node adjacent connection determining unit 208. It is determined whether or not each link connected to the adjacent node can be connected.

  Next, the search data creation means 107 will be described in detail. The search data creation means 107 performs a process for creating data of a wider road network on a macroscopic basis based on the distributed map data in order to speed up the search for the guide route. . In the following description, for the sake of understanding, it is assumed that the search data is created by recording only one or more major roads with map data of one layer as a target. The map data layer may be created by a plurality of layers.

  FIG. 9 shows an example of search data created by the search data creation means 107, FIG. 9A shows an example of the search data creation range, and FIG. 9B shows search data management. An example of the information, FIG. 9C shows an example of the configuration data of the search data.

  As shown in FIG. 9A, in the present embodiment, the search data creation range is a range in which a predetermined number of map units in an area in a predetermined range, for example, 8 × 8 units are grouped. The search data 901 shown in FIG. 9A is composed of 64 map units from the map unit (0, 0) to the map unit (7, 7) whose positions are indicated by rows and columns. ing.

  Information of the search data 901 is managed for each map unit by a management table as shown in FIG. Each map unit records and manages information such as the latitude, longitude, head address, and file size of a reference point predetermined for each map unit. An example of recording this information is shown in FIG. The search data shown in FIG. 9C includes at least information such as node information 902, link information 903, and the like, which is at least the minimum road network information for executing search processing. As shown in FIG. 9B, when the updated map unit is distributed by creating management information for managing where the information of each map unit is recorded in the search data, Since the search data can be recreated only in the distributed map unit and embedded in the recording position of the original search data, the search data can be created in a short time.

  Next, the operation of the search data creation unit 107 will be described with reference to FIG.

  In FIG. 10, first, an unselected map unit is selected from the updated map units (step S1001). Next, search data including the selected map unit is read (step S1002). Furthermore, the recording area of the information regarding the corresponding map unit is cleared in the read search data (step S1003). Then, an unselected node included in the corresponding map unit is selected (step S1004), and a recording target node determination process described later is executed to determine whether or not the node is a recording target node (step S1005).

  Subsequently, it is determined whether or not the selected node is a recording target (step S1006). If it is determined in step S1006 that the selected node is a recording target, the selected node is recorded as a recording target node (step S1007), and it is determined whether all the nodes have been investigated (step S1006). S1008). On the other hand, if it is determined in step S1006 that the selected node is not a recording target, the process proceeds to step S1008 described above.

  If it is determined in step S1008 that all nodes have been examined, an unselected recording target node is selected (step S1009). If it is not determined in step S1008 that all nodes have been investigated, the process returns to step S1004.

  Subsequently, a data generation process to be described later is executed (step S1010), and search data is created. Then, it is determined whether or not all the recording target nodes have been investigated (step S1011). If it is determined that all the recording target nodes have been investigated, the search data creation process is terminated, and all the recording target nodes are investigated. If it is not determined that the process has been performed, the process returns to step S1009. In addition, what is necessary is just to repeat the process of FIG. 10, when there are two or more updated maps. Moreover, you may implement with respect to the map with the same map version.

  Next, the recording target node determination process in step S1005 will be described with reference to FIG.

  In FIG. 11, first, it is determined whether or not the selected node is an adjacent node (step S1101). If it is determined in step S1101 that the selected node is an adjacent node, a link connected to the adjacent node is selected (step S1111), and it is determined whether the selected connection link is a recording target (step S1111). S1112). In the present embodiment, as described above, roads whose road type is a main road or higher are recorded.

  If it is determined in step S1112 that the selected connection link is a recording target, it is determined as a recording target, the number of recording target links is recorded (step S1110), and the recording target node determination process is terminated. On the other hand, if the selected connection link is not determined to be a recording target in step S1112, it is determined that the selected connection link is not a recording target (step S1113), and the recording target node determination process ends.

  If the selected node is not determined to be an adjacent node in step S1101, the number of recording target links is initialized (step S1102). Next, an unselected link is selected from the links connected to the selected node (step S1103). Further, it is determined whether or not the selected connection link is a recording target (step S1104). If the selected connection link is determined to be a recording target, the number of recording target links is incremented by one (step S1105) and selected. It is determined whether all the links connected to the selected node have been investigated (step S1106). If it is determined in step S1104 described above that the selected connection link is not a recording target, the process advances to step S1106.

  If it is determined in step S1106 that all links connected to the selected node have been investigated, it is determined whether the number of recording target links is zero (step S1107). On the other hand, if it is not determined in step S1106 that all the links connected to the selected node have been investigated, the process returns to step S1103.

  If it is determined in step S1107 that the number of recording target links is zero, the recording target node determination processing is terminated after the processing in step S1113 described above. On the other hand, if it is determined in step S1107 that the number of recording target links is not zero, it is determined whether or not the number of recording target links is two (step S1108).

  If it is determined in step S1108 that the number of recording target links is not two, the process proceeds to step S1110 described above. After determining the recording target and recording the number of recording target links, the recording target node determination processing ends. On the other hand, if it is determined in step S1108 that the number of recording target links is two, it is determined whether or not the link attributes of the two recording target links are the same (step S1109).

  If it is determined in step S1109 that the link attributes of the two recording target links are the same, the recording target node determination process ends after the process of step S1113 described above. On the other hand, if it is determined in step S1109 that the link attributes of the two recording target links are not the same, it is determined as an attribute change point, and after the process of step S1110, the recording target node determination process ends. Note that the processing in step S1109 can reduce the number of simple two-way nodes, and thus the number of links to be searched can be reduced.

  Next, the data generation processing in step S1010 shown in FIG. 10 will be described with reference to FIG.

  In FIG. 12, first, it is determined whether or not the selected node is an adjacent node (step S1201). When it is determined in step S1201 that the selected node is an adjacent node, boundary connection data generation processing described later is executed (step S1202), and an unselected recording target link connected to the selected node is selected (step S1202). Step S1203). The boundary connection data generation process refers to a process for creating data indicating an adjacent connection relationship in advance in order to speed up the connection determination of adjacent nodes during a search. On the other hand, if it is determined in step S1201 that the selected node is not an adjacent node, the process proceeds to step S1203.

  Subsequently, the link attributes are accumulated and a new link attribute is generated (step S1204). For example, if the cumulative link length of the link attribute so far is 90 and the link length of the selected recording target link is 10, the cumulative link length of the new link attribute is 100. Next, the counterpart node of the recording target link is acquired (step S1205), and it is determined whether the counterpart node is a recording target node (step S1206).

  If it is determined in step S1206 that the counterpart node is not a recording target node, a new link attribute is generated from the node attribute (step S1207). For example, the contents of node costs such as node traffic restrictions and right / left turn costs are reflected in the link attributes. Next, the counterpart node is used as a base point, the other recording target link is selected (step S1208), and the process returns to step S1204.

  On the other hand, if it is determined in step S1206 that the counterpart node is a recording target node, a new link attribute is recorded as a link attribute between the selected node and the counterpart node (step S1209). Then, it is determined whether or not there is an unselected recording target link (step S1210). If it is determined that there is an unselected recording target link, the process returns to step S1203, and if there is an unselected recording target link. If not determined, the data generation process is terminated.

  As described above, the search data creation means 107 creates a wide range of search data, and by referring to the search data when acquiring adjacent map data, the target links to be searched can be reduced. Search time can be shortened.

  Next, the boundary connection data generation process in step S1202 will be described in detail. By this processing, data representing an adjacent relationship that can speed up the connection determination of adjacent nodes at the time of search is created.

  In FIG. 13, first, it is determined whether or not the boundary is between search data (step S1301). If it is not determined in step S1301 that the boundary is between the search data, the adjacent range is set as an adjacent map record in the same search data (step S1305), and the specific node adjacent connection determination process described above is executed (step S1301). In step S1306, the boundary connection data generation process ends. With this processing, a list representing the correspondence relationship between the adjacent relationships in the search data is created, which will be described with reference to FIG.

  FIG. 14A shows an example of boundary connection data between the search data A1401 and the search data B1402. Search data A1401 and search data B1402 are composed of 64 map units from map unit (0,0) to map unit (7,7) whose positions are indicated by rows and columns. A node A 1403 on the boundary of the map unit (7, 4) of the data A 1401, a node B 1404 on the boundary of the map unit (0, 4) of the search data B 1402, and a map unit (5, 5 of the search data B 1402) A node C 1405 on the boundary of 2) and a node D 1406 on the boundary of the map unit (6, 2) of the search data B 1402 are shown. FIG. 14B shows environment connection data of search data A1401 and search data B1402. The data created in step S1305 and step S1306 described above represents a connection relationship within the same search data, such as information representing the relationship between the node C1405 and the node D1406 shown in FIG. It is data.

  If it is determined in step S1301 shown in FIG. 13 that the boundary is between search data, the adjacent range is set as adjacent map data (step S1302), and the above-described specific node adjacent connection determination process is executed (step S1302). S1303). With this processing, a list representing the correspondence relationship between the map data and the search data is created, which will be described with reference to FIG.

  FIG. 15A shows an example of boundary connection data between the map data (7, 4) included in the map data group C1501 and the search data D1502. The map data group C1501 is composed of 64 pieces of map data from map data (0, 0) to map data (7, 7) whose positions are indicated by rows and columns. The search data D1502 includes 64 map units from a map unit (0, 0) to a map unit (7, 7) whose positions are indicated by rows and columns. Here, the road network recorded in the search data D is composed of only major road maps recorded in the map data group C.

  FIG. 15A shows a node E1503 on the boundary of the map data (7, 4) included in the map data group C1501 and a node F1504 on the boundary of the map unit (0, 4) of the search data D1502. Is shown. FIG. 15B shows environment connection data of map data (7, 4) and search data D1502 included in the map data group C1501. The data created in steps S1302 and S1303 described above represents the connection relationship between the map data and the search data, like the information representing the relationship between the node E1503 and the node F1504 shown in FIG. Data.

  Subsequently, the adjacent range is set as adjacent search data (step S1304), the above-described specific node adjacent connection determination process is executed (step S1306), and the boundary connection data generation process ends. By this processing, a list describing the correspondence relationship of the adjacent relationship between the search data is created. The data created in the above steps is data representing the connection relationship between the search data like the information representing the relationship between the node A 1403 and the node B 1404 shown in FIG.

  Note that the boundary connection data shown in FIG. 14B and FIG. 15B is not only the connection relationship from one side, for example, the node B 1404 that is not only the direction from the node A 1403 to the node B 1404 but also the reverse connection relationship. The direction of the node A 1403 may be recorded, or the connection relationship from both may be recorded. The information to be recorded may be any content as long as the node can be specified. In the case of FIG. 14B, boundary connection data in the same search data and boundary connection data between adjacent search data may be recorded separately. Furthermore, it may be recorded separately for each map to which the node belongs.

  As described above, according to the navigation device of the present embodiment, the all-node adjacent connection determining unit 208 is configured to determine whether or not the links respectively connected to all the nodes existing on the boundary can be connected. Therefore, it is possible to connect adjacent map data based on the determination result, and to search for an optimum guide route and guide guidance using the connected map data.

(Second Embodiment)
First, the structure of the navigation apparatus provided with the map data joining apparatus of the 2nd Embodiment of this invention is demonstrated. As shown in FIG. 16, the navigation apparatus 1600 according to the present embodiment includes an input unit 1601 for a user to input information such as a starting point and a destination of a vehicle, and a vehicle position detecting unit 1602 for detecting the current position of the vehicle. The distribution information requesting means 1603 that requests distribution information distributed by an information center (not shown) to the information center, the distribution information receiving means 1604 that receives distribution information distributed by the information center, and the distribution information receiving means 1604. Based on the distribution information analyzed by the distribution information analysis unit 1605, the distribution information analyzed by the distribution information analysis unit 1605, and the guidance information stored in the guidance information storage unit 1608 described later, data for searching for a guidance route is created. Based on the distribution information analyzed by the search data creation means 1606 and the distribution information analysis means 1605 Guidance information update means 1607 for updating the guide information stored in the internal information storage means 1608, guidance information storage means 1608 for storing the analysis result of distribution information and search data, and information related to the guidance guidance of the vehicle are processed. Arithmetic processing means 1609, presentation information creating means 1610 for creating presentation information based on information processed by the arithmetic processing means 1609, and information presentation means 1611 for presenting presentation information are provided.

  In the following description of the configuration, the description of the same configuration as that of the navigation device 100 according to the first embodiment of the present invention will be omitted.

  The guide information update unit 1607 is constituted by a CPU, a RAM, a ROM, and the like, and updates the guide information stored in the guide information storage unit 1608. For example, when map data of a certain area is received by the distribution information receiving means 1604 and this map data is newer than the map data of the corresponding area stored in the guidance information storage means 1608, the guidance information updating means 1607 The corresponding map data stored in the guidance information storage unit 1608 is updated. The guidance information update unit 1607 constitutes a map data update unit.

  The guide information storage means 1608 includes, for example, a magnetic disk, an optical disk, a semiconductor memory, and the like, and includes map information relating to road networks such as intersection and road connection status, coordinates, shape, attributes, and regulatory information, and an index for setting points. Various information necessary for navigation, such as information, is stored. Also, the search data created by the search data creation means 1606 is stored.

  As described above, in the navigation device 100 according to the first embodiment of the present invention, the received distribution information is stored in the distribution information storage means 108, and this information and the information stored in the guidance information storage means 103 are stored. In contrast, in the navigation device 1600 according to the second embodiment of the present invention, the received distribution information is stored in the guidance information storage unit 1608. The difference is that it is configured. That is, in the navigation device 1600 according to the second embodiment of the present invention, the latest distribution information is stored as the guide information by the guide information storage unit 1608, and the arithmetic processing unit 1609 is stored by the guide information storage unit 1608. Based on the stored guide information, a guide route search process, a guidance guide process, and the like are executed.

  Next, the configuration of the arithmetic processing unit 1609 will be described with reference to FIG.

  In FIG. 17, the arithmetic processing unit 1609 of the present embodiment replaces the all-node adjacent connection determination unit 208 of the arithmetic processing unit 110 included in the navigation device 100 of the first embodiment of the present invention with a specific node adjacent connection. A determination unit 1708 is provided. Therefore, the configuration of the specific node adjacent connection determination unit 1708 will be described, and the description of other configurations will be omitted.

  As described above, when the map information acquisition unit 203 acquires the map information, the all-node adjacent connection determination unit 208 provided in the navigation device 100 according to the first embodiment of the present invention displays the adjacent boundary portion of the area. In the present embodiment, the specific node adjacent connection determination unit 1708 determines the route search and the current position of the vehicle, while it has been determined for all the boundary passing links whether or not the passing link is connected to the adjacent map. The difference is that it is determined whether or not an individual specific node is connected to the adjacent map data when it is necessary at the time of calculation. For example, a distance threshold is set in advance, and when the distance from the current position of the vehicle to a node on the boundary of the traveling area is within the distance threshold, the specific node adjacent connection determination unit 1708 The connection relationship between the area and the area adjacent to the traveling area is determined.

  The operation of the navigation apparatus 1600 according to the second embodiment of the present invention is the same as the step shown in FIG. 4 described in the operation of the navigation apparatus 100 according to the first embodiment of the present invention. Further, the step from receiving the distribution information distributed from the information center to storing it is executed after the step S503 shown in FIG. Is different. This distribution information update step is performed when the distribution information distributed by the guide information update unit 1607 is newer than the information stored in the guide information storage unit 1608. Further, the processing by the specific node adjacent connection determining unit 1708 is the same as the flowchart showing the specific node adjacent connection determining process shown in FIG.

  As described above, according to the navigation device of the present embodiment, the specific node adjacent connection determination unit 1708 determines whether or not the links respectively connected to the specific nodes existing on the boundary can be connected. Therefore, it is possible to connect adjacent map data based on the determination result, and to search for an optimum guide route and guide guidance using the connected map data.

  Each means and each part provided in the navigation device of the first and second embodiments of the present invention described above may be configured by hardware or as a result of program processing such as multitasking of a microcomputer. It may be configured.

  Further, by programming the processing of each step described above, storing this program in a storage medium such as a floppy (registered trademark) disk and transferring it, it can be easily implemented in another independent computer system. In this case, the storage medium is not limited to a floppy (registered trademark) disk, but may be any medium that can store a program, such as an optical disk, an IC card, or a ROM cassette.

  Further, the arithmetic processing means 110 in the first embodiment of the present invention and the arithmetic processing means 1609 in the second embodiment of the present invention may be replaced.

  Further, the information center distributes the distribution information in a communication type distribution in which the distribution information is distributed according to a user's request and a broadcast type distribution in which the information center always distributes regardless of the user's request. This navigation apparatus is compatible with any distribution form.

The block diagram of the navigation apparatus provided with the map data joining apparatus of the 1st Embodiment of this invention The block diagram of the arithmetic processing means of the 1st Embodiment of this invention Illustration of nodes and links in two adjacent areas The flowchart of each step of the navigation apparatus provided with the map data joining apparatus of the first embodiment of the present invention. Flowchart of steps from when a navigation device having the map data joining device according to the first embodiment of the present invention requests distribution information until it is stored. Flowchart of all node adjacent connection determination processing Specific node adjacent connection determination processing flowchart Flow chart of adjacent connection determination processing (A) A diagram showing an example of a search data creation range (b) A diagram showing an example of search data management information (c) A diagram showing an example of a configuration of search data Flow chart of search data creation processing Flowchart of recording target node determination processing Data generation process flowchart Boundary connection data generation processing flowchart (A) The figure which shows an example of the connection relation of the search data A and the search data B (b) The figure which shows an example of the relationship information with an adjacent origin node and an adjacent destination node (A) The figure which shows an example of the connection relation of the map data C and the search data D (b) The figure which shows an example of the relationship information with an adjacent origin node and an adjacent destination node The block diagram of the navigation apparatus provided with the map data joining apparatus of the 2nd Embodiment of this invention The block diagram of the arithmetic processing means of the 2nd Embodiment of this invention Block diagram of a conventional navigation device

Explanation of symbols

100, 1600 Navigation device 101, 1601 Input means 102, 1602 Vehicle position detection means 103, 1608 Guidance information storage means 104, 1603 Distribution information request means 105, 1604 Distribution information reception means 106, 1605 Distribution information analysis means 107, 1606 Search Data creation means 108 Distribution information storage means 109 Information determination means 110, 1609 Arithmetic processing means 111, 1610 Presentation information creation means 112, 1611 Information presentation means 1401 Search data A
1402 Search data B
1403 Node A
1404 Node B
1405 Node C
1406 Node D
1501 Map data group C
1502 Search data D
1503 Node E
1504 Node F
1607 Guidance information update unit 1708 Specific node adjacent connection determination unit 201 Processing selection unit 202 Information acquisition unit 203 Map information acquisition unit 204 Location calculation unit 205 Route selection unit 206 Route guidance unit 207 Output information generation unit 208 All node adjacent connection determination unit 301 First area 302 Node A
303 Node B
304 Link A
305 Link B
311 2nd area 312 Node C
313 Node D
314 Link C
315 Link D
901 Search data 902 Node information 903 Link information

Claims (7)

A navigation device having a map update function,
A navigation device comprising arithmetic processing means for creating a wide area road network for an area larger than an area targeted by the map using a distributed map. The navigation device according to claim 1, wherein the arithmetic processing unit creates a wide area road network using only roads greater than or equal to a main road included in the map. The navigation apparatus according to claim 1, wherein the arithmetic processing unit creates management information for managing a position to which a map belongs in a wide area road network. The navigation device according to claim 1, wherein the arithmetic processing unit creates a wide area road network by excluding two roads having matching attributes. The arithmetic processing means corresponds to a partial unit when only a part of the plurality of units is distributed when the wide area road network is managed in a range in which a plurality of units that are units for managing the map are collected. The navigation device according to claim 1, wherein the wide area road network is recreated only within a range to be performed. The navigation apparatus according to claim 1, wherein the arithmetic processing unit creates a connection relationship between wide area road networks. A navigation device having a map update function,
A navigation apparatus comprising arithmetic processing means for creating a connection relationship between a distributed map and a wide area road network that covers a larger area than the area targeted by the map.

Images