JP5144759B2 - Route search device, route search method, route search program, and recording medium - Google Patents

Description

  The present invention relates to a route search device, a route search method, a route search program, and a recording medium.

  In recent years, a mobile device such as a vehicle is equipped with a navigation device that guides a route to the destination point by setting the destination point. This type of navigation device has a route search function for searching for a route to a destination point.

  In order to perform a route search, the navigation device normally stores route calculation data having a hierarchical structure. When calculating long-distance routes, the number of candidate roads is large, and it takes time to calculate the route.Therefore, in the high-level route calculation data for long-distance, the starting point area and the destination point area are A method is adopted in which data of links necessary for route calculation between the combinations and between them are recorded.

  Details of conventional data for long-distance calculation will be described with reference to FIGS. 10 and 11. FIG. 10 is an explanatory diagram showing an example of a combination of conventional long-distance route calculation data. In FIG. 10, combination data 1000 indicates a combination of the area of the departure point and the area of the destination point. Link data necessary for route calculation is recorded for each combination of areas. As a specific example, link data in a combination of the South Kanto area and the Kinki area indicated by reference numeral 1001 will be described below with reference to FIG. Of the combination data, the link data of the area indicated by the halftone dots will be described later.

  FIG. 11 is an explanatory diagram showing link data for each combination of areas in conventional long-distance route calculation data. In FIG. 11, link data 1100 indicates data used for route calculation between the South Kanto area and the Kinki area. For example, as a route from the South Kanto area with Tokyo Station 1101 as the departure point to the Kinki area with Osaka Station 1102 as the destination point, a route through the Tokai region (south side) or a route through the Koshinetsu region (north side) Many routes are recorded in advance. When the route search process is performed with the Tokyo station 1101 as the departure point and the Osaka station 1102 as the destination point, the route is determined by narrowing down the optimum route that matches the search conditions and the like.

  In addition, as a technology with such long-distance calculation data, in order to speed up long-distance calculation, each area on the map is divided into multiple sections, and main roads such as expressways in each section In addition, when connecting to the main road such as an interchange, the main road is identified from the section including the start point and the section including the end point, and the section including the start point and the end point are included. There has been proposed a technique for specifying a route from each point in each section to a connection point of a main road (see, for example, Patent Document 1 below).

JP-A-11-64023

  However, in the above-described conventional technology, there is a problem that the amount of data for route calculation is enormous. In particular, since the amount of data at the time of update is large, there is a problem that it takes time to update.

  Here, a supplementary explanation will be given for data to be updated at the time of updating, with reference to FIG. For example, if it is assumed that a new expressway has been opened between Atsugi belonging to the South Kanto area and Kuki belonging to the North Kanto area, all link data of the combinations shown in the halftone dots in FIG. 10 should be updated. become. In other words, except for combinations of areas west of the Hokuriku area and combinations of areas north of the Tohoku area, link data is updated for each area combination that has a route connecting the South Kanto area and the North Kanto area. There is a need.

  That is, there is a problem that only one main road that extends from the South Kanto area to the North Kanto area needs to be updated for more than half of the combination data 1000. Therefore, even when the user desires to update only a specific area, there is a problem that only the area cannot be updated and the amount of data at the time of updating becomes enormous.

  In order to solve the above-described problems and achieve the object, the route search apparatus according to the invention of claim 1 is a combination of a departure area and a destination area and a route that passes between the departure area and the destination area for each combination. A table in which a sequence of areas is associated, a recording means for recording in-area route data including only links used for routes connecting boundary nodes located at the boundary of the area in each area, and a departure point And a route area that passes between the area to which the departure point belongs and the area to which the departure point belongs, based on the combination of the input means for receiving the input of the destination point and the area to which the departure point belongs and the area to which the departure point belongs The departure means is extracted from the table using the route data in the area of the via area, Characterized in that it comprises a search means for searching for a route from a point to the destination point, the.

  The route search method according to claim 6 includes a table in which a combination of a departure area and a destination area and a sequence of transit areas that pass between the departure area and the destination area are associated with each combination. A route search method for a route search device including a recording unit that records in-area route data including only links used for routes connecting boundary nodes located at the boundary of the area in the area, And a transit area that passes between the area to which the departure point belongs and the area to which the departure point belongs, based on the combination of the input step for receiving the input of the destination point and the area to which the departure point belongs and the area to which the departure point belongs Using the extraction step of extracting the column of the table from the table and the route data in the area of the via area, the departure point Characterized by comprising a searching step for searching for a route et to the destination point, the.

  A route search program according to claim 7 causes a computer to execute the route search method according to claim 6.

  A recording medium according to an eighth aspect is characterized in that the route search program according to the seventh aspect is recorded in a computer-readable manner.

