JP2008145193A - Route search device, route search method, route search program, and storage medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To increase the speed of the long-distance route calculation, without causing the data quantity of data for route search to increase excessively. <P>SOLUTION: This route searching device can be mounted to a car navigation device, for example and stores data for route search for searching for a route from an origin to a destination. The data for route search includes block data for search and a search table. One or a plurality of block data for search are prepared for a predetermined block on geography and indicate a link used for the route search. The search table is prepared for each of combinations of origins and destinations, and represents data for specifying the block data for search to be used for the route search from the origin to the destination. In the route search, when the origin and destination are determined, the block data for search, corresponding to the combination of the origin and destination, is determined; and the route search is performed by using the determined block data for search. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to a route search method using map data.

  A route search function is provided in a car navigation device, a map providing application using the Internet, and the like. The route search function is a function for automatically calculating a route from a geographical departure point to a destination using map data and presenting it to the user.

  In general, long-distance route searching takes time because the number of candidate roads increases. Usually, route search data has a hierarchical structure, and in long-distance route calculation, data including only main roads is used to speed up the calculation. However, even if it is limited to major roads, there are a considerable number of road links nationwide. Therefore, in searching for a long-distance route that passes through a plurality of prefectures, all road links of the main road are subject to calculation, and thus a huge amount of calculation is required.

  In order to perform a long-distance route search at high speed, a method is known in which special data is included in route search data in addition to normal node and link data. For example, for a combination of a departure area and a destination area, a method is known in which data storing only links necessary for a route search between them is prepared and a route search is performed using the data.

  Patent Document 1 proposes the following method. First, the area on the map is divided into a plurality of search sections. For each search section, candidate roads such as expressways and national roads that are expected to be used in general, and connection points (entrances / entrances) to the candidate roads ) Is determined and stored in advance. At the time of route search, the candidate road corresponding to the search section including the start point and the end point and the connection point to the candidate road are called, and the route calculation is performed using only the candidate road.

