A Method of Calculating the Shortest Car-seeking Path in the Parking Lot

Abstract

A method for calculating the shortest vehicle finding path in a parking lot comprises the following steps: (1) making a map of a parking lot, marking parking space points, path points, a vehicle finding point and an elevator point, and determining the names; (2) describing the connection relationship among the path points, the vehicle finding point and the elevator point; (3) connecting all the path points in each layer to form line segments, calculating the vertical distances from each parking space point to the line segments, taking the line segment with the shortest vertical distance from the parking space point as the nearest line segment of the parking space point, and recording the horizontal and vertical coordinates of the vertical point; (4) calculating the shortest path from the vehicle finding point to the elevator point; and (5) calculating the shortest path from the vehicle finding point and the elevator point to the vertical points of the parking space points, calculating the sum of distances of the connection line segments between the vehicle finding point and the parking space points, wherein the vehicle finding path with the shortest distance is the shortest vehicle finding path. The advantage lies in that through calculation of the shortest path from the vehicle finding point to the parking space points, artificial workload is reduced, accuracy is ensured, and the problem of shortest path calculation for same-floor and cross-floor vehicle finding is solved.

Description

technical field [0001] The invention relates to the field of reverse car search systems in parking lots, in particular to a method for calculating the shortest car search path in a parking lot. Background technique [0002] In the prior art, the reverse car-finding system in the parking lot adopts a technical solution of manually drawing the car-finding point to the parking spot in advance to calculate the shortest path. When the end user needs to find a car, only the drawn shortest car-finding path is displayed. However, this so-called "shortest path" is the shortest path that the mappers think, not the path with the shortest actual distance, so the results drawn by different mappers are also different, which is extremely unscientific. When there are a large number of car search points and parking spaces, pre-drawing the shortest car search path becomes a huge workload, and it is prone to errors, and it cannot solve the problem of cross-floor car search, which reduces the c...

AI Technical Summary

Problems solved by technology

However, this so-called "shortest path" is the shortest path that the mappers think, not the path with the shortest actual distance, so the results drawn by different mappers are not the same, which is extremely unscientific

When there are a large number of car search points and parking spaces, pre-drawing the shortest car search path becomes a huge workload, and it is prone to errors, and it cannot solve the problem of cross-floor car search, which reduces the car search efficiency of car search products. and product image, which is not conducive to the effective promotion and use of products

Images