FIG. 1 is a block diagram illustrating an example of a functional configuration of the route search apparatus according to the present embodiment. FIG. 2 is a flowchart showing an example of a route search processing procedure of the route search device according to this exemplary embodiment. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment. FIG. 4 is an explanatory diagram illustrating an example of a long-distance route. FIG. 5 is an explanatory diagram showing an example of long-distance path calculation data recorded on the magnetic disk. FIG. 6 is an explanatory diagram showing an example of intra-area route data. FIG. 7 is an explanatory diagram showing an example of intra-area route data when the area is subdivided. FIG. 8 is a flowchart illustrating an example of route search processing performed by the navigation device. FIG. 9 is a flowchart showing data update processing performed by the navigation device. FIG. 10 is an explanatory diagram showing an example of a combination of conventional long-distance route calculation data. FIG. 11 is an explanatory diagram showing link data for each combination of areas in conventional long-distance route calculation data.

Explanation of symbols

DESCRIPTION OF SYMBOLS 100 Route search device 110 Recording part 111 Table 112 In-area route data 120 Input part 130 Extraction part 140 Search part 150 Output part 160 Acquisition part 170 Update part 300 Navigation apparatus

  Exemplary embodiments of a route search device, a route search method, a route search program, and a recording medium according to the present invention will be explained below in detail with reference to the accompanying drawings.

