A parking lot parking management method, system, device and computer storage medium

Abstract

The application relates to the technical field of parking management, in particular to a parking lot parking management method, system and device and a storage medium. The method comprises the following steps: obtaining entering information of a target vehicle entering a parking lot area; calculating a first parking density of the parking lot area, and dividing the parking lot area into a plurality of subareas based on the first parking density; calculating second parking densities of the plurality of subareas, and determining first priorities of the plurality of subareas based on the second parking densities; obtaining a required driving distance of the target vehicle driving to an empty parking space in the subarea based on the first priority sequence of the subarea; setting a second priority of the empty parking space based on the required driving distance; and outputting a parking scheduling result of the target vehicle based on the second priority sequence of the empty parking space. The application has the effect of uniformly distributing the parking density in each subarea in the parking lot area and reducing the occurrence of congestion and collision of vehicles.

Description

Technical Field

[0001] This application relates to the field of parking management technology, and in particular to a parking lot management method, system, equipment and storage medium. Background Technology

[0002] With the rapid development of society and the economy, cars have increasingly become a common means of transportation for ordinary families. While cars bring time-saving, convenience, and comfort, parking has become a daily concern for many car owners. Parking spaces are designated areas for parking, divided into outdoor and indoor spaces. Outdoor parking spaces offer the advantages of saving space and usage costs, but the disadvantage is that the vehicle is exposed and lacks protection. Therefore, indoor parking spaces in residential communities, office buildings, and shopping mall parking garages can help car owners solve their parking problems.

[0003] With existing technologies, indoor parking spaces, due to their small footprint and high utilization rate, often require drivers to actively search for available spaces, which is inconvenient. Furthermore, congestion can easily occur when many vehicles enter or leave the garage, increasing the risk of collisions and scrapes between vehicles.

[0004] Therefore, based on the above problems, the existing technology still needs to be improved. Summary of the Invention

[0005] The purpose of this application is to provide a parking management method, system, equipment and storage medium, which aims to solve the problems of reducing congestion and easy collisions between vehicles when a large number of vehicles enter or leave the parking area.

[0006] The purpose of this application is to provide a parking management method for a parking lot, including:

[0007] Obtain entry information of the target vehicle into the parking area;

[0008] Calculate the first parking density of the parking area, and based on the first parking density, divide the parking area into several sub-areas;

[0009] Calculate the second parking density of several sub-regions, and determine the first priority of several sub-regions based on the second parking density;

[0010] Based on the first priority order corresponding to the sub-region, the required driving distance for the target vehicle to reach an empty parking space within the sub-region is obtained;

[0011] Based on the required driving distance, a second priority is set for the available parking spaces;

[0012] Based on the second priority order of the available parking spaces, the parking scheduling result for the target vehicle is output.

[0013] By adopting the above technical solution, when a target vehicle enters the parking area, the initial parking density within the parking area is calculated. Based on this initial density, the parking area is rationally divided into several sub-areas. A comparison of the second parking densities across these sub-areas reveals the sub-area with the lowest second parking density. The target vehicle is then reassigned to this sub-area, thus evenly distributing parking density across the sub-areas and reducing the likelihood of congestion and collisions caused by too many vehicles parking or leaving in one sub-area compared to others. Furthermore, by determining the distance the target vehicle needs to travel to all available parking spaces within that sub-area, the shortest available parking space is identified, allowing the vehicle owner to easily and conveniently find a suitable parking space and improving parking efficiency.

[0014] In one possible implementation of this application, the steps of calculating a first parking density of the parking area and dividing the parking area into several sub-areas based on the first parking density include:

[0015] Obtain the total number of first-time parked parking spaces and the total number of first-time parking spaces within the parking area;

[0016] The first parking density is calculated based on the ratio of the total number of the first parking spaces to the total number of the first parking spaces.

[0017] Based on the first parking density, calculate the number of segmented sub-regions corresponding to the first density;

[0018] Based on the number of sub-regions, the parking area is divided into several sub-regions corresponding to the number of sub-regions.

