JP3546537B2 - In-vehicle navigation system - Google Patents

Description

[0001]
[Industrial applications]
The present invention relates to an in-vehicle navigation system that searches for a route from a current location to a destination using map information recorded on a recording medium and guides the user.
[0002]
[Prior art]
As a method of searching for a route from the current position to the destination based on the map information recorded on the recording medium, route network map data connecting each intersection on the road map and each intersection is created from the above map information. A method for performing a route search based on the route network map data has been proposed in, for example, Japanese Patent Application Laid-Open No. 6-52237. In the route network map data in this publication, for each intersection, an intersection name, coordinates on the map of the intersection, an intersection Y connected to the intersection X by a connecting road, and a distance Dxy of the connecting road are recorded. As a route search method, for the purpose of finding the shortest route, a connection route capable of connecting each intersection is obtained from an intersection included between the current position and the destination, and then a connection distance of each intersection Dxy is obtained. The shortest route that minimizes the total distance by the sum is searched from the connection route.
[0003]
[Problems to be solved by the invention]
However, on an actual road, particularly a road with a high frequency of passing through an intersection such as an urban area, the shortest distance based on the distance between the intersections as represented by the above-mentioned publication is not necessarily the route that can reach the destination in the shortest time. Often not limited. Because the intersection is set so as to prolong the time to become a green light in the direction traveling along the direction in order to smooth the flow of traffic in a specific direction, the intersection does not proceed along the setting of this signal. This is because, even if the distance is the shortest, the signal waiting by the red light becomes longer, and the time until arrival at the destination becomes longer.
[0004]
In addition, in the shortest distance based on the distance between intersections as represented by the above-mentioned publication, when selecting an intersection to turn right, the presence or absence of a right-turn arrow signal at the intersection and the level of the probability of the green signal of the right-turn arrow signal are determined. Did not consider. However, it is difficult to make a right turn at an intersection where there is no right-turn arrow signal when traveling in an urban area with a large traffic volume. At intersections with low traffic, it was not only difficult to make a right turn smoothly, but also the possibility of waiting for a traffic light at the intersection became high.
[0005]
The present invention has been made to solve the above-described problem, and an object of the present invention is to provide an in-vehicle navigation system capable of searching for a route with the shortest waiting time at a traffic signal.
Further, the present invention has been made to solve the above-mentioned problem, and an object of the present invention is to provide an in-vehicle navigation system for selecting an intersection where a right turn can be made smoothly and searching for a route.
[0006]
[Means for Solving the Problems]
In order to achieve the above object, the on-vehicle navigation system according to the first aspect of the present invention includes a map information storage unit, a current position detection unit, and a destination input unit, and searches for a route from the current position to the destination. On-board navigation system,
A road network map that stores intersections on the map, their position coordinates, and roads connecting the intersections;
Traffic signal display data storing the ratio of the time of one cycle in which the display of the traffic signal installed at each of the intersections is repeated and the progress permission display time in one cycle;
Route search means for searching a plurality of routes short in distance from the current position to the destination based on the map information and the road network map stored in the storage unit;
For a plurality of routes searched by the route searching means, a probability that a traffic signal included in each route indicates progress permission is calculated based on a ratio of a traffic signal progress permission display time at an intersection included in each route. Intersection passing probability calculating means,
A shortest time route selecting means for selecting a route having a shortest required time among a plurality of routes searched by the route searching means based on a calculation result by the intersection passing probability calculating means.
[0007]
According to a second aspect of the present invention, in the vehicle navigation system according to the first aspect, the intersection passage probability calculating unit calculates a traffic signal at an intersection included in each of the plurality of routes searched by the route searching unit. Calculate the probability that the traffic signal indicates progress permission by multiplying the percentage of the permission display time,
The gist is that the shortest time route selecting means selects the route having the highest probability of displaying the permission to proceed in the traffic signal calculated by the intersection passing probability calculating means.
[0008]
According to a third aspect of the present invention, there is provided a vehicle-mounted navigation system including a map information storage unit, a current position detection unit, and a destination input unit. An in-vehicle navigation system for searching for
A road network map that stores intersections on the map, their position coordinates, and roads connecting the intersections;
Traffic signal display data storing a ratio of one cycle time at which the display of the traffic signal installed at each intersection is repeated and a right turn permission display time in one cycle;
Route search means for searching a plurality of routes short in distance from the current position to the destination based on the map information and the road network map stored in the storage unit;
For a plurality of routes searched by the route searching means, an intersection passing probability calculation for calculating a probability that the traffic signal indicates a right-turn permission based on a ratio of a right-turn permission display time of a traffic signal at a right-turn intersection in each route. Means,
A shortest time route selecting means for selecting a route having a shortest required time among a plurality of routes searched by the route searching means based on a calculation result by the intersection passing probability calculating means.
[0009]
In the vehicle-mounted navigation system according to a fourth aspect, in the third aspect, the shortest time route selecting means sets a right turn permission calculated by the intersection passing probability calculating means in a plurality of routes searched by the route searching means. The gist is to select a route that passes through an intersection with the highest probability of being displayed.
[0010]
[Action]
In the in-vehicle navigation system according to the first aspect, the route searching means searches a plurality of short routes from the current position to the destination based on the map information and the road network map stored in the storage unit. Then, the intersection passage probability calculating means determines, based on the ratio of the traffic signal progress permission display time at the intersection included in each of the plurality of searched routes, that the traffic light included in each of the routes has the traffic permission. Calculate the displayed probability. Then, the shortest time route selecting means selects the route having the shortest required time among the plurality of routes searched by the route searching means based on the calculation result by the intersection passing probability calculating means.
[0011]
In the vehicle-mounted navigation system according to the second aspect, the shortest time route selecting means selects the route having the highest probability of displaying the permission to proceed in the traffic signal calculated by the intersection passing probability calculating means, so that the stop by the traffic signal is performed. The time is short and you can reach your destination in the shortest time.
[0012]
In the vehicle-mounted navigation system according to the third aspect, the route search means searches a plurality of short routes from the current position to the destination based on the map information and the road network map stored in the storage unit. Then, the intersection passage probability calculating means displays the right turn permission at the traffic signal on the plurality of routes searched by the route search means based on the ratio of the right turn permission display time of the traffic signal at the right turn intersection in each route. Calculate the probability of being done. Thus, the shortest time route selecting means selects the route having the shortest required time among the plurality of routes searched by the route searching means based on the calculation result by the intersection passing probability calculating means.
[0013]
In the vehicle-mounted navigation system according to the fourth aspect, the shortest time route selecting means passes through the intersection having the highest probability of displaying the right turn permission calculated by the intersection passing probability calculating means in the plurality of routes searched by the route searching means. In order to select a route, a right turn can be smoothly made at the intersection.
[0014]
【Example】
Hereinafter, an embodiment of the present invention will be described with reference to the drawings.
FIG. 1 is a block diagram showing a configuration of a vehicle-mounted navigation device according to one embodiment of the present invention. In this embodiment, a GPS receiver 18 is used as a device for measuring the position of the vehicle.
[0015]
The GPS receiver 18 calculates the position of the vehicle by demodulating data from radio waves received by a dedicated antenna 18a attached to the vehicle and performing data processing. The calculated vehicle position data is sent to the CPU 12. The CPU 12 corrects position information from the GPS receiver 18 based on outputs from a gyro and a vehicle speed sensor (not shown).
[0016]
The CDROM (not shown) loaded in the CDROM player 30 includes, in addition to map data obtained by processing a map into a predetermined format, intersections on the map, their position coordinates, roads connecting the intersections, and the connection. Intersection data consisting of combined road data consisting of the distance of the road, the traveling direction of the traffic signal installed at the intersection, the cycle of displaying the traffic signal, the green signal display time in the cycle, and the display time of the right-turn arrow signal And are included. The CDROM player 30 reproduces the CDROM to read out desired map data, combined road data, and intersection data, and sends them to the CPU 12.
[0017]
The CPU 12 causes the CDROM player 30 to read necessary data. The map screen data created by the data thus read out is written to the VRAM 24 via the graphic display controller (GDC) 22. The GDC 22 stores the screen data in the VRAM 24, generates a display timing signal and outputs it to the monitor 28, and outputs a signal for reading the screen data stored in the VRAM 24. The output of the data read from the VRAM 24 is converted into an analog RGB signal by the palette DAC 26 and displayed on the monitor 28 as an image.
[0018]
The CPU 12 provides the audio output device 36 with a control signal extracted from the map data (for example, a control signal that is converted into an audio signal of "turn left 500 m ahead") together with the image display on the monitor. The sound output device 36 converts the control signal into a sound signal and outputs the sound signal from the speaker 38.
[0019]
The ROM 14 is a memory that stores work procedures (programs) of the CPU 12 and fixed data. The RAM 16 is a work memory used as necessary when the CPU 12 performs various processes. The input device 20 is provided with an input key for inputting a destination, and is a device for setting and operating a destination of the in-vehicle navigation device when a user presses the input key with a finger. A signal is sent to the CPU 12. In addition, the receiver 40 receives information on traffic congestion, road construction, and the like, and information on the blue and red states of each traffic light, and sends the information to the CPU 12.
[0020]
Next, the operation of setting the destination of the vehicle-mounted navigation device according to the first embodiment will be described with reference to the flowchart shown in FIG. 2 and FIGS. When a destination is input via the input device 20 (Yes in S12 shown in FIG. 2), the CPU 12 detects a current position (departure place) based on a signal from the GPS receiver 18 (S14), The traffic jam information received via the receiver 40 is input (S16).
[0021]
Thereafter, the CPU 12 searches for map information (S18). That is, the map data including the input destination and the current position are obtained by accessing the CDROM, and further, the intersections included in the map data are extracted from the intersection closest to the destination and the intersection closest to the current position. A road connecting the intersection is obtained by searching the combined road data and the intersection data.
[0022]
Here, the combined road data and the intersection data included in the CDROM will be described in more detail with reference to FIG. 3 showing both data and FIG. 4 showing the contents of these data. The combined road data includes, as shown in FIG. 3B, a combined road number, an intersection number connected by the combined road number, a type of the combined road, a speed limit on the combined road, and the combined road. And data including the distance between the intersections to be joined. For example, the connecting road number X11 in FIG. 3 (B) connects the intersection A-1 and the intersection A-2 as shown in FIG. 4, the type is a national highway, the speed limit is 60 km, and the distance between both intersections is Is stored as 500 m.
[0023]
On the other hand, the intersection data includes an intersection number, coordinates (latitude / longitude) of the intersection, and an indication (lighting color switching pattern) by a traffic light arranged in each traveling direction of the intersection as shown in FIG. ) Pattern.
For example, the coordinates of the intersection number A-1 shown in FIG. 3A are XA1 and YA1, and a traffic light A-1 that displays a signal for a vehicle traveling in the X-axis direction as shown in FIG. -X and a traffic signal A-1-Y in the Y-axis direction are provided. Assuming that the switching pattern of the lighting color for straight ahead and right / left turn in the X-axis direction permitted to proceed by the traffic light A-1-X is the first display pattern, the X-axis is then turned on by the right-turn arrow signal of the same traffic light A-1-X. The display is switched to the lighting color of the right turn direction that permits only the right turn to proceed in the direction. This is the second presentation. Next, the traffic light A-1-Y is switched to the third indication which permits the straight traveling and the right / left turn in the Y-axis direction. The intersection data stores the direction and the lighting time permitted by each lighting color included in each indication.
Similarly, for the intersection number B-1, the coordinates and the present pattern are stored as the intersection data.
[0024]
That is, in step 18, the route network connecting the intersection as shown in FIG. 4 is searched based on the combined road data and the intersection data shown in FIG. Here, it should be noted that FIG. 4 is illustrated for convenience of description, and is not drawn in the actual processing of the CPU 12.
[0025]
Then, the CPU 12 lists a plurality of traversable routes from the route network connecting the intersections shown in FIG. 4 (S20). That is, an intersection group connecting the intersection F1 closest to the departure point to the intersection A-6 closest to the destination is selected, and the distance connecting the respective intersections in this intersection group is integrated with the inter-intersection distance in the combined road data. We ask by doing. Here, the shortest route and the route that is longer than the shortest route by, for example, up to 5% are selected. In addition, instead of selecting a route having a predetermined distance longer than the shortest route, a straight-line distance from the departure point to the destination is obtained, and a route within a distance obtained by adding, for example, 10% of the straight-line distance to the distance of the shortest route It is also possible to select. Here, if it is difficult to drive if a route that repeatedly turns right and left at the intersection is selected, a route that has the minimum number of right and left turns plus 1 or 2 (this value increases as the number of intersections increases) is selected.
[0026]
In this step 20, the CPU 12 determines the route of the intersections F-1, B-1, B-5 and A-6 (the shortest route) in FIG. It is assumed that a route, a route at intersections F-1, C-1, C-6, and A-6 and a route at intersections F-1, D-1, D-6, and A-6 are selected. Although the routes at the intersections F-1, E-1, E-6, and A-6 are short in terms of distance, the connecting road between the intersections E-1 and E-5 is relatively difficult to travel on narrow streets. Has been removed from the selection. In addition, the route of the intersection F-1, E-1, E-6, A-6 is, for example, 5% or more than the shortest route (the route of the intersection F-1, B-1, B-5, A-6). Because it is far away, it has been deselected.
[0027]
Next, the CPU 12 excludes a congested route from the selected plurality of routes based on the congestion information retrieved in step 16 (S22). Here, for example, the route of the intersections F-1, D-1, D-6, and A-6 is excluded from the selection based on the information that there is congestion between the intersections D-2 and D-5. And
[0028]
Subsequently, the CPU 12 calculates the probability of a green signal during the progress of each of the selected routes based on the intersection data described above with reference to FIG. 3A (S24). Here, prior to the description of the processing in step 24, lighting of a signal at a traffic light will be described with reference to FIG. FIG. 7A shows the operation of the traffic signals (signal numbers A-1-X and A-1-Y) in the X-axis direction and the Y-axis direction installed at the intersection A-1 shown in FIG. 3A. ing. First, the signal number A-1-X turns on the yellow signal 1 for 4 seconds following the 46-second green signal 1 (hereinafter referred to as “straight blue”) and then switches to the red signal 1 (first). Present). Two seconds after the start of lighting of the red signal 1, the display is switched to the green signal 2, which is a right-turn arrow signal. Ten seconds after that, the signal is switched to the red 2 signal which is in the same state as the red signal 1 (second display).
[0029]
Two seconds after the start of the red signal 2 lighting, the traffic signal A-1-X turns on the blue signal 3 for 60 seconds while the red signal 2 is maintained. Then, the signal is switched to the red signal 3 for 2 seconds after the yellow signal 3 for 4 seconds (third embodiment). Next, the signal A-1-X returns to the first display in which the traffic light A-1-X turns on the green light 1 while the traffic light A-1-Y maintains the red light 3. The above is one cycle of the pattern currently displayed by the traffic signals A-1-X and A-1-Y installed at two points in the intersection A-1.
[0030]
FIG. 7B is a diagram showing one cycle of the present case in which neither the X-axis signal nor the Y-axis signal has a right-turn arrow signal. This one cycle includes a first indication by a traffic signal that displays a signal for a vehicle traveling in the X-axis direction (including straight ahead, right and left turn) and a vehicle traveling in the Y axis direction (including straight ahead, right and left turn). And a second indication by a traffic light for displaying a signal.
[0031]
In this step 24, the CPU 12 selects a plurality of selected routes, that is, the route of the intersection F-1, A-1, A-6, the route of the intersection F-1, B-1, B-5, A-6, When the vehicle travels in the X direction along the route of the intersections F-1, C-1, C-6, and A-6, the probability that all the signals turn blue is calculated. First, regarding the intersections A-2, A-3, A-4, A-5, and A-6, which pass through the intersection in the X direction in the route of the intersections F-1, A-1, and A-6. After searching the intersection data for the probability that the traffic lights A-2-X, A-3-X, A-4-X, A-5-X, and A-6-X become blue, all the traffic lights become blue. Is calculated (see FIG. 5A). Here, the signal A-2-X has a probability of blue (8/13), the signal A-3-X has a probability of blue (1/3), and the signal A-4-X has a probability of blue (3/5). And the probability that A-5-X is blue (5/9) and the probability that A-6-X is blue (3/8), to obtain a possibility of 1/39.
[0032]
Similarly, as shown in FIG. 5B, intersections B-2 and B-3 passing when traveling in the X direction in the route of the intersections F-1, B-1, B-5, and A-6. , B-4, B-5, the blue probabilities of the traffic lights B-2-X, B-3-X, B-4-X, B-5-X indicate the probability that all the traffic lights will be blue (1 / 42). Also, as shown in FIG. 5C, intersections C-2, C-3, which pass when traveling in the X direction on the route of the intersections F-1, C-1, C-6, A-6, From the blue probabilities of the traffic lights C-2-X, C-3-X, C-4-X, C-5-X and C-6-X in C-4, C-5 and C-6, all Is obtained (1/70).
[0033]
Here, for convenience of explanation, only intersections that pass when traveling through the intersection in the X direction are compared. However, in actual calculation data, intersections that travel in the Y direction are also considered. Please be careful. For example, in the route of the intersections F-1, A-1, and A-6, the traffic lights B-1-Y and C-1-Y provided at the intersections B-1 and C-1 are considered, and the intersection F-1. In the route of B-1, B-5, and A-6, traffic signals C-1-Y and C-6-Y provided at intersections C-1 and A-6 are taken into consideration, and similarly, at intersections F-1 and C-6. In the route of -1.C-6.A-6, traffic signals B-5-Y and A-6-Y provided at intersections B-5 and A-6 are considered.
[0034]
Next, the CPU 12 selects a route having the highest probability of becoming a green signal and a route having a high probability within a range of, for example, 5% from the route having the highest probability (S26). Here, the route of the intersections F-1, A-1, and A-6 is selected as the route with the highest probability of being a green light, and the route of the intersections F-1, B-1, B-5, and A-6. Is selected as a route with a high probability in the range of 5%.
[0035]
Next, the CPU 12 selects the route between the intersections F-1, A-1, and A-6 selected in step 26 and the route between the intersections F-1, B-1, B-5, and A-6. Then, the one with the higher ratio of the right-turn arrow signal displayed at the intersection turning right is selected (S28). That is, in the route of the intersections F-1, A-1, and A-6, the right turn is made at the intersection A-1, so the CPU 12 searches the intersection data for the ratio of the right turn arrow signal of the traffic light A-1-Y. Here, as shown in FIG. 3A, the blue (the right-turn arrow signal) of the second indication is 10 seconds, and one cycle of the traffic light is 130 seconds, so that the probability is 1/13 as shown in FIG. It becomes. On the other hand, in the route of the intersections F-1, B-1, B-5, and A-6, the right turn is made at the intersection B-1, so the CPU 12 searches the intersection data for the right turn arrow signal ratio at the intersection B-1. I do. Here, as shown in FIG. 3A, the blue (the right turn arrow signal) of the second display is 7 seconds, and one cycle of the traffic light is 140 seconds, so that the probability is 1/20 as shown in FIG. It becomes. Therefore, in step 26, the route of the intersection F-1, A-1, A-6 having a high ratio of right turn arrow signals is selected.
[0036]
In this step 26, if a right-turn arrow signal is not displayed at a right-turn intersection in the route, the route is excluded from selection targets. When the probability of the right-turn arrow signal is compared, if the difference is, for example, less than 20%, regardless of the result of the comparison of the right-turn arrow signal, in step 24 described above, the ratio of the blue signal when traveling in the X direction is determined. The highest one is determined as the final path.
[0037]
Then, in step 30, it is determined whether or not the user sets the on-vehicle navigation device so that the distance is prioritized, and whether the arrival time is prioritized. Here, if the distance is set to be prioritized (Yes in S30), the process proceeds to step 36, and the intersection F having the shortest distance to the destination among the routes listed in step 18 described above. The route of -1.B-1.B-5.A-6 is selected. On the other hand, if the time is set to be prioritized (No in S30), the process proceeds to step 32, where the intersection F-1.A-1.A with the highest probability of the green signal selected in step 28 is described. The route of -6 is selected.
[0038]
Thereafter, in step 34, route guidance is performed according to the route set in step 32 or 36. That is, a map for route guidance is output to the monitor 28 based on the map data created from the read data, and a voice control signal (for example, “turn left 500 m ahead”) extracted from the map data is output from the speaker 38. .
[0039]
In the navigation device of the first embodiment, the route (intersection) having the highest probability of displaying a green light at a traffic light is not the shortest route (intersection F-1, B-1, B-5, A-6). Since the route of (F-1.A-1.A-6) is selected, the stop time by the signal is shortened, and the destination can be notified in the shortest time. In addition, since a route is selected so as to make a right turn at an intersection (intersection A-1) where the probability that a right-turn arrow signal is displayed is high, a right turn can be made smoothly at the intersection (intersection A-1).
[0040]
Here, a second embodiment of the present invention will be described. The configuration of the navigation device of the second embodiment is the same as that of the first embodiment described above with reference to FIG. The route search process of the second embodiment is substantially the same as that of the first embodiment described above with reference to FIG.
[0041]
In the second embodiment, after the route search in steps 12 to 28 shown in FIG. 2, it is further determined whether or not the signal is a green light while the vehicle is running to change the route. The processing after step 28 shown in FIG. 2 will be described with reference to the flowchart shown in FIG. In the second embodiment, each traffic light receives signal information about the timing of displaying the blue, red, and right-turn arrows from the side that controls the traffic light, and performs signal prediction based on this signal information. Reroute to the intersection of the traffic light that is predicted to be blue.
[0042]
This route change processing will be described with reference to the flowchart in FIG. First, the CPU 12 detects the current position (S52), and determines whether or not to pass the branch point within a predetermined time (for example, within 2 minutes) (S54). Here, when the vehicle is traveling on the combined road Y21 shown in FIG. 4, the route of the intersections F-1, A-1, and A-6 (hereinafter referred to as a first route) within two minutes, Since the vehicle passes through the intersection B1, which is a junction with the route of the intersections F-1, B-1, B-5, and A-6 (hereinafter, referred to as a second route), the step 54 becomes Yes.
[0043]
The CPU 12 calculates an average speed of the vehicle (S56), and then calculates a distance to an intersection within a predetermined range (for example, 3 km) (S58). Then, the estimated time of arrival at each intersection is calculated based on the average speed and distance (S60). Thereafter, a signal at the calculated estimated arrival time is predicted from the signal data relating to the timing of the received signal (S62).
[0044]
Then, the CPU 12 determines the state of the signal that arrives first in the first path and the second path. That is, the signal states of the traffic signal A-1-Y on the first route and the traffic signal B-1-Y on the second route are determined. Here, when both traffic signals are red signals (Yes in S64), and when the traffic signals B-1-Y on the second path are red signals (Yes in S68), the path is not changed, and FIG. As described above with reference to No. 2, the first route with the highest probability of the green light is guided according to a schedule.
[0045]
On the other hand, if both of the traffic lights are green light (S66: Yes), the process proceeds to step 74, where the probability that the traffic light at the intersection within the predetermined range (for example, 3 km) in the first route and the second route is the green signal is determined. calculate. If the probability that the second route is a green light is higher than a predetermined value than the planned first route (S76: Yes), the process proceeds to step 70, and the route is changed from the first route to the second route. The route is changed, and route guidance is executed (S70). This predetermined value can be set to, for example, about 50% in consideration of the probability of a green signal at a traffic light at an intersection beyond the calculated predetermined range (3 km). If the probability of the green signal is not higher than the predetermined value in the second route than in the first route (No in S76), the route is not changed.
[0046]
In the navigation device according to the second embodiment, a route including an intersection of a traffic light assumed to be a green light is selected. In other words, it is possible to arrive at the destination in the shortest time to select a crossing that becomes a green light at the time of arrival and perform route guidance. That is, according to the in-vehicle navigation device of the second embodiment, the route including the intersection of the traffic light and the traffic light estimated to be green is selected based on the received data on the timing of the traffic light, so that the vehicle reaches the destination in the shortest time. can do.
[0047]
In the first in-vehicle navigation device, a change in the lighting time of a traffic light or the like can be handled by using a CDROM whose contents are updated based on the changed time. In addition, for switching according to the time zone of the traffic light (for example, the green signal is short in the morning and the red signal is short in the afternoon), the data of the signal state of the intersection data defines the relationship with the time. When the route is determined, it can be dealt with by searching for the state of the signal at the time and selecting the route with the highest probability of becoming a green signal at the time.
[0048]
【effect】
As described above, in the in-vehicle navigation device according to the first aspect, since the route with the highest probability of displaying a green light in a traffic light is selected, the stop time due to the traffic light is shortened and the destination is notified in the shortest time. can do.
[0049]
Further, in the vehicle-mounted navigation device according to the third aspect, since the route is selected so as to make a right turn at the intersection where the right turn arrow signal is most likely to be displayed, it is possible to make a right turn at the intersection smoothly, The stop time is shortened and the destination can be notified in the shortest time.
[Brief description of the drawings]
FIG. 1 is a block diagram showing an electric configuration of a vehicle-mounted navigation device according to one embodiment of the present invention.
FIG. 2 is a flowchart illustrating a route search process of the navigation device according to the first embodiment.
FIG. 3 is an explanatory diagram showing intersection data and combined road data held in a ROM shown in FIG. 1;
FIG. 4 is an explanatory diagram showing contents of intersection data and combined road data shown in FIG. 3;
FIG. 5 is an explanatory diagram showing a calculation by the on-vehicle navigation device of the first embodiment.
FIG. 6 is an explanatory diagram showing a calculation by the on-vehicle navigation device of the first embodiment.
FIG. 7 is an explanatory diagram showing one cycle currently displayed at an intersection.
FIG. 8 is a flowchart illustrating a route change process of the navigation device according to the second embodiment.
[Explanation of symbols]
12 CPU
18 GPS receiver
28 monitors
30 CDROM player