(Embodiment)
(Functional configuration of route search device)
A functional configuration of the route search apparatus according to the embodiment of the present invention will be described. FIG. 1 is a block diagram illustrating an example of a functional configuration of the route search apparatus according to the present embodiment. In FIG. 1, the route search device 100 includes a recording unit 110, an input unit 120, an extraction unit 130, a search unit 140, an output unit 150, an acquisition unit 160, and an update unit 170. .

  The recording unit 110 records the table 111 and the intra-area route data 112. In the present embodiment, the target data is, for example, the long-distance route calculation data of the highest hierarchy or the hierarchy equivalent to it among the route calculation data having a hierarchical structure. The departure area is an area including the departure point. The departure point is a point arbitrarily selected by the user, a current point when a destination point is input, or the like. The destination area is an area including the destination point.

  The table 111 associates a combination of a departure area and a destination area with a sequence of transit areas that pass between the departure area and the destination area for each combination. The table 111 specifically corresponds to, for example, a combination of the Tokai area, such as Shizuoka and Aichi, and the transit area via the Kinki area, for a combination with the South Kanto area as the departure area and the China area as the destination area. It is attached. This table 111 lists text data such as an area ID assigned to each area in order of the passing area for each combination.

  The intra-area route data 112 is data in which boundary nodes located at the boundary of the area are connected in each area. Specifically, the in-area route data 112 is data including only links used for routes connecting boundary nodes. Also, the intra-area route data 112 may be different data depending on the combination of adjacent areas, or may be the same data by providing a flag for use / non-use for each combination of adjacent areas on each link. For example, in the intra-area route data 112 of the Tokai area, the intra-area route data 112 connects a boundary node located at the boundary with the South Kanto area and a boundary node located at the boundary with the Kinki area. Data of a plurality of link strings.

  The input unit 120 receives input of a departure point and a destination point. Examples of a method for receiving input by the input unit 120 include operation input and voice input.

  Based on the combination of the area to which the departure point belongs and the area to which the destination point belongs, the extraction unit 130 extracts, from the table 111, a series of transit areas that pass between the area to which the departure point belongs and the area to which the destination point belongs. . Specifically, the extraction unit 130 determines an area to which the departure point belongs, determines an area to which the destination point belongs, and extracts a sequence of transit areas based on a combination of the areas.

  The search unit 140 searches for a route from the departure point to the destination point using the in-area route data 112 of the via area. Specifically, the search unit 140 searches for a route from the departure point to the destination point by calculating a route between the boundary nodes for each via area included in the via area column extracted by the extracting unit 130. To do. In addition, the search unit 140 may search for a plurality of routes. The search unit 140 may calculate the route in order for each area, or may simultaneously read the necessary areas and calculate the route collectively.

  The output unit 150 outputs information on the route searched for by the search unit 140. The output unit 150 outputs the searched route to a display unit (not shown), a voice output unit, or the like for the user to select, and also outputs the route guidance data to a RAM or the like.

  Further, in the present embodiment, the table 111 may be a table in which a plurality of via area rows are associated with one combination of the departure area and the destination area. Specifically, the table 111 is, for example, for a combination of the South Kanto area as the departure area and the China area as the destination area, a sequence of via areas via the Tokai area and Kinki area, Yamanashi, Nagano, etc. A plurality of transit area columns are associated with each other, such as a transit area sequence via the Koshinetsu area and the Kinki area.

  In this case, the extraction unit 130 extracts a sequence of one transit area based on the area to which the departure point belongs and the area to which the destination point belongs. Specifically, the extraction unit 130 selects and extracts a link string according to, for example, a departure point in the departure area, a position of the destination point in the destination area, a search condition described later, and the like.

  In the present embodiment, the recording unit 110 may record the table 111 for each search condition. In this case, the input unit 120 receives an input of search conditions together with the departure point and the destination point. The extraction unit 130 extracts a sequence of transit areas corresponding to the search condition received by the input unit 120 from the table 111. In addition, the search unit 140 searches for a route from the departure point to the destination point that satisfies the search condition, using the in-area route data 112 of the transit area.

  As described above, if the table 111 is distinguished for each search condition, it is possible to use the same in-area route data 112 regardless of the search condition. In this case, a flag may be set for each link for each search condition. That is, it is only necessary to set the flag of each link in the in-area route data 112 to on or off according to each search condition such as time priority or distance priority so that a route search corresponding to the search condition can be performed. The in-area route data 112 may be recorded as different data for each search condition.

  In the present embodiment, the acquisition unit 160 and the update unit 170 are arbitrary components. The acquisition unit 160 acquires update information of the table 111. Specifically, the update information of the table 111 is, for example, text data such as area IDs enumerated in order of passing areas for each combination.

  The update unit 170 updates the table 111 recorded in the recording unit 110 based on the update information of the table 111 acquired by the acquisition unit 160. Specifically, when the update information indicates text data for rewriting the table, the update unit 170 only needs to rewrite the text data in the table 111. Note that the updating unit 170 may update the table 111 for each combination of the departure area and the destination area.

  In the present embodiment, the acquisition unit 160 may acquire update information of the in-area route data 112. In this case, the update unit 170 updates the intra-area route data 112 recorded in the recording unit 110 for each area based on the update information of the intra-area route data 112. That is, the updating unit 170 may replace only the updated in-area route data 112. It should be noted that the update for each table 111 and the update for each in-area route data 112 can also be updated together.

(Route search processing procedure of route search device)
Next, a route search processing procedure of the route search device 100 will be described with reference to FIG. FIG. 2 is a flowchart illustrating an example of a route search processing procedure of the route search device 100 according to the present embodiment.

  In the flowchart of FIG. 2, the route search device 100 determines whether or not the input unit 120 has received input of a departure point and a destination point (step S <b> 201). The input unit 120 is in a standby state until it receives the input of the departure point and the destination point (step S201: No loop). When the input is received (step S201: Yes), the extraction unit 130 determines the area to which the departure point belongs and Based on the combination of areas to which the destination points belong, a sequence of transit areas that pass between the area to which the departure point belongs and the area to which the destination point belongs is extracted from the table 111 (step S202).

  Then, the search unit 140 searches for a route from the departure point to the destination point using the in-area route data 112 of the transit area (step S203). Thereafter, the output unit 150 outputs route information (step S204), and the series of processing ends.

  As described above, according to the route search device 100 according to the present embodiment, a sequence of route areas that pass between the area to which the departure point belongs and the area to which the destination point belongs is extracted from the table 111, and the route area Since the route from the departure point to the destination point is searched using the in-area route data, it is possible to reduce the data capacity of the long-distance route calculation data while enabling a rapid route search process. .

  Further, in the present embodiment, the table 111 is obtained by associating a plurality of via area columns with one combination of the departure area and the destination area, and extracts a via area column from the table 111. By doing so, it is possible to present an optimum route from a plurality of routes while reducing the data capacity of the long-distance route calculation data.

  Further, in the present embodiment, the table 111 for each search condition is recorded, a sequence of transit areas corresponding to the search condition received from the user is extracted from the table 111, and the purpose is determined from the departure point satisfying the search condition. If the route to the point is searched, it is possible to present an optimum route according to the search condition desired by the user while reducing the data capacity of the long-distance route calculation data.

  In this embodiment, if update information of the table 111 is acquired and the table 111 is updated based on the update information, for example, the amount of data to be updated by rewriting only text data Can be reduced. Therefore, the cost required for updating can be suppressed.

  In the present embodiment, if the update information of the intra-area route data 112 is acquired and the intra-area route data 112 is updated for each area based on the update information, the update is performed on an area basis. This can be done and the amount of data to be updated can be reduced. Therefore, the cost required for updating can be suppressed.

  Examples of the present invention will be described below. In this embodiment, an example in which the route search device 100 of the present invention is implemented by a navigation device mounted on a vehicle will be described.