[0019] By adopting the above technical solution, the total number of parking spaces with vehicles already parked in the parking lot area (the first total number of parked parking spaces) and the total number of parking spaces in the parking lot area that can accommodate vehicles (the first total number of parking spaces) are obtained. The first parking density is calculated by the ratio of the first total number of parked parking spaces to the first total number of parking spaces, which clearly and intuitively reflects the parking situation in the parking lot area. The number of sub-areas that conform to the actual situation is obtained by comparing the first parking density. The parking lot area is divided into a corresponding number of sub-areas according to the number of sub-areas. By monitoring and scheduling the sub-areas, the efficiency of target vehicle parking scheduling is improved.

[0020] In one possible implementation of this application, the steps of calculating a second parking density for a plurality of said sub-regions and determining a first priority for the plurality of said sub-regions based on the second parking density include:

[0021] Obtain the total number of second parked parking spaces and the total number of second parking spaces in each of the sub-regions;

[0022] The second parking density is calculated based on the ratio of the total number of second-already-parked parking spaces to the total number of second-parking spaces;

[0023] Based on the second parking density, several sub-regions are sorted, with the sub-regions corresponding to those with lower second parking densities having higher first priority.

[0024] By adopting the above technical solution, the total number of parking spaces already occupied in the sub-area (the total number of second parked parking spaces) and the total number of parking spaces in the sub-area that can accommodate vehicles (the total number of second parking spaces) are obtained. The second parking density is calculated by the ratio of the total number of second parked parking spaces to the total number of second parking spaces, which clearly and intuitively reflects the parking situation in the sub-area. By comparing the second parking densities among several sub-areas, the sub-area with the lowest second parking density is selected so that the target vehicle can park in that sub-area. This evens out the parking density in each area of ​​the parking lot, reducing the possibility of congestion and collisions between vehicles caused by a relatively large number of vehicles parking or leaving in one sub-area compared to other sub-areas.

[0025] In one possible implementation of this application, the step of obtaining the required driving distance for the target vehicle to reach an empty parking space within the sub-region, based on a first priority order corresponding to the sub-region, includes:

[0026] Obtain the path information from the target vehicle to each available parking space in the sub-region;

[0027] Based on the required travel distance of the target vehicles within the path information, the required travel distances of the target vehicles are sorted, and the second priority of the available parking spaces corresponding to the target vehicles with shorter required travel distances is higher.

[0028] The second priority vacant parking space location information is arranged before the second priority vacant parking space location information.

[0029] By adopting the above technical solution, the path information of the target vehicle moving to each empty parking space in the selected first-priority sub-area is obtained. The required travel distance of the target vehicle is obtained from the path information, and the required travel distances from one or more paths are sorted to quickly and conveniently locate the second-priority empty parking space. The target vehicle can quickly find the empty parking space and park there, thus evenly distributing parking density across different sub-areas of the parking lot, reducing congestion and the risk of minor collisions, and improving parking efficiency for car owners.

[0030] In one possible implementation of this application, the method further includes:

[0031] Determine whether there is any scheduling information for adjacent empty parking spaces within the sub-region that were scheduled within a preset time period;

[0032] If there is scheduling information for adjacent empty parking spaces within the sub-region that were scheduled within a preset time period, then the generation time of the scheduling information for the adjacent empty parking spaces is obtained.

[0033] The scheduling information generation time of adjacent empty parking spaces is compared, and the target vehicle corresponding to the empty parking space with the later scheduling information generation time is re-assigned for parking.

[0034] If the scheduling information for adjacent empty parking spaces within the sub-region does not exist within a preset time period, a scheduling normal prompt message is sent.

[0035] By adopting the above technical solution, when adjacent empty parking spaces are likely to be occupied by vehicles at the same time within a preset time period, the parking scheduling and allocation of the target vehicle corresponding to the empty parking space with the later scheduling information generation time is carried out to reduce the risk of scratches and collisions that may be caused by two target vehicles parking at the same time. This allows car owners to park at different times or in different spaces, reducing parking risks and increasing parking efficiency.

