Traffic probe in-vehicle map-based process to reduce data communications and improve accuracy

• US 8,260,532 B2
• Filed: 06/27/2007
• Issued: 09/04/2012
• Est. Priority Date: 06/27/2007
• Status: Active Grant

• Current Assignee: GM Global Technology Operations LLC (General Motors Company)
• Original Assignee: GM Global Technology Operations LLC (General Motors Company)
• Inventors: Roesser, Robert P.
• Primary Examiner(s): Mawari, Redhwan K
• Application Number:
  US11/769,000
• Publication Number:
  US 20090005958A1
• Time in Patent Office: 1,896 Days
• Field of Search: 701/117, 701/118, 701/119, 701/408, 701/422, 340/995.13, 340/933, 340/988, 340/907
• US Class Current: 701/117
• CPC Class Codes: G08G 1/0104 Measuring and analyzing of parameters relative to traffic conditions
• CPC Class Codes: G08G 1/20 Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles

Abstract

A system and method for combining sequential map segments to aggregate, analyze, and display traffic data collected from one or more probe vehicles located on one or more segments of road are provided. Vehicle travel data generation and storage are provided by a data processing center, partitioning a road into a plurality of connected segments, and calculating an estimate of the time required for a probe vehicle to traverse a particular segment. The calculations are performed by a processor that may be on-board the probe vehicle, and the resulting data are transmitted to the processing center, at which they are aggregated and optionally transmitted to one or more subscriber vehicles.

Claims

1. A method of acquiring and storing data useful for generating traffic information, the method comprising:

combining a plurality of sequential map segments associated with a first street to provide a superlink, said superlink extending between an intersection with a second street and an intersection with a third street, wherein said plurality of sequential map segments are located between the intersection with the second street and the intersection with the third street, wherein combining a plurality of sequential map segments includes;

identifying a set of map segments, wherein each map segment of the set of map segments is associated with a through street, and wherein each through street has a name;

sorting the set of map segments according to the names of their respective through streets, and identifying, for each through street name, a subset of map segments associated with the through street name;

determining, for each map segment of each subset of map segments, a longitude range including a beginning longitude and an ending longitude, and a latitude range, including a beginning latitude and an ending latitude;

identifying one or more nodes at which each subset of map segments intersects all other subsets of map segments, resulting in a plurality of nodes;

sorting the plurality of nodes by the larger of the longitude range or the latitude range of each map segment associated with one or more nodes of the plurality of nodes; and

determining, for each pair of adjacent nodes of the plurality of nodes, the plurality of map segments extending between the pair of adjacent nodes, and combining the plurality of map segments;

configuring a processing center, said processing center comprising;

a computing device, comprising a memory;

a wireless transmitter connected to said computing device; and

a wireless receiver connected to said computing device;

providing a plurality of probe vehicles, wherein each of said probe vehicles are traveling on map segments of said superlink, said probe vehicles each comprising;

a global positioning system unit;

an on-board data processor;

an on-board vehicle speed sensor connected to said processor;

a wireless transmitter connected to said processor;

partitioning the map segments upon which said probe vehicles are traveling into a plurality of connected segments;

assigning each particular connected segment a unique identifier name;

selecting the particular connected segment on which each particular vehicle is traveling from said plurality of connected segments;

determining an estimate of the time required for each vehicle to traverse a particular selected connected segment upon which it travels;

transmitting data that comprises said unique identifier name and time required for each vehicle to traverse each of such particular connected segments to said processing center; and

storing said data in said memory.

2. The method according to claim 1 wherein partitioning the map segments is performed in an on-board processor of a probe vehicle.

3. The method according to claim 1 wherein selecting a particular connected segment from the plurality of connected segments is performed in an on-board processor of a probe vehicle.

4. The method according to claim 1 wherein determining an estimate of the time required for each vehicle to traverse a particular connected segment upon which it travels is performed by calculation in the on-board processor of a probe vehicle.

5. The method according to claim 4 wherein said calculation includes:

identifying the beginning and end points of a given connected segment;

determining the length of said given connected segment;

sampling position and motion data of the vehicle at a plurality of points disposed between the beginning and end points of said given connected segment;

determining a first sample point which is closest to the beginning point of said connected segment;

determining a second sample point which is closest to the end point of said connected segment;

calculating the distance between the first and second sample points;

computing the difference between the timestamps of the first and second sample points to arrive at a travel time; and

multiplying the travel time by the ratio of the length of said connected segment to the distance between the first and second sample points.

6. The method according to claim 4 wherein said calculation includes:

identifying the beginning and end points of a given connected segment;

determining the length of said given connected segment;

sampling position and speed data at a plurality of points disposed between the beginning and end points of said given connected segment;

calculating an average speed by averaging the speed recorded at each sample point along the particular connected segment; and

calculating the time required for traversing said connected segment by dividing the length of said segment by said average speed.

7. The method according to claim 4, wherein combining the plurality of sequential map segments includes:

identifying the second street and the third street which intersect the first street, wherein the plurality of sequential map segments are located between the intersections; and

combining the plurality of sequential map segments located between the intersections.

8. The method according to claim 7, wherein at least the first street is a through street.

9. The method according to claim 8, wherein the second and third streets are through streets.

10. The method according to claim 4, wherein combining the plurality of sequential map segments includes:

identifying the plurality of sequential map segments associated with the first street and extending between an intersection with a second street and an intersection with a third street; and

combining the plurality of sequential map segments.