(Hardware configuration of navigation device)
The hardware configuration of the navigation device according to the present embodiment will be described with reference to FIG. FIG. 3 is a block diagram illustrating an example of a hardware configuration of the navigation device according to the present embodiment.

  In FIG. 3, a navigation device 300 includes a CPU 301, a ROM 302, a RAM 303, a magnetic disk drive 304, a magnetic disk 305, an optical disk drive 306, an optical disk 307, an audio I / F (interface) 308, and a speaker 309. An input device 310, a video I / F 311, a display 312, a communication I / F 313, a GPS unit 314, and various sensors 315. Each component 301 to 315 is connected by a bus 320.

  The CPU 301 governs overall control of the navigation device 300. A rewritable nonvolatile memory such as the ROM 302 or the flash ROM records various programs such as a boot program, a current location calculation program, a route search program, a route guidance program, and an update program. The RAM 303 is used as a work area for the CPU 301.

  The current location calculation program, for example, calculates the current location of the vehicle (the current location of the navigation device 300) based on output information from the GPS unit 314 described later.

  The route search program searches for an optimum route from the departure point to the destination point using map data, route calculation data, and the like recorded on the magnetic disk 305. Here, the optimum route is a shortest (or fastest) route to the destination point or a route that best matches a condition specified by the user. Further, not only the destination point but also a route to a stop point or a rest point may be searched. The searched guidance route is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  Further, the route search program is a program for searching a route from a departure point to a destination point using a later-described table or in-area route data recorded on the magnetic disk 305 in long-distance route calculation. Specifically, based on the combination of the area to which the departure point belongs and the area to which the destination point belongs, a column of transit areas that pass between the area to which the departure point belongs and the area to which the destination point belongs is extracted from the table. This program searches for a route from a departure point to a destination point using in-area route data.

  The route guidance program includes guidance route information searched by executing the route search program, vehicle current location information calculated by executing the current location calculation program, and map data read from the magnetic disk 305. Based on this, real-time route guidance information is generated. The generated route guidance information is output to the audio I / F 308 and the video I / F 311 via the CPU 301.

  The update program is a program for updating the table or intra-area route data recorded on the magnetic disk 305 based on the update information of the table or intra-area route data acquired by the communication I / F 313.

  The extraction unit 130, the search unit 140, and the update unit 170 illustrated in FIG. 1 are realized by the CPU 301. That is, the functions of the extraction unit 130 and the search unit 140 are realized by the CPU 301 executing the route search program. Further, the function of the update unit 170 is realized by the CPU 301 executing the update program.

  The magnetic disk drive 304 controls the reading / writing of the data with respect to the magnetic disk 305 according to control of CPU301. The magnetic disk 305 records data written under the control of the magnetic disk drive 304. As the magnetic disk 305, for example, an HD (hard disk) or an FD (flexible disk) can be used. Map data and route calculation data are recorded on the magnetic disk 305.

  The route calculation data has a hierarchical structure, and has data for a long distance in the upper layer, and data for a short distance in the lower layer. This long-distance route calculation data includes a table in which a combination of a departure area and a destination area and a column of one or a plurality of transit areas that pass between the departure area and the destination area for each combination. Have. In this table, a row of transit areas is recorded for each search condition. Further, the long-distance route calculation data has intra-area route data that connects boundary nodes located at the boundary of the area in each area for each area.

  Further, the magnetic disk drive 304 may be detachable. In this case, the update information may be read by connecting the removable magnetic disk drive 304 to a PC (Personal Computer) (not shown) in which updated path calculation data is recorded.

  The optical disk drive 306 controls the reading / writing of the data with respect to the optical disk 307 according to control of CPU301. The optical disk 307 is a detachable recording medium from which data is read according to the control of the optical disk drive 306. As the optical disc 307, a writable recording medium can be used. In addition to the optical disk 307, the removable recording medium may be an MO, a memory card, or the like.

  The optical disk drive 306 reads the updated path calculation data (update information) recorded on the optical disk 307 when an optical disk 307 recorded with updated path calculation data is inserted. In the present embodiment, the update information is acquired by the communication I / F 313.

  The audio I / F 308 is connected to the speaker 309. Audio information is output from the speaker 309. Examples of the input device 310 include a remote controller having a plurality of keys for inputting characters, numerical values, and various instructions, a keyboard, a mouse, and a touch panel. The input device 310 may be realized by any one of a remote controller, a keyboard, a mouse, and a touch panel, or may be realized by a plurality of forms. The input device 310 receives input of a departure point and a destination point. The input unit 120 illustrated in FIG. 1 is realized by the input device 310.

  The video I / F 311 is connected to the display 312. Specifically, the video I / F 311 includes, for example, a graphic controller that controls the entire display 312, a buffer memory such as a VRAM (Video RAM) that temporarily records image information that can be displayed immediately, and a graphic controller. Based on the output image data, the display 312 is configured by a control IC or the like.

  The display 312 displays icons, cursors, menus, windows, or various data such as characters and images. As this display 312, for example, a CRT, a TFT liquid crystal display, a plasma display, or the like can be adopted. By executing the navigation program described above, information on the searched route is displayed from the display 312. The output unit 150 illustrated in FIG. 1 is realized by the display 312.

  The communication I / F 313 is connected to a communication network such as the Internet via wireless and functions as an interface between the communication network and the CPU 301. The communication I / F 313 has a function of receiving updated route calculation data (update information) from an external server (not shown).

  The GPS unit 314 receives radio waves from GPS satellites and outputs information indicating the current location of the vehicle. The output information of the GPS unit 314 is used when the CPU 301 calculates the current location of the vehicle. The information indicating the current location is information for specifying one point on the map data, such as latitude / longitude and altitude.

  The various sensors 315 output information that can determine the position and behavior of the vehicle, such as a vehicle speed sensor, an acceleration sensor, and an angular velocity sensor. The output values of the various sensors 315 are used for the calculation of the current location of the vehicle by the CPU 301 and the measurement of the change in speed and direction.

  The recording unit 110, the input unit 120, the extraction unit 130, the search unit 140, the output unit 150, the acquisition unit 160, and the update unit 170 provided in the route search apparatus 100 according to the present embodiment illustrated in FIG. Means that the CPU 301 uses a program or data recorded in a rewritable non-volatile memory such as the ROM 302 or flash ROM in the navigation device 300 shown in FIG. 3, the RAM 303, the magnetic disk 305, the optical disk 307, etc. And the function is realized by controlling each part in the navigation device 300.

  That is, the navigation device 300 according to the present embodiment is configured such that the CPU 301 executes a route search program recorded in a rewritable non-volatile memory such as a ROM 302 or a flash ROM as a recording medium in the navigation device 300, and thus, FIG. The functions of the route search device 100 shown can be executed by the route search processing procedure shown in FIG.