[0036] In one possible implementation of this application, the method further includes:

[0037] Real-time acquisition of vehicle departure flow from several exit lanes in the parking area;

[0038] Compare the vehicle departure flow rates at several of the aforementioned exit channels;

[0039] The vehicle departure dispatch information is generated by arranging the exit channel information with lower vehicle departure traffic before the exit channel information with higher vehicle departure traffic.

[0040] Display the vehicle departure dispatch information of the target vehicle.

[0041] By adopting the above technical solutions, the vehicle departure flow in the exit lanes of the parking area is evenly distributed, making it easier for car owners to leave through the exit lanes effectively, reducing the possibility of congestion when leaving the exit lanes, increasing the flow of traffic within the parking area and thus improving parking efficiency.

[0042] In one possible implementation of this application, the method further includes:

[0043] Acquire the vehicle's driving status at locations outside parking spaces within the parking lot area;

[0044] If the vehicle does not move from the non-parking space location within a preset time, a parking abnormality alert will be sent.

[0045] By adopting the above technical solution, and by monitoring the driving situation of vehicles in non-parking spaces within the parking area, timely feedback can be provided when vehicles are congested in non-parking spaces, thereby improving vehicle flow within the parking area and reducing the possibility of vehicle congestion within the parking area.

[0046] The second objective of this application is to provide a parking lot management system, which includes:

[0047] Entry Information Acquisition Module: Used to acquire entry information of target vehicles entering the parking area;

[0048] First parking density calculation module: used to calculate the first parking density of the parking area, and based on the first parking density, divide the parking area into several sub-areas;

[0049] The second parking density calculation module is used to calculate the second parking density of several sub-regions and, based on the second parking density, determine the first priority of several sub-regions.

[0050] Required driving distance acquisition module: used to acquire the required driving distance for the target vehicle to drive to an empty parking space in the sub-region based on the first priority order corresponding to the sub-region;

[0051] Second priority setting module for vacant parking spaces: used to set the second priority of the vacant parking spaces based on the required driving distance;

[0052] Parking scheduling result output module: used to output the parking scheduling result for the target vehicle based on the second priority order of the available parking spaces.

[0053] By adopting the above technical solution, when a target vehicle enters the parking area, the initial parking density within the parking area is calculated. Based on this initial density, the parking area is rationally divided into several sub-areas. A comparison of the second parking densities across these sub-areas reveals the sub-area with the lowest second parking density. The target vehicle is then reassigned to this sub-area, thus evenly distributing parking density across the sub-areas and reducing the likelihood of congestion and collisions caused by too many vehicles parking or leaving in one sub-area compared to others. Furthermore, by determining the distance the target vehicle needs to travel to all available parking spaces within that sub-area, the shortest available parking space is identified, allowing the vehicle owner to easily and conveniently find a suitable parking space and improving parking efficiency.

[0054] The third objective of this application is to provide a parking lot management device, which includes:

[0055] The system includes a memory and a processor, wherein the memory stores a computer program that can be loaded by the processor and executed as described above for a parking management method.

[0056] The fourth objective of this application is to provide a computer storage medium.

[0057] The fourth objective of this application is achieved through the following technical solution:

[0058] A storage medium storing a computer program capable of being loaded by a processor and executed as described above for parking management.

[0059] In summary, this application includes at least one of the following beneficial technical effects:

[0060] 1. When a target vehicle enters the parking area, the initial parking density is calculated. Based on this density, the parking area is divided into several sub-areas. A comparison of the second parking densities across these sub-areas reveals the sub-area with the lowest density. The target vehicle is then reassigned to this sub-area to ensure even parking density across all sub-areas, reducing the likelihood of congestion and collisions caused by too many vehicles in one sub-area compared to others. Furthermore, the system determines the distance the target vehicle needs to travel to reach all available parking spaces within that sub-area, identifying the shortest available space. This allows the vehicle owner to easily and conveniently find a suitable parking space, improving parking efficiency.