JP-A-11-64023

  However, with the above-described method, the amount of special data included in the route search data increases. In addition, when the route search data needs to be updated in accordance with the change of the road, the amount of data to be updated also increases.

  The above-mentioned thing is mentioned as an example as a subject which the present invention tends to solve. An object of the present invention is to speed up long-distance route calculation without excessively increasing the amount of route search data.

  The invention according to claim 1 is a route search device, wherein one or a plurality of blocks are prepared for each predetermined geographical block, and search block data indicating a link used for a route search, a starting point and a destination A search table prepared for each combination and specifying the search block data to be used for a route search from the departure place to the destination; a storage unit storing route search data including the search table; A route search means for determining the search block data corresponding to the combination of the starting point and the destination and performing a route search using the determined block data for search. .

  The invention according to claim 4 is a route search method, in which one or a plurality of blocks are prepared for each predetermined geographical block, and search block data indicating a link to be used for route search, and a starting point and a destination A storage step of storing in the storage unit route search data including a search table prepared for each combination and specifying the search block data to be used for route search from the departure place to the destination; A route search step of referring to a search table, determining the search block data corresponding to a combination of a departure place and a destination, and performing a route search using the determined block data for search. Features.

  The invention according to claim 5 is a route search program executed in a terminal device including a storage unit and a computer, and shows one or more prepared for each predetermined geographical block and a link used for route search. Search route data including search block data and a search table that is prepared for each combination of a departure point and a destination and that is used for route search from the departure point to the destination. Referring to the storage means for storing data in the storage unit and the search table, the search block data corresponding to the combination of the departure place and the destination is determined, and the determined search block data is used. The computer is made to function as route search means for performing route search.

  The invention according to claim 7 is a storage medium, one or more prepared for each predetermined geographical block, and search block data indicating a link used for route search, and a combination of a departure point and a destination Route search data including a search table prepared for each and specified for the search block data to be used for route search from the departure place to the destination is stored.

  The invention according to claim 10 is a search data creation device including a search including all links to be used for a route search from the departure place to the destination for a combination of the departure place and the destination. Search overall data creating means for creating the overall search data; splitting means for creating the search block data by dividing the search overall data into predetermined geographical blocks; and a plurality of corresponding to the same block Integration means for integrating similar search block data into one of the search block data, and output means for outputting the search block data after the integration processing by the integration means as search data, It is characterized by providing.

  The invention according to claim 11 is a search data creation method, wherein a search includes all links to be used for route search from the departure place to the destination for a combination of the departure place and the destination. A search overall data creation step for creating overall search data, a division step for creating search block data by dividing the overall search data into predetermined geographical blocks, and a plurality of corresponding to the same block An integration step of integrating similar search block data into one of the search block data, and an output step of outputting the search block data after the integration processing by the integration step as search data, It is characterized by providing.

  The invention according to claim 12 is a search data creation program executed in a terminal device including a computer, and for a route search from the departure place to the destination with respect to a combination of the departure place and the destination. Search overall data creation means for creating search overall data including all links to be used; splitting means for creating search block data by dividing the search overall data into predetermined geographical blocks; Among the plurality of search block data corresponding to the same block, integration means for integrating similar search block data into one, and the search block data after the integration processing by the integration means The computer is caused to function as output means for outputting as data.

  In one embodiment of the present invention, one or a plurality of route search apparatuses are prepared for each predetermined geographical block, search block data indicating a link used for route search, and a combination of a departure point and a destination point. A search table for identifying the search block data to be used for a route search from the departure point to the destination, and a storage unit storing route search data including the search table. Route search means for determining the search block data corresponding to the combination of the departure point and the destination, and performing a route search using the determined block data for search.

  The above route search device can be mounted on, for example, a car navigation device, and stores route search data for route search from the departure point to the destination. The route search data includes search block data and a search table. One or a plurality of search block data is prepared for each predetermined geographical block, and is data indicating a link used for route search. The search table is prepared for each combination of departure place and destination, and is data for specifying the search block data to be used for route search from the departure place to the destination. At the time of route search, when the starting point and the destination are determined, the search block data corresponding to the combination of the starting point and the destination is determined, and the route search is performed using the determined block data for search. Is called.

  In one aspect of the above route search apparatus, each of the plurality of search block data prepared corresponding to one block is between the other search block data prepared corresponding to the one block. The number of links common to each other is equal to or less than a predetermined ratio. As a result, the number of search block data including overlapping common links can be reduced, and the data amount of the route search data can be reduced.

  In another aspect of the route search apparatus, the storage unit is prepared for each predetermined block, stores link data indicating all links existing in the block, and the route search means For the block to which the departure point and the destination belong, a route search is performed using the link data. Thus, an appropriate route search can be performed in the vicinity of the departure point and the destination in consideration of a large number of roads.

  In another embodiment of the present invention, one or a plurality of route search methods are prepared for each predetermined geographical block, search block data indicating a link used for route search, and a combination of a departure point and a destination point. A search table for identifying the search block data to be used for a route search from the departure place to the destination, and storing the route search data in a storage unit, and the search table , And a route search step of determining the search block data corresponding to the combination of the starting point and the destination and performing a route search using the determined search block data.

  In still another embodiment of the present invention, one or more route search programs executed in a terminal device including a storage unit and a computer are prepared for each predetermined geographical block, and a search indicating a link used for route search is provided. Route search data including block data and a search table that is prepared for each combination of a departure point and a destination and that specifies the search block data to be used for a route search from the departure point to the destination. Is stored in the storage unit, and the search table is determined with reference to the search table, and the search block data corresponding to the combination of the departure place and the destination is determined. The computer is caused to function as route search means for performing route search. The route search program can be handled in a state stored in a storage medium.

  In yet another embodiment of the present invention, one or a plurality of storage media are prepared for each predetermined geographical block, search block data indicating a link used for route search, and a combination of a departure place and a destination place. And a search table for specifying the search block data to be used for a route search from the departure place to the destination.

  In a preferred example of the storage medium, the route search data has a hierarchical structure including a plurality of layers, and the search block data and the search table are at least the highest level of the plurality of layers. Are included in the route search data of the other layer. In another preferable example, the route search data has a hierarchical structure including a plurality of layers, and the route search data of the plurality of layers is the departure place existing within a predetermined range. The search block data and the search table are included only for the combination of the destination and the destination.

  In still another embodiment of the present invention, the search data generation device includes, for a combination of a departure point and a destination, a search for including all links to be used for a route search from the departure point to the destination. Search overall data creating means for creating overall data; splitting means for creating search block data by dividing the search overall data into predetermined geographical blocks; and a plurality of corresponding to the same block Integration means for integrating similar search block data into one of the search block data; and output means for outputting the search block data after the integration processing by the integration means as search data. Prepare.

  In the search data creation device, first, overall search data including all links to be used for route search from the departure place to the destination is created for the combination of the departure place and the destination. . Next, the search whole data is divided into predetermined geographical blocks to create search block data. Next, among the plurality of search block data corresponding to the same block, similar search block data is integrated into one, and the search block data after the integration processing is output as search data.

  In still another embodiment of the present invention, the search data generation method includes a search and a search combination including all links to be used for a route search from the departure place to the destination for the combination of the departure place and the destination. A search overall data creation step for creating overall data; a search step for creating search block data by dividing the search overall data into predetermined geographical blocks; and a plurality of steps corresponding to the same block An integration step of integrating similar search block data into one of the search block data, and an output step of outputting the search block data after the integration processing by the integration step as search data. Prepare.

  In still another embodiment of the present invention, a search data creation program executed in a terminal device including a computer is used for a route search from the departure place to the destination for a combination of the departure place and the destination. Search overall data creation means for creating overall search data including all links to be performed; division means for creating search block data by dividing the overall search data into predetermined geographical blocks; Integration means for integrating similar search block data among a plurality of search block data corresponding to the block, and the search block data after the integration processing by the integration means The computer is caused to function as output means for outputting as

  Hereinafter, preferred embodiments of the present invention will be described with reference to the drawings.

