JP2008122266A - Route searching device, route searching method, route searching program, and storage medium - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To accelerate route calculation of a long distance without excessively increasing a data amount of route calculation data. <P>SOLUTION: The route calculation data used for route searching includes a route calculation flag in addition to node data and link data. The route calculation flag is prepared in each link or each node, and indicates whether the link or node is used in route calculation from a start point to a destination or not. The route calculation flag can make data setting any one of a value (1)indicating that the route calculation flag is used in route calculation and another value (0) indicating that it is not used in the route calculation in each combined ID given to combination of the start point and the destination for instance. A route calculation means determines the link or the node to use in the route calculation from the start point to the destination by referring the route calculation flag, and performs the route calculation by using the determined link or node in the route calculation from the specific start point to the specific destination. <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 calculation takes time because the number of candidate roads increases. Normally, route calculation 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 calculating 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 calculation at high speed, a method of including special data in addition to normal node and link data in route calculation data is known. 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 route calculation between them is prepared and route calculation is performed using this 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 calculation, 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, the above-described method increases the amount of special data included in the route calculation data. In addition, when the route calculation data needs to be updated in accordance with the road change, 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 calculation data.

  The invention according to claim 1 is a route search device, and is prepared for each link or node, link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road. A storage unit for storing map data including route calculation data indicating whether or not to use the link or node in the route calculation from the departure point to the destination, and from the specific departure point to the specific destination In route calculation, route calculation means for determining a link or node to be used for route calculation from the departure place to the destination with reference to the route calculation data and performing route calculation using the determined link or node And.

  The invention according to claim 4 is a route search method, and is prepared for each link or node, link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road. A storage step of storing map data in the storage unit including route calculation data indicating whether or not to use the link or node in the route calculation from the departure point to the destination, and a specific purpose from the specific departure point In the route calculation to the ground, the link or node to be used for the route calculation from the departure place to the destination is determined with reference to the route calculation data, and the route calculation is performed using the determined link or node. And a route calculation step.

  The invention according to claim 5 is a route search program executed in a terminal device including a storage unit and a computer, and corresponds to link data indicating a link corresponding to a road and a predetermined point on the road Storing the map data including node data indicating nodes to be used and route calculation data prepared for each link or node and indicating whether or not to use the link or node in the route calculation from the departure point to the destination And a link or node to be used for route calculation from the departure point to the destination with reference to the route calculation data in route calculation from the specific departure point to the specific destination. And the computer is caused to function as route calculation means for performing route calculation using the determined link or node.

  The invention according to claim 6 is a storage medium, prepared for each link or node, link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, Map data including route calculation data indicating whether or not to use the link or node in route calculation from the departure place to the destination is stored.

  In a preferred embodiment of the present invention, the route search device is provided for each link or node, link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and starting. A storage unit for storing map data including route calculation data indicating whether or not the link or node is used in route calculation from the place to the destination, and route calculation from the specific departure point to the specific destination A route calculation means for determining a link or node to be used for route calculation from the departure place to the destination with reference to the route calculation data, and performing route calculation using the determined link or node; It is characterized by providing.

  The route search device described above can be configured as a navigation device or a terminal device such as a PC that performs route search using map data on the Internet or a storage medium. Map data used for route search includes route calculation data in addition to node data and link data. The route calculation data is prepared for each link or node, and indicates whether the link or node is used in route calculation from the departure point to the destination. The route calculation data includes, for example, a value “1” indicating that it is used for route calculation and a value “0” indicating that it is not used for route calculation for each combination ID assigned to the combination of the departure point and the destination. One of these can be set as a flag. The route calculation means determines a link or a node to be used for route calculation from the departure place to the destination with reference to the route calculation data in the route calculation from the specific departure place to the specific destination. Route calculation is performed using the determined link or node.

  According to this route search device, route calculation data indicating a link or node used for route calculation may be stored in association with link data or node data, so that the link dedicated to route calculation is separated from normal link data. Compared with the case where data etc. are memorize | stored, a rapid route calculation is attained, without increasing the data amount of map data more than necessary.

  In a preferred example of the above route search device, the route calculation data is prepared for each link, and a flag indicating whether or not each link is used for each of a plurality of combinations of a departure place and a destination. Can do. In another preferred example, the route calculation data is prepared for each node, and can be a flag indicating whether or not to use each node for each of a plurality of combinations of a departure place and a destination. .

  In another preferred example of the route search apparatus, the route calculation data may be data in which IDs of links or nodes used for route calculation are collected for each combination of a departure place and a destination.

  In another embodiment of the present invention, a route search method includes link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and a link or a node for each departure. A storage step of storing in the storage unit map data including route calculation data indicating whether or not to use the link or node in the route calculation from the place to the destination, and from the specific departure point to the specific destination In the route calculation, the route calculation is performed by determining the link or node to be used for the route calculation from the departure place to the destination with reference to the route calculation data, and performing the route calculation using the determined link or node. A process.

  According to this route search method, route calculation data indicating a link or node used for route calculation may be stored in association with link data or node data, so that a link dedicated to route calculation is separated from normal link data. Compared with the case where data etc. are memorize | stored, a rapid route calculation is attained, without increasing the data amount of map data more than necessary.

  In another embodiment of the present invention, a route search program executed in a terminal device including a storage unit and a computer includes link data indicating a link corresponding to a road, and a node corresponding to a predetermined point on the road Map data including node data indicating, and route calculation data prepared for each link or node and indicating whether to use the link or node in the route calculation from the departure point to the destination in the storage unit In the storage means for storing, and in the route calculation from a specific departure place to a specific destination, the link or node to be used for the route calculation from the departure place to the destination is determined with reference to the route calculation data Then, the computer is caused to function as route calculation means for performing route calculation using the determined link or node.

  By executing the route search program by the computer of the terminal device, the route search device can be realized.

  In another embodiment of the present invention, link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, and prepared for each link or node, from the departure place to the destination Map data including route calculation data indicating whether or not to use the link or node in the route calculation is stored in the storage medium.

  By using the map data stored in this storage medium, the data amount of the map data is increased more than necessary as compared with the case where link data dedicated to route calculation is stored separately from the normal link data. Therefore, quick route calculation is possible.

  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 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. In each layer, one unit of map data is referred to as “block (B)”. The “block” is a concept indicating a geographically wide range, and may be expressed as “parcel”, “mesh”, or the like.

  The map data 120 is prepared separately for each layer, and includes map display data 122 and route calculation 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 calculation data 124 is data used for route calculation by the route search function.

  FIG. 2 shows the configuration of the route calculation data. The route calculation data 124 includes node data 125 and link data 126. 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.

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

  FIG. 3 shows the structure of link data. The link data 126 includes, for each link ID corresponding to each link, a link attribute indicating a road attribute corresponding to the link, and a route calculation flag. The link attribute includes, for example, the road type, width, coordinates, length, and the like of the corresponding road. The route calculation flag is a flag used in route calculation, and indicates whether or not the link corresponding to the link ID is used in route calculation from a specific departure place to a specific destination. The route calculation flag is an example of route calculation data in the present invention.

  The route calculation flag will be described in detail with reference to FIG. The route calculation flag indicates whether or not the link is used in the route calculation from the departure point to the destination for a plurality of combinations of the departure point and the destination. FIG. 5A shows an example of a combination table showing a plurality of combinations of a departure place and a destination. As shown in FIG. 5A, a combination ID is assigned to a plurality of combinations of a departure place and a destination. There are as many combinations of departure points and destinations as there are departure points and destinations required in a car navigation device described later. In the following description, the city name such as “Tokyo” or “Sapporo” is used as the starting point and destination for convenience of explanation, but the actual map data includes areas including Tokyo and Sapporo. A route calculation flag is set for each combination. That is, on the map data, the combination ID 1 indicates a combination of an area including Tokyo and an area including Fukuoka.

  FIG. 5B shows an example of the route calculation flag. In this example, the route calculation flag is prepared for each link ID, and indicates whether each link is used in route calculation for the combination of the departure place and the destination indicated by the combination ID. Specifically, the route calculation flag indicates that it is used for route calculation when its value is “1”, and indicates that it is not used for route calculation when its value is “0”. For example, in the example of FIG. 5B, for the link with the link number L00001, the route calculation flag corresponding to the combination ID “1” is “1”, and therefore from the departure place “Tokyo” corresponding to the combination ID “1”. In the route calculation to the destination “Fukuoka”, the link having the link number L00001 is used. Similarly, for the link with the link number L00001, the route calculation flag corresponding to the combination ID “2” is “0”, so the departure point “Tokyo” corresponding to the combination ID “2” is changed to the destination “Kochi”. In the route calculation, the link having the link number L00001 is not used.

  As described above, the route calculation flag indicates whether or not the link is used in route calculation from a specific departure point to a specific destination for each link. Therefore, when the starting point and the destination are determined at the time of route calculation, the link used in the route calculation from the starting point to the destination can be specified by referring to FIG. 5B. Therefore, by using the route calculation flag of the present embodiment, route calculation can be performed quickly with a much smaller amount of computation than when route calculation is performed based on link data including links corresponding to all roads. it can.

  In this embodiment, it is necessary to prepare and store separate data called the above-described route calculation flag as compared with the case where route calculation is performed using normal link data. However, as understood from FIG. 5B, the route calculation flag is a flag of “0” and “1”, and can be represented by 1 bit. Therefore, the route calculation flag is sufficient for the information amount of the number of bits corresponding to the number of combinations of the starting point and the destination for each link, and link data dedicated to route calculation etc. separately from normal link data Compared with the method of storing the data, the amount of data to be increased can be very small.

  There are several methods for storing the actual route calculation flag. In the first method, as shown in FIG. 3, a route calculation flag corresponding to each link ID is accommodated in the link data of the link. In the example of FIG. 3, the content of the route calculation flag corresponding to the link IDL00001 is the route calculation data of the link IDL00001 shown in the first row of FIG. In this method, information such as link attributes related to one link and a route calculation flag can be managed as one data.

  In the second method, the link calculation flag is not included in the link data as in the first method, but the link data and the route calculation flag are stored and managed as separate data. In this case, the link data itself includes only the link ID and the link attribute, and a route calculation flag table as illustrated in FIG. 5B is stored separately from the link data. The second method has an advantage that the update process becomes easier when the geographical road (link) is changed and the link data is updated. For example, when one new road is created, the link data itself may increase the link data of the link corresponding to the new road. On the other hand, since the route route calculation flag needs to be updated according to the occurrence of the new road, it covers a plurality of links and combinations of the departure point and destination, so it is better to recreate the route calculation flag table itself. Often it is efficient. As described above, the second method has an advantage that the link data itself and the route calculation flag table can be updated independently.

  As shown in FIG. 1, the route calculation data 124 is prepared for each of a plurality of layers, but it is usually sufficient to prepare the route calculation flag only for the highest layer.

