Traffic routing based on segment travel time

• US 20070038362A1
• Filed: 08/24/2006
• Published: 02/15/2007
• Est. Priority Date: 03/05/2002
• Status: Active Grant

• Current Assignee: Uber Technologies, Inc.
• Original Assignee: Triangle Software LLC (Pelmorex, Inc.)
• Inventors: Gueziec, Andre
• Granted Patent: US 7,375,649 B2
• Time in Patent Office: Days
• US Class Current: 701/117
• CPC Class Codes: G01C 21/30 Map- or contour-matching
• CPC Class Codes: G01C 21/3407 specially adapted for specific applications
• CPC Class Codes: G01C 21/3492 employing speed data or traffic data, e.g. real-time or historical traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G01C 21/36 Input/output arrangements for on-board computers
• CPC Class Codes: G01C 21/3694 Output thereof on a road map
• CPC Class Codes: G06N 5/04 Inference or reasoning models
• CPC Class Codes: G08G 1/0125 Traffic data processing
• CPC Class Codes: G08G 1/0129 for creating historical data or processing based on historical data
• CPC Class Codes: G08G 1/093 Data selection, e.g. prioritizing information, managing message queues, selecting the information to be output
• CPC Class Codes: G08G 1/0967 Systems involving transmission of highway information, e.g. weather, speed limits transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G08G 1/096716 where the received information does not generate an automatic action on the vehicle control
• CPC Class Codes: G08G 1/096741 where the source of the transmitted information selects which information to transmit to each vehicle
• CPC Class Codes: G08G 1/09675 where a selection from the received information takes place in the vehicle
• CPC Class Codes: G08G 1/096775 where the origin of the information is a central station
• CPC Class Codes: G08G 1/096816 where the complete route is transmitted to the vehicle at once
• CPC Class Codes: G08G 1/096822 where the segments of the route are transmitted to the vehicle at different locations and times
• CPC Class Codes: G08G 1/096827 where the route is computed onboard
• CPC Class Codes: G08G 1/096866 where the complete route is shown to the driver
• CPC Class Codes: G08G 1/096888 where input information is obtained using learning systems, e.g. history databases
• CPC Class Codes: H04B 1/3822 specially adapted for use in vehicles H04B1/3827 takes precedence
• CPC Class Codes: H04W 4/025 : using location based information parameters
• CPC Class Codes: H04W 4/029 : Location-based management or tracking services

Abstract

A system for identifying a fastest possible travel route is disclosed. A traveler data processor collects traffic speed data and associates the traffic speed data with road segments. The road segments collectively represent one or more possible travel routes from a start point to an end point. A forecast engine determines a predicted travel time for each of the road segments based on, for example, the traffic speed data for each of the road segments. A routing engine determines the fastest possible travel route from the start point to the end point. The fastest possible travel route is the possible travel route from the one or more possible travel routes with the shortest predicted travel time.

Claims

1. A system for identifying a fastest possible travel route, comprising:

a traveler data processor configured to collect traffic speed data and associate the traffic speed data with a plurality of road segments, the plurality of road segments collectively representing one or more possible travel routes from a start point to an end point;

a forecast engine configured to determine a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments; and

a routing engine configured to determine the fastest possible travel route from the start point to the end point, wherein the fastest possible travel route is the possible travel route from the one or more possible travel routes with the shortest predicted travel time.

2. The system of claim 1, wherein the routing engine is further configured to determine the fastest possible travel route from the start point to the end point via the one or more waypoints, wherein the one or more waypoints are points between the start point and the end point.

3. The system of claim 2, wherein the one or more waypoints comprises a mile marker.

4. The system of claim 2, wherein the one or more waypoints comprises a cross street.

5. The system of claim 2, wherein the one or more waypoints comprises a landmark.

6. The system of claim 2, wherein the one or more waypoints comprises a city.

7. The system of claim 1, wherein the routing engine is further configured to determine a fastest possible return route.

8. The system of claim 7, wherein the fastest possible return route is automatically generated from at least the start point and the end point.

9. The system of claim 1, wherein the routing engine is further configured to determine whether the predicted travel time for the fastest possible travel route exceeds a threshold based on the forecast engine subsequently calculating predicted travel time for the fastest possible travel route based on at least real-time traffic speed data collected by the traveler data processor.

10. The system of claim 9, wherein the routing engine is further configured to determine a next fastest possible travel route if the fastest possible travel route as originally determined by the routing engine is no longer the fastest possible travel route in light of at least the real-time traffic speed data.

11. The system of claim 9, wherein a publishing engine is configured to generate an alert in response to a determination by the routing engine that the predicted travel time for the fastest possible route exceeds the threshold.

12. The system of claim 10, wherein a publishing engine is configured to identify the next fastest possible travel route to the user.

