JPH0793694A - Dynamic route retriever - Google Patents

Abstract

PURPOSE:To evade congestion by using congestion information that is external information from a beacon in a navigation system loaded on a vehicle. CONSTITUTION:A present location correction part 63 which finds the present location of the vehicle when route retrieval started after the road information of the beacon is received by finding the speed data of the vehicle and distance where the vehicle advances during the route retrieval time of a route retrieval part 61 is completed is provided at a dynamic route retriever provided with the route retrieval part 61 which retrieves the optimum route from the present location of the vehicle and a target position based on link data on which the road information is attached on every link in which a road is fractionized, and a link weighting part 62 which forms the weight of the distance of data link from the link data and the beacon installed at the road, and the route retrieval part 61 performs the route retrieval based on a corrected present location.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a dynamic route search device for a navigation system mounted on a vehicle, and more particularly to a RACS (Road / Automobile Communic).
ation) to avoid traffic congestion by using traffic congestion information that is external information from beacons.

[0002]

2. Description of the Related Art Conventionally, the Dijkstra method or the like has been used in a route search device as a technique in such a field. In the Dijkstra method, etc., based on the link data relating to the information of the link obtained by subdividing the road and the node data relating to the information of the connection relation of the nodes at the both ends of the road, the starting position and the target position which are the search starting points The optimum route having the shortest route length is calculated in the order of node data → link data → node data → link data. This shortest route is obtained as the shortest distance among the plurality of routes from the starting position to the target position by connecting the links with the node data and accumulating the link length in the link data. Furthermore, in order to improve the accuracy of route search, as a static route search method, the number of right and left turns, road width, and road level (national road, prefectural road, etc.) included in the link data are considered. The distance of the link is corrected. The correction coefficient Vs (1) is set as Vs (2) = link distance / [W (number of right / left turns) + W (road width) + W (road level)] (1).

Further, not only the static route search but also the dynamic route search considering dynamic information is attempted to improve the route search. For example, as the dynamic information, link distance information that considers traffic congestion is used as dynamic information from the RACS beacon to correct the distance of the link. The correction coefficient Vs (2)
Is set as Vs (2) = link distance / [W (number of right / left turns) + W (road width) + W (road level) + W (congestion)] (2).

[0004]

However, in the conventional dynamic route search device, the route search is performed at the time when it is received from the beacon, but since the route search requires a certain time, congestion as dynamic information is generated. Even if a new route is searched in consideration of, the vehicle may be moving during the search and the vehicle may deviate from the new route. The problem arises of having to go back the way. Furthermore, when a route is searched, roads that are frequently used differ depending on the user who uses the vehicle. Therefore, there is a demand that it is safe and practical to preferentially search such a road.

Therefore, an object of the present invention is to provide a dynamic route searching apparatus which is flexible with respect to traffic congestion information and can preferentially search a road which is frequently used in view of the above problems and problems.

[0006]

In order to solve the above problems, the present invention finds an optimum route from the current position and destination position of a vehicle based on link data in which road information is added to each link obtained by subdividing a road. A vehicle speed data and route search are provided in a dynamic route search device having a route search unit for searching and a link weighting unit that forms a weight of a distance of a data link from the link data and road information data from a beacon installed on a road. The current position correction unit is provided to find the current position of the vehicle at the end of the route search started after obtaining the road information of the beacon by obtaining the distance traveled by the vehicle during the route search time The route search unit is caused to perform a route search based on In addition, a traffic congestion link prediction unit that predicts whether there is a traffic congestion link change when passing the route searched previously from the road information data of a plurality of beacons is provided to the link weighting unit even if traffic congestion is not currently present. The weight of the traffic jam is assigned to the link where the traffic jam is predicted. Further, a link passage number recording unit for storing the number of times of passing a link by the route search of the route searching unit is provided, and the number of passages is used for weighting of the link weighting unit. The current position correction unit, the traffic jam link prediction unit, and the link passage count recording unit may be provided in combination.

[0007]