[Navigation device]
FIG. 6 shows a configuration of the navigation device 200 according to the embodiment of the present invention. As shown in FIG. 6, the navigation device 200 includes a self-supporting 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 a voice 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 22, a ROM 23, and a RAM 24, and controls the entire navigation device 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, etc. 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 a memory such as a VRAM (Video RAM), and can display image information that can be displayed immediately. 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 is a D / A converter that performs D / A 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. 51, 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. Yes.

  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 calculation unit by executing a route search program stored in advance in the ROM 23 or the like. The map data illustrated in FIG. 1 is stored in the data storage unit 36.

[Route search processing]
Next, route search processing will be described. FIG. 7 shows a flowchart of the route search process. In practice, when the CPU 22 executes a 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 designate and input a destination. In response to this, the CPU 22 determines a starting point and a destination for route search (step S10). 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 route calculation flag in each link data shown in FIG. 3 or the route calculation flag table shown in FIG. 5B and uses it for route calculation of the departure point and destination determined in step S10. A link to be identified is specified (step S11). Then, the CPU 22 calculates a candidate route to the destination using the identified link (step S12). When a plurality of candidate routes from the departure point to the destination are obtained, the CPU 22 calculates a cost for each candidate route, determines a candidate route having the minimum cost, and presents it to the user (step S13). 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.

  FIG. 8 shows another flowchart of the route search process. 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 designate and input a destination. In response to this, the CPU 22 determines a starting point and a destination for route search (step S20).

  Next, the CPU 22 refers to the route calculation flag in each link data shown in FIG. 3 or the route calculation flag table shown in FIG. 5B and uses it for route calculation of the departure point and destination determined in step S10. The links to be performed are identified one by one from the departure point to the destination, and candidate routes to the destination are calculated (step S21). Thus, when a plurality of candidate routes from the departure point to the destination are 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 S22). Thus, the route search process ends.

  Next, the advantages of the route calculation method using the route calculation flag of the present invention will be described with reference to FIG. FIGS. 9A and 9B show a method of calculating in advance a link to be used for calculating a route from a certain departure point to a destination and storing it for each combination of the departure point and the destination (hereinafter referred to as “the method of the comparative example”). The route calculation data (hereinafter also referred to as “route calculation dedicated link data”) prepared by FIG. 9A shows an example of route calculation dedicated link data from the departure point X1 to the destination Y1, and FIG. 9B shows an example of route calculation dedicated link data from the departure point X2 to the destination Y2. In the method of the comparative example, one route calculation-dedicated link data indicating all the links used for route calculation from the departure point to the destination is prepared for the combination of the departure point and the destination. Therefore, at the time of route calculation, one route calculation dedicated link data may be read and route calculation may be performed. However, since it is necessary to prepare as many route calculation dedicated link data as the number of combinations of the departure point and the destination, the total amount of the route calculation dedicated link data becomes enormous. Further, the link data included in the route calculation dedicated link data is also included in normal link data, and substantially the same link data is redundantly held.

  On the other hand, in the method of this embodiment, each link included in the link data prepared for each block is stored as a flag as to whether or not it is used for route calculation from a specific departure place to a specific destination. is doing. FIGS. 9C and 9D show examples. 9 (C) and 9 (D) are originally the same data, and FIG. 9 (C) shows the focus on the starting point X1 and the destination Y1, and FIG. 9 (C) shows the focus on the starting point X2 and the destination Y2. 9 (D). In the figure, a solid line link is a link whose route calculation flag is “0” (that is, a link that is not used for route calculation), and a broken line link is a link whose route calculation flag is “1” (that is, that is used for route calculation). Link).

  Thus, in the method of this embodiment, it is only necessary to set the route calculation flag for each link in the link data. Further, at the time of route calculation, the same link data is used, and a route calculation may be performed by extracting a link used for route calculation between the departure point and the destination from the route calculation flag.

  Further, the first and second methods are exemplified as the route calculation method according to the present embodiment. However, when the second method shown in FIG. 8 is used, the route calculation is performed while following the links one by one in order from the departure point. For example, in the case of the example of FIG. 9D, links of blocks B1, B2, and B3 that do not include a link whose route calculation flag is “1” (that is, a link indicated by a broken line). There is no need to refer to the data as a result, and it is not necessary to read the data into a memory or the like. Thereby, the route search processing is made efficient and quick.

  In the method of the comparative example described above, dedicated link data for route calculation including link data of links used for route calculation is created for each combination of the departure point and the destination. For this reason, as described above, at the time of route calculation, there is an advantage that one route calculation dedicated link data is read and route calculation is performed. If you want to prepare data used exclusively for route calculation, such as link data dedicated to route calculation, for each combination of departure point and destination, use route calculation data with the same content as the route calculation flag of this embodiment as the starting point and destination. What is necessary is just to prepare for every combination of the ground. That is, for each combination of the departure point and the destination, a set of link IDs of links used for route calculation is obtained and used as route calculation data. In this way, since the contents of the route calculation data are only a set of link IDs, the amount of data can be significantly reduced compared to the case where the link data itself is held as in the comparative route calculation dedicated link data. Can do.

  In this case, in the route calculation, the navigation apparatus first specifies a link corresponding to the combination of the departure point and the destination with reference to route calculation data that is a set of link IDs. Next, referring to link data corresponding to those links, route calculation is executed. In addition, if the set of link IDs is sorted by the link ID, it becomes easy to refer at the time of route calculation.