[Map data]
FIG. 1 schematically shows the configuration of map data used in this embodiment. The map data has a hierarchical structure including a plurality of layers corresponding to a plurality of different scales. Although FIG. 1 illustrates the map data of three layers for convenience of explanation, the map data may have a larger number of hierarchical structures. In each layer, one unit of map data is referred to as “block (B)”. Note that “block” is a concept indicating a geographically wide range, and can also be expressed as “parcel”, “mesh”, or the like. In FIG. 1, layer 3 is the highest layer and corresponds to the widest map. Layer 1 is the lowest layer and corresponds to the most detailed map.

  The map data 120 is prepared separately for each layer, and includes map display data 122 and route search data 124, respectively. The map display data 122 is data used to display a map image to the user, and mainly includes image data corresponding to the map. The route search data 124 is data used for route search by the route search function.

  FIG. 2 shows the configuration of the route search data of the highest layer 3. The route search data 124 includes node data 125, link data 126, a search table 127, and search block data 128. The node corresponds to a predetermined point such as an intersection on the road, and the node data 125 is data indicating the node. On the other hand, the link corresponds to one section of the road divided by an intersection or the like, and the link data 126 is data indicating the link. In this embodiment, in the layers other than the highest layer, the route search data includes the node data 125 and the link data 126, but does not include the search table 127 and the search block data 128.

  However, the application of the present invention is not limited to this, and the route search data may be configured to include the search table 127 and the search block data 128 in all layers. For example, layer 3 may have a nationwide combination, and layer 2 may have only those data for blocks within 200 km. In this case, “Tokyo and Yamanashi”, “Tokyo and Tochigi”, etc. of the starting point and the destination have the search table 127 and the search block data 128 not only in Layer 3 but also in Layer 2, but “Tokyo and Hokkaido”. For “Tokyo and Fukuoka”, only layer 3 has a search table 127 and search block data 128.

  In another example, even in the highest layer, the search table 127 and the search block data 128 may be included for the combination of the departure place and the destination existing within a predetermined range without having the combination of the whole country. In still another example, the range having the search table 127 and the search block data 128 may be different for each layer. In a preferred example in this case, the range having the search table 127 and the search block data 128 is expanded as the layer becomes higher. For example, layer 1 has a search table 127 and search block data 128 for a combination of a departure place and a destination in Tokyo, and layer 2 has a search table 127 and search block data 128 for a combination of a departure place and a destination in Kanto. The layer 3 may have a search table 127 and search block data 128 for combinations of departure points and destinations nationwide.

  Examples of nodes and links are shown in FIGS. 3 (A) and 3 (B). A map including a plurality of roads 111 shown in FIG. 3A includes a plurality of nodes and links as shown in FIG. In FIG. 3B, each node is indicated by a node ID (N00001 etc.) and each link is indicated by a link ID (L00001 etc.).

  The search table 127 is a table for specifying the search block data 128 used for the route search process for each combination of the departure point and the destination. The search block data 128 is data indicating a link used in the route search process, and is prepared for each predetermined geographical block. That is, although details will be described later, during the route search, the search block data 128 corresponding to the combination of the departure point and the destination is specified with reference to the search table 127, and the links included in the search block data 128 are determined. The route search process is executed as a target.

  The search block data will be described in detail below. As described above, the route search data 124 includes the link data 126 for each layer. The link data 126 is data prepared for each predetermined geographical block, and basically includes all links existing in the block at the level of the corresponding layer. Therefore, basically, the route search can be executed by using the link data 126. However, since all the links in the corresponding block are included in the link data 126, unnecessary links are included depending on the route search conditions. For example, it is assumed that there is a main road extending from east to west, north and south in a certain block. When the positional relationship between the starting point and the destination in the route search is far from north to south, it is not necessary to consider the main road extending from east to west in the route search. That is, in the route search between the departure point and the destination that are separated in the north-south direction, among the links included in each block, the link extending mainly in the north-south direction should be considered, and the link extending in the east-west direction is considered. The need is low. However, since the link data 126 includes all the links existing in the corresponding block, when the route search is executed using the link data 126, the route search is calculated for even less necessary links. As a result, calculation takes time unnecessarily.

  For this reason, in this embodiment, for each combination of the departure place and the destination, data indicating a link to be considered in the route search between the departure place and the destination (hereinafter referred to as “search data”). create.

  4 and 5 show examples of search data between the departure point and the destination (hereinafter also referred to as “total search data”). FIG. 4A shows the entire search data indicating the link used for the route search from Sapporo to Fukuoka, and FIG. 4B shows the entire search data indicating the link used for the route search from Sapporo to Kochi. FIG. 4C shows the entire search data showing links used for route search from Sapporo to Naha. When these are compared, as a whole, the links included in the entire search data are different. In particular, the difference is remarkable in areas around China, Shikoku, and Kyushu, and there are subtle differences in the area including Tokyo shown by the broken line 130, but it can be seen that almost the same links are included in Tohoku and Hokuriku.

  As another example, FIG. 5A shows the entire search data showing a link used for route search from Sendai to Nagoya, and FIG. 5B shows a link used for route search from Sendai to Kanazawa. The entire search data is shown. Comparing these, in the area indicated by the broken line 130, the included links are very similar.

  Therefore, in this embodiment, search data is divided and prepared for each block, search data of similar blocks is integrated into one, and the number of search data is reduced. As a result, a rapid route search can be performed while suppressing the amount of data used exclusively for route search. The search data divided into blocks is referred to as “search block data”.

  First, a method for integrating search block data will be briefly described. In this embodiment, search block data corresponding to the same block and having a similarity greater than or equal to a predetermined value are integrated into one search block data. Specifically, the process of integration is to take the logical sum of the links. For example, for the same block, as shown in FIG. 6, the search block data 131a used in the route search from the departure point M to the destination N and the route block from the departure point P to the destination Q are used. Assume that there is search block data 131b. Each of them includes one link that does not exist in the other, but if they are assumed to be similar, the search block data 131a and 131b are calculated to be logically summed into one search block data 131c. be able to. That is, if the integrated search block data 131c is prepared and used in both the search from the departure place M to the destination N and the search from the departure place P to the destination Q, The amount of data to be stored as search block data can be reduced.

  Next, search block data creation processing will be described. FIG. 7 is a flowchart showing search block data creation processing. This process can be realized by a computer executing a program in a terminal device such as a PC.

  First, overall search data as illustrated in FIGS. 4 and 5 is created for a plurality of combinations of the departure point and the destination (step S10). This process is performed by extracting an appropriate link for a combination of the departure point and the destination from a plurality of links included in the link data according to the search condition including the departure point and the destination. Specifically, from all links in the link data, links corresponding to roads of a certain size such as expressways and main trunk roads, and links corresponding to roads extending in the direction of departure and destination Extract.

  When the entire search data is created for a plurality of combinations, the entire search data corresponding to each combination is then divided into predetermined geographical block units to obtain search block data. (Step S11). Next, similar ones are extracted from a plurality of search block data corresponding to the same block and integrated (step S12). Here, “similar” is determined based on how many common links are included in two search block data to be compared. In one example, when the total number of links included in a block is “X” and the number of links included in two search block data to be compared is “Y”, The similarity is calculated by the following formula.