(Example of long-distance route)
Next, an example of a long-distance route will be described with reference to FIG. FIG. 4 is an explanatory diagram illustrating an example of a long-distance route. In FIG. 4, an area 400 indicates a section for each prefecture. The long-distance route 401 indicates a route when the Tokyo area 400a is a departure point and the Osaka area 400b is a destination point. The same applies to the reverse route with the Osaka area 400b as the departure point and the Tokyo area 400a as the destination point.

  The long distance route 401a is a route that reaches the Osaka area via the Kanagawa area, Shizuoka area, Aichi area, Gifu area, Shiga area, and Kyoto area. The long distance route 401b is a route that reaches the Osaka area via the Kanagawa area, the Yamanashi area, the Nagano area, the Aichi area, the Gifu area, the Shiga area, and the Kyoto area. Here, only two long-distance paths 401 are illustrated here, but there are actually many long-distance paths 401. How to hold the data of such a long distance path 401 will be described below.

(Example of long-distance path calculation data recorded on a magnetic disk)
Next, an example of long-distance path calculation data recorded on the magnetic disk 305 will be described with reference to FIGS. 5 and 6. FIG. 5 is an explanatory diagram showing an example of long-distance path calculation data recorded on the magnetic disk 305.

  In FIG. 5, the long-distance route calculation data includes a table 500. The table 500 includes a departure area 501, a destination area 502, a search condition 503, a route number 504, and a via area column 505. The departure area 501 is an area to which the departure point belongs. The destination area 502 is an area to which the destination point belongs.

  The search condition 503 indicates the condition at the time of search. Specifically, the time priority giving priority to the required time to the destination point, the distance priority giving priority to the shortest distance to the destination point, and detouring the expressway. There is general road priority. The via area column 505 lists the via areas set corresponding to the combination of the departure area and the destination area in the order of the area numbers that are text data. The numbers shown in this table 500 indicate the area numbers of the area 400 shown in FIG.

  That is, in the table 500, the number 1 shown in the departure area 501 indicates the Tokyo area, and the number 12 shown in the destination area 502 indicates the Osaka area. Further, in the route area column 505, the route indicated by reference numeral 510 indicates the long-distance route 401a shown in FIG. 4, that is, 2: Kanagawa area, 4: Shizuoka area, 5: Aichi area, 7: The route reaches the 12: Osaka area via the Gifu area, 9: Shiga area, 11: Kyoto area.

  Also, in the route area column 505, the route indicated by reference numeral 511 indicates the long-distance route 401b shown in FIG. 4, that is, 2: Kanagawa area, 3: Yamanashi area, 6: Nagano area, 5: The route reaches the 12: Osaka area via the Aichi area, 7: Gifu area, 9: Shiga area, 11: Kyoto area.

  When the departure area 501 and the destination area 502 are determined using such a table 500, it is possible to extract a via area column 505 corresponding to the search condition 503. In this example, the case where the area is divided into prefectural units is taken as an example. However, the present invention is not limited to this. For example, the subdivision of the prefectural unit, the local unit such as the Kanto region or the Kinki region. In regions with borders, it is also possible to use national units.

  FIG. 6 is an explanatory diagram showing an example of intra-area route data. In FIG. 6, in-area route data 600 indicates, for example, data for the Shiga area. A boundary node 601 indicates a node located at the boundary of the area. The link column 602 indicates a link connection from one boundary node 601a to the other boundary node 601b. Thus, there are multiple routes from the Gifu area to the Kyoto area via the Shiga area. For each link, an on / off flag is set for a link to be used according to a search condition, and a route search according to the search condition is possible.

  Here, each area is set as a prefecture unit, but the intra-area route data 600 can be narrowed down efficiently by further subdividing each area. In the following, supplementary description will be given of intra-area route data when each area is subdivided.

  FIG. 7 is an explanatory diagram showing an example of intra-area route data when the area is subdivided. In FIG. 7, each area is divided into prefectures, and each prefecture is divided into north and south. For example, the route from the Gifu Kita area to the Kyoto Kita area is the route indicated by the bold line in the figure. That is, when searching for a route, a route from Gifu Kita to Kyoto South and a route from Gifu South to Kyoto North or Kyoto South are excluded from the route search targets. Therefore, it is possible to efficiently narrow down the intra-area route data 600, and it is possible to perform a quick route search process.

