Parking lot vehicle guidance method and system

Abstract

The present invention provides a parking lot vehicle guidance method and system, including obtaining relevant information of visitors and interviewees when visitors submit a visit application; creating a geographic information system map of the parking lot and marking the location information of each building; collecting the identity information of the visitor's vehicle entering the parking lot and performing vehicle identification; after confirming the vehicle identity, querying the building location of the interviewee according to the license plate information and searching for the nearest vacant parking space; performing path planning based on the Dijkstra algorithm according to the location of the vacant parking space; displaying guidance information on the information screen of the parking lot for real-time guidance of the vehicle to the designated parking space. The beneficial effect of the present invention is that through accurate map information, real-time information display and optimized path planning, the driver can find a parking space more quickly, avoid traffic congestion in the parking lot, improve the user's parking experience and improve safety.

Description

Technical Field

[0001] The invention belongs to the technical field of vehicle navigation, and in particular relates to a parking lot vehicle guidance method and system. Background Art

[0002] As urbanization accelerates, the contradiction between the surge in the number of vehicles and limited parking resources has become increasingly prominent. Public places such as office buildings, complexes, large shopping malls, hospitals and other areas, parking lots are facing many challenges such as difficulty in finding parking spaces, low parking efficiency, and high management costs. Urban land is tight and parking lot construction is restricted. In the central area of ​​the city, due to the high land price, the cost of parking lot construction has also increased, making parking lot construction more difficult. The planned parking lot construction cannot keep up with the growth rate of vehicles, and there is a serious shortage of parking spaces, especially in some underground parking lots. The planning is very complicated, and car owners often need to spend a lot of time and energy to find parking spaces, which brings great inconvenience. Especially in the underground environment, the network signal is poor, navigation cannot be performed, and it is not clear where to park the car to be most convenient to the destination.

[0003] In order to solve these problems, the intelligent guidance algorithm for vehicles in complex underground parking lots came into being. It uses advanced technical means to provide car owners with a reliable, efficient and convenient parking experience, and also provides parking lot managers with intelligent and refined operations to achieve automated management. The characteristics of the intelligent vehicle guidance algorithm for vehicles in complex underground parking lots are that starting from the time the vehicle passes through the gate, the real-time information screen is used to plan and guide the vehicle's route, and guide it to park in the parking space closest to the target staircase. Summary of the invention

[0004] In order to solve the above technical problems, the present invention provides a parking lot vehicle guidance method and system, which is particularly suitable for quickly guiding visitors to park in a park.

[0005] The technical solution adopted by the present invention is: in the first aspect, a parking lot vehicle guidance method is provided, comprising:

[0006] When a visitor submits a visit application, obtain relevant information about the visitor and the interviewee;

[0007] Create a GIS map of the parking lot and annotate the location of each building;

[0008] Collect vehicle identity information of visitors entering the parking lot and perform vehicle identification;

[0009] After confirming the identity of the vehicle, the respondent’s building location is checked based on the license plate information, and the nearest available parking space is searched;

[0010] According to the location of the vacant parking spaces, the path is planned based on the Dijkstra algorithm;

[0011] Guidance information is displayed on the information screen of the parking lot to guide vehicles to the designated parking spaces in real time.

[0012] Furthermore, path planning based on the Dijkstra algorithm includes the following steps:

[0013] Starting from the initial node, visit the nodes in the map;

[0014] Iteratively check the nodes in the set of nodes to be checked, and add the nodes closest to the node that have not been checked to the set of nodes to be checked;

[0015] The set of nodes expands outward from the initial node until it reaches the target node.

[0016] Furthermore, the Dijkstra algorithm is optimized to achieve the optimal path of guiding in a straight line.

[0017] In a second aspect, a parking lot vehicle guidance system is provided, comprising:

[0018] Visitor management module, used to collect visitor information of visitors and corresponding vehicles;

[0019] The personnel management module is used to record the information of the respondents in the building where the respondents are located;

[0020] Geographic information module, used to create a GIS map of the parking lot and mark the location of each building;

[0021] Route planning module, which is used to receive visitor information, interviewee information and geographic information system map, and plan the driving route through Dijkstra algorithm;

[0022] The guidance information display module is used to display the route planned by the route planning module and the information input by the staff.

[0023] Furthermore, the geographic information module includes:

[0024] Parking lot geographic information unit, used to create a geographic information system map of the parking lot;

[0025] The park building location unit is used to record the location information of the buildings in the park.