13. The system of claim 1, wherein the traffic speed data associated with each of the plurality of road segments is further associated with a particular time interval for each of the plurality of road segments.

14. The system of claim 13, wherein the forecast engine is further configured to determine a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments in conjunction with a particular time interval.

15. The system of claim 14, wherein the traveler data processor is further configured to associate traffic speed data with each of the plurality of road segments in conjunction with a particular time interval.

16. The system of claim 15, wherein the particular time interval comprises an expected time at which a user will reach each of the plurality of road segments.

26. The system of claim 1, wherein the forecast engine is further configured to determine traffic delays by subtracting a reference travel time from the shortest predicted travel time.

17. A method for identifying a fastest possible travel route, comprising:

receiving an identification of at least a start point and an end point;

collecting traffic speed data and associating the traffic speed data with a plurality of road segments, the plurality of road segments collectively representing one or more possible travel routes from the identified start point to the identified end point;

determining a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments;

determining the fastest possible travel route from the identified start point to the identified end point, wherein the fastest possible travel route is the possible travel route from the one or more possible travel routes with the shortest predicted travel time; and

identifying the fastest possible travel route to a user.

18. The method of claim 17, further comprising:

determining whether the predicted travel time for the fastest possible travel route exceeds a threshold;

determining a next fastest possible travel route if the fastest possible travel route as originally determined is no longer the fastest possible travel route;

generating an alert in response to the determination that the predicted travel time for the fastest possible route exceeds the user-specified threshold; and

identifying the next fastest possible travel route to the user.

19. The method of claim 17, further comprising:

associating the traffic speed data with each of the plurality of road segments and further associating the traffic speed data with a particular time interval for each of the plurality of road segments;

determining a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments in conjunction with a particular time interval; and

associating traffic speed data with each of the plurality of road segments in conjunction with a particular time interval, wherein the particular time interval comprises an expected time at which a traveler will reach each of the plurality of road segments.

20. A computer-readable medium having embodied thereon a program, the program being executable by a processor to perform a method for identifying a fastest possible travel route, comprising:

receiving an identification of at least a start point and an end point from a user;

collecting traffic speed data and associating the traffic speed data with a plurality of road segments, the plurality of road segments collectively representing one or more possible travel routes from the identified start point to the identified end point;

determining a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments;

determining the fastest possible travel route from the identified start point to the identified end point, wherein the fastest possible travel route is the possible travel route from the one or more possible travel routes with the shortest predicted travel time;

identifying the fastest possible travel route to the user;

determining whether the predicted travel time for the fastest possible travel route exceeds a user-specified threshold;

determining a next fastest possible travel route if the fastest possible travel route as originally determined is no longer the fastest possible travel route;

generating an alert in response to a determination that the predicted travel time for the fastest possible route exceeds the user-specified threshold; and

identifying the next fastest possible travel route to the user.

21. A computer-readable medium having embodied thereon a program, the program being executable by a processor to perform a method for identifying a fastest possible travel route, comprising:

receiving an identification of at least a start point and an end point from a user;

collecting traffic speed data and associating the traffic speed data with a plurality of road segments, the plurality of road segments collectively representing one or more possible travel routes from the identified start point to the identified end point;

associating the traffic speed data with each of the plurality of road segments and further associating the traffic speed data with a particular time interval for each of the plurality of road segments;

determining a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments in conjunction with a particular time interval;

associating traffic speed data with each of the plurality of road segments in conjunction with a particular time interval, wherein the particular time interval comprises an expected time at which a traveler will reach each of the plurality of road segments;

determining a predicted travel time for each of the plurality of road segments based on at least the traffic speed data for each of the plurality of road segments;

determining the fastest possible travel route from the identified start point to the identified end point, wherein the fastest possible travel route is the possible travel route from the one or more possible travel routes with the shortest predicted travel time; and

identifying the fastest possible travel route to the user.

22. A system for identifying traffic delays, comprising:

a traveler data processor configured to collect traffic data, the traffic data including traffic speed data, the traveler data processor further configured to associate the traffic speed data with one or more road segments;

a forecast engine configured to determine a predicted travel time for each of the one or more road segments based on at least a first set of the traffic speed data associated with each of the one or more road segments, the forecast engine further configured to determine whether the application of a second set of the traffic speed data to the one or more road segments causes an increase in the predicted travel time for at least one of the one or more road segments; and

a publishing engine configured to generate a traffic delay indication in response to a determination by the forecast engine that the application of the second set of traffic speed data to the one or more road segments causes an increase in the predicted travel time for at least one of the one or more road segments.

23. The system of claim 22, wherein the traffic delay indication is an SMS message describing the traffic delay.

24. The system of claim 22, wherein the traffic delay indication is a coloration of a visual representation of the one or more road segments in a user interface.

25. The system of claim 22, wherein the traffic delay indication is a text box in a user interface, the text box describing the traffic delay.