Incremental map generation, refinement and extension with GPS traces

• US 9,322,660 B2
• Filed: 10/22/2009
• Issued: 04/26/2016
• Est. Priority Date: 10/22/2009
• Status: Active Grant

• Current Assignee: Tomtom Global Content B.V (TomTom NV)
• Original Assignee: TomTom Germany Gmbh & Co. Kg. (TomTom NV)
• Inventors: Mund, Heiko
• Primary Examiner(s): Algahaim, Helal A
• Assistant Examiner(s): WALLACE, DONALD JOSEPH
• Application Number:
  US13/503,429
• Publication Number:
  US 20120277993A1
• Time in Patent Office: 2,378 Days
• Field of Search: 701446-450, 701/532, 701/533, 340/995.14
• US Class Current: 1/1
• CPC Class Codes: G01C 21/32 Structuring or formatting of map data
• CPC Class Codes: G01C 21/3811 Point data, e.g. Point of Interest [POI]
• CPC Class Codes: G01C 21/3841 Data obtained from two or more sources, e.g. probe vehicles
• CPC Class Codes: G01C 21/3844 Data obtained from position sensors only, e.g. from inertial navigation
• CPC Class Codes: G09B 29/106 using electronic means

Abstract

A method for improving and extending an existing road network and generating new networks from statistically relevant amounts of probe data recorded by GPS-enabled navigation devices. New probe data is matched to the existing digital vector map, then the data merged into the existing network using a weighted mean technique. When new roads are detected, appropriate junction points are made with the existing network elements. The updated network data is simplified to improve computing speed and reduce data storage requirements.

Claims

1. A computer-implemented method for generating, refining and extending digital vector maps using GPS traces from probe data, comprising:

providing, by a processor, a digital vector map having a plurality of nodes spatially associated within a coordinate system, each node having at least one line segment extending therefrom;

associating, by the processor, each line segment in the digital vector map with a weight value, wherein the weighting of each line segment is based on a number of previous probe traces associated with each line segment;

collecting, by the processor, at least one GPS trace from a plurality of sequentially transmitted probe data points;

establishing, by the processor, a map matching criteria;

comparing, by the processor, each probe data point along the GPS trace to at least one line segment in the digital vector map using the map matching criteria;

designating, by the processor, as “

matched”

each probe data point along the GPS trace that meets the map matching criteria while designating as “

unmatched”

each probe data point along the GPS trace that fails the map matching criteria;

associating, by the processor, the portion of the GPS trace containing matched probe data points to the respective line segment(s) of the digital vector map;

computing, by the processor, a centre-line between the respective line segment and the portion of the GPS trace containing matched probe data points using the weight value of the line segment;

replacing, by the processor, the line segment through the centre-line; and

creating, by the processor, a new line segment in the digital vector map with the portion of the GPS trace containing unmatched probe data points;

the method further comprising the steps of;

determining, by the processor, a split point based on the last matched probe data point and a projected point on the line segment of the digital vector map by projecting a last matching probe point to a closet point on a respective line segment associated with the last matching probe point;

splitting, by the processor, the digital vector map by providing a new node at this point; and

connecting, by the processor, the new node with the next node in the digital vector map.

2. The method of claim 1 further including simplifying the updated digital vector map.

3. The method of claim 1 wherein said step of simplifying the updated digital vector map includes applying the Douglas-Peucker algorithm.

4. The method of claim 1 wherein the digital vector map is a unidirectional network.

5. The method of claim 1 wherein the digital vector map is a bidirectional network.

6. The method of claim 1 further comprising computing attributes of the updated digital vector map.

7. The method of claim 6, wherein said step of computing attributes includes computing a road class of the line segments.

8. The method of claim 1 further including removing line segments from the digital vector map which have a weight value below a predetermined threshold value in a post-processing operation.

9. The method of claim 1, wherein the designation is based on a calculated offset distance between each probe data point and the respective line segment.

10. The method of claim 1 further comprising providing the digital vector map to one or more navigation system to assist in at least one navigation service.

11. The method of claim 2, wherein the projection uses a calculated weighted mean.

12. A non-transitory computer-readable medium which stores a set of instructions which when executed performs a method for generation, refining and extending digital vector maps using GPS traces from probe data, the method executed by the set of instructions comprising:

providing a digital vector map having a plurality of nodes spatially associated within a coordinate system, each node having at least one line segment extending therefrom;

associating each line segment in the digital vector map with a weight value, wherein the weighting of each line segment is based on a number of previous probe trace associated with each line segment;

collecting at least one GPS trace from a plurality of sequentially transmitted probe data points;

establishing a map matching criteria;

comparing each probe data point along the GPS trace to at least one line segment in the digital vector map matching criteria;

designating as “

matched”

each probe data point along the GPS trace that meets the map matching criteria while designating as “

unmatched”

each probe data point along the GPS trace that fails the map matching criteria;

associating the portion of the GPS trace containing matched probe data points to the respective line segment(s) of the digital vector map;

computing a centre-line between the respective line segment and the portion of the GPS trace containing matched probe data points using the weight value of the line segment;

replacing the line segment through the centre-line; and

creating a new line segment in the digital vector map with the portion of the GPS trace containing unmatched probe data points;

the method further comprising the steps of;

determining a split point based on the last matched probe data point and a projected point on the line segment of the digital vector map by projecting a last matching probe point to a closet point on a respective line segment associated with the last matching probe point;

splitting the digital vector map by providing a new node at this point; and

connecting the new node with the next node in the digital vector map.

13. The computer-readable medium of claim 12 further comprising providing the digital vector map to one or more navigation systems to assist in at least one navigation service.

14. The computer-readable medium of claim 12, wherein the projection uses a calculated weighted mean.

15. A non-transitory computer-readable medium which stores a set of instructions which when executed performs a method for generating, refining and extending digital vector maps using GPS traces from probe data, the method executed by the set of instructions comprising:

providing a digital vector map having a plurality of nodes spatially associated within a coordinate system, each node having at least one line segment extending therefrom;

associating each line segment in the digital vector map with a weight value, wherein the weighting of each line segment is based on a number of previous probe traces associated with each line segment;

collecting at least one GPS trace from a plurality of sequentially transmitted probe data points;

establishing a map matching criteria;

comparing each probe data point along the GPS trace to at least one line segment in the digital vector map using the map matching criteria;

designating as “

matched”

each probe data point along the GPS trace that meets the map matching criteria while designating as “

unmatched”

each probe data point along the GPS trace that fails the map matching criteria;

associating the portion of the GPS trace containing matched probe data points to the respective line segment(s) of the digital vector map;

computing a centre-line between the respective line segment and the portion of the GPS trace containing matched probe data points using the weight value of the line segment;

replacing the line segment through the centre-line; and

creating a new line segment in the digital vector map with the portion of the GPS trace containing unmatched probe data points;

determining a split point based on the last matched probe data point and a projected point on the line segment of the digital vector map by projecting a last matching probe point to a closest point on a respective line segment associated with the last matching probe point;

splitting the digital vector map by providing a new node at this point; and

connecting the new node with the next node in the digital vector map.