Similarity = Y / X
When the similarity obtained in this way is equal to or greater than a predetermined value, the two search block data are determined to be “similar”. In the above example, the similarity is determined based on the ratio of the common links included in the two search block data to be compared. Instead, the two to be compared are two The similarity may be determined based on the number of common links included in the search block data.

  The processing for integrating the search block data can be realized by calculating the logical sum of the links included in the two search block data, as already described with reference to FIG. In this way, when similar search block data is integrated, a plurality of search block data having a low common link ratio, that is, dissimilar search data is prepared for one block.

  FIG. 8A shows an example of a list of search block data prepared for each block as described above. In this example, only one search block data is prepared for the blocks A, B, and I, and four search block data are prepared for the blocks E and H.

  Next, for each combination of the departure point and the destination, search block data to be used for route search is determined, and a search table is created (step S13). Search block data used for a certain combination of starting point and destination is basically each search block data obtained by dividing the entire search data generated for the combination. Become. However, in the case of integration by the above integration processing, the search block data after integration is used. In this way, search block data and a search table are created.

  An example of the created search table is shown in FIG. FIG. 9 and FIG. 10 show block data for search corresponding to the combination of the departure place and the destination exemplified in FIG. 8B for each block. For example, in the route search from Sapporo to Fukuoka shown in FIG. 9 (A) and the route search from Sapporo to Kochi shown in FIG. 9 (B), the same search is performed in blocks A, B, C, H, and I. Although block data is used, different search block data is used in blocks C, D, E, and F. Similarly, in the route search from Sendai to Nagoya shown in FIG. 10A and the route search from Sendai to Kanazawa shown in FIG. 10B, the same search block data is obtained in blocks C, F, and I. Although used, different search block data are used in the blocks E and H.

  In this way, by integrating search block data having a high degree of similarity, the data amount of the entire search block data can be reduced. As a result, it can be applied to a system with a small storage capacity, and the search block data update processing time can be shortened.

  Next, consider the size of the block. In the present embodiment, even if the block size is reduced, similar search block data are integrated, so that the total amount of search data does not increase. Theoretically, if the block is made smaller, the similar search block data increases, so that the entire data amount of the search data can be expected to be reduced. However, if the block is made smaller, it is necessary to read a large number of search block data when performing a route search using the search block data, and the route search processing may take time. Therefore, it is actually desirable to adjust various parameters to optimize the block size.

