IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0795290
(2013-03-12)
|
등록번호 |
US-8655593
(2014-02-18)
|
발명자
/ 주소 |
|
출원인 / 주소 |
- United Parcel Service of America, Inc.
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
23 인용 특허 :
1 |
초록
▼
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, s
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.
대표청구항
▼
1. A method for defining travel paths in parking areas, the method comprising: identifying, via one or more processors, a parking area in which there is at least one travel path for the parking area that is not represented on a digital map;identifying, via the one or more processors, one or more str
1. A method for defining travel paths in parking areas, the method comprising: identifying, via one or more processors, a parking area in which there is at least one travel path for the parking area that is not represented on a digital map;identifying, via the one or more processors, one or more street network connection points for the parking area, the one or more street network connection points providing the ability to at least enter the parking area from or exit the parking area to a street network; anddefining, via the one or more processors, one or more travel paths in the parking area by connecting the one or more street network connection points in the parking area. 2. The method of claim 1 further comprising: identifying a known obstruction in the parking area; andremoving travel paths defined in the parking area that overlap with the known obstructions. 3. The method of claim 2, wherein removing the travel paths defined in the parking area that overlap with the known obstructions further comprises removing travel paths defined in the parking area that are within a configurable distance of the known obstructions. 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 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 travel paths of the grid, lattice, or matrix are defined at a configurable distance from one another. 7. The method of claim 1 further comprising, before defining the one or more travel paths in the parking area, identifying a known obstruction in the parking area so as to not define travel paths that (a) overlap with the known obstruction or (b) are within a configurable distance of the known obstruction. 8. 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 a parking area in which there is at least one travel path for the parking area that is not represented on a digital map;identify one or more street network connection points for the parking area, the one or more street network connection points providing the ability to at least enter the parking area from or exit the parking area to a street network; anddefine one or more travel paths in the parking area by connecting the one or more street network connection points in the parking area. 9. The apparatus of claim 8, 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; andremove travel paths defined in the parking area that overlap with the known obstruction. 10. The apparatus of claim 9, 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. 11. The apparatus of claim 10, 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. 12. The apparatus of claim 8, wherein defining the 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. 13. The apparatus of claim 8, wherein travel paths of the grid, lattice, or matrix are defined at a configurable distance from one another. 14. The apparatus of claim 8, wherein the memory and computer program code are further configured to, with the processor, cause the apparatus to, before defining the one or more travel paths in the parking area, identify a known obstruction in the parking area so as to not define travel paths that (a) overlap with the known obstruction or (b) are within a configurable distance of the known obstruction. 15. 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 a parking area in which there is at least one travel path for the parking area that is not represented on a digital map;an executable portion configured to identify one or more street network connection points for the parking area, the one or more street network connection points providing the ability to at least enter the parking area from or exit the parking area to a street network; andan executable portion configured to define one or more travel paths in the parking area by connecting the one or more street network connection points in the parking area. 16. The computer program product of claim 15 further comprising: an executable portion configured to identify a known obstruction in the parking area; andan executable portion configured to remove travel paths defined in the parking area that overlap with the known obstruction. 17. The computer program product of claim 16, 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. 18. The computer program product of claim 17 an executable portion configured to represent the travel paths defined in the parking area in the digital map. 19. The computer program product of claim 15, wherein defining the 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. 20. The computer program product of claim 15, wherein travel paths of the grid, lattice, or matrix are defined at a configurable distance from one another. 21. The computer program product of claim 15 further comprising an executable portion configured to, before defining the one or more travel paths in the parking area, identify a known obstruction in the parking area so as to not define travel paths that (a) overlap with the known obstruction or (b) are within a configurable distance of the known obstruction.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.