[Modification]
In the above example, a route calculation flag is prepared for each link and included in the link data as shown in FIG. 3, or a route calculation flag corresponding to all links is described as shown in FIG. A route calculation flag table was created. Instead, a route calculation flag can be prepared for each node. FIG. 10 shows an example of node data when a route calculation flag is prepared for each node. As shown in FIG. 10, the node data 125 includes the position coordinates of the node and a route calculation flag in association with the node ID indicating each node. As shown in FIG. 5B, the route calculation flag has a value of “0” or “1” for each combination ID indicating a combination of a departure place and a destination.

  In this case, in the actual route search process, the route calculation is executed by referring to the route calculation flag in the above node data based on the combination of the departure point and the destination, identifying the node used for the route calculation. That's fine.

  In the above embodiment, the present invention is applied to a car navigation device. However, the present invention can be used for various terminal devices having a function of searching for a route using map data. Specifically, using a car navigation device, a server device that provides a route search service on the web, map data downloaded from a server on the web, or map data stored in a storage medium such as a DVD-ROM. It can be used for an application for calculating a route on a PC.

The structure of the map data used in the Example of this invention is shown typically. The structural example of the data for route calculation is shown. The structural example of the link data by an Example is shown. It is a figure explaining a link and a node. The structural example of the route calculation flag by an Example is shown. The structure of the navigation apparatus which is an Example of the route calculation apparatus of this invention is shown. It is a flowchart of a route search process. It is another flowchart of a route search process. It is a figure which compares the method by an Example and the method by a comparative example. The structural example of the node data by a modification is shown.

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 calculation data 125 Node data 126 Link data 200 Navigation device