[Navigation device]
FIG. 11 shows the configuration of the navigation apparatus 200 according to the embodiment of the present invention. As shown in FIG. 11, the navigation device 200 includes a self-contained positioning device 10, a GPS receiver 18, a system controller 20, a disk drive 31, a data storage unit 36, a communication interface 37, a communication device 38, a display unit 40, and an audio output. A unit 50 and an input device 60 are provided.

  The autonomous positioning device 10 includes an acceleration sensor 11, an angular velocity sensor 12, and a distance sensor 13. The acceleration sensor 11 is made of, for example, a piezoelectric element, detects vehicle acceleration, and outputs acceleration data. The angular velocity sensor 12 is composed of, for example, a vibrating gyroscope, detects the angular velocity of the vehicle when the direction of the vehicle is changed, and outputs angular velocity data and relative azimuth data. The distance sensor 13 measures a vehicle speed pulse composed of a pulse signal generated with the rotation of the vehicle wheel.

  The GPS receiver 18 receives radio waves 19 carrying downlink data including positioning data from a plurality of GPS satellites. The positioning data is used to detect the absolute position of the vehicle from latitude and longitude information.

  The system controller 20 includes an interface 21, a CPU (Central Processing Unit) 22, a ROM (Read Only Memory) 23, and a RAM (Random Access Memory) 24, and controls the entire navigation apparatus 200.

  The interface 21 performs an interface operation with the acceleration sensor 11, the angular velocity sensor 12, the distance sensor 13, and the GPS receiver 18. From these, vehicle speed pulses, acceleration data, relative azimuth data, angular velocity data, GPS positioning data, absolute azimuth data, and the like are input to the system controller 20. The CPU 22 controls the entire system controller 20. The ROM 23 includes a nonvolatile memory (not shown) in which a control program for controlling the system controller 20 is stored. The RAM 24 stores various data such as route data preset by the user via the input device 60 so as to be readable, and provides a working area to the CPU 22.

  A system controller 20, a disk drive 31 such as a CD-ROM drive or a DVD-ROM drive, a data storage unit 36, a communication interface 37, a display unit 40, an audio output unit 50, and an input device 60 are mutually connected via a bus line 30. It is connected to the.

  The disk drive 31 reads and outputs content data such as music data and video data from a disk 33 such as a CD or DVD under the control of the system controller 20. The disk drive 31 may be either a CD-ROM drive or a DVD-ROM drive, or may be a CD and DVD compatible drive.

  The data storage unit 36 is composed of, for example, an HDD and stores various data used for navigation processing such as map data and facility data.

  The communication device 38 includes, for example, an FM tuner, a beacon receiver, a mobile phone, a dedicated communication card, and the like, and traffic congestion and traffic information distributed from a VICS (Vehicle Information Communication System) center via the communication interface 37. Receive road traffic information and other information.

  The display unit 40 displays various display data on a display device such as a display under the control of the system controller 20. Specifically, the system controller 20 reads map data from the data storage unit 36. The display unit 40 displays the map data read from the data storage unit 36 by the system controller 20 on a display screen such as a display. The display unit 40 includes a graphic controller 41 that controls the entire display unit 40 based on control data sent from the CPU 22 via the bus line 30 and image information that can be displayed immediately, such as a VRAM (Video RAM). A buffer memory 42 that temporarily stores, a display control unit 43 that controls display of a display 44 such as a liquid crystal display or a CRT (Cathode Ray Tube) based on image data output from the graphic controller 41, and a display 44 are provided. . The display 44 is composed of, for example, a liquid crystal display device having a diagonal of about 5 to 10 inches, and is mounted near the front panel in the vehicle.

  The audio output unit 50 performs D / A (Digital to Analog) conversion of audio digital data sent from the CD-ROM drive 31, DVD-ROM 32, RAM 24, or the like via the bus line 30 under the control of the system controller 20. A D / A converter 51 to perform, an amplifier (AMP) 52 that amplifies the audio analog signal output from the D / A converter 51, and a speaker 53 that converts the amplified audio analog signal into sound and outputs the sound into the vehicle. It is prepared for.

  The input device 60 includes keys, switches, buttons, a remote controller, a voice input device, and the like for inputting various commands and data. The input device 60 is disposed around the front panel and the display 44 of the main body of the in-vehicle electronic system mounted in the vehicle. When the display 44 is a touch panel system, the touch panel provided on the display screen of the display 44 also functions as the input device 60.

  The CPU 22 functions as a route search unit by executing a route search program stored in advance in the ROM 23 or the like. Further, the map data illustrated in FIG. 1 is stored in a data storage unit 36 as a storage unit.