[0026] Furthermore, the route planning module includes:

[0027] A parking space acquisition unit is used to acquire the nearest available parking space according to the building location of the respondent;

[0028] The route planning unit plans the driving path through the Dijkstra algorithm.

[0029] Furthermore, the guidance information display module includes:

[0030] An information input unit, used to input information input by staff;

[0031] The display unit is used to display the route planned by the route planning module and the information input by the staff.

[0032] In a third aspect, an electronic device is provided, comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the parking lot vehicle guidance method provided by the present disclosure.

[0033] In a fourth aspect, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable a computer to execute the parking lot vehicle guidance method provided by the present disclosure.

[0034] In a fifth aspect, a computer program product is provided, including a computer program / instruction, which, when executed by a processor, implements the parking lot vehicle guidance method provided by the present disclosure.

[0035] The advantages and positive effects of the present invention are as follows: due to the adoption of the above technical solution, by intelligently managing visiting vehicles, the time for finding parking spaces is reduced, thereby improving the space utilization rate and service quality of the parking lot; through accurate map information, real-time information display and optimized path planning, drivers can find parking spaces more quickly and avoid traffic congestion in the parking lot, thereby improving the user's parking experience and improving safety; automated management and optimized path planning reduce the need for manual intervention, thereby reducing the operating and management costs of the parking lot. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 Schematic diagram of a parking lot vehicle guidance method according to an embodiment of the present invention

[0037] Figure 2 Schematic diagram of a path planning method according to an embodiment of the present invention

[0038] Figure 3 Schematic diagram of the structure of a parking lot vehicle guidance system according to an embodiment of the present invention

[0039] Figure 4 is a schematic diagram of the structure of a geographic information module according to an embodiment of the present invention

[0040] Figure 5 Schematic diagram of the structure of a route planning module according to an embodiment of the present invention

[0041] Figure 6 Schematic diagram of the structure of a guidance information display module according to an embodiment of the present invention DETAILED DESCRIPTION

[0042] The present disclosure is described more fully below with reference to the accompanying drawings, in which exemplary embodiments of the present disclosure are described. The technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are only part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present disclosure.

[0043] like Figure 1 As shown, the present invention provides a parking lot vehicle guidance method, comprising:

[0044] S100, when a visitor submits a visit application, obtain relevant information of the visitor and the interviewee;

[0045] Provide an online or on-site platform for visitors to submit a visit request before they plan to visit. The platform should support multiple ways to enter information, including but not limited to web forms and mobile applications. When a visitor submits a visit request, the system automatically obtains or the visitor provides the following relevant information, including but not limited to the visitor's name, contact information, estimated time of arrival and purpose of visit, as well as relevant information about the interviewee, including but not limited to the interviewee's name, company name and building location,

[0046] S200, creating a geographic information system map of the parking lot and marking the location information of each building;

[0047] The system creates a geographic information system (GIS) map of the parking lot, marking not only the location information of each building, but also the location of specific facilities such as driveways, sidewalks, entrances, exits, disabled parking spaces and charging stations.

[0048] S300, collecting vehicle identity information of visitors entering the parking lot and performing vehicle identification;

[0049] Through the cameras or other identification devices installed at the entrance of the parking lot, the identity information of the visitors' vehicles entering the parking lot is collected, including but not limited to the license plate number, model and color, and the vehicles are identified using image processing and pattern recognition technology.

[0050] S400, after confirming the identity of the vehicle, query the building location of the respondent according to the license plate information and search for the nearest vacant parking space;

[0051] After confirming the identity of the vehicle, the system will query the pre-registered respondent information in the database based on the license plate information, determine the building location of the respondent, and further search for the nearest available parking space, while taking into account the direction of traffic flow and safety regulations.

[0052] S500, performing path planning based on the Dijkstra algorithm according to the location of the vacant parking space;

[0053] S600. Displaying guidance information on an information screen in the parking lot to guide vehicles to designated parking spaces in real time.

[0054] Detailed guidance information, including but not limited to text instructions, arrow instructions and distance display, is displayed on multiple information screens in the parking lot to guide vehicles to designated parking spaces in real time. In addition, navigation services can also be provided to drivers through in-vehicle navigation systems, smartphone applications, etc.

[0055] In one embodiment, if Figure 2 As shown, path planning based on Dijkstra algorithm includes the following steps:

[0056] S501, starting from the initial node, visit the nodes in the map;

