Concepts for defining travel paths in parking areas

• US 9,020,761 B2
• Filed: 04/10/2014
• Issued: 04/28/2015
• Est. Priority Date: 03/12/2013
• Status: Active Grant

• Current Assignee: United Parcel Service Of America Incorporated (United Parcel Service Incorporated)
• Original Assignee: United Parcel Service Of America Incorporated (United Parcel Service Incorporated)
• Inventors: Davidson, Mark J.
• Primary Examiner(s): Marc, McDieunel
• Application Number:
  US14/249,518
• Publication Number:
  US 20140278101A1
• Time in Patent Office: 383 Days
• Field of Search: 701/533, 701/23, 701/400, 701/532, 318/443, 318/444, 188/79.54, 404/17, 340/932.2
• US Class Current: 701/533
• CPC Class Codes: G01C 21/32 Structuring or formatting of map data
• CPC Class Codes: G01C 21/34 Route searching; Route guidance

Abstract

Computer program products, methods, systems, apparatus, and computing entities are provided for defining travel paths in parking areas. In one embodiment, travel paths in parking areas can be defined by connecting street networking connection points within the parking areas. In another embodiment, such defined travel paths can be merged with actual paths traveled by vehicles in the parking areas.

Claims

1. A method for defining travel paths in parking areas, the method comprising:

identifying, by one or more processors, one or more street network connection points for a parking area, the one or more street network connection points providing the ability to enter the parking area from a street network, exit the parking area to the street network, or both;

defining, by the one or more processors, a first set of one or more travel paths in the parking area by connecting the one or more street network connection points in the parking area;

defining, by the one or more processors, a second set of one or more travel paths in the parking area by identifying one or more paths traversed by one or more vehicles in the parking area based at least in part on telematics data collected while the one or more vehicle were traversing the parking area; and

merging, by the one or more processors, the first set of one or more travel paths with the second set of one or more travel paths.

2. The method of claim 1 further comprising:

identifying a known obstruction in the parking area; and

removing travel paths defined in the parking area that overlap with the known obstruction.

3. The method of claim 2, wherein removing the travel paths defined in the parking area that overlap with the known obstruction further comprises removing travel paths defined in the parking area that are within a configurable distance of the known obstruction.

4. The method of claim 3 further comprising representing the travel paths defined in the parking area in the digital map.

5. The method of claim 1, wherein defining the first set of travel paths in the parking area by connecting the one or more street network connection points in the parking area further comprises defining travel paths in the parking area using one selected from the group consisting of a grid, a lattice, and a matrix.

6. The method of claim 5, wherein each of the first set of travel paths of the grid, lattice, or matrix is defined at a configurable distance from one another.

7. A computer program product for defining travel paths in parking areas, the computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising:

an executable portion configured to identify one or more street network connection points for a parking area, the one or more street network connection points providing the ability to enter the parking area from a street network, exit the parking area to the street network, or both;

an executable portion configured to define a first set of one or more travel paths in the parking area by connecting the one or more street network connection points in the parking area;

an executable portion configured to define a second set of one or more travel paths in the parking area by identifying one or more paths traversed by one or more vehicles in the parking area based at least in part on telematics data collected while the one or more vehicle were traversing the parking area; and

an executable portion configured to merge the first set of one or more travel paths with the second set of one or more travel paths.

8. The computer program product of claim 7 further comprising:

an executable portion configured to identify a known obstruction in the parking area; and

an executable portion configured to remove travel paths defined in the parking area that overlap with the known obstruction.

9. The computer program product of claim 8, wherein removing the travel paths defined in the parking area that overlap with the known obstruction further comprises removing travel paths defined in the parking area that are within a configurable distance of the known obstruction.

10. The computer program product of claim 9 further comprising an executable portion configured to represent the travel paths defined in the parking area in the digital map.

11. The computer program product of claim 7, wherein defining the first set of travel paths in the parking area by connecting the one or more street network connection points in the parking area further comprises defining travel paths in the parking area using one selected from the group consisting of a grid, a lattice, and a matrix.

12. The computer program product of claim 11, wherein each of the first set of travel paths of the grid, lattice, or matrix is defined at a configurable distance from one another.

13. An apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the processor, cause the apparatus to at least:

identify one or more street network connection points for a parking area, the one or more street network connection points providing the ability to enter the parking area from a street network, exit the parking area to the street network, or both;

define a first set of one or more travel paths in the parking area by connecting the one or more street network connection points in the parking area;

define a second set of one or more travel paths in the parking area by identifying one or more paths traversed by one or more vehicles in the parking area based at least in part on telematics data collected while the one or more vehicle were traversing the parking area; and

merge the first set of one or more travel paths with the second set of one or more travel paths.

14. The apparatus of claim 13, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to:

identify a known obstruction in the parking area; and

remove travel paths defined in the parking area that overlap with the known obstruction.

15. The apparatus of claim 14, wherein removing the travel paths defined in the parking area that overlap with the known obstruction further comprises removing travel paths defined in the parking area that are within a configurable distance of the known obstruction.

16. The apparatus of claim 15, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to represent the travel paths defined in the parking area in the digital map.

17. The apparatus of claim 13, wherein defining the first set of travel paths in the parking area by connecting the one or more street network connection points in the parking area further comprises defining travel paths in the parking area using one selected from the group consisting of a grid, a lattice, and a matrix.

18. The apparatus of claim 17, wherein each of the first set of travel paths of the grid, lattice, or matrix is defined at a configurable distance from one another.