Travel time determination

• US 20080065318A1
• Filed: 09/12/2006
• Published: 03/13/2008
• Est. Priority Date: 09/12/2006
• Status: Active Grant

• Current Assignee: DDS Wireless International Incorporated (Ghai Investments Ltd)
• Original Assignee: DDS Wireless International Incorporated (Ghai Investments Ltd)
• Inventors: Ho, William P.C.
• Granted Patent: US 8,036,822 B2
• Time in Patent Office: Days
• US Class Current: 701/201
• CPC Class Codes: G01C 21/3407 specially adapted for specific applications

Abstract

The present invention relates to travel time determination, for example, determining a predicted travel time between locations based on historical data. One aspect of the invention is directed toward a method for determining a predicted amount of time required to travel from one location to another that includes dividing a region into multiple grid portions and designating each grid portion that contains at least one address of interest as a departure grid, a destination grid, or both. The method can further include generating a searchable data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids, and updating the travel times using historical data.

Claims

1. A method in a computer system for determining a predicted amount of time required to travel from one location to another, the method comprising:

maintaining a searchable data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids, each selected departure grid and each selected destination grid being associated with at least one address of interest in a region;

receiving historical data that includes actual amounts of time that have been required to travel from selected departure grids to selected destination grids; and

updating the travel times using the historical data.

2. The method of claim 1 wherein maintaining a searchable data arrangement includes maintaining a searchable three-dimensional data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids during selected time periods.

3. The method of claim 1 wherein updating the travel times using historical data includes:

filtering the collected data to exclude data collected under abnormal circumstances; and

updating the travel times using the filtered data.

4. The method of claim 1 wherein maintaining a searchable data arrangement includes maintaining a searchable data arrangement wherein the selected departure grids and the selected destination grids (a) are expected to require no more than a selected amount of time to transit, (b) include a special condition, or (c) both (a) and (b).

5. The method of claim 1, further comprising:

receiving a command to search the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest;

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid and the selected destination grid.

6. The method of claim 1 wherein maintaining a searchable data arrangement includes maintaining a searchable three-dimensional data arrangement that includes travel times associated with traveling from departure grids to destination grids during different time periods, and wherein the method further comprises:

receiving a command to search the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest during a selected time period;

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid, the selected destination grid, and the selected time period.

7. The method of claim 1, further comprising:

receiving a command to search the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest;

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid and the selected destination grid, wherein determining the travel time associated with the selected departure grid and the selected destination grid includes adjusting the travel time by an operational factor.

8. The method of claim 1, further comprising:

determining if transit times within or through one or more of the departure grids and destination grids is less than or greater than a selected amount of time, and if so

combining the one or more of the monitored grids into a single new grid, dividing the one or more of the monitored grids into multiple new grids, or both.

9. A computer-readable medium containing instructions for controlling a computing environment to perform a method comprising:

maintaining a searchable data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids, each selected departure grid and each selected destination grid being associated with at least one address of interest in a region;

receiving historical data that includes actual amounts of time that have been required to travel from selected departure grids to selected destination grids; and

updating the travel times using the historical data.

10. The computer-readable medium of claim 9, wherein the method further comprises:

receiving a command to search the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest;

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid and the selected destination grid.

11. The computer-readable medium of claim 9, wherein the method further comprises:

determining if transit times within or through one or more of the departure grids and destination grids is less than or greater than a selected amount of time, and if so

combining the one or more of the monitored grids into a single new grid, dividing the one or more of the monitored grids into multiple new grids, or both.

12. A method for determining a predicted amount of time required to travel from one location to another, comprising:

dividing a region into multiple grid portions;

designating each grid portion that contains at least one address of interest as a departure grid, a destination grid, or both;

generating a searchable data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids; and

updating the travel times using historical data.

13. The method of claim 12 wherein generating a searchable data arrangement includes generating a searchable three-dimensional data arrangement that includes travel times associated with traveling from selected departure grids to selected destination grids during selected time periods.

14. The method of claim 12 wherein updating the travel times with historical data includes updating the travel times with actual amounts of time that have been required to travel from selected departure grids to selected destination grids.

15. The method of claim 12 wherein updating the travel times using historical data includes:

collecting data that includes actual amounts of time that have been required to travel from selected departure grids to selected destination grids;

filtering the collected data to exclude data collected under abnormal circumstances; and

updating the travel times using the filtered data.

16. The method of claim 12 wherein dividing a region into multiple grid portions includes (a) dividing a portion of a region into multiple grid portions that are expected to require no more than a selected amount of time to transit, (b) dividing a portion of a region into multiple grid portions based on special conditions, or (c) both (a) and (b).

17. The method of claim 12, further comprising searching the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest, wherein searching the data arrangement comprises:

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid and the selected destination grid.

18. The method of claim 12 wherein generating a searchable data arrangement includes generating a searchable three-dimensional data arrangement that includes travel times associated with traveling from departure grids to destination grids during different time periods, and wherein the method further comprises searching the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest during a selected time period, wherein searching the data arrangement comprises:

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid, the selected destination grid, and the selected time period.

19. The method of claim 12, further comprising searching the data arrangement to determine a predicted travel time from a first address of interest to a second address of interest, wherein searching the data arrangement comprises:

determining a selected departure grid in which the first address is located;

determining a selected destination grid in which the second address of interest is located; and

determining the travel time associated with the selected departure grid and the selected destination grid, wherein determining the travel time associated with the selected departure grid and the selected destination grid includes adjusting the travel time by an operational factor.

20. The method of claim 12, further comprising:

determining if transit times within or through one or more of the departure grids and destination grids is less than or greater than a selected amount of time, and if so

combining the one or more of the monitored grids into a single new grid, dividing the one or more of the monitored grids into multiple new grids, or both.

21. The method of claim 12 wherein updating the travel times includes updating the travel times using at least one of a statistical technique, a learning process, an adaptive process, and/or a predictive process.

22. The method of claim 12, further comprising searching the data arrangement to determine a first predicted travel time from a first address of interest to a second address of interest during a selected time period, wherein the first predicted travel time is different than a second predicted travel time, the second predicted travel time being associated in the data arrangement with travel from the second address of interest to the first address of interest during the selected time period.

23. The method of claim 12 wherein updating the travel times with historical data includes updating the travel times with an actual amount of time that has been required to travel from at least one first address in a selected departure grid to at least one second address in a selected destination grid.