[0057] Set the initial node to the current location of the vehicle, set the distance of this node to 0, and set the distances of all other unvisited nodes to infinity. Starting from the initial node, visit the nodes in the map and record the actual distance between each node and its adjacent nodes.

[0058] S502, iteratively checking the nodes in the node set to be checked, and adding the node closest to the node that has not been checked to the node set to be checked;

[0059] Iterate and check the nodes in the set of nodes to be checked. For each node, check whether it has been visited. If it has not been visited, calculate the total distance from the initial node to the node and update the minimum distance of the node. Add the node closest to the current node that has not been checked to the set of nodes to be checked, and repeat the above steps until the target node is found or the set of nodes to be checked is empty.

[0060] S503: The node set expands outward from the initial node until reaching the target node.

[0061] At each iteration, make sure to choose the node with the smallest known distance as the next node to visit, so that the resulting path is the shortest of all possible paths.

[0062] In one embodiment, the Dijkstra algorithm is optimized to achieve the optimum of all paths being able to guide in a straight line.

[0063] Without affecting driving safety, choose straight routes instead of turning as much as possible to reduce unnecessary turns and improve driving efficiency; for situations where turning is necessary, give priority to turning right, as it is generally safer than turning left and requires less waiting time; taking into account the road design inside the parking lot, the system allows the driver to go directly through certain areas instead of detouring when conditions are met, but the premise is to ensure that no safety hazards are caused.

[0064] Adjustments are made at the algorithm level, including adjustments to path cost calculation, graph structure preprocessing, search strategy improvements, and special case handling. Adjustments to path cost calculation include turning penalties, which introduce additional cost factors to represent turning operations, especially left turns. Whenever a path contains a turn, a corresponding penalty value is added to the cost of that section of the path, and the penalty value for left turns can be set higher than that for right turns; straight-ahead rewards, which give a certain cost reduction for each section of the path that can maintain straight-ahead traffic, and encourage the algorithm to give priority to straight-ahead lanes; distance weights, which retain the weights based on the shortest distance in the original Dijkstra algorithm, but combine them with turning penalties and straight-ahead rewards to form a comprehensive path cost function. Graph structure preprocessing includes topological simplification, analyzing the map data of the parking lot, and identifying those cases where the intermediate nodes can be omitted by directly connecting two non-adjacent nodes. If there is one or more continuous straight lanes between two nodes, a new edge can be created in the logic graph to represent this straight path, thereby simplifying the graph structure and reducing unnecessary search space; key node marking, marking key nodes in the parking lot, such as entrances, exits, main intersections, disabled parking spaces, etc., and ensuring that these nodes have priority in path planning. The paths between these key nodes can be pre-calculated and stored for fast retrieval. Improvements in search strategies, including improvements in search strategies, combining the idea of ​​the A* (A-star) algorithm, introducing heuristic estimates based on Dijkstra, such as using Manhattan distance or Euclidean distance as a heuristic function, to help find a path close to the optimal solution faster. The heuristic function should consider the advantages of straight travel, so that the search direction is more inclined to the direction of straight forward; dynamic obstacle avoidance, real-time monitoring of dynamic obstacles in the parking lot (such as temporarily parked vehicles, construction areas, etc.), and avoiding these areas during path planning. When new obstacles are detected, the affected path parts are re-evaluated and the path is adjusted accordingly. Special situation handling, including concurrent requests from multiple vehicles. When multiple vehicles request route planning at the same time, the system should be able to effectively allocate resources to ensure that each vehicle can obtain a personalized optimal route. Batch processing or priority scheduling can be used to manage concurrent requests; emergency response. In order to respond to emergencies (such as traffic accidents, medical emergencies, etc.), the system should reserve emergency channels and be able to quickly adjust route planning when necessary to make way for emergency vehicles; special needs support. Considering the differences in needs of different visitors, such as large vehicles requiring a larger turning radius, disabled people may need parking spaces close to elevators, etc., the system should provide options for users to specify special needs and take them into account in route planning.

[0065] like Figure 3 As shown, in order to facilitate the execution of the vehicle guidance method provided by the present disclosure, the present disclosure also provides a parking lot vehicle guidance system, including:

[0066] Visitor management module 700, used to collect visitor information of visitors and corresponding vehicles;

[0067] The personnel management module 800 is used to record the respondent information of the building where the respondent is located;

[0068] A geographic information module 900 is used to create a geographic information system map of the parking lot and mark the location of each building;

[0069] The route planning module 110 is used to receive visitor information, interviewee information and geographic information system map, and plan the driving route through Dijkstra algorithm;