[Route search processing]
Next, route search processing will be described. FIG. 12 shows a flowchart of the route search process. Actually, when the CPU 22 executes the route search program, the navigation device 200 operates as a route search device and executes route search processing.

  First, a user who performs a route search uses the input device 60 of the navigation device 200 to call a route search function, and designates and inputs a destination (final destination), a search condition, and the like. In response to this, the CPU 22 determines a starting point and a destination for route search (step S20). Usually, the position of the vehicle on which the navigation device 200 is mounted is set as the departure place. When a terminal device such as a PC is a route search device, the user may specify a departure place.

  Next, the CPU 22 refers to the search table illustrated in FIG. 8B to determine search block data corresponding to the determined combination of the departure place and the destination (step S21), and for the search. A plurality of route candidates from the departure point to the destination are calculated using the block data (step S22).

  When a plurality of candidate routes from the departure point to the destination are thus obtained, the CPU 22 calculates the cost for each candidate route, determines a candidate route having the minimum cost, and presents it to the user (step S23). Thus, the route search process ends. Note that the cost calculation is a method generally used in route calculation and refers to calculating the total cost associated with links and nodes in advance. The cost value associated with the link and the node is set in advance based on various types of information such as the time required to pass through the link and the node and the number of road lanes. Since cost calculation is a known method, detailed description thereof is omitted.

  In the above example, the route search is executed using the search block data for the block including the departure point and the destination. Instead, the route search may be performed for the block including the starting point and the destination by using link data including links smaller than the search block data. As a result, an appropriate route can be set in consideration of a large number of roads including small roads between the departure point and the destination, and the expressway and the main trunk road.

