METHOD AND PROCESS TO ENSURE THAT A VEHICULAR TRAVEL PATH RECORDING THAT INCLUDES POSITIONAL ERRORS CAN BE USED TO DETERMINE A RELIABLE AND REPEATABLE ROAD USER CHARGE

• US 20090157566A1
• Filed: 11/12/2008
• Published: 06/18/2009
• Est. Priority Date: 03/21/2006
• Status: Abandoned Application

• Current Assignee: Skymeter Corporation
• Original Assignee: Skymeter Corporation
• Inventors: Grush, Bernard
• Application Number:
  US12/269,730
• Publication Number:
  US 20090157566A1
• Time in Patent Office: Days
• US Class Current: 705/400
• CPC Class Codes: G01C 21/28 with correlation of data from several navigational instruments
• CPC Class Codes: G01S 19/14 specially adapted for specific applications
• CPC Class Codes: G01S 19/22 Multipath-related issues
• CPC Class Codes: G01S 19/42 Determining position
• CPC Class Codes: G06Q 30/0283 Price estimation or determination
• CPC Class Codes: G07B 15/02 taking into account a variable factor such as distance or time, e.g. for passenger transport, parking systems or car rental systems G07B15/06 takes precedence; taximeters G07B13/00; parking meters per se G07F17/24; car rental systems per se G07B15/00
• CPC Class Codes: G07B 15/063 using wireless information transmission between the vehicle and a fixed station identification of vehicles G08G
• CPC Class Codes: G07C 5/008 communicating information to a remotely located station transmission systems for measured values G08C

Abstract

The invention relates to a system and a method for addressing three problems:

• (A) generate a tollpath of consistent length by determining one of a possible set of paths which are all the same length in cell-count every time the same journey is taken,
• (B) determine a consistent price for each tollpath by setting pre-determined values on those cells such that every possible path variant of a specific journey produces the same toll, and
• (C) determine the correct price for each tollpath by adjusting prices in each cell to account for the exact distance actually represented (some roads pass through a cell parallel to the cell edges and some pass through at an angle) so that the toll calculated exactly matches the toll that would be calculated had the exact linear, analogue distance been measured on the actual road.

Claims

1. A method of tracking the position of an object that is moving or stationary, comprising the steps of:

receiving positioning data with respect to the object'"'"'s position in timed intervals;

calculating a position estimate and associated error bound for each timed interval based upon the received positioning data;

fitting each calculated position estimate and associated error bound to a grid of cells;

calculating a maximum-likelihood path of travel based upon the position estimates and associated error bounds and designating a cell as a path element if the maximum-likelihood path of travel crosses that cell; and

thinning the path, except at start and end points, by removing path elements such that each 2×

2 group of cells along the path that initially has three or four path elements has at least two but no more than three path elements, whilst ensuring that each path element remains 8-connected to at least two path elements to produce a recorded travel path with no breaks.

2. The method according to claim 1, wherein each 2×

2 group of cells along the path is thinned to have exactly two path elements, except at the start and end points of the path.

3. The method according to claim 1, wherein calculating the maximum likelihood path comprises attributing to each cell the portion of each error bound that overlaps the cell and summing for each cell all of the portions attributed to that cell.

4. The method according to claim 3, wherein calculating the maximum likelihood path comprises an optimization technique selected from the group of:

peak-following, hill climbing and the like.

5. The method according to claim 3, wherein calculating the maximum likelihood path comprises removing path elements if the summed error bounds for that cell do not pass a threshold.

6. The method according to claim 1, further comprising the steps of:

generating a pricing grid by assigning a price to each cell on the grid; and

summing the prices of each path element on the recorded travel path to calculate a total cost for the recorded travel path.

7. The method according to claim 6, wherein each cell within a region of the grid is assigned the same price.

8. The method according to claim 6, wherein generating a pricing grid comprises:

providing a digital map;

aligning the map with the grid of cells; and

translating a desired price per unit distance traveled into a price per grid cell on the basis of the aligned map and grid of cells.

9. The method according to claim 8, wherein the price for each grid cell is determined on the basis of the length of a tolled road within that cell, preferably in an automated manner by the use of a vector-based digital map.

10. The method according to claim 8, wherein the price for each grid cell is determined on the basis of a length of a tolled road segment divided by the number of cells that are traversed by that segment, apportioning the total price for that segment evenly over that number of cells.

11. The method according to claim 10, wherein the length of tolled road segment comprises a distance between two road access points.

12. The method according to claim 1, wherein the thinning step is carried out only on 2×

2 groups of cells in which the path elements are in sufficient temporal proximity.

13. A system for tracking the position of an object that is moving or stationary, comprising:

a receiver for receiving positioning data with respect to the object'"'"'s position in timed intervals; and

a processor for;

calculating a position estimate and associated error bound for each timed interval based upon the received positioning data;

fitting each calculated position estimate and associated error bound to a grid of cells;

calculating a maximum-likelihood path of travel based upon the position estimates and associated error bounds and designating a cell as a path element if the maximum-likelihood path of travel crosses that cell; and

thinning the path, except at start and end points, by removing path elements such that each 2×

2 group of cells along the path that initially has three or four path elements has at least two but no more than three path elements, whilst ensuring that each path element remains 8-connected to at least two path elements to produce a recorded travel path with no breaks.

14. The system according to claim 13, wherein the processor is for thinning each 2×

2 group of cells along the path, except at the start and end points, to have exactly two path elements.

15. The system according to claim 13, wherein the processor is for calculating the maximum likelihood path by attributing to each cell the portion of each error bound that overlaps the cell and summing for each cell all of the portions attributed to that cell.

16. The method according to claim 15, wherein the processor is for calculating the maximum likelihood path by an optimization technique selected from the group of:

peak-following, hill climbing and the like.

17. The system according to claim 15, wherein the processor is for calculating the maximum likelihood path by removing path elements if the summed error bounds for that cell do not pass a threshold.

18. The system according to claim 13, wherein the processor is for thinning only 2×

2 groups of cells in which the path elements are in sufficient temporal proximity.

19. The system according to claim 13, comprising an on-board component, including the receiver, processor and a wireless communication device, installed on the object;

and a datacentre component remote and in wireless communication with the on-board component.

20. The system according to claim 19, wherein the datacentre is for storing a pricing grid and receiving the recorded travel path, for calculating a toll for the recorded travel path.