(Example of route search processing performed by the navigation device)
Next, an example of route search processing performed by the navigation device 300 will be described with reference to FIG. FIG. 8 is a flowchart illustrating an example of route search processing performed by the navigation device 300.

  In FIG. 8, the CPU 301 of the navigation device 300 determines whether or not the user has accepted the input of the departure point and the destination point from the input device 310 (step S801). Normally, the departure point is the current point unless the user designates the departure point.

  In step S801, it is in a standby state until the input of the departure point and the destination point is accepted (step S801: No loop). When the input is accepted (step S801: Yes), the search condition is determined from the table 500 shown in FIG. The sequence of the via area corresponding to is extracted (step S802). For example, if the departure point is Tokyo Station and the destination point is Osaka Station, in step S802, a series of transit areas between the Tokyo area to which Tokyo Station belongs and the Osaka area to which Osaka Station belongs (for example, FIG. 5), a sequence of areas via the Tokai region indicated by reference numeral 510 of FIG.

  Thereafter, the next via area is specified from the area number of the link for which the route is calculated (step S803). Specifically, for example, the next via area (2: Kanagawa area) is specified from the area number of the departure point (1: Tokyo area). Then, the flag set for the link according to the search condition is referred to for each column of the via area (step S804). Specifically, a flag set for a link from the Tokyo area to the Kanagawa area is referred to.

  Then, the links are narrowed down (step S805). That is, an optimal link is selected from a plurality of links in the area. Thereafter, the link is connected, and it is determined whether or not the destination point has been reached (step S806). If it is determined that it is not connected to the destination point (step S806: No), it is determined whether or not the region boundary is exceeded (step S807). If it is determined that the region boundary has not been exceeded (step S807: NO), the process proceeds to step S804, and the links are narrowed down with reference to the flag set for the link.

  If it is determined that the region boundary has been exceeded (step S807: YES), the process proceeds to step S803, and the next via area is specified. In other words, when performing route calculation within the Kanagawa area across Tokyo, the Shizuoka area, which is the next transit area, is specified.

  On the other hand, if it is determined in step S806 that the destination point has been reached (step S806: Yes), information on the searched route is output from the display 312 or the like (step S808), and the series of processing ends.

  If a plurality of routes are to be output, it is only necessary to go to step S801 again and execute route search processing. In this case, it is only necessary to search for a route that avoids the route that has already been output. For example, in the route search between the Tokyo area and the Osaka area, the route that goes through the Tokai region is searched as the first route. In this case, a route that passes through the Koshinetsu region may be searched for as the next route. Specifically, the route may be searched by extracting a column of areas via the Koshinetsu region indicated by reference numeral 511 in FIG. If no search condition is input in advance, the route search may be performed by changing the search condition for the route to be searched next from the previously searched route.

  In the above-described processing, the route search from the departure point side to the destination point side has been described. However, even when the route search from the destination point side to the departure point side is performed, the route search can be performed by the same processing. it can. It is also possible to perform a route search from the destination point side to the departure point side simultaneously with a route search from the departure point side to the destination point side. As described above, when a route search is performed from both the departure point side and the destination point side, the route search ends when the routes from both sides are connected at a certain point. When a plurality of routes are output, route calculation is performed simultaneously from both the departure point side and the destination point side, and after the routes are connected, route calculation is performed again from both sides.

  According to the processing shown in FIG. 8, a sequence of transit areas that pass between the area to which the departure point belongs and the area to which the destination location belongs is extracted from the table 500, and the route data in the area of the transit area is used to depart. Since the route from the point to the destination point is searched, it is possible to reduce the data capacity of the long-distance route calculation data while enabling a quick route search process. In particular, conventionally, data corresponding to the number of combinations of the departure area / target area is required. However, in this embodiment, the intra-area route requires only the data amount of the number of combinations of areas adjacent to the area. The amount can be greatly reduced.

  Further, in the table 500, a combination of a plurality of transit areas is associated with one combination of a departure area and a destination area, and a sequence of one transit area is extracted from the table 500. It is possible to present an optimum route from a plurality of routes while reducing the data capacity of the route calculation data for distance.

  In addition, a table 500 for each search condition is recorded, a sequence of transit areas corresponding to the search condition received from the user is extracted from the table 500, and a route from the departure point to the destination point that satisfies the search condition is searched. Thus, it is possible to present an optimum route according to the search condition desired by the user while reducing the data capacity of the long-distance route calculation data.