[0070] The guidance information display module 120 is used to display the route planned by the route planning module 110 and the information input by the staff.

[0071] In one embodiment, if Figure 4 As shown, the geographic information module 900 includes:

[0072] The parking lot geographic information unit 901 is used to establish a geographic information system map of the parking lot;

[0073] The campus building location unit 902 is used to record location information of buildings in the campus.

[0074] In one embodiment, if Figure 5 As shown, the route planning module 110 includes:

[0075] The parking space acquisition unit 111 is used to acquire the nearest vacant parking space according to the building location of the respondent;

[0076] The route planning unit 112 plans the driving route by using the Dijkstra algorithm.

[0077] In one embodiment, if Figure 6 As shown, the guidance information display module 120 includes:

[0078] An information input unit 121, used to input information input by staff;

[0079] The display unit 122 is used to display the route planned by the route planning module 110 and the information input by the staff.

[0080] Based on the embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

[0081] An electronic device includes at least one processor; and a memory connected to the at least one processor in communication; wherein the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the parking lot vehicle guidance method provided by the present disclosure.

[0082] Electronic devices are intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframes, and other suitable computers. Electronic devices may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0083] A non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to enable a computer to execute the parking lot vehicle guidance method provided by the present disclosure.

[0084] Various embodiments of the present disclosure may be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments may include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which may be a dedicated or general programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0085] A computer program product includes a computer program / instruction. When the computer program / instruction is executed by a processor, the parking lot vehicle guidance method provided by the present disclosure is implemented.

[0086] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0087] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0088] The embodiments of the present invention are described in detail above, but the contents described are only preferred embodiments of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made according to the scope of application of the present invention should still fall within the scope of the patent coverage of the present invention.

Claims

1. A parking lot vehicle guidance method, characterized in that: include: When a visitor submits a visit application, obtain relevant information about the visitor and the interviewee; Create a GIS map of the parking lot and annotate the location of each building; Collect vehicle identity information of visitors entering the parking lot and perform vehicle identification; After confirming the identity of the vehicle, the respondent’s building location is checked based on the license plate information, and the nearest available parking space is searched; According to the location of the vacant parking spaces, the path is planned based on the Dijkstra algorithm; Guidance information is displayed on the information screen of the parking lot to guide vehicles to the designated parking spaces in real time.

2. The parking lot vehicle guidance method according to claim 1, characterized in that: Path planning based on Dijkstra algorithm includes the following steps: Starting from the initial node, visit the nodes in the map; Iteratively check the nodes in the set of nodes to be checked, and add the nodes closest to the node that have not been checked to the set of nodes to be checked; The set of nodes expands outward from the initial node until it reaches the target node.

3. The parking lot vehicle guidance method according to claim 2, characterized in that: The Dijkstra algorithm is optimized to achieve the optimal path of all paths being able to guide in a straight line.

4. A parking lot vehicle guidance system, characterized in that: include: Visitor management module, used to collect visitor information of visitors and corresponding vehicles; The personnel management module is used to record the information of the respondents in the building where the respondents are located; Geographic information module, used to create a GIS map of the parking lot and mark the location of each building; Route planning module, which is used to receive visitor information, interviewee information and geographic information system map, and plan the driving route through Dijkstra algorithm; The guidance information display module is used to display the route planned by the route planning module and the information input by the staff.

5. The parking lot vehicle guidance system according to claim 4, characterized in that: The geographic information module includes: Parking lot geographic information unit, used to create a geographic information system map of the parking lot; The park building location unit is used to record the location information of the buildings in the park.

6. The parking lot vehicle guidance system according to claim 4, characterized in that: The route planning module includes: A parking space acquisition unit is used to acquire the nearest available parking space according to the building location of the respondent; The route planning unit plans the driving path through the Dijkstra algorithm.

7. The parking lot vehicle guidance system according to claim 4, characterized in that: The guidance information display module includes: An information input unit, used to input information input by staff; The display unit is used to display the route planned by the route planning module and the information input by the staff.

8. An electronic device, comprising: at least one processor; as well as a memory communicatively connected to at least one processor; wherein, The memory stores instructions that can be executed by at least one processor. The instructions are executed by at least one processor so that the at least one processor can execute the method according to any one of claims 1 to 3.

9. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to make a computer execute the method according to any one of claims 1 to 3.

10. A computer program product comprising a computer program / instructions, which, when executed by a processor, implement the steps of the method according to any one of claims 1 to 3.

Images