[0061] 2. When adjacent empty parking spaces are likely to be occupied by vehicles at the same time within a preset time period, the parking scheduling is reassigned to the target vehicle corresponding to the empty parking space whose scheduling information was generated later. This reduces the risk of scratches and collisions that may be caused by two target vehicles parking at the same time, allowing car owners to park at different times or in different spaces, reducing parking risks and increasing parking efficiency. Attached Figure Description

[0062] Figure 1 This is a flowchart illustrating a parking management method for a parking lot provided in an embodiment of this application;

[0063] Figure 2 This is a schematic diagram of the virtual structure of a parking management system provided in an embodiment of this application. Detailed Implementation

[0064] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0065] Furthermore, the term "and / or" in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, or B existing alone. Additionally, the character " / " in this article, unless otherwise specified, generally indicates that the preceding and following related objects have an "or" relationship.

[0066] The embodiments of this application will now be described in further detail with reference to the accompanying drawings.

[0067] This application provides a method for detecting and processing anti-spy camera footage, referring to... Figure 1 The main process of the method is described as follows:

[0068] S1: Obtain entry information of the target vehicle into the parking area;

[0069] Specifically, when a target vehicle enters the parking area through the gate outside the parking area, the system obtains the entry information of the target vehicle into the parking area.

[0070] S2: Calculate the first parking density of the parking area, and based on the first parking density, divide the parking area into several sub-areas;

[0071] Once the system receives entry information, it begins calculating the first parking density within the parking area, dividing the parking lot into several sub-areas based on this density. Preferably, the shapes and sizes of these sub-areas can be the same or different, depending on the actual terrain and conditions of the parking area. Each sub-area is a designated parking location within the parking area, containing parking spaces. Locations outside of designated parking spaces within the parking area are not used for calculating the first and second parking densities.

[0072] S3: Calculate the second parking density of several sub-regions, and determine the first priority of several sub-regions based on the second parking density;

[0073] When a parking area is divided into more than one sub-area, the second parking density of all sub-areas is calculated. The first priority among all sub-areas is determined by the second parking density. This allows the system to retrieve the sub-area with the lower second parking density based on the first priority. When a car owner parks the target vehicle in that sub-area, the ratio of the second density among all sub-areas becomes smaller, thus evenly distributing the parking density among the sub-areas in the parking area and reducing the possibility of congestion and collisions.

[0074] S4: Based on the first priority order corresponding to the sub-region, obtain the driving distance required for the target vehicle to drive to an empty parking space in the sub-region;

[0075] Specifically, the system searches for available parking spaces in the highest priority sub-region to obtain the driving distance required for the target vehicle to reach each available parking space in that sub-region. Based on the driving distance required, it determines which available parking space in the highest priority sub-region is closest to the target vehicle, making it easier for the system to identify the location of an available parking space that is convenient for the car owner to park.

[0076] S5: Based on the required driving distance, set the second priority of the available parking space;

[0077] The process involves comparing the required driving distances for moving the target vehicle to each available parking space within a sub-area. The second priority of available parking spaces is determined by the length of the required driving distance. This second priority helps in finding the available parking space with the shortest parking route for the driver, thus improving the driver's parking efficiency.

[0078] S6: Based on the second priority order of the available parking spaces, output the parking scheduling result for the target vehicle.

[0079] When a parking space with the highest second priority is identified, the parking scheduling result for the target vehicle, including the location and route of the parking space, will be displayed on the display terminal within the parking lot area; or the parking scheduling result for the target vehicle will be sent to the target vehicle's terminal through the communication terminal connection channel, so that the car owner can park according to the parking scheduling result.

[0080] Specifically, in some possible embodiments, the step of calculating a first parking density of the parking area and dividing the parking area into several sub-areas based on the first parking density includes:

[0081] Obtain the total number of first-time parked parking spaces and the total number of first-time parking spaces within the parking area;

[0082] The first parking density is calculated based on the ratio of the total number of the first parking spaces to the total number of the first parking spaces.

[0083] Based on the first parking density, calculate the number of segmented sub-regions corresponding to the first density;

