Mapping infrastructure layout between non-corresponding datasets

• US 9,552,372 B2
• Filed: 10/08/2012
• Issued: 01/24/2017
• Est. Priority Date: 10/08/2012
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: O'Sullivan, Shane, Murphy, Liam J., Nesbitt, Pamela A.
• Primary Examiner(s): Perveen, Rehana
• Assistant Examiner(s): Hoffler, Raheem
• Application Number:
  US13/647,056
• Publication Number:
  US 20140101179A1
• Time in Patent Office: 1,569 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: G01C 21/26 specially adapted for navigation in a road network
• CPC Class Codes: G01C 21/30 Map- or contour-matching
• CPC Class Codes: G01C 21/34 Route searching; Route guidance
• 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/3694 Output thereof on a road map
• CPC Class Codes: G06F 16/10 File systems; File servers
• CPC Class Codes: G06F 16/258 Data format conversion from or to a database
• CPC Class Codes: G06F 16/26 Visual data mining; Browsing structured data
• CPC Class Codes: G06F 16/29 Geographical information databases
• CPC Class Codes: G06F 16/34 Browsing; Visualisation therefor
• CPC Class Codes: G06T 11/001 Texturing; Colouring; Generation of texture or colour inpainting G06T5/77
• CPC Class Codes: G06T 11/203 Drawing of straight lines or curves
• CPC Class Codes: G06T 11/206 Drawing of charts or graphs
• CPC Class Codes: G06T 2207/30184 Infrastructure
• CPC Class Codes: G06T 2207/30236 Traffic on road, railway or crossing
• CPC Class Codes: G08G 1/096833 where different aspects are considered when computing the route
• CPC Class Codes: G08G 1/123 indicating the position of vehicles, e.g. scheduled vehicles; Managing passenger vehicles circulating according to a fixed timetable, e.g. buses, trains, tramstransmission of navigation instructions to vehicles G08G1/0968
• CPC Class Codes: H04H 20/55 for traffic information

Abstract

A system or computer usable program product for mapping infrastructure layout between non-corresponding datasets including accessing from a memory a set of long links with points that trace the curvature of a set of linestrings, accessing from the memory a set of short links that are short enough for analytical purposes wherein each short link represents a straight line, and from the set of long links and the set of short links, using a processor to create a set of hybrid links for storage in the memory, each hybrid link corresponding to one short link for analytic purposes, a plurality of the hybrid links including at least one of the points for tracing the curvature of the set of linestrings.

Claims

1. A data processing system for mapping infrastructure layout between non-corresponding traffic datasets, the data processing system comprising:

a processor; and

a memory storing program instructions which when executed by the processor execute the steps of;

accessing from the memory a set of long links with segments that trace a detailed shape of a first set of geospatial linestrings of roadways, each long link having a set of segments, each segment having two points with geospatial coordinates;

accessing from the memory a set of short links that are short enough for traffic analytical purposes wherein each short link has two endpoints with geospatial coordinates that represent a straight line with endpoints that trace a shape of a second set of geospatial linestrings of the roadways, each of the endpoints having geospatial coordinates;

from the set of long links and the set of short links, using the processor to create a set of hybrid links for storage in the memory, each hybrid link having two endpoints corresponding to the two endpoints of one short link for traffic analytic purposes, a plurality of the hybrid links including at least one of the long link segments for tracing the detailed shape of the first set of geospatial linestrings of the roadways, wherein a location of the endpoints of each short link is compared to a location of the segment points of at least one long link to determine for each short link which segment points are located closest to the short link endpoints for inclusion in the corresponding hybrid link, wherein the geospatial coordinates of the endpoints of each short link are compared to the geospatial coordinates of the segment points of at least one long link to determine which segment points are included between the endpoints of the corresponding hybrid link, and wherein the set of hybrid links are created based a distance between geospatial coordinates of long link segment points and short link endpoints, each hybrid link having endpoints of the corresponding short link endpoints and points of the corresponding long link segment points to trace the shape of the first set of geospatial linestrings;

determining whether the segment points located closest to the short link endpoints are within a minimum distance from the short link endpoints; and

upon a negative determination identifying the short link endpoints for manual processing;

