JP3753045B2 - Navigation system and route search method program - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a navigation system and a route search method program.
[0002]
[Prior art]
Conventionally, in a navigation device, for example, the current position of a vehicle, that is, the current position is detected by GPS (Global Positioning System), and the rotation angular velocity of the vehicle detected by a gyro sensor, that is, based on a turning angle, The direction of the vehicle, that is, the vehicle direction is detected, the map data is read from the data recording unit, a map screen is formed on the display of the display unit, and the map, the current location, and the vehicle direction are displayed on the map screen. It has become so. Therefore, the driver who is an operator can drive the vehicle according to the map displayed on the map screen, the current location, and the vehicle direction.
[0003]
In addition, the driver can set the destination and the starting point, and when the destination is set, the route from the current position to the destination is searched and the destination and the starting point are set. Then, a route from the departure point to the destination is searched. A searched route display screen is formed on the display, and the searched route, that is, the searched route is displayed on the searched route display screen. Therefore, the driver can drive the vehicle according to the searched route.
[0004]
Incidentally, in order to search for the route, a search data file is recorded in the data recording unit, and data, that is, search data is read out in order to determine a route from the search data file. The search data has a hierarchical structure composed of a plurality of layers from the lower layer to the upper layer, for example, layers 1 to 3. In Layer 1, high-speed and toll roads such as highways and toll roads, national roads, main local roads, In addition to general roads such as prefectural roads, all roads such as narrow streets and introductory roads are recorded. In Layer 2, among the roads in Layer 1, the highway / toll road, national roads, major local roads, etc. As described above, roads with a large width, roads with a large number of lanes, roads with a high speed limit, roads with good vehicle flow, and the like are recorded. And in Layer 3, like the high-speed / toll roads, national roads, etc., roads with higher width, roads with more lanes, roads with higher speed limit, and vehicle flow are better among the roads of Layer 2 Roads etc. are recorded. Each layer 1 to 3 is formed by a data file.
[0005]
By the way, in general, when a driver travels a long distance of about several hundreds [km], the driver often uses a highway, and when driving a medium distance of about several tens [km] Local roads and prefectural roads are often used. Accordingly, depending on the distance traveled, the configuration of each layer 1 to 3, for example, the number of layers, the roads constituting each layer 1 to 3, the search data area of each layer 1 to 3, and the like are determined. Yes.
[0006]
When searching for a route with a short distance, only the search data of layer 1 is used, and when searching for a route with a long distance, the search data of each layer 1 to 3 is used. This is because when searching for a route with a long distance, if only layer 1 is used, the amount of search data recorded in the data recording unit is extremely large, and the route search processing, that is, route search processing, is performed. This is because the memory capacity necessary for the execution cannot be secured, the route cannot be searched, or the processing speed of the route search process is lowered.
[0007]
Further, the search data of the lower layer is used as it is closer to the departure point and the destination, and the search data of the upper layer is used as it is farther from the departure point and the destination. In the vicinity of the departure point and the destination, the search data of layer 1 is used, and the search data of all roads are the search targets.
[0008]
[Problems to be solved by the invention]
However, in the conventional navigation device, since the search data of the upper layers 2 and 3 is used at the intermediate point between the departure point and the destination, prefectural roads, narrow streets, introduction roads, etc. existing only in layer 1 The road search data is not a search target.
[0009]
Therefore, the search cost (generally necessary for road length or passing through) is used to branch to the intermediate point from the searched route obtained by the route searching process and determine the route in the route searching process. Even if there is a short-cut road (hereinafter referred to as a “branch road”) with a low value (related to a long time), as long as the branch road is a prefectural road, a narrow street, an introduction road, etc., it will not be searched. As a result, the optimum route cannot be searched.
[0010]
FIG. 2 is a diagram for explaining the operation of a conventional route search process.
[0011]
In the figure, Ps is a departure place, Pe is a destination, and a layer 1 is formed around the departure place Ps and the destination Pe, and a layer 2 is formed as an upper layer of the layer 1. Rn1 and Rn2 are national roads, Rp1 is a prefectural road, and F1 is a searched route. The search data for the national roads Rn1 and Rn2 exist in layers 1 and 2, and the search data for the prefectural road Rp1 exist in layer 1.
[0012]
Since the layer 2 is used at the intermediate point between the departure point Ps and the destination Pe, the search data for the prefectural road Rp1 is not a search target. Therefore, although the prefectural road Rp1 is a branch road, it is not included in the searched route F1, and thus an optimum route cannot be searched.
[0013]
The present invention solves the problems of the conventional navigation device, can search for branch road search data as necessary, and can search for an optimum route and a route search. The object is to provide a method program.
[0014]
[Means for Solving the Problems]
Therefore, in the navigation system of the present invention, information acquisition processing means for acquiring navigation information, destination setting processing means for setting a destination, route search processing means for searching for a route from the departure point to the destination, A route re-search processing unit that divides the searched route and searches again for the divided route, and a re-search route determination processing unit that determines a re-search route based on a search result by the route re-search processing unit. Have.
The searched route is repeatedly divided by shifting the dividing points between the divided routes.
[0016]
In another navigation system of the present invention, the search data of the navigation information is recorded as a plurality of layers hierarchized according to the degree of detail from the lower road to the upper road. The route re-search processing means searches for a route again using search data of a plurality of layers.
[0017]
In still another navigation system of the present invention, the searched route is further divided based on a range of navigation information that can be searched with a predetermined memory capacity.
[0023]
In the program of the route search method of the present invention, the computer includes an information acquisition processing means for acquiring navigation information, a destination setting processing means for setting a destination, and a route search processing means for searching for a route from the departure place to the destination. A route re-search processing unit that divides the searched route and searches again for the divided route, and a re-search route determination processing unit that determines a re-search route based on a search result by the route re-search processing unit Let
The searched route is repeatedly divided by shifting the dividing points between the divided routes.
[0024]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
[0025]
FIG. 1 is a functional block diagram of the navigation system according to the first embodiment of the present invention.
[0026]
In the figure, 92 is information acquisition processing means for acquiring navigation information, 93 is destination setting processing means for setting a destination, 96 is route search processing means for searching for a route from the departure point to the destination, and 95 is search. Route re-search processing means for dividing the divided route and searching again for the divided route, 97 is a re-search route determination processing means for determining the re-search route based on the search result by the route re-search processing means 95. .
[0027]
FIG. 3 is a block diagram showing a main part of the navigation system according to the first embodiment of the present invention.
[0028]
In the figure, reference numeral 14 denotes a navigation device. The navigation device 14 includes a current location detection processing unit 15 that detects a current location, an information recording unit that records navigation information such as map data, road data, and search data, and a recording medium. The data recording unit 16 is arranged as a computer, functions as various processing means, and performs various arithmetic processing such as navigation processing based on the input information, an operation device, and a first input. An input unit 34 as a device, a display unit 35 as a display device and a first output device, an audio input unit 36 as a second input device, an audio output unit 37 as a second output device, and a third input And a communication unit 38 as a third output device, and a vehicle speed sensor 41 is connected to the navigation processing unit 17.
[0029]
The current location detection processing unit 15 includes a GPS 21 as a current location detection unit, a geomagnetic sensor 22, a distance sensor 23, a steering sensor 24, a beacon sensor 25, a gyro sensor 26 as an orientation detection unit, an altimeter (not shown), and the like.
[0030]
The GPS 21 detects the present location on the earth by receiving radio waves generated by artificial satellites, the geomagnetic sensor 22 detects the vehicle direction by measuring geomagnetism, and the distance sensor 23 A distance between predetermined positions on the road is detected. Examples of the distance sensor 23 include a sensor that measures the rotational speed of a wheel (not shown) and detects a distance based on the rotational speed, a sensor that measures acceleration, integrates the acceleration twice, and detects a distance. Can be used.
[0031]
The steering sensor 24 detects a rudder angle, and the steering sensor 24 is attached to, for example, an optical rotation sensor, a rotation resistance sensor, or a wheel attached to a rotating portion of a steering wheel (not shown). An angle sensor or the like is used.
[0032]
The beacon sensor 25 receives position information from radio wave beacons, optical beacons and the like arranged along the road to detect the current location. The gyro sensor 26 detects a turning angle. As the gyro sensor 26, for example, a gas rate gyro, a vibration gyro, or the like is used. Then, by integrating the turning angle detected by the gyro sensor 26, the vehicle direction can be detected.
[0033]
The GPS 21 and the beacon sensor 25 can detect the current location independently. The current position can also be detected by combining the distance detected by the distance sensor 23 with the vehicle direction detected by the geomagnetic sensor 22 or the turning angle detected by the gyro sensor 26. Further, the current location can be detected by combining the distance detected by the distance sensor 23 and the steering angle detected by the steering sensor 24.
[0034]
The data recording unit 16 includes a database including data files such as a map data file, an intersection data file, a node data file, a road data file, a photo data file, a search data file, and a point information data file. Is map data for displaying a map on a map screen formed on a display (not shown) of the display unit 35, the intersection data file includes intersection data relating to each intersection, and the node data file includes node data relating to node points. However, the road data file contains road data related to roads, the search data file contains search data for searching for routes, and the point information data file contains hotels, gas stations, parking lots, and sightseeing spot information for each region. Point about facilities such as Broadcast data is recorded as navigation information. The intersection data, node data, road data, and search data constitute road condition data representing a road condition. The node data includes data indicating actual road branch points (including intersections, T-junctions, etc.), node points, and inter-node point links that connect the node points.
[0035]
And, according to the road data, about the road itself, width, slope (gradient), cant, bank, road surface condition, number of road lanes, places where the number of lanes decreases, places where the width becomes smaller, etc. Radius of curvature, intersections, T-shaped roads, corner entrances, etc., road attributes, downhill roads, uphill roads, etc., road types, expressways, urban expressways, toll roads, and other national highways General roads such as prefectural roads are shown. Further, the road data represents a railroad crossing, a highway entrance and exit road (rampway), a highway / toll road tollgate, and the like.
[0036]
In each data file, a guide map is output along the searched route on the searched route display screen set on the display of the display unit 35 and displayed, or characteristic photographs and frames at intersections or routes are displayed. Various data for displaying a figure or the like, displaying a distance to the next intersection, a traveling direction at the next intersection, or other guidance information is recorded. The data recording unit 16 also records various data for outputting predetermined information by the audio output unit 37.
[0037]
The navigation processing unit 17 includes a CPU 31 as an arithmetic device that controls the entire navigation device 14, a RAM 32 used as a working memory when the CPU 31 performs various arithmetic processes, and a control program. It comprises a ROM 33 as a recording medium on which various programs for searching for a route to the destination, route guidance, determination of a specific section, etc. are recorded, and the navigation processing unit 17 includes the input unit 34 and a display unit. 35, an audio input unit 36, an audio output unit 37, and a communication unit 38 are connected. The CPU 31 includes an MPU.
[0038]
The data recording unit 16 and the ROM 33 are configured by a magnetic core, a semiconductor memory, etc. (not shown). Further, as the data recording unit 16 and the ROM 33, various recording media such as a magnetic tape, a magnetic disk, a flexible disk, a magnetic drum, a CD, an MD, a DVD, an optical disk, an MO, an IC card, and an optical card can be used. .
[0039]
In the present embodiment, various programs are recorded in the ROM 33 and various data are recorded in the data recording unit 16, but the programs, data, and the like are recorded on the same external recording medium. You can also. In this case, for example, a flash memory (not shown) may be provided in the navigation processing unit 17, and the program, data, and the like may be read from the external recording medium and written to the flash memory. Therefore, the program, data, etc. can be updated by exchanging an external recording medium. In addition, a program for controlling an automatic transmission control device (not shown) can be recorded on the external recording medium. As described above, it is possible to start programs recorded in various recording media and perform various processes based on the data.
[0040]
Further, the communication unit 38, for example, from traffic information consisting of information such as traffic jam information, regulation information, and parking lot information, traffic accident information, and base stations such as D-GPS information for detecting GPS 21 detection errors. Various types of transmitted data are received, or position information is received via radio wave beacons, optical beacons, etc. from radio wave beacon devices, optical beacon devices and the like disposed along the road.
[0041]
The input unit 34 is used to correct the current location at the start of traveling or to input a starting point and a destination. Various keys displayed as images on the screen set in the display It consists of operation switches such as an operation menu. Therefore, an input can be performed by touching the operation switch. As the input unit 34, a keyboard, a mouse, a barcode reader, a light pen, a remote control device for remote operation, etc. arranged separately from the display unit 35 can be used.
[0042]
Various screens formed on the display display operation guidance, operation menus, operation key guidance, a route from the current location to the destination, guidance information along the route, and the like. As the display unit 35, a display such as a CRT display, a liquid crystal display, or a plasma display can be used, or a hologram device that projects a hologram on a windshield of a vehicle can be used.
[0043]
The voice input unit 36 includes a microphone (not shown) and the like, and can input necessary information by voice. Further, the voice output unit 37 includes a voice synthesizer and a speaker (not shown), and outputs sound information, for example, guidance information composed of voice synthesized by the voice synthesizer, shift information, and the like from the speaker. In addition to the voice synthesized by the voice synthesizer, various sounds, various guidance information recorded in advance on a tape, a memory, and the like can be output from the speaker.
[0044]
Next, the operation of the navigation device 14 configured as described above will be described.
[0045]
FIG. 4 is a flowchart showing the operation of the navigation device according to the first embodiment of the present invention, FIG. 5 is a diagram showing a hierarchical structure of search data according to the first embodiment of the present invention, and FIG. FIG. 7 is a diagram illustrating a layer configuration in the first embodiment, FIG. 7 is a first diagram illustrating an operation of dividing a route in the first embodiment of the present invention, and FIG. 8 is a first embodiment of the present invention. FIG. 9 is a third diagram for explaining the operation of dividing the path in the first embodiment of the present invention, and FIG. 10 is the first implementation of the present invention. It is a figure which shows the subroutine of the information registration process in the form of.
[0046]
First, when the input unit 34 (FIG. 3) is operated by a driver who is an operator and the navigation device 14 is activated, a navigation initialization processing unit (not shown) of the CPU 31 performs a navigation initialization process. Subsequently, the CPU 31 reads the current location detected by the GPS 21 and the vehicle direction detected by the gyro sensor 26, and the information acquisition processing unit 92 (FIG. 1) of the CPU 31 performs the information acquisition processing, and the data recording unit A map data file, road data file, search data file, etc. are referenced from 16 to read navigation information such as map data, road data, search data, etc., and acquire information. In the present embodiment, the information acquisition processing unit 92 reads and acquires navigation information from the data recording unit 16, but can also receive and acquire the navigation information by the communication unit 38. .
[0047]
Next, a map display processing means (not shown) of the CPU 31 performs a map display process, forms a map screen on the display, displays a map around the current location on the map screen according to the map data, and also displays the current location. And the direction of the vehicle is displayed.
[0048]
When the navigation device 14 is used as a route search device, when the driver operates the input unit 34 to input a departure place and a destination, the destination setting processing means 93 of the CPU 31 performs a destination setting process. And set the destination. The route search processing unit 96 of the CPU 31 performs route search processing. Then, the route search processing means 96 reads the search data and searches for a route from the departure place to the destination based on the search data.
[0049]
Subsequently, search route display processing means (not shown) of the route search processing means 96 performs search route display processing, forms a search route display screen on the display, and displays the search route on the search route display screen. Therefore, the driver can drive the vehicle according to the searched route. In the present embodiment, the departure point is set by operating the input unit 34. However, the departure point may be set using the current location detected by the current location detection processing unit 15. it can.
[0050]
By the way, as shown in FIG. 5, the search data has a hierarchical structure composed of a plurality of layers, for example, layers 1 to 3 from the lower layer to the upper layer, and has a layer structure as shown in FIG. That is, the layers 1 to 3 are hierarchized according to the degree of detail from the lower road to the upper road. In FIG. 5, the arrow indicates the search direction of the route search process. In the present embodiment, a route is searched from the departure point Ps to the destination Pe along the search direction, but from the departure point Ps to the destination Pe and from the destination Pe. It is also possible to search for a route toward the departure place Ps.
[0051]
In Layer 1, all roads such as highways and toll roads such as expressways, toll roads, national roads, major local roads, prefectural roads, narrow streets, introduction roads, etc. are recorded. Of the layer 1 roads, roads with a large width, roads with a large number of lanes, roads with a high speed limit, roads with a good flow of vehicles, such as the high-speed / toll roads, national roads, main local roads, etc. Is recorded. And in Layer 3, like the high-speed / toll roads, national roads, etc., roads with higher width, roads with more lanes, roads with higher speed limit, and vehicle flow are better among the roads of Layer 2 Roads etc. are recorded. Each layer 1 to 3 is formed by a data file.
[0052]
By the way, in general, when a driver travels a long distance of about several hundreds [km], the driver often uses a highway, and when driving a medium distance of about several tens [km] Local roads and prefectural roads are often used. Therefore, the structure of each layer 1-3, for example, the number of hierarchies, the road which comprises each layer 1-3, the range of each layer 1-3, etc. are determined by the distance traveled.
[0053]
When searching for a route with a short distance from the departure point Ps to the destination Pe, only the search data of the layer 1 is used, and when searching for a route with a long distance from the departure point Ps to the destination Pe, 1 to 3 search data are used. This is because when searching for a long distance route, if only the search data of layer 1 is used, a sufficient memory capacity for performing the route search processing cannot be secured, and the route search processing is performed. This is because it becomes impossible to do so, and the processing speed of the route search processing is lowered.
[0054]
Further, the lower layer search data is used as it is closer to the departure point Ps and the destination Pe, and the higher layer search data is used as it is farther from the departure point Ps and the destination Pe. In the vicinity of the departure point Ps and the destination Pe, the search data of layer 1 is used, and the search data of all roads are the search targets. Therefore, in the route search process, it is possible to search for a route according to a predetermined search method using search data of an appropriate layer.
[0055]
However, since the upper layers 2 and 3 are used at the intermediate point between the departure point Ps and the destination Pe, search data for roads such as prefectural roads, narrow streets, and introduction roads that exist only in the layer 1 is the target of the search. In this case, even if a branch road exists at the intermediate point, the branch road is not included in the searched route as long as it is a road such as a prefectural road, a narrow street, or an introduction road. Therefore, it becomes impossible to search for the optimum route.
[0056]
Therefore, in the present embodiment, at a predetermined timing after the route search processing is performed, the route re-search processing means 95 of the CPU 31 starts from the departure point Ps obtained by the route search processing to the destination Pe. The search route is divided into a plurality of divided routes ARi (i = 1, 2,...), And between two points (sections) in the divided route ARi, in the present embodiment, between the start point and the end point of the divided route ARi. The route is searched again according to the search data, and the optimum route can be determined based on the search result. Note that the search data for re-searching between two points on the divided route ARi may be only the search data of layer 1, but as in the case of searching for the route from the departure point Ps to the destination Pe, the divided route Search data for a predetermined layer may be used based on the distance between the start point and the end point of ARi.
[0057]
In FIG. 7, F1 is a search route from the starting point Ps to the destination Pe obtained by the route search process, and the search route F1 includes only the national road Rn and does not include the prefectural road Rp that is a shortcut to the national road Rn. . In the figure, x indicates a dividing point.
[0058]
A route division processing unit (not shown) of the route re-search processing unit 95 performs a route division process, and divides the search route F1 to form divided routes AR1 to AR4.
[0059]
In this case, in order to ensure that the branch road is included in the searched route F1 in the route re-search process, it is desirable to widen the divided routes AR1 to AR4. Therefore, when dividing the search path F1, the divided paths AR1 to AR4 are formed in the RAM 32 as large as possible within the range allowed by resources such as the memory capacity necessary for performing the route re-search process in the background. .
[0060]
For this purpose, the route division processing means includes a departure point Ps in the RAM 32, for example, if it is possible to allocate a memory capacity of 2 [Mbyte] for performing route re-search processing in the background. A range of search data that can be searched with a memory capacity of [Mbyte] is formed as a divided route AR1, and the end point of the road closest to the destination Pe among the roads in the divided route AR1, that is, the final point is a dividing point. And Next, similarly, a range of search data that includes the division point and can be searched with a memory capacity of 2 [Mbyte] is formed as the division path AR2, and the final point of the division path AR2 is set as the division point. Then, by repeating this operation, the divided paths AR3 and AR4 can be formed.
[0061]
Subsequently, a divided search processing unit (not shown) of the route re-search processing unit 95 performs a divided search process, and searches for the divided route AR1 to AR4 again according to the layer 1 search data.
[0062]
By the way, as shown in FIG. 7, when the search route F1 is divided into the divided routes AR1 to AR4, the prefectural road Rp reaches a plurality of divided routes, in this embodiment, the divided routes AR1 to AR4. Even if the route is searched again for each of the divided routes AR1 to AR4, the prefectural road Rp is not a search target.
[0063]
Therefore, the route division processing means divides the search route F1 from the departure point Ps to the destination Pe according to the search data of layer 1 as shown in FIG. In the embodiment, one divided route AR11 longer than each of the divided routes AR1 to AR4 is formed. Subsequently, the division search processing means searches for a route again according to the search data of layer 1 for the divided route AR11. In this way, the prefectural road Rp, which is a branch road, can be searched as a re-search route, and a new search route F2 can be obtained.
[0064]
In this case, since the divided route AR11 is longer than the divided routes AR1 to AR4, the prefectural road Rp falls within the divided route AR11 and does not reach a plurality of divided routes. Therefore, since the prefectural road Rp is included in the searched route F2, the optimum route can be searched.
[0065]
Subsequently, the re-search route determination processing unit 97 of the CPU 31 performs re-search route determination processing, and determines the prefectural road Rp as the re-search route based on the search result by the route re-search processing unit 95. For this purpose, the route comparison processing means (not shown) of the re-search route determination processing means 97 performs route comparison processing, and calculates the prefectural road Rp and the route corresponding to the prefectural road Rp on the search route F1 obtained by the route search processing. Comparison is made according to the search cost or the like, and it is determined whether or not the prefectural road Rp has a lower search cost than the route corresponding to the prefectural road Rp, that is, whether or not it is better than the route corresponding to the prefectural road Rp.
[0066]
The route comparison processing means corresponds to the re-search route between two points obtained by the divided search processing means, for example, the prefectural road Rp and the route between the two points on the search route F1, for example, the prefectural road Rp. It is determined whether or not the route is the same. If not, it can be determined that the re-search route is good. Further, the re-search route determination processing means 97 can automatically replace a route between two points on the search route F1 with the re-search route. As described above, the re-search route determination processing unit 97 determines a re-search route based on the comparison result by the route comparison processing unit.
[0067]
Then, the information registration processing means (not shown) of the CPU 31 performs information registration processing when the prefectural road Rp is good, and registers the prefectural road Rp.
[0068]
For this purpose, the information registration processing means determines whether or not the prefectural road Rp has already been registered. If the prefectural road Rp has already been registered, the frequency that the prefectural road Rp is included in the search route F2 in the divided search process, the prefectural road Rp When the prefectural road Rp is not registered, the road data of the prefectural road Rp is recorded in the data recording unit 16 as the search data of the layer 2.
[0069]
In this way, since the re-search route is searched and the search data of the branch road having a lower search cost than the predetermined route on the search route F1 can be calculated, the search data can be the target of the route search process. it can. Therefore, an optimum route can be searched.
[0070]
In this case, a predetermined memory area of the search data file is used to register the prefectural road Rp, and road data of the prefectural road Rp is recorded as branch road search data. The road data of the road before the prefectural road Rp on the national road Rn is recorded as the search data of the road before leaving, and the road data of the road after the prefectural road Rp merges is recorded as the search data of the road after returning.
[0071]
In this embodiment, each road data of the prefectural road Rp, the road before leaving, and the road after return is recorded. However, only road data of the prefectural road Rp is recorded, or a divided route including the prefectural road Rp. It is also possible to record only road data.
[0072]
In this way, in the information registration process, the road data of the prefectural road Rp, the road before leaving, and the road after return are recorded as search data in the search data file. When the destination Pe is set, the route search processing means 96 determines a route with reference to a search data file in which the search data for the prefectural road Rp, the road before leaving, and the road after returning is included in layer 2.
[0073]
That is, the route search processing means 96 determines whether the predetermined road on the search route F1 matches the road before leaving or the road after return based on the road number attached to the search data, When the predetermined road matches the road before leaving or the road after return, the route corresponding to the prefectural road Rp on the national road Rn in the search route F1 is replaced with the prefectural road Rp to form the search route F2.
[0074]
In this way, at the intermediate point between the departure point Ps and the destination Pe, the road data of the branch road existing only in the lowest layer 1 is recorded as the search data in the other layer, and the search data is subsequently searched for the route search. Since it can be made into the search object in a process, a branch road can be included in a search route. Therefore, an optimum route can be searched.
[0075]
Further, after the branch road is registered, it is not necessary to perform the route re-search process for the divided route corresponding to the registered branch road, so that the processing time of the route re-search process can be shortened.
[0076]
By the way, in the route re-search process, since it is necessary to repeat the division search process for each of the layers 1 to 3 and for each divided route ARi, the route re-search process is started immediately after the route search process is completed. It takes tens of seconds or minutes to complete the route re-search process. Therefore, the optimum route cannot be searched in real time.
[0077]
Therefore, in the present embodiment, while the driver is driving the vehicle according to the searched route F1 obtained by the route search processing, the route re-search processing is performed in the background using the free time of the CPU 31. I am doing so. Therefore, after that, when the driver sets a new destination Pe on another occasion, the route is searched based on the search data after the information registration processing is performed. In addition, after the route re-search process is performed in the background, the route can be searched based on the search data after the information registration processing is performed, and the vehicle can be driven according to the searched route F2.
[0078]
By the way, the route re-search processing means 95 performs route division processing and division search processing for all layers from the lowest layer 1 to the highest layer 3.
[0079]
Therefore, for example, when the route division process and the division search process are performed for the uppermost layer 3, as shown in FIG. 9, the national road Rn is bypassed as compared with the case where the national road Rn is used from the departure point Ps to the destination Pe. When it is preferable to use the highway Rh, the divided route F3 including the highway Rh can be searched for as an optimum route.
[0080]
In the present embodiment, the search route F1 searched in the route search process is divided to form the divided route ARi, but the range of the lowest layer 1 is divided without dividing the search route F1. The route re-search process can be performed every time the range of layer 1 is exceeded.
[0081]
Further, after the destination Pe is set and the route search process is performed, when the search route F1 includes the road before leaving and the road after return, the route corresponding to the prefectural road Rp on the national road Rn in the search route F1 is selected. The route can be replaced with the prefectural road Rp, and the route can be divided for the remaining portion on the national road Rn to perform route re-search processing.
[0082]
Next, the flowchart of FIG. 4 will be described.
Step S1: The starting point Ps and the destination Pe are input.
Step S2: Route search processing is performed.
Step S3: A loop based on the number of layers is started.
Step S4: The search route is divided.
Step S5: A loop based on the number of divided paths is started.
Step S6: A division search process is performed.
Step S7: It is determined whether the prefectural road Rp is good. If the prefectural road Rp is good, the process proceeds to step S8, and if not, the process proceeds to step S9.
Step S8 Information registration processing is performed.
Step S9: The loop based on the number of divided paths is terminated.
Step S10: The loop based on the number of layers is terminated, and the process is terminated.
[0083]
Next, the flowchart of FIG. 10 will be described.
Step S8-1: It is determined whether the prefectural road Rp has already been registered. If the prefectural road Rp has already been registered, the process proceeds to step S8-3. If not registered, the process proceeds to step S8-2.
Step S8-2 The prefectural road Rp is registered.
Step S8-3: Update data such as frequency and improvement effect, and return.
[0084]
Next, a second embodiment of the present invention in which the search route F1 is divided by another method will be described.
[0085]
FIG. 11 is a flowchart showing the operation of the route division processing means in the second exemplary embodiment of the present invention.
[0086]
In this case, the route division processing unit first sets the starting point Ps (FIG. 7) as the starting point and the destination Pe as the ending point, and has a memory capacity necessary for performing a search according to the search data from the starting point to the ending point. It is determined whether or not the threshold value is larger than 2 [Mbyte]. When the memory capacity is larger than 2 [Mbyte], the path division processing unit divides the path from the start point to the end point into two, the intermediate point between the start point and the end point is the end point, and the memory capacity is 2 [Mbyte] or less. If so, the route division processing means sets the end point as a division point. Subsequently, the route division processing unit determines whether or not the end point and the destination Pe match. If the end point and the destination Pe do not match, the route end processing unit sets the end point as the start point and the destination Pe as the end point. Whether the memory capacity is larger than 2 [Mbyte] is determined again.
[0087]
By repeating such an operation, the divided route ARi can be formed in the searched route F1.
[0088]
Next, a flowchart will be described.
Step S11 The starting point Ps is set as the starting point, and the destination Pe is set as the ending point.
Step S12: It is determined whether the memory capacity is larger than a threshold value. If the memory capacity is larger than the threshold, the process proceeds to step S13. If the memory capacity is equal to or smaller than the threshold, the process proceeds to step S14.
Step S13: An intermediate point between the start point and the end point is set as the end point, and the process returns to Step S12.
Step S14: The end point is set as a dividing point.
Step S15: It is determined whether the end point matches the destination Pe. If the end point matches the destination Pe, the process ends. If not, the process proceeds to step S16.
Step S16: Set the end point as the start point and the destination Pe as the end point, and return to step S12.
[0089]
By the way, in the first embodiment, the divided route ARi is widened within the range allowed by the memory capacity. However, even if the divided route ARi is widened, the branch road is included in one divided route. If it does not fit and extends over two or more divided routes, the branch road cannot be included in the searched route F2.
[0090]
Therefore, the third embodiment of the present invention is such that the branch road can be included in the searched route F2 even when the branch road does not fit in one divided route and extends to two or more divided routes. Will be described.
[0091]
FIG. 12 is a flowchart showing the operation of the route division processing means in the third embodiment of the present invention. FIG. 13 is a first diagram for explaining the operation of dividing the route in the third embodiment of the present invention. 14 is a second diagram for explaining the operation of dividing the path in the third embodiment of the present invention.
[0092]
In this case, the route division processing means (FIG. 1) first divides the search route F3 according to the route division method described in the first and second embodiments, as shown in FIG. AR21 and AR22 are formed. Subsequently, the path division processing unit acquires the already formed divided paths AR21 and AR22, and calculates and sets an intermediate point between the acquired divided paths AR21 and AR22. Next, the route division processing means sets the starting point Ps as the starting point, reads each intermediate point in order from the starting point Ps, sets each intermediate point as the end point, and searches according to the search data from the starting point to the end point. It is determined whether or not the memory capacity necessary for performing the above is larger than 2 [Mbyte] which is a threshold value. When the memory capacity is larger than 2 [Mbyte], the route division processing unit sets a route from the start point to the intermediate point immediately before the end point as a new division route.
[0093]
For example, when searching for a route according to the search data of layer 2, as shown in FIG. 13, when a route is searched according to the search data of the divided routes AR21 and AR22 formed in the first route division processing, Since the prefectural road Rp that is a shortcut extends to the two divided routes AR21 and AR22, it is not included in the searched route F3.
[0094]
On the other hand, as shown in FIG. 14, when the route is searched according to the search data of the divided routes AR31 to AR33 formed in the second route dividing process, the prefectural road Rp is accommodated in one divided route AR32, It does not reach multiple division paths. Therefore, the prefectural road Rp is included in the searched route F4.
[0095]
As described above, in the second route division processing, the division point is shifted to form the division route ARi again, and the route is searched according to the search data of the division route ARi, thereby improving the quality of the division route around the division point. Can be made. Therefore, by performing the divided search process, the branch road can be surely included in the searched route.
[0096]
The intermediate point does not have to be positioned at the center of the divided paths AR21 and AR22 formed in the first path dividing process, and can be positioned at an arbitrary point on the divided paths AR21 and AR22. Further, by performing the third path division process, it is possible to set an intermediate point so as to avoid each division point set in the first and second path division processes, and further form a divided path. Therefore, by performing the divided search process, the branch road can be more reliably included in the searched route. Similarly, the route dividing process can be repeated four or more times to form further divided routes. Note that Pe is a destination.
[0097]
In the present embodiment, the entire search route F1 is divided to form a plurality of divided routes ARi. However, at least two division points are set as the vehicle travels, and the distance between the division points is set. Can also be used as a split path. For example, two division points can be set in the traveling direction of the vehicle every time the vehicle travels a predetermined distance or every predetermined time.
[0098]
Moreover, a dividing point can be set every time the road attribute changes on the dividing route F1. Further, when the toll road priority search condition is set, the divided route ARi is formed only for the portion of the general road other than the high speed / toll road without forming the divided route ARi for the portion of the high speed / toll road. You can also
[0099]
Next, a flowchart will be described.
Step S21: The already formed divided paths AR21 and AR22 are acquired.
Step S22: An intermediate point between the divided paths AR21 and AR22 is calculated.
Step S23: The starting point Ps is set as the starting point.
Step S24: A loop based on the number of intermediate points is started.
Step S25: The intermediate points are read in order from the starting point Ps.
Step S26: The intermediate point is set as the end point.
Step S27: It is determined whether the memory capacity is larger than a threshold value. If the memory capacity is larger than the threshold, the process proceeds to step S28, and if the memory capacity is equal to or smaller than the threshold, the process proceeds to step S30.
Step S28: The route up to the previous intermediate point is set as a new divided route.
Step S29: The previous intermediate point is set as the start point.
Step S30: The loop based on the number of intermediate points is terminated, and the process is terminated.
[0100]
Next, the data structure of the search data file will be described. In the search data file, each divided route # 0 to #n represents a registered branch road.
[0101]
FIG. 15 is a diagram showing an example of a search data file according to the fourth embodiment of the present invention.
[0102]
As shown in the figure, the search data file contains data such as data version # 0 indicating version information of the search data file, the number of divided routes indicating the number of registered branch roads, and divided routes # 0 to #n. Recorded, as the data of each divided route # 0 to #n, the layer to which each divided route # 0 to #n belongs, the road number before leaving indicating the road number of the road before leaving recorded corresponding to each branch road, The post-return road number indicating the road number of the post-return road recorded corresponding to each branch road, the search cost of each divided route # 0 to #n, the search condition, the number of roads of each divided route # 0 to #n, Data such as roads # 0 to #n, the number of upper layer roads representing the number of roads in the upper layer, and upper layer roads # 0 to #n representing roads belonging to the upper layer are recorded.
[0103]
In addition, as data of each road # 0 to #n, data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.) are recorded, and as data of upper layer roads # 0 to #n, Data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.), position information of lower roads with respect to higher roads are recorded.
[0104]
By the way, when recording search data in the information registration process, it is necessary to match the data format of the search data with the data format of the search data of the search data file already recorded in the data recording unit 16 (FIG. 3). Therefore, as described above, data of data version # 0 for recognizing the data format is recorded in the search data file. In addition, search data of data version # 0 or lower can be recorded in the search data file of data version # 0.
[0105]
In general, since the search route is composed of a row of roads (hereinafter referred to as “road row”), each road is identified in order to identify the correspondence between the row of roads # 0 to #n and the search data in the search data file. Road number data is recorded as data of # 0 to #n.
[0106]
Then, since the data of the road number before leaving and the road number after return are recorded as the data of each divided route # 0 to #n, the route search processing means 96 is provided with the road sequence of the searched route obtained in the route search processing. The road number assigned to each road is compared with the road number before leaving and the road number after returning, and if the road number matches the road number before leaving and the road number after returning, forcibly leaving An optimum route can be searched by replacing the route corresponding to the branch road between the previous road and the post-return road with the road train of the branch road.
[0107]
Further, in order to determine whether or not a branch road is better than a route corresponding to the branch road, it is preferable not to simply compare search costs but also to determine whether or not search conditions match. Therefore, search cost and search condition data are recorded as data of the respective divided paths # 0 to #n.
[0108]
Then, as the route corresponding to the branched road is replaced with the branched road, the searched route displayed on the searched route display screen changes. At this time, if the search route display processing means reads road shape data from the map data and displays the search route, the processing time becomes long. Therefore, road shape data is recorded as the data of the roads # 0 to #n. Therefore, the search route display processing means can display the search route in a short time based on the road shape data.
[0109]
Further, when the branch road is searched according to the search data of the lower layer, the break between the road of the upper layer and the road of the lower layer may be different. In that case, if the route corresponding to the branch road is replaced with the branch road only by the road number, the information on the distance from the departure point Ps to the destination Pe cannot be matched. Therefore, data of upper layer roads # 0 to #n representing roads belonging to an upper layer corresponding to each branch road are recorded as data of the respective divided routes # 0 to #n. Therefore, the responsiveness of the route search process can be increased.
[0110]
Incidentally, as shown in the figure, when the registered search data for each branch road is recorded in parallel in units of divided routes # 0 to #n, the search data for all the branch roads is accessed in the route search process. Necessity arises and the responsiveness of the route search processing is lowered.
[0111]
Therefore, one data element among the data elements of each layer # 0 to #n, each road attribute # 0 to #n, and each mesh # 0 to #n is hierarchized, and search data is recorded for each data element. Thus, a search data file that can increase the responsiveness of the route search processing will be described.
[0112]
FIG. 16 shows a first modification of the search data file in the fourth embodiment of the present invention, and FIG. 17 shows a second modification of the search data file in the fourth embodiment of the present invention. FIG. 18 and FIG. 18 are views showing a third modification of the search data file in the fourth embodiment of the present invention.
[0113]
In FIG. 16, data such as data version # 0, the number of divided paths, and divided paths # 0 to #n are recorded in the search data file, and each divided path # 0 is used as data of each divided path # 0 to #n. Data of the number of layers of #n and layers # 0 to #n to which the divided paths # 0 to #n belong are recorded. The data of each layer # 0 to #n includes a layer, a road number before leaving, a road number after return, a search cost, a search condition, the number of roads of each divided route # 0 to #n, and roads # 0 to #n. The number of upper layer roads, upper layer roads # 0 to #n, and the like are recorded.
[0114]
And as data of each road # 0- # n, data, such as a road number, a road shape, and a road attribute (attributes, such as classification, distance, and width), are recorded, and as data of upper layer roads # 0- # n, Data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.), position information of lower roads with respect to higher roads are recorded.
[0115]
In this case, the layers # 0 to #n are hierarchized as data elements. Since only a necessary layer can be searched for a route according to the search data, the responsiveness of the route search process can be increased. For example, when a route is searched according to the search data of layer 1 in the first route search process, it is not necessary to search for a route according to the search data of layer 2 or 3. This is because the search data of the lower layer has more types of roads than the search data of the upper layer, and basically a good route is searched.
[0116]
In FIG. 17, data such as data version # 0, the number of divided paths, and divided paths # 0 to #n are recorded in the search data file, and each divided path is used as data of each divided path # 0 to #n. Data such as the number of road attributes # 0 to #n and road attributes # 0 to #n are recorded. The data of each road attribute # 0 to #n includes a layer, a road number before leaving, a road number after return, a search cost, a search condition, the number of roads of each divided route # 0 to #n, and roads # 0 to ##. Data such as n, the number of upper layer roads, and upper layer roads # 0 to #n are recorded.
[0117]
And as data of each road # 0- # n, data, such as a road number, a road shape, and a road attribute (attributes, such as classification, distance, and width), are recorded, and as data of upper layer roads # 0- # n, Data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.), position information of lower roads with respect to higher roads are recorded.
[0118]
In this case, each road attribute # 0 to #n is hierarchized as a data element. Since the route can be searched according to the road attributes of the road before leaving and the road after returning, the responsiveness of the route search process can be increased. For example, when the road attribute is a road type, the search data is classified into a hierarchical structure such as a highway / toll road, a national road, a main local road, a prefectural road, a narrow street, an introduction road, etc., depending on the road type of the road before leaving and the road after returning. To be recorded. Therefore, for example, when the search route obtained in the initial route search process is a high-speed / toll road, only search data for roads at a level higher than that of the high-speed / toll road can be searched. In addition, when the search route obtained in the first route search process is a low-level road, only search data for roads with a lower rank can be used as a search target.
[0119]
In FIG. 18, data such as data version # 0, the number of divided paths, and divided paths # 0 to #n are recorded in the search data file, and each divided path is used as data of each divided path # 0 to #n. Data such as the number of meshes # 0 to #n, meshes # 0 to #n, and the like are recorded. The data of each mesh # 0 to #n includes a layer, a road number before leaving, a road number after return, a search cost, a search condition, the number of roads of each divided route # 0 to #n, and roads # 0 to #n. The number of upper layer roads, upper layer roads # 0 to #n, and the like are recorded.
[0120]
And as data of each road # 0- # n, data, such as a road number, a road shape, and a road attribute (attributes, such as classification, distance, and width), are recorded, and as data of upper layer roads # 0- # n, Data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.), position information of lower roads with respect to higher roads are recorded.
[0121]
In this case, the meshes # 0 to #n are hierarchized as data elements. The route can be searched according to the mesh to which each coordinate belongs by using the coordinates of the departure point that represents the branch point between the road before the departure and the branch road and the return point that represents the branch point between the branch road and the road after the return. Therefore, the responsiveness of the route search process can be increased. Note that the mesh represents an area that is equally divided throughout Japan.
[0122]
In this case, an intermediate point between the departure point and the return point on the searched route obtained in the route search process is calculated, and each data of the divided routes # 0 to #n is recorded at a position corresponding to the mesh. Only search data for meshes that intersect the search path (mesh around the search path) can be targeted for search.
[0123]
By the way, if a disk such as a DVD used in the data recording unit 16 (FIG. 3) is replaced with a new version database or a disk manufactured by a different data supply company, the disk is replaced. Various data cannot be read out unless the road number assigned to the road in the disc database matches the road number assigned to the road in the disc database after replacement.
[0124]
Also, the branch road search data registered by the route re-search process cannot be read when the disk is changed.
[0125]
Accordingly, a fifth embodiment of the present invention will be described in which search data can be read when an existing database is replaced with a database of a different version, a database manufactured by a different data supplier, or the like. .
[0126]
FIG. 19 is a diagram showing a search data file in the fifth embodiment of the present invention.
[0127]
As shown in the figure, data such as the number of shortcuts and shortcuts # 0 to #n are recorded in the search data file that constitutes the database, and the data version # 0, the divided path, as the data of each shortcut # 0 to #n And the data of the divided routes # 0 to #n are recorded. As data of each divided route # 0 to #n, the layer to which each divided route # 0 to #n belongs, the road number before leaving, the road number after returning, Data such as search cost, search conditions, number of roads, roads # 0 to #n, number of upper layer roads, upper layer roads # 0 to #n, and the like are recorded.
[0128]
And, as the data of the road number before leaving, the road number after returning and the data of each road # 0 to #n, data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.) are recorded, As the data of the upper layer roads # 0 to #n, data such as road number, road shape, road attributes (attributes such as type, distance, width, etc.) and position information of the lower roads with respect to the upper roads are recorded.
[0129]
In this case, since data such as road number, road shape, road attributes (type, distance, width, etc.) are recorded as data for specifying the road number before leaving and the road number after returning, route re-search The processing means 95 newly determines the road number before leaving and the road after return based on the road shape, road attributes (attributes such as type, distance, width, etc.) from the search data of the search data file after the replacement. The number can be detected. Then, the route re-search processing means 95 sets the road before departure of the exchanged search data file as the departure point Ps and sets the road after return as the destination Pe, and again according to the search data for each of the layers 1 to 3. Search for a route. The information registration processing means registers a branch road based on the searched route obtained in the route re-search process.
[0130]
In this way, after being exchanged by the road shape, road attributes (type, distance, width, etc.) of the road number before leaving and the road number after returning recorded in the database before exchange Branch roads can be registered in the database.
[0131]
Therefore, search data can be read when an existing database is replaced with a database of a different version, a database manufactured by a different data supply company, or the like.
[0132]
Next, a navigation system capable of transmitting and receiving a database between the information base and the in-vehicle terminal will be described.
[0133]
FIG. 20 is a first block diagram showing a navigation system according to the fifth embodiment of the present invention, FIG. 21 is a second block diagram showing the navigation system according to the fifth embodiment of the present invention, and FIG. It is a figure which shows the data structure of the data for reference in the 5th Embodiment of invention.
[0134]
20, 50 is a navigation system, 61 is an in-vehicle terminal constituted by the navigation device 14 (FIG. 3), 51 is an information base, 52 is an information network connecting the information base 51 and the in-vehicle terminal 61, 53 is It is a server arranged in the information base 51, and can transmit and receive various programs and data between the information base 51 and the in-vehicle terminal 61. For this purpose, the communication unit 38 of the in-vehicle terminal 61 includes a transmission / reception device. The server 53 includes a CPU 54, a RAM 55, a ROM 56, a communication interface (not shown), and the like as an arithmetic device, and constitutes a computer. Further, the server 53 and the navigation processing unit 17 of the in-vehicle terminal 61 can constitute a computer, and the computer can further include other arithmetic devices.
[0135]
When the information base 51 is an information center, a navigation server is provided in the information center as the server 53, and the information center and the in-vehicle terminal 61 are connected via a communication network as the information network 52. When the information base 51 is a provider, an Internet server is provided as the server 53 to the provider, the provider and the in-vehicle terminal 61 are connected via the Internet network as the server 53, and the information base 51 is a base station. In this case, a base station server is provided in the base station, and the base station and the in-vehicle terminal 61 are connected via an FM multiplex broadcasting network, a telephone line network, or the like as the server 53.
[0136]
The server 53 is a recording device 57 as an information recording unit that records a database including a map data file, a road data file, an intersection data file, a node data file, a search data file, a guidance data file, a facility data file and the like as navigation information. And various data are recorded in the recording device 57.
[0137]
In the in-vehicle terminal 61, when various programs, data, and the like are received by the communication unit 38, the CPU 31 of the navigation processing unit 17 downloads to, for example, a RAM 32, a flash memory, a hard disk, etc., and starts the program. Various processes are performed based on the data. That is, the CPU 31 downloads the database to a recording medium such as a RAM 32, a flash memory, and a hard disk, and performs various processes based on each data of the database. Note that the program and data may be recorded on different recording media, or may be recorded on the same recording medium.
[0138]
Further, using a home personal computer, the program, data, etc. transmitted from the information base 51 are downloaded to an external recording medium such as a memory card or a flexible disk that is detachable from the personal computer, and the program is downloaded. It is also possible to start up and perform various processes based on the data.
[0139]
By the way, since the server 53 can manage various data, the CPU 31 makes an inquiry about the search data to the server 53, thereby registering the branch road in the exchanged database. Search data can be read out. For this purpose, the information base 51 and a plurality of in-vehicle terminals 61 are connected, and in the server 53 of the information base 51, a correspondence table of road numbers before leaving and road numbers after returning for each database is shown in FIG. Such data is recorded in the ROM 56 as reference data.
[0140]
In the reference data, the data of roads # A1 to #An, # B1 to #Bn, and # C1 to #Cn including the road number before leaving and the road number after returning are recorded for each database A to C. Is done.
[0141]
Therefore, the divided search processing means (FIG. 1) of the CPU 31 sends the road number before leaving and the road number after returning to the server 53 by sending the road number before leaving and the road number after returning to the server 53. The road number after return is received from the server 53, the road before leaving the database after being exchanged is set as the departure point Ps, the road after return is set as the destination Pe, and the route is again determined according to the search data for each of the layers 1 to 3 Explore. The information registration processing unit (not shown) of the CPU 31 registers the branch road based on the searched route obtained in the route re-search process.
[0142]
In each embodiment, the CPU 31 is provided with divided search processing means and information registration processing means. However, the CPU 54 of the server 53 is provided with divided search processing means and information registration processing means not shown. It is also possible to search for a route based on the pre-leaving road number and post-return road number received from the in-vehicle terminal 61 and register the branch road based on the searched route obtained in the route re-search process.
[0143]
Moreover, a common database can also be held between each in-vehicle terminal 61 connected to the information base 51. For this purpose, a common database is managed by the server 53. For example, an information management processing unit (not shown) of the server 53 performs information management processing and receives a database from each in-vehicle terminal 61. The database received from the terminal 61 is compared, and search data other than the common search data is recorded in the recording device 57.
[0144]
Therefore, each in-vehicle terminal 61 can use the branch road search data supplied from the other in-vehicle terminals 61.
[0145]
Further, the destination setting processing means 93 of each CPU 31 can perform destination setting processing, set the destination Pe, and send the data of the destination Pe to the server 53. The CPU 54 is provided with route search processing means, route division processing means, and division search processing means (not shown), performs route search processing, divides the search route obtained by the route search processing, and again based on the divided route. You can search for routes and register branch roads.
[0146]
In addition, this invention is not limited to the said embodiment, It can change variously based on the meaning of this invention, and does not exclude them from the scope of the present invention.
[0147]
【The invention's effect】
As described above in detail, according to the present invention, a route is searched again according to the navigation information for each divided route, so that the route searched by the re-search can be the target of route search processing. Therefore, an optimum route can be searched.
[Brief description of the drawings]
FIG. 1 is a functional block diagram of a navigation system according to a first embodiment of the present invention.
FIG. 2 is a diagram illustrating an operation of a conventional route search process.
FIG. 3 is a block diagram showing a main part of the navigation system according to the first embodiment of the present invention.
FIG. 4 is a flowchart showing an operation of the navigation device according to the first embodiment of the present invention.
FIG. 5 is a diagram showing a hierarchical structure of search data according to the first embodiment of the present invention.
FIG. 6 is a diagram showing a layer configuration in the first embodiment of the present invention;
FIG. 7 is a first diagram illustrating an operation of dividing a path in the first embodiment of the present invention.
FIG. 8 is a second diagram for explaining an operation of dividing a path in the first embodiment of the present invention;
FIG. 9 is a third diagram for explaining the operation of dividing the path in the first embodiment of the present invention;
FIG. 10 is a diagram showing a subroutine of information registration processing in the first embodiment of the present invention.
FIG. 11 is a flowchart showing the operation of the route division processing means in the second exemplary embodiment of the present invention.
FIG. 12 is a flowchart showing the operation of the route division processing means in the third exemplary embodiment of the present invention.
FIG. 13 is a first diagram illustrating an operation of dividing a path in the third embodiment of the present invention.
FIG. 14 is a second diagram illustrating an operation of dividing a path in the third embodiment of the present invention.
FIG. 15 is a diagram showing an example of a search data file according to the fourth embodiment of the present invention.
FIG. 16 is a diagram showing a first modification of the search data file according to the fourth embodiment of the present invention.
FIG. 17 is a diagram showing a second modification of the search data file in the fourth embodiment of the invention.
FIG. 18 is a diagram showing a third modification of the search data file according to the fourth embodiment of the present invention.
FIG. 19 is a diagram showing a search data file according to the fifth embodiment of the present invention.
FIG. 20 is a first block diagram showing a navigation system according to a fifth embodiment of the present invention.
FIG. 21 is a second block diagram showing a navigation system in the fifth embodiment of the present invention.
FIG. 22 is a diagram showing a data structure of reference data in the fifth embodiment of the present invention.
[Explanation of symbols]
16 Data recording part
17 Navigation processor
31 CPU
50 Navigation system
53 servers
57 Recording device
92 Information acquisition processing means
93 Destination setting processing means
95 Route re-search processing means
96 Route search processing means
97 Re-search route determination processing means

Claims (4)

An information acquisition processing unit that acquires navigation information, a destination setting processing unit that sets a destination, a route search processing unit that searches for a route from the departure point to the destination, and the divided route is divided. a route re-search processing unit route again search was, together with a re-searched route determination processing unit for determining the re-searched route based on the search result by the route re-searching processing means, the searched route, each A navigation system characterized by being repeatedly divided by shifting a dividing point between divided routes . Search data before Symbol navigation information is recorded as a plurality of layers stratified according to level of detail of the lower road to the road of the upper, the route re-search processing means uses the search data of a plurality of layers The navigation system according to claim 1, wherein the route is searched again. The navigation system according to claim 1, wherein the searched route is divided based on a range of navigation information that can be searched with a predetermined memory capacity . The computer divides the information acquisition processing means for acquiring navigation information, a destination setting processing means for setting a destination, a route search processing unit for searching for a route from a departure point to a destination, the searched route, divided The route re-search processing means for re-searching the re-routed route, and the re-search route determination processing means for determining the re-search route based on the search result by the route re-search processing means, and the searched route is: A program for a route search method, characterized in that division is repeated by shifting the dividing points between the divided routes.

Images