The structure of the map data used in the Example of this invention is shown typically. The structural example of the data for route search is shown. It is a figure explaining a link and a node. An example of the entire search data is shown. Another example of the entire search data is shown. It is a figure explaining the integration method of the block data for search. It is a flowchart of search block data creation processing. It is an example of search block data and a search table. An example of search block data corresponding to a combination of a departure place and a destination is shown. An example of search block data corresponding to a combination of a departure place and a destination is shown. It is a block diagram which shows the structure of the navigation apparatus by an Example. It is a flowchart of a route search process.

Explanation of symbols

10 Independent positioning device 18 GPS receiver 20 System controller 22 CPU
36 Data Storage Unit 40 Display Unit 60 Input Device 120 Map Data 122 Map Display Data 124 Route Search Data 125 Node Data 127 Search Table 128 Search Block Data 200 Navigation Device

Claims (12)

One or more prepared for each geographical block, prepared for each combination of the search block data indicating the link used for route search and the origin and destination, and the route from the origin to the destination A search table for specifying the search block data to be used for search, and a storage unit storing route search data including:
Route search means for determining the search block data corresponding to the combination of the starting point and the destination with reference to the search table and performing a route search using the determined block data for search. A route search device characterized by the above.   Each of the plurality of search block data prepared corresponding to one block has a predetermined number or less of the number of links common to other search block data prepared corresponding to the one block. The route search device according to claim 1, wherein the route search device is provided. The storage unit is prepared for each predetermined block, stores link data indicating all links existing in the block,
The route search device according to claim 1 or 2, wherein the route search means performs a route search using the link data for a block to which the departure place and the destination belong. One or more prepared for each geographical block, prepared for each combination of the search block data indicating the link used for route search and the origin and destination, and the route from the origin to the destination A storage step of storing, in a storage unit, route search data including a search table for specifying the search block data to be used for search;
A route search step of referring to the search table, determining the block data for search corresponding to a combination of a departure place and a destination, and performing a route search using the determined block data for search. The route search method characterized by this. A route search program executed in a terminal device including a storage unit and a computer,
One or more prepared for each geographical block, prepared for each combination of the search block data indicating the link used for route search and the origin and destination, and the route from the origin to the destination A storage means for storing route search data in the storage unit, including a search table for specifying the search block data to be used for search; and
Referring to the search table, the computer is used as route search means for determining the search block data corresponding to a combination of a departure place and a destination and performing a route search using the determined block data for search. A route search program characterized by functioning.   A storage medium storing the route search program according to claim 5.   One or more prepared for each geographical block, prepared for each combination of the search block data indicating the link used for route search and the origin and destination, and the route from the origin to the destination A storage medium storing route search data including a search table for specifying the search block data to be used for search. The route search data has a hierarchical structure composed of a plurality of layers,
The storage medium according to claim 7, wherein the search block data and the search table are included in the route search data of at least the highest layer among the plurality of layers. The route search data has a hierarchical structure composed of a plurality of layers,
8. The route search data of the plurality of layers includes the search block data and the search table only for the combination of the departure place and the destination existing within a predetermined range. The storage medium described in 1. Search overall data creation means for creating search overall data including all links to be used for route search from the departure place to the destination for the combination of the departure place and the destination;
Dividing means for dividing the entire search data into predetermined geographical blocks to create search block data;
Integration means for integrating similar search block data into one of the plurality of search block data corresponding to the same block;
And an output means for outputting the search block data after the integration processing by the integration means as search data. A search overall data creation step for creating a search overall data including all links to be used for a route search from the departure place to the destination for the combination of the departure place and the destination;
A dividing step of dividing the entire search data into predetermined geographical blocks to create search block data;
An integration step of integrating similar search block data into one of the plurality of search block data corresponding to the same block;
An output step of outputting the search block data after the integration processing by the integration step as search data. A search data creation program executed in a terminal device including a computer,
Search overall data creation means for creating overall search data including all links to be used for route search from the departure place to the destination for the combination of the departure place and the destination;
Dividing means for dividing the entire search data into predetermined geographical blocks to create search block data;
Integration means for integrating similar search block data into one of the plurality of search block data corresponding to the same block; and
A search data creation program that causes the computer to function as output means for outputting the search block data after integration processing by the integration means as search data.

Images