According to the dynamic route search device of the present invention, the route search end which is started after obtaining the road information of the beacon by obtaining the speed data of the vehicle and the traveling distance of the vehicle during the route search time of the route search unit By providing a current position correction unit that determines the current position of the vehicle at the time, and letting the route search unit search for a route based on the corrected current position, the search time can be taken into consideration, and the searched route will be effective. Will be available. Furthermore, a traffic congestion link prediction unit that predicts whether there is a traffic congestion link change when passing a route previously searched for from road information data of a plurality of beacons,
By causing the link weighting unit to give the weight of the traffic jam to the link where the traffic jam is predicted, even if it is not currently traffic jam, the change in the traffic jam section is predicted, so that the traffic jam is not easily involved. Further, by providing a link passage number recording unit for storing the number of times of passing through the link by the route search unit, and using the number of passages for weighting of the link weighting unit, the route search can be performed according to the user's preference. Will be able to.

[0008]

Embodiments of the present invention will be described below with reference to the drawings. It is a figure which shows schematic structure of the navigation system which concerns on the Example of this invention. As shown in the figure, the navigation system includes a CD-ROM 1 for reading a road map stored in a CD (Compact Disc) -ROM at high speed,
IC that is a non-volatile memory that stores processed data
Card 2 and a piezoelectric gyro used to find the current position of the vehicle in vehicle navigation, geomagnetic sensor, vehicle speed pulse, back gear, GPS (Global Positioning Sy)
stem) and the like, terminal 3 for receiving signals from the like, terminal 4 for receiving information from the beacon of RACS, and CD-ROM 1
A display unit 5 for displaying the optimum route between the current position and the target position of the vehicle on the road, and having the mechanical switch and the optical touch switch; and the CD-ROM 1.
It has an IC card 2 and a display unit 5, and has a current position sensor and R
The system controller 6 includes a system controller 6 that receives information data from an ACS beacon and performs a route search. Below, a schematic configuration example of the information data from the beacon will be described using a table.

[0009]

[Table 1]

As shown in the above table, the beacon information data consists of a header, quasi-header, basic information, extension part, etc.
It consists of information such as the time and minutes of information provision, the degree of traffic congestion on the road, traffic congestion links, traffic congestion length, etc. FIG. 2 is a diagram showing a route search in the system controller 6 of FIG. 1 in which the current position is corrected by the speed of the vehicle. As shown in the figure, the system controller 6 is provided with a route search unit 61. The route search unit 61 inputs the current position and the target position of the vehicle and outputs road map data in a certain range between them on the CD-R.
The result is developed in the memory via the OM1, the route search is performed by the above-mentioned Dijkstra method, and the result is displayed on the display unit 5.

The route searching unit 61 converts the road map data into a CD-
A link weighting unit 62 is provided before input from the ROM 1. In the link weighting unit 62, the weight of the distance is formed for each link data by the weighting formula described above. The static correction coefficient Vs (1) can be formed in the link data in advance, but the dynamic correction coefficient is formed for each link by the link weighting unit 62 based on the beacon information data of RACS. To be done. The target position data may be given to the system controller 6 via a mechanical switch or a touch switch of the display unit 5.

Next, the current position correction unit 63 for correcting the current position used when the route search unit 61 updates the route search.
Is provided. The current position correction unit 63 inputs vehicle speed data converted from vehicle speed pulses and the like. Since the time T required for the route search unit 61 to search is known in advance, the distance L traveled by the vehicle from the beacon information data input to the time T is calculated. Since this distance L is obtained instantly, the route searching unit 61 is caused to perform a route search with the corrected current position obtained by adding and correcting this distance to the current position in the route searched by the route searching unit 61 as a new current position. . The operation of the dynamic route search device of the system controller 6 will be described in detail below.

FIG. 3 is a diagram for explaining a route search from the current position to the destination position without correction in FIG. In this figure, if the starting position is A and the destination position is B,
Beacon at departure point A and beacon at intersection C
Suppose It is assumed that the vehicle retrieves the information of the beacon at the departure position A and performs a route search, and then searches for a route toward the destination position B via the intersection D.

FIG. 4 is a diagram for explaining a route searched without correcting the current position when a traffic jam occurs in FIG. In this figure, when there is information that a traffic jam is occurring near the target position in the RACS beacon, the route searching unit 61 searches for a route at that position. In that case, since there is position information of the traffic jam from the beacon, the weight of the section is reduced accordingly, and the distance of this section is evaluated large. Therefore, as a result, the optimum route is searched for in the section excluding the traffic jam section, and for example, the path from the intersection C to the target intersection B is turned right at the intersection and then left at the intersection to reach the target position B. In this case, the following problems described above occur.