Claims (7)

Link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, prepared for each link or node, and calculating the link or node in the route calculation from the departure place to the destination A storage unit for storing map data including route calculation data indicating whether or not to use;
In the route calculation from a specific departure point to a specific destination, the link or node to be used for calculating the route from the departure point to the destination is determined with reference to the route calculation data, and the determined link or A route search device comprising: route calculation means for performing route calculation using a node.   2. The route according to claim 1, wherein the route calculation data is prepared for each link, and is a flag indicating whether or not to use each link for each of a plurality of combinations of a departure place and a destination. Search device.   2. The route according to claim 1, wherein the route calculation data is prepared for each node and is a flag indicating whether or not to use each node for each of a plurality of combinations of a departure place and a destination. Search device.   The route search apparatus according to claim 1, wherein the route calculation data is configured as data in which IDs of links or nodes used for route calculation are collected for each combination of a departure place and a destination. Link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, prepared for each link or node, and calculating the link or node in the route calculation from the departure place to the destination A storage step of storing map data including route calculation data indicating whether or not to use in a storage unit;
In the route calculation from a specific departure point to a specific destination, the link or node to be used for calculating the route from the departure point to the destination is determined with reference to the route calculation data, and the determined link or And a route calculation step of performing route calculation using a node. A route search program executed in a terminal device including a storage unit and a computer,
Link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, prepared for each link or node, and calculating the link or node in the route calculation from the departure place to the destination Storage means for storing map data including route calculation data indicating whether or not to use in the storage unit; and
In the route calculation from a specific departure point to a specific destination, the link or node to be used for calculating the route from the departure point to the destination is determined with reference to the route calculation data, and the determined link or A route search program for causing the computer to function as route calculation means for performing route calculation using a node.   Link data indicating a link corresponding to a road, node data indicating a node corresponding to a predetermined point on the road, prepared for each link or node, and calculating the link or node in the route calculation from the departure place to the destination A storage medium storing map data including route calculation data indicating whether or not to use.

Images