[0084] Based on the number of sub-regions, the parking area is divided into several sub-regions corresponding to the number of sub-regions.

[0085] Among them, through monitoring equipment, it was found that there are 120 parking spaces in the parking lot area, and 40 vehicles are already parked. That is, the total number of the first parking spaces in the parking lot area is 40, and the total number of the first parking spaces is 120. According to the ratio of the total number of the first parking spaces to the total number of the first parking spaces, 40 / 120=1 / 3, which is approximately 33%, the calculated first parking density is 33%. The system is pre-defined as follows: when the initial parking density is between 0-20% (inclusive), the number of sub-regions is 12; when the initial parking density is between 20% (exclusive) and 40% (inclusive), the number of sub-regions is 6; when the initial parking density is between 40% (exclusive) and 60% (inclusive), the number of sub-regions is 4; when the initial parking density is between 60% (exclusive) and 80% (inclusive), the number of sub-regions is 3; and when the initial parking density is between 80% (exclusive) and 100% (inclusive), the number of sub-regions is 2. Therefore, when the initial density is 33%, which is greater than 20% and less than 40%, the number of sub-regions is 6. Based on this number, the parking area is divided into 6 sub-regions. The size and shape of these 6 sub-regions can be adjusted according to the actual terrain and management methods of the corresponding parking area. The system can preset division results of 12, 6, 4, 3, and 2 sub-regions. When the number of sub-regions is generated, the system will trigger monitoring and supervision of the division. After the division is completed, the system will monitor and manage each sub-region separately.

[0086] Specifically, in some possible embodiments, the step of calculating a second parking density for several sub-regions and determining a first priority for several sub-regions based on the second parking density includes:

[0087] Obtain the total number of second parked parking spaces and the total number of second parking spaces in each of the sub-regions;

[0088] The second parking density is calculated based on the ratio of the total number of second-already-parked parking spaces to the total number of second-parking spaces;

[0089] Based on the second parking density, several sub-regions are sorted, with the sub-regions corresponding to those with lower second parking densities having higher first priority.

[0090] In this study, each of the six sub-areas has 20 parking spaces. The total number of second-terminated parking spaces and the total number of second-terminated parking spaces in each of the six sub-areas are obtained. Assuming the number of vehicles parked in the first to sixth sub-areas are 10, 6, 2, 4, 7, and 11 respectively, the total number of second-terminated parking spaces in each sub-area is 10, 6, 2, 4, 8, 9, and 1 respectively. The second parking density of each sub-area is calculated as 50%, 30%, 10%, 20%, 35%, and 55% based on the ratio of the total number of second-terminated parking spaces to the total number of second-terminated parking spaces. The sub-areas are then arranged from lowest to highest second parking density as 10% < 20% < 30% < 35% < 50% < 55%. Sub-areas with lower second parking densities have higher first priority, with the third sub-area having the highest first priority and the sixth sub-area having the lowest.

[0091] Specifically, in some possible embodiments, the step of obtaining the required driving distance for the target vehicle to reach an empty parking space within the sub-region, based on the first priority order corresponding to the sub-region, includes:

[0092] Obtain the path information from the target vehicle to each available parking space in the sub-region;

[0093] Based on the required travel distance of the target vehicles within the path information, the required travel distances of the target vehicles are sorted, and the second priority of the available parking spaces corresponding to the target vehicles with shorter required travel distances is higher.

[0094] The second priority vacant parking space location information is arranged before the second priority vacant parking space location information.

[0095] In this process, since the third sub-region has the highest priority, the locations of empty parking spaces in the third sub-region are obtained first, along with the actual location of the target vehicle. Based on the actual location pointing to the empty parking space, the path information from the target vehicle to each empty parking space in the sub-region is obtained. The path information includes the distance the target vehicle needs to travel to the corresponding empty parking space in the third sub-region. Preferably, there are 20-2=18 empty parking spaces remaining in the third sub-region. Let the distances the target vehicle needs to travel to the empty parking spaces be 50m, 53m, 56m, 59m, 62m, 65m, 68m, 71m, 74m; 55m, 58m, 61m, 64m, 67m, 70m, 73m. The distances the target vehicle needs to travel are sorted. The shortest distance is 50m, and the longest is 73m. Therefore, the empty parking space with a distance of 50m has the highest second priority, and the empty parking space with a distance of 73m has the lowest second priority. When the parking scheduling results for the target vehicle are output and displayed, the second priority vacant parking space location information is arranged before the second priority vacant parking space location information, so that the car owner can find the best vacant parking space to park.