(Example of data update processing performed by the navigation device)
Next, an example of a data update process performed by the navigation device 300 will be described with reference to FIG. FIG. 9 is a flowchart showing a data update process performed by the navigation device 300.

  In FIG. 9, the CPU 301 of the navigation device 300 determines whether or not route calculation data update information has been acquired (step S <b> 901). The determination as to whether or not update information has been acquired is specifically a determination as to whether or not the communication I / F 313 has received update information from an external server, for example.

  In step S901, it is in a standby state until update information is acquired (step S901: No loop). When update information is acquired (step S901: Yes), it is determined whether or not the update information of the table 500 is included in the update information. Judgment is made (step S902). When it is determined that the update information of the table 500 is included (step S902: Yes), the table 500 is updated (step S903). That is, the text data in the table 500 is rewritten. In this case, the table 500 may be updated for each combination of the departure area and the destination area.

  Thereafter, it is determined whether or not the update information includes the update information of the intra-area route data (step S904). If it is determined that the update information of the intra-area route data is included (step S904: Yes), the intra-area route data is updated for each area (step S905). That is, the intra-area route data is replaced on an area basis. Thereafter, the updated data is stored (step S906), and the series of processes is terminated.

  On the other hand, when it is determined in step S902 that the update information of the table 500 is not included (step S902: No), the update information is determined as the update information of the intra-area route data (step S907), and the update process in step S905 is performed. Do it. If it is determined in step S904 that the update information of the in-area route data is not included (step S904: No), the data is stored in step S906.

  According to the above-described processing, since the table 500 is updated based on the update information of the table 500, for example, just one main road straddling the Kanto to the North Kanto is added as in the past. In combination data 1000 (see FIG. 10), it is possible to prevent a problem that more than half of link data must be updated. Further, only text data in the table 500 can be rewritten, the amount of data to be updated can be reduced, and the cost required for the update can be suppressed.

  Moreover, since the intra-area route data 112 is updated for each area based on the update information of the intra-area route data 112, the amount of data to be updated can be reduced. Thus, since it can update in area unit, the cost which update requires can be held down.

  As described above, according to the route search device, route search method, route search program, and recording medium of the present invention, it is possible to reduce the data capacity of long-distance route calculation data while enabling a rapid route search process. Can do.

  The route search method described in the present embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. The program may be a transmission medium that can be distributed via a network such as the Internet.

