1. Field of the Invention
The present invention relates to an information transmission method for reporting on-road location information such as traffic jams and accidents in a traffic information provision system, and in particular to such a method that can correctly report a location on a digital map.
2. Description of the Related Art
In recent years, the number of vehicles that have car-mounted navigation apparatus has been increasing rapidly. The car-mounted navigation system has a digital map database and is capable of displaying the map around the vehicle on a screen based on the latitude/longitude data received by a GPS receiver as well as displaying the travel locus and the result of search for a route to the destination on the map.
In Japan, digital map databases are prepared by several companies. The problem is that map data contains errors inherent in the reduced-scale maps. Some of the maps on the market drawn on the scale of 1:25000 contains errors of about 50 meters depending on the location, and the errors vary with digital maps available from those companies.
Latitude/Longitude data obtained from a GPS receiver may contain errors of several tens of meters.
Some models of car-mounted navigation apparatus on the market receive traffic jam information and accident information from a traffic information provision system and display the traffic jam and accident locations on the map or performs route search using such information as additional search conditions.
In a prior traffic information provision system, as shown in
The traffic information collecting center 71 exchanges traffic information with a traffic information collecting center 78 in other areas to collect traffic information in a wide service area including the peripheral areas.
In the traffic information, for example, in case latitude/longitude data on the location is presented alone in order to report a traffic jam location or accident location, various errors are contained depending on the kind of digital map database of the car-mounted navigation apparatus as mentioned earlier. Thus, different locations on the road could be recognized as the accident location by the car-mounted navigation apparatus retaining a digital map database from Company A and the car-mounted navigation apparatus retaining a digital map database from Company B.
In order to alleviate incorrect information transmission, as shown in
Traffic information represents a point on the road by first specifying a link number then the distance in meters from the start of the link. For example, a representation “Location 200 meters from the start of the road with link number=11113333” allows the user to obtain the location P on the same road by tracing the road with link number=11113333 as far as 200 meters from the node with node number 1111, irrespective of what digital map data is used by the car-mounted navigation system in question.
Node numbers and link numbers defined on a road network must be changed to new numbers in case a road d is constructed or a road is modified as shown in
Construction of and modification to a road continue into the future. As long as on-road location representation is made using node numbers and link numbers, maintenance of digital map databases is permanently accompanied by huge workload and resulting costs.
The information delivery center must send information that complies with past node numbers and link numbers for a predetermined period, for example three to five years, as well as the information of the latest year, in order to support navigation systems sold in the past. This causes huge maintenance workload.
In order to solve such problems, the inventor of the invention has proposed a location information transmission method that can report a location on a digital map without excessive maintenance workload (JP2001-041757 A).
In this location information transmission method, an information provider transmits on-road location information by using road shape data consisting of string of coordinates representing the road shape of a road section including the on-road location having a predetermined length and relative data indicating the on-road location in the road section. A party receiving the on-road location information performs shape matching to identify the road section on the digital map and uses relative data to identify the on-road location in this road section.
For example, in case a traffic jam has occurred in the section A to B on the road shown in
The receiving party that has received this information performs shape matching of map data in the digital map database retained by the receiving party and the received map shape data, and identifies the map shape on its own digital map. The receiving party identifies the traffic jam section to be displayed on its digital map based on the distance data from the start point of the road section.
Roads Q, R included within the error range around the P0 (x0, y0) point of map data read from the digital map database 7 are selected as candidates.
Then, locations Q0, R0 on each candidate road closest to P0 (x0, y0) are obtained and distance P0-Q0 and distance P0-R0 are calculated.
This operation is carried out for each point P1(x1, y1), . . . , P600(x600, y600) and the road section where the summation value of the root mean square of the distances from each point P0, P1, . . . , p600 is smallest is obtained.
Then the section l1-l2 meters from the start point of the road section is identified as a traffic jam section.
In this way, it is possible for the receiving party to identify an on-road location without defining node numbers or link numbers, by providing road shape data representing a road shape using a string of coordinates. This location information can be used when traffic information is exchanged between traffic information collecting centers or when traffic information is provided from an FM station or road beacon.
This method is disadvantageous in that it requires location information on a great number of points on the road to be transmitted in order to correctly report the road shape and is consequently accompanied by huge transmit data. Reducing the number of points on the target road could invite erroneous matching at the receiving party.
The invention solves such problems and aims at providing a location information transmission method that can report a road shape by using only a small amount of data in transmitting the road shape by using location information on a plurality of points on the road.
According to the invention, when reporting an on-road location on a digital map, an information provider transmits, as on-road location information, string of coordinates information representing the road shape of a road section including the on-road location having a length that depends on the situation, additional information including at least one information item chosen from a group of the attribute information on the road including the road location and detailed information on the nodes in the road section, and relative information indicating the on-road location in the road section. A party that has received this on-road location information performs shape matching to identify the road section on a digital map and uses the relative data to identify the on-road location in this road section.
In this way, by transmitting additional information together with string of coordinate information, the receiving party can identify the road shape with high accuracy even when only a small amount of string of coordinate data is available. This makes it possible to reduce the amount of data transmissions and identify an on-load location with high accuracy.
A location information transmission method in an embodiment of the invention, information that already exists in a digital map database is used to transmit a road shape to the distant party.
This location information transmission method uses nodes and interpolation points for nodes included in a digital map database, as a plurality of points on a road representing string of coordinates. The nodes are on-road points specified in correspondence with crossings, entrances/exits of tunnels, entrances/exits of bridges and boundaries of administrative districts. The interpolation points are points specified to reproduce the road shape across nodes.
The location information transmission method transmits, as additional information, detailed information on road types, road numbers or crossing nodes that already exists in a digital map database, on top of the string of coordinate information on the nodes and interpolation points.
The road type is information to distinguish between expressways, national highways, and major local highways. The road numbers are numbers assigned to roads, such as National Highway 246. Detailed information on crossing nodes includes the number of crossing links that connect to the node and the angle of crossing links that connect to the node. The number of crossing links of the crossing node P6 in
The additional information includes crossing names used for crossing nodes and information on entrances/exits of tunnels, entrances/exits of bridges and boundaries of administrative districts represented by nodes.
The additional information includes information on the accuracy level of the base map such as data obtained from the map on a scale of 1 to 25,000 or 10,000, in order to provide a standard for accuracy of transmitted information.
In the location information transmission method, from the viewpoint of reducing the data amount, length of a string of node/interpolation point coordinates to be acquired from the periphery of the event location is changed and the coordinates of interpolation points that contribute less to the improvement of accuracy in shape matching are omitted.
Generally, in case the road density is high and a number of roads are running in parallel, the receiving party tends to suffer from erroneous matching thus making it more difficult to perform correct shape matching. Thus, the location information transmission system retrieves the road density of the periphery of the event location and presence/absence of roads running in parallel with the target road when acquiring a string of coordinates of nodes and interpolation point from the periphery of the event location. The method then acquires a longer string of coordinates of node/interpolation point in case erroneous matching is likely to result by also considering the accuracy level of the map, and a shorter node/interpolation point string of coordinates in case erroneous matching is unlikely to result.
Interpolation point omitting processing determines whether the interpolation points are to be omitted in accordance with the omitting conditions that are based on the distance and the angle. An interpolation point is omitted only when the bearing has changed by less than an angle of α (degrees) from the preceding node or interpolation point against the bearing and the distance from the preceding node or interpolation point is less than β (m).
In
In the case of
(Step 21:) For the interpolation point Pn where n=1, (Step 22:) it is determined whether the bearing deviation dn from the preceding interpolation point or node is smaller than α. In case it is smaller than α, (Step 23:) it is determined whether the distance gn from the preceding interpolation point or node is shorter than β. In case it is shorter than β, (Step 24:) the interpolation point Pn is omitted.
(Step 25:) Processing of Step 22 through 24 is repeated for interpolation points Pn where n is incremented by 1.
In case dn is larger than α in Step 22, and in case gn is longer than β, execution proceeds to Step 25 without omitting the interpolation point Pn.
The node string information in
While relative coordinate is represented by using differences from the longitude/latitude of the position P1 in this example, it is possible to represent relative coordinates in difference from the immediately preceding node (for example difference frog Pn−1 in the case of Pn). By doing so, it is possible to further reduce the data amount in the data line information.
The additional information in
The node line information and the additional information are used to set the road shape of a predetermined road section. The relative data is used to set the on-road location in the road section to be identified.
The sending party,
The receiving party
The shape matching can be made using the approach shown in
In this way, according to the location information transmission method, additional information is transmitted so that it is possible for the receiving party to correctly grasp the on-road location on a digital map even when the data amount in the string of coordinates is reduced.
It is of course possible to use some location information represented on a digital map beside traffic information as long as the location information is calculated by using shape matching. The location information transmission method may be also used in the following applications:
As understood from the foregoing description, a location information transmission method according to the invention can correctly transmit the location on a digital map to a distant party without using node numbers or link numbers on a road network. The method transmits additional information as well as node line information. This substantially reduces the amount of data transmission necessary for reporting location information and allows the receiving party to grasp the location quite accurately and quickly.
With this method, it is possible to substantially reduce workload and costs for maintenance of digital map databases thus reducing the social costs for maintaining the traffic information provision system.
Number | Name | Date | Kind |
---|---|---|---|
4807127 | Tenmoku et al. | Feb 1989 | A |
4819175 | Wuttke | Apr 1989 | A |
4893246 | Iihoshi et al. | Jan 1990 | A |
4924699 | Kuroda et al. | May 1990 | A |
4930888 | Freisleben et al. | Jun 1990 | A |
4963864 | Iihoshi et al. | Oct 1990 | A |
4963865 | Ichikawa et al. | Oct 1990 | A |
4982332 | Saito et al. | Jan 1991 | A |
4984168 | Neukrichner et al. | Jan 1991 | A |
5040122 | Neukirchner et al. | Aug 1991 | A |
5046011 | Kakihara et al. | Sep 1991 | A |
5067082 | Nimura et al. | Nov 1991 | A |
5214757 | Mauney et al. | May 1993 | A |
5307278 | Hermans et al. | Apr 1994 | A |
5311195 | Mathis et al. | May 1994 | A |
5375059 | Kyrtsos et al. | Dec 1994 | A |
5442559 | Kuwahara et al. | Aug 1995 | A |
5459667 | Odagaki et al. | Oct 1995 | A |
5488559 | Seymour | Jan 1996 | A |
5742923 | Odagawa | Apr 1998 | A |
5815118 | Schipper | Sep 1998 | A |
5839087 | Sato | Nov 1998 | A |
5848374 | Wakabayashi et al. | Dec 1998 | A |
5862511 | Croyle et al. | Jan 1999 | A |
5874905 | Nanba et al. | Feb 1999 | A |
5899954 | Sato | May 1999 | A |
5908466 | Veugen et al. | Jun 1999 | A |
5928305 | Nomura | Jul 1999 | A |
5948043 | Mathis | Sep 1999 | A |
5995023 | Kreft | Nov 1999 | A |
6002981 | Kreft | Dec 1999 | A |
6006161 | Katou | Dec 1999 | A |
6035253 | Hayashi et al. | Mar 2000 | A |
6038559 | Ashby et al. | Mar 2000 | A |
6061627 | Sato | May 2000 | A |
6108603 | Karunanidhi | Aug 2000 | A |
6115668 | Kaneko et al. | Sep 2000 | A |
6157342 | Okude et al. | Dec 2000 | A |
6188959 | Schupfner | Feb 2001 | B1 |
6230100 | Geier | May 2001 | B1 |
6240368 | Kreft | May 2001 | B1 |
6249740 | Ito et al. | Jun 2001 | B1 |
6278918 | Dickson et al. | Aug 2001 | B1 |
6278928 | Aruga et al. | Aug 2001 | B1 |
6324468 | Meis et al. | Nov 2001 | B1 |
6333703 | Alewine et al. | Dec 2001 | B1 |
6334089 | Hessing | Dec 2001 | B2 |
6345229 | Honkomp et al. | Feb 2002 | B1 |
6356836 | Adolph | Mar 2002 | B1 |
20010001847 | Hessing | May 2001 | A1 |
20010007088 | Winter et al. | Jul 2001 | A1 |
20010012981 | Yamashita et al. | Aug 2001 | A1 |
20010016796 | Ata et al. | Aug 2001 | A1 |
20010029425 | Myr | Oct 2001 | A1 |
20010037177 | Nishida et al. | Nov 2001 | A1 |
Number | Date | Country |
---|---|---|
0 478 438 | Dec 1995 | EP |
0 875 877 | Nov 1998 | EP |
1 022 578 | Jul 2000 | EP |
1 098 168 | May 2001 | EP |
1 102 036 | May 2001 | EP |
1 122 517 | Aug 2001 | EP |
1 167 923 | Jan 2002 | EP |
WO 9827530 | Jun 1998 | WO |
WO 9845724 | Oct 1998 | WO |
WO 9924787 | May 1999 | WO |
WO 9956081 | Nov 1999 | WO |
WO 9956264 | Nov 1999 | WO |
WO 0008616 | Feb 2000 | WO |
WO 0049530 | Aug 2000 | WO |
WO 0050845 | Aug 2000 | WO |
WO 0118768 | Mar 2001 | WO |
WO 0118768 | Mar 2001 | WO |
WO 0118769 | Mar 2001 | WO |
WO 0118769 | Mar 2001 | WO |
WO 0150089 | Jul 2001 | WO |
WO 0150437 | Jul 2001 | WO |
WO 0175838 | Oct 2001 | WO |
WO 0184081 | Nov 2001 | WO |
WO 0204894 | Jan 2002 | WO |
WO 0214788 | Feb 2002 | WO |
WO 0216874 | Feb 2002 | WO |
Number | Date | Country | |
---|---|---|---|
20030154019 A1 | Aug 2003 | US |