[0096] Specifically, in some possible embodiments, the method further includes:

[0097] Determine whether there is any scheduling information for adjacent empty parking spaces within the sub-region that were scheduled within a preset time period;

[0098] If there is scheduling information for adjacent empty parking spaces within the sub-region that were scheduled within a preset time period, then the generation time of the scheduling information for the adjacent empty parking spaces is obtained.

[0099] The scheduling information generation time of adjacent empty parking spaces is compared, and the target vehicle corresponding to the empty parking space with the later scheduling information generation time is re-assigned for parking.

[0100] If the scheduling information for adjacent empty parking spaces within the sub-region does not exist within a preset time period, a scheduling normal prompt message is sent.

[0101] When two target vehicles enter the parking area, the system automatically schedules them to park in adjacent empty parking spaces, generating scheduling information for each space. Since simultaneous parking in adjacent spaces can easily cause congestion and collisions, making parking difficult for drivers, the system retrieves scheduling information for all empty spaces while waiting for a target vehicle. It then determines which empty spaces are adjacent and uses the generation time of the scheduling information for each space. For example, empty space 1's scheduling information is generated at 12:21:55, and empty space 2's at 12:22:20. Because empty space 1's scheduling information is generated earlier than empty space 2's, the target vehicle corresponding to empty space 2 needs to be rescheduled by the system. The target vehicle corresponding to empty space 1 parks according to the scheduling result, and a scheduling success message is sent. The system can be set to wait for a preset time until the target vehicle is parked in empty parking space 1, and then reassign the second target vehicle to empty parking space 2. Alternatively, without waiting for the preset time, empty parking space 2 can be excluded during the reassignment of parking spaces, and the target vehicle can be reassigned to other empty parking spaces using the above methods.

[0102] Specifically, in some possible embodiments, the method further includes:

[0103] Real-time acquisition of vehicle departure flow from several exit lanes in the parking area;

[0104] Compare the vehicle departure flow rates at several of the aforementioned exit channels;

[0105] The vehicle departure dispatch information is generated by arranging the exit channel information with lower vehicle departure traffic before the exit channel information with higher vehicle departure traffic.

[0106] Display the vehicle departure dispatch information of the target vehicle.

[0107] The parking area has several exit lanes for vehicles to leave. Monitoring equipment tracks the vehicle departure flow at each exit lane; for example, exit lane 1 has a flow of 10 vehicles / minute, exit lane 2 has a flow of 20 vehicles / minute, exit lane 3 has a flow of 15 vehicles / minute, and exit lane 4 has a flow of 30 vehicles / minute. The vehicle departure flow rates of the four exit lanes are compared, and the real-time flow rates are displayed on the parking area terminal. Based on the comparison results, exit lane 1 has the lowest flow rate. Therefore, exit lane 1's information is prioritized over exit lanes 2, 3, and 4, which have higher flow rates, generating vehicle departure scheduling information and recommending exit lane 1 as the optimal exit lane for vehicles currently needing to leave.

[0108] Specifically, in some possible embodiments, the method further includes:

[0109] Acquire the vehicle's driving status at locations outside parking spaces within the parking lot area;

[0110] If the vehicle does not move from the non-parking space location within a preset time, a parking abnormality alert will be sent.

[0111] The parking area includes not only parking spaces but also non-parking spaces for vehicles to move between. Vehicles use these non-parking spaces to move to available spaces or leave the parking area. When monitoring equipment detects a vehicle moving in a non-parking space, and the system detects it, if the vehicle does not move within a preset time (e.g., 30 seconds), it is determined that the vehicle is blocking the lane and potentially causing congestion in the parking area. The system will then send a parking anomaly alert to the monitoring center, allowing staff to make timely adjustments and resolve the issue.

