Browse Prior Art Database

A mthod to find the nearest parking spot for customer

IP.com Disclosure Number: IPCOM000245525D
Publication Date: 2016-Mar-15
Document File: 3 page(s) / 59K

Publishing Venue

The IP.com Prior Art Database

Abstract

The disclosure introduce the customer's destination into the methodology to help a customer find the nearest parking spot in a large parking lots. At that spot, the customer could spend the shortest time and least effort to the destination.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 49% of the total text.

Page 01 of 3

A mthod to find the nearest parking spot for customer

Currently, some parking lots are too large for customers to find a suitable parking spot which is near to the elevator they want to use. Some times, customers have to walk a long way to reach the elevator which can directly take him to the target place, but when they walking they find there are some available parking spots that much nearer than the one at which they have just parked their car, this will become more inconvenient when customers come back and taking a lot of things in their hands. With the support of this methodology, customers can find the nearest parking spot even when there are multiple elevators, it will figure out which parking spot is the nearest one for customers to get to the destination.

    Different from the exist solutions, the core idea of this invention is not to find the nearest free parking spot to the Parking Entrance but to the destination of the customers. Thus the customers could walk to the destination with the shortest time and least effort. This is very helpful when there are a lot of stuffs to carry or the parking lot is very huge. So the destination was introduced into this invention. After the free parking spot was found, the system could use some known algorithm like: the ant colony algorithm etc, to find the shortest path from the Parking Entrance to the free parking spot.

    When a car enter a parking lot,the customers should set the destination at the Parking Entrance. The system will use the destination and the information stored in the system including the distance from each exit to the destination, each parking spot's position in the park and status etc to calculate and find the free parking spot which has the lowest weight to the destination.

    Assume there are m elevators or stairs work as exit from the parking lot to the destination(E1, E2, ...,Em). The system store the weight of each exit to the destination. To find the nearest free parking spot, the algorithm will search from the nearest E to find the free parking spot. If there is no free parking spot, the algorithm will increase the search radius until there is a free parking spot was found.

    Given the target place is T. There are m elevators,each elevator is marked as E1, E2, ..., Ey, …, Em. So the distance between Ey and T is D(EyT). For Ey, there are n layer parking spots. We mark the parking spots with 1 car length is P1, the parking spots can be marked as P1, P2, …, Px, .., Pn, the distance between Px and Ey is D(PxEy). For parking spot Px, there is m path between Px and T, each distance is D(PxEy)+D(EyT). This algorithm is to find the x parking spot and its related y elevator to make D(PxEy)+D(EyT) is the minimal.

Given each parking spot, the algorithm work as below: 1. Calculate all D(EyT) and make Ey as sort ascending, that is, D(E1T) < D(E2T) < … < D(EyT) < … < D(EmT)

2. Search free parking spots in P1. If there is one, the x=1, y=1. If no one, continue the following...