Claims (8)

A table in which a combination of a departure area and a destination area and a sequence of transit areas that pass between the departure area and the destination area for each combination, and a boundary node located at the boundary of the area in each area and recording means for recording area route data including only links used sintered department path to each other,
An input means for receiving an input of a departure point and a destination point;
Extraction means for extracting, from the table, a sequence of transit areas from the area to which the departure point belongs to the area to which the departure point belongs based on a combination of the area to which the departure point belongs and the area to which the destination point belongs; ,
Search means for searching for a route from the departure point to the destination point using the in-area route data of the via area ;
A route search apparatus comprising: In the table, a plurality of via area columns are associated with one combination of a departure area and a destination area,
2. The route search apparatus according to claim 1, wherein the extraction unit extracts a sequence of one transit area based on an area to which the departure point belongs and an area to which the destination point belongs. The recording means records the table for each search condition,
The input means accepts input of search conditions together with the departure point and the destination point,
The extraction unit extracts a column of the transit area corresponding to the search condition received by the input unit from the table,
3. The route according to claim 1, wherein the search unit searches for a route from the departure point that satisfies the search condition to the destination point using intra-area route data of the transit area. 4. Search device. Obtaining means for obtaining update information of the table;
Updating means for updating the table recorded in the recording means based on the update information;
The route search device according to any one of claims 1 to 3, further comprising: Obtaining means for obtaining update information of the route data in the area;
Updating means for updating the intra-area route data recorded in the recording means for each area based on the update information;
The route search device according to any one of claims 1 to 4, further comprising: A table in which a combination of a departure area and a destination area and a sequence of transit areas that pass between the departure area and the destination area for each combination, and a boundary node located at the boundary of the area in each area a route search method for route searching apparatus including a recording unit for recording the area route data including only link used to each other in the binding department path,
An input process for receiving an input of a departure point and a destination point;
An extraction step of extracting from the table a sequence of transit areas that pass between the area to which the departure point belongs and the area to which the destination point belongs, based on a combination of the area to which the departure point belongs and the area to which the destination point belongs; ,
A search step for searching for a route from the departure point to the destination point using the route data in the area of the via area ;
A route search method comprising:   A route search program causing a computer to execute the route search method according to claim 6.   A computer-readable recording medium on which the route search program according to claim 7 is recorded.

Images