FIG. 5 is a diagram for explaining an example in which the searched route cannot be effectively used when the time required for the route search cannot be ignored. It takes a certain time for the route search by the route search unit 61. If this time is T and the vehicle speed is V, the vehicle travels L = T × V during the search period. During this time, for example, if the vehicle is passing through the intersection E of the searched route, it cannot be used when the route is displayed on the searched display unit 5. If you try to use it forcibly, you will have to back up, which will impose a burden on the driver. Moreover, since the vehicle did not pass the search route temporarily due to the back movement, the search accuracy decreases. Therefore, the search must be performed again, which is complicated.

FIG. 6 is a diagram for explaining a route search using the current position in which the vehicle speed is corrected by the current position correction unit 63 in FIG. When it is determined by the current position correction unit 63 that the beacon is congested on the route searched at the departure position A in the figure, the distance L that the vehicle travels during the route search period is calculated. Then, at the end of the route search, the position of the vehicle on the previously searched route is calculated,
The route search unit 61 is caused to search for a route using this as the current position. As shown in the figure, the route search unit 61 uses the route EFB.
For example, the route DGHB is searched for instead of searching. Thus, by considering the search time, the searched route can be effectively used.

FIG. 7 is a diagram showing a route search of the system controller 6 of FIG. 2 and further predicting a congestion link. In this figure, the difference from the configuration of FIG. 2 is that the traffic jam link prediction unit 64 is provided before the beacon information data is input to the link weighting unit 62. The traffic jam link prediction unit 64 detects a change in the traffic jam link from the beacon information and changes the route so as not to be affected by the traffic jam. This will be described in detail below.

FIG. 8 is a diagram for explaining the route search in the early stage of the traffic jam in FIG. As shown in this figure, the starting position A of the vehicle
Then, the information of the beacon is taken in and the route search to the destination position B is performed via the intersection D. In this case, no congestion has occurred on the searched route, but if there is a congested section outside the searched route, this congestion link information is stored. FIG. 9 is a diagram for explaining route search for avoiding the traffic jam link in FIG. 7. As shown in this figure, according to the traffic jam information from the beacon, the traffic jam section obtained by the beacon has not come into the searched route yet, but is getting very close. Therefore, the traffic jam link prediction unit 64 determines whether or not the traffic jam section will cut into the searched route from the time change of the traffic jam of the beacon and the traffic to the destination position B. If it is expected to cut in, the route is searched again with the section as a traffic jam section.

FIG. 10 shows the traffic jam link predicting unit 6 in FIG.
FIG. 4 is a diagram illustrating a route search for avoiding a traffic jam link according to 4; As shown in the figure, the weight of the link in which the traffic congestion is predicted decreases and the distance in that section increases, so that the route CDHIGB is searched in the route search again.
Thus, since the change in the traffic jam section is predicted, the traffic jam is not easily involved.

FIG. 11 is a diagram for explaining a route search for giving priority to a road that is frequently used in the surroundings when the road is frequently used. In this figure, a configuration different from FIG. 7 is a link passage number recording unit 65 provided between the route search unit 61 and the link weighting unit 62. The link passage count recording unit 65 is composed of the non-volatile IC card 2 and records the number of passages through the road links searched by the route searching unit 61. The reason why the link passage number recording unit 65 is made non-volatile is to retain the passage number data even when the engine is off. The link weighting unit 62 attaches a weight Vs (3) to the link according to the number of passages as described below so that the distance of the link which is frequently used is reduced as follows.

Vs (3) = link distance / [W (number of right / left turns) + W (road width) + W (road level) + W (congestion) + W (number of passes)] (3) Route search in this case This will be described below. 12 is shown in FIG.
FIG. 6 is a diagram for explaining a route search in which a link having a high frequency of use is prioritized by the link passage number recording unit 65 of FIG. As shown in this figure, if there is a road with a high frequency of use of double lines, the weight of the link is large and the distance is evaluated to be small. Therefore, the route that is frequently used is selected. Thus, the route can be searched according to the user's preference.

[0022]

As described above, according to the present invention, the search time can be taken into consideration, the searched route can be effectively used, and the change in the congestion section can be predicted, so that the congestion can be easily performed. You will not be involved and you will be able to search the route according to your preference.

[Brief description of drawings]

FIG. 1 is a diagram showing a schematic configuration of a navigation system according to an embodiment of the present invention.