[0112] Another embodiment of this application provides a parking management system for a parking lot, wherein, see reference Figure 2 A parking management system, comprising:

[0113] Entry Information Acquisition Module 100: Used to acquire entry information of the target vehicle entering the parking area;

[0114] First parking density calculation module 200: used to calculate the first parking density of the parking area, and based on the first parking density, divide the parking area into several sub-areas;

[0115] Second parking density calculation module 300: used to calculate the second parking density of several sub-regions, and based on the second parking density, determine the first priority of several sub-regions;

[0116] Required driving distance acquisition module 400: used to acquire the required driving distance for the target vehicle to drive to an empty parking space in the sub-region based on the first priority order corresponding to the sub-region;

[0117] Vacant parking space second priority setting module 500: used to set the second priority of the vacant parking space based on the required driving distance;

[0118] Parking scheduling result output module 600: used to output the parking scheduling result for the target vehicle based on the second priority order of the available parking spaces.

[0119] The parking management system provided in this embodiment can achieve the steps of the aforementioned embodiments due to the functions of each module and the logical connections between them. Therefore, it can achieve the same technical effect as the aforementioned embodiments. For the principle analysis, please refer to the relevant description of the steps of the aforementioned parking management method, which will not be repeated here.

[0120] This application also provides a parking management device, including a memory and a processor, wherein the memory stores a computer program that can be loaded by the processor and executed as described above for parking management.

[0121] This application also provides a computer storage medium storing a computer program that can be loaded by a processor and executed as described above for a parking lot management method.

[0122] The computer storage medium provided in this embodiment can achieve the same technical effect as the aforementioned embodiments because the computer program therein, after being loaded and run on the processor, will implement the various steps of the aforementioned embodiments. For the principle analysis, please refer to the relevant description of the aforementioned method steps, which will not be repeated here.

[0123] The storage medium includes, for example, various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0124] The steps of the methods or algorithms described in conjunction with the embodiments disclosed herein can be implemented directly by hardware, a software module executed by a processor, or a combination of both. The software module can be located in random access memory (RAM), main memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.

[0125] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the present invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples. Moreover, without contradiction, those skilled in the art can combine and integrate the different embodiments or examples described in this specification, as well as the features of different embodiments or examples.

[0126] Furthermore, features defined by the terms "first" and "second" may explicitly or implicitly include at least one of those features. In the description of this invention, "a plurality of" means at least two, such as two, three, etc., and unless otherwise explicitly specified, is used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features.

[0127] Therefore, any process or method description in the flowchart or otherwise herein can be understood as representing a module, segment, or portion of code comprising one or more executable instructions for implementing custom logic functions or processes, and the scope of the preferred embodiments of the invention includes additional implementations in which functions may be performed not in the order shown or discussed, including substantially simultaneously or in reverse order depending on the functions involved, as will be understood by those skilled in the art to which embodiments of the invention pertain.

[0128] The embodiments described in this specific implementation are preferred embodiments of this application and are not intended to limit the scope of protection of this application. Therefore, all equivalent changes made in accordance with the structure, shape and principle of this application should be covered within the scope of protection of this application.

Claims

1. A parking lot management method, characterized in that, include: Obtain entry information of the target vehicle into the parking area; Calculate the first parking density of the parking area, and divide the parking area into several sub-areas based on the first parking density. Specific steps include: obtaining the total number of first parked parking spaces and the total number of first parking spaces within the parking area; calculating the first parking density based on the ratio of the total number of first parked parking spaces to the total number of first parking spaces; calculating the number of sub-areas corresponding to the first parking density; and dividing the parking area into several sub-areas corresponding to the number of sub-areas based on the number of sub-areas. Calculate the second parking density of several sub-regions, and determine the first priority of several sub-regions based on the second parking density; Based on the first priority order corresponding to the sub-region, the required driving distance for the target vehicle to reach an empty parking space within the sub-region is obtained; Based on the required driving distance, a second priority is set for the available parking spaces; Based on the second priority order of the available parking spaces, the parking scheduling result for the target vehicle is output.