receiving traffic information for an endpoint of a first short link of the set of short links;

utilizing the processor to update a corresponding endpoint of a first hybrid link of the set of hybrid links associated with the first short link with the traffic information; and

providing the traffic information of the updated endpoint of the first hybrid link for display to a user.

2. The data processing system of claim 1 wherein a first mapping service uses the set of long links to map the first set of geospatial linestrings of the roadways and a second mapping service uses the set of short links to map the second set of geospatial linestrings of the roadways, so that linestrings from the first and second mapping services can be related by the hybrid links based on geospatial coordinates of the linestrings.

3. The data processing system of claim 1 further comprising normalizing the long link segment points geospatial coordinates with the short links endpoint geospatial coordinate prior to creating the hybrid links.

4. The data processing system of claim 1 wherein traffic information provided for updating a plurality of short links is utilized by the processor to update a plurality of corresponding hybrid links.

5. The data processing system of claim 4 wherein analysis is performed by the processor on a plurality of the short links to generate traffic information results and wherein the traffic information results are utilized by the processing unit to update a plurality of corresponding of hybrid links.

6. The data processing system of claim 4 wherein analysis is performed by the processor directly on the set of hybrid links to predict traffic flow including traffic speed and volume.

7. A computer usable program product comprising a non-transitory computer usable storage medium including computer usable code for use in mapping infrastructure layout between non-corresponding traffic datasets, the computer usable program product comprising code for performing the steps of:

accessing from a memory a set of long links with segments that trace a detailed shape of a first set of geospatial linestrings of roadways, each long link having a set of segments, each segment having two points with geospatial coordinates;

accessing from the memory a set of short links that are short enough for traffic analytical purposes wherein each short link has two endpoints with geospatial coordinates that represent a straight line with endpoints that trace a shape of a second set of geospatial linestrings of the roadways, each of the endpoints having geospatial coordinates;

from the set of long links and the set of short links, using the processor to create a set of hybrid links for storage in the memory, each hybrid link having two endpoints corresponding to the two endpoints of one short link for traffic analytic purposes, a plurality of the hybrid links including at least one of the long link segments for tracing the detailed shape of the first set of geospatial linestrings of the roadway, wherein a location of the endpoints of each short link is compared to a location of the segment points of at least one long link to determine for each short link which segment points are located closest to the short link endpoints for inclusion in the corresponding hybrid link, wherein the geospatial coordinates of the endpoints of each short link are compared to the geospatial coordinates of the segment points of at least one long link to determine which segment points are included between the endpoints of the corresponding hybrid link, and wherein the set of hybrid links are created based a distance between geospatial coordinates of long link segment points and short link endpoints, each hybrid link having endpoints of the corresponding short link endpoints and points of the corresponding long link segment points to trace the shape of the first set of geospatial linestrings;

determining whether the segment points located closest to the short link endpoints are within a minimum distance from the short link endpoints; and

upon a negative determination identifying the short link endpoints for manual processing;

receiving traffic information for an endpoint of a first short link of the set of short links;

utilizing the processor to update a corresponding endpoint of a first hybrid link of the set of hybrid links associated with the first short link with the traffic information; and

providing the traffic information of the updated endpoint of the first hybrid link for display to a user.

8. The computer usable program product of claim 7 wherein a first mapping service uses the set of long links to map the first set of geospatial linestrings of the roadways and a second mapping service uses the set of short links to map the second set of geospatial linestrings of the roadways, so that linestrings from the first and second mapping services can be related by the hybrid links based on geospatial coordinates of the linestrings.

9. The computer usable program product of claim 7 further comprising normalizing the long link segment points geospatial coordinates with the short links endpoint geospatial coordinate prior to creating the hybrid links.

10. The computer usable program product of claim 7 wherein traffic information provided for updating a plurality of short links is utilized by the processor to update a plurality of corresponding hybrid links.

11. The computer usable program product of claim 10 wherein analysis is performed by the processor on a plurality of the short links to generate traffic information results and wherein the traffic information results are utilized by the processing unit to update a plurality of corresponding of hybrid links.

12. The computer usable program product of claim 10 wherein analysis is performed by the processor directly on the set of hybrid links to predict traffic flow-including traffic speed and volume.