Claims (4)

A storage unit for map information, a current position detection unit, and a vehicle-mounted navigation system that includes a destination input unit and searches for a route from the current position to the destination,
A road network map that stores intersections on the map, their position coordinates, and roads connecting the intersections;
Traffic signal display data storing the ratio of the time of one cycle in which the display of the traffic signal installed at each of the intersections is repeated and the progress permission display time in one cycle;
Route search means for searching a plurality of routes short in distance from the current position to the destination based on the map information and the road network map stored in the storage unit;
For a plurality of routes searched by the route searching means, a probability that a traffic signal included in each route indicates progress permission is calculated based on a ratio of a traffic signal progress permission display time at an intersection included in each route. Intersection passing probability calculating means,
A shortest time route selecting means for selecting a route having a shortest required time among a plurality of routes searched by the route searching means based on a calculation result by the intersection passing probability calculating means; Navigation system. The intersection passage probability calculating means multiplies the plurality of routes searched by the route searching means by a ratio of a traffic signal progress permission display time at an intersection included in each route, thereby allowing the traffic signal to proceed. Calculate the probability to display,
2. The in-vehicle navigation system according to claim 1, wherein the shortest time route selecting means selects a route having the highest probability of displaying the permission of progress in the traffic signal calculated by the intersection passing probability calculating means. A storage unit for map information, a current position detection unit, and a vehicle-mounted navigation system that includes a destination input unit and searches for a route from the current position to the destination,
A road network map that stores intersections on the map, their position coordinates, and roads connecting the intersections;
Traffic signal display data storing a ratio of one cycle time at which the display of the traffic signal installed at each intersection is repeated and a right turn permission display time in one cycle;
Route search means for searching a plurality of routes short in distance from the current position to the destination based on the map information and the road network map stored in the storage unit;
For a plurality of routes searched by the route searching means, an intersection passing probability calculation for calculating a probability that the traffic signal indicates a right-turn permission based on a ratio of a right-turn permission display time of a traffic signal at a right-turn intersection in each route. Means,
A shortest time route selecting means for selecting a route having a shortest required time among a plurality of routes searched by the route searching means based on a calculation result by the intersection passing probability calculating means; Navigation system. The shortest time route selecting means selects a route passing through an intersection having a highest probability of displaying a right turn permission calculated by the intersection passing probability calculating means, among a plurality of routes searched by the route searching means. The vehicle-mounted navigation system according to claim 3, wherein

Images