2. The parking management method for a parking lot according to claim 1, characterized in that, The steps of calculating a second parking density for several sub-regions and determining a first priority for several sub-regions based on the second parking density include: Obtain the total number of second parked parking spaces and the total number of second parking spaces in each of the sub-regions; The second parking density is calculated based on the ratio of the total number of second-already-parked parking spaces to the total number of second-parking spaces; Based on the second parking density, several sub-regions are sorted, with the sub-regions corresponding to those with lower second parking densities having higher first priority.

3. The parking management method for a parking lot according to claim 2, characterized in that, Based on the first priority order corresponding to the sub-region, the steps for obtaining the required driving distance for the target vehicle to reach an empty parking space within the sub-region include: Obtain the path information from the target vehicle to each available parking space in the sub-region; Based on the required travel distance of the target vehicles within the path information, the required travel distances of the target vehicles are sorted, and the second priority of the available parking spaces corresponding to the target vehicles with shorter required travel distances is higher. The second priority vacant parking space location information is arranged before the second priority vacant parking space location information.

4. A parking lot management method according to claim 3, characterized in that, The method further includes: Determine whether there is any scheduling information for adjacent empty parking spaces within the sub-region that were scheduled within a preset time period; If there is scheduling information for adjacent empty parking spaces within the sub-region that were scheduled within a preset time period, then the generation time of the scheduling information for the adjacent empty parking spaces is obtained. The scheduling information generation time of adjacent empty parking spaces is compared, and the target vehicle corresponding to the empty parking space with the later scheduling information generation time is re-assigned for parking. If the scheduling information for adjacent empty parking spaces within the sub-region does not exist within a preset time period, a scheduling normal prompt message is sent.

5. A parking lot management method according to claim 1, characterized in that, The method further includes: Real-time acquisition of vehicle departure flow from several exit lanes in the parking area; Compare the vehicle departure flow rates at several of the aforementioned exit channels; The vehicle departure dispatch information is generated by arranging the exit channel information with lower vehicle departure traffic before the exit channel information with higher vehicle departure traffic. Display the vehicle departure dispatch information of the target vehicle.

6. A parking lot management method according to claim 1, characterized in that, The method further includes: Acquire the vehicle's driving status at locations outside parking spaces within the parking lot area; If the vehicle does not move from the non-parking space location within a preset time, a parking abnormality alert will be sent.

7. A parking management system, characterized in that, include: Entry Information Acquisition Module: Used to acquire entry information of target vehicles entering the parking area; The first parking density calculation module is used to calculate the first parking density of the parking area and, based on the first parking density, divide the parking area into several sub-areas. Specific steps include: obtaining the total number of first-time parked parking spaces and the total number of first-time parking spaces within the parking area; calculating the first parking density based on the ratio of the total number of first-time parked parking spaces to the total number of first-time parking spaces; calculating the number of sub-areas corresponding to the first parking density; and dividing the parking area into several sub-areas corresponding to the number of sub-areas based on the number of sub-areas. Second parking density calculation module: used to calculate the second parking density of several sub-regions, and based on the second parking density, determine the first priority of several sub-regions; Required driving distance acquisition module: used to acquire the required driving distance for the target vehicle to drive to an empty parking space in the sub-region based on the first priority order corresponding to the sub-region; Second priority setting module for vacant parking spaces: used to set the second priority of the vacant parking spaces based on the required driving distance; Parking scheduling result output module: used to output the parking scheduling result for the target vehicle based on the second priority order of the available parking spaces.

8. A parking lot management device, characterized in that, include: The memory and processor, wherein the memory stores a computer program capable of being loaded by the processor and executing any one of the parking management methods of claims 1-6.

9. A computer storage medium, characterized in that, The computer program is stored and can be loaded by a processor to execute any one of the parking management methods of claims 1-6.

Images