FIG. 2 is a diagram showing a route search in the system controller 6 of FIG. 1 in which the current position is corrected according to the speed of the vehicle.

FIG. 3 is a diagram illustrating a route search from a current position to a target position without correction in FIG.

FIG. 4 is a diagram illustrating a route searched without correcting the current position when a traffic jam occurs in FIG. 2;

FIG. 5 is a diagram illustrating an example in which the searched route cannot be effectively used when the time required for the route search in FIG. 2 cannot be ignored.

6 is a diagram illustrating a route search using a current position in which a vehicle speed is corrected by a current position correction unit 63 in FIG.

FIG. 7 is a diagram showing a route search of the controller 6 of FIG. 2, which further predicts a congestion link.

FIG. 8 is a diagram for explaining route search in the early stage of traffic congestion in FIG. 7.

9 is a diagram illustrating route search for avoiding the congestion link in FIG. 7. FIG.

FIG. 10 is a diagram illustrating a route search for avoiding a traffic jam link by the traffic jam link prediction unit 64 in FIG. 7.

FIG. 11 is a diagram for explaining a route search that preferentially guides a road that is frequently used in the vicinity when the road is frequently used.

12 is a diagram for explaining a route search that gives priority to a link that is frequently used by the link passage number recording unit 65 of FIG.

[Explanation of symbols]

 1 ... CD-ROM 2 ... IC card 3 ... Current position sensor terminal 4 ... Beacon information input terminal 5 ... Display unit 6 ... System controller 61 ... Route search unit 62 ... Link weighting unit 63 ... Current position correction unit 64 ... Congestion link prediction Part 65 ... Link passing count recording part

Claims (4)

[Claims] 1. A route search unit (61) for searching an optimal route from a current position and a destination position of a vehicle based on link data in which road information is added to each link obtained by subdividing a road, and the link data and the road. A dynamic route search device having a link weighting unit (62) for forming a weight of a distance of a data link from road information data from an installed beacon, the vehicle speed data and the route search time of the route search unit (61). A current position correction unit (63) for obtaining the current distance of the vehicle and obtaining the current position of the vehicle at the end of the route search started after obtaining the road information of the beacon is provided between the two and based on the corrected current position. A dynamic route search device characterized by causing a route search section (61) to perform a route search. 2. A route search unit (61) for searching for an optimum route from a current position and a target position of a vehicle based on link data in which road information is added to each link obtained by subdividing a road, and the link data and the road. A dynamic route search device having a link weighting unit (62) for forming a weight of a distance of a data link from road information data from installed beacons, wherein a route previously searched for is searched from road information data of a plurality of beacons. A traffic congestion link prediction unit (64) for predicting whether or not a traffic congestion link changes at the time of passage is provided, and a link weighting unit (62) assigns a traffic congestion weight to a link whose traffic congestion is predicted even if it is not currently traffic congestion. A dynamic route search device characterized by being attached. 3. A route search unit (61) for searching an optimum route from a current position and a destination position of a vehicle based on link data in which road information is added to each link obtained by subdividing a road, and the link data and the road. A dynamic route search device having a link weighting unit (62) for forming a weight of a distance of a data link from road information data from an installed beacon, which passes through a link by a route search of the route search unit (61). A dynamic route search device, characterized in that a link passage number recording unit (65) for storing the number of times is provided, and this passage number is used for weighting of the link weighting unit (62). 4. A route search unit (61) for searching an optimum route from a current position and a target position of a vehicle based on link data in which road information is added to each link obtained by subdividing a road, and the link data and the road. A dynamic route search device having a link weighting unit (62) for forming a weight of a distance of a data link from road information data from an installed beacon, the vehicle speed data and the route search time of the route search unit (61). A current position correction unit (63) for obtaining the current distance of the vehicle at the time of obtaining the road information of the beacon and obtaining the current position of the vehicle at the end of the route search is provided between, and the route search is performed based on the corrected current position. The part (61) is caused to perform a route search and predicts whether or not there is a change in the congestion link when the route searched last time is passed from the road information data of a plurality of beacons. A link predicting unit (64) is provided to cause the link weighting unit (62) to weight a link for which a traffic congestion is predicted even if the traffic is not currently congested, by the route searching unit (61). A dynamic route search device characterized in that a link passage number recording unit (65) for storing the number of passages through the link is provided, and this passage number is used for weighting of the link weighting unit (62).