Parking reservation method and system, computer equipment and readable storage medium

Abstract

The invention provides a parking reservation method and system, computer equipment and a readable storage medium. The parking reservation method comprises the steps of receiving first reservation information sent by a first client for a first vehicle; in response to second identity information of a second vehicle which detects the access information and is sent by a second client, updating the reservable initial parking space according to second reservation information corresponding to the second identity information to obtain an updated reservable parking space; and according to the first reservation information, selecting a target parking space from the available parking spaces, and returning the target parking space to the first client. According to the method and the device, the available parking spaces are dynamically adjusted according to the actual parking access information, so that the reservation effect of subsequent vehicle reservation is ensured, and the parking management effect in the parking lot is improved.

Description

Parking reservation methods, systems, computer equipment, and readable storage media Technical Field

[0001] This application relates to the field of computer technology, specifically to a parking reservation method, system, computer device, and readable storage medium. Background Technology

[0002] With the continuous increase in car ownership, parking lot management faces many challenges. Traditional parking lot management methods are often inefficient, requiring drivers to spend a lot of time searching for parking spaces, while parking lots also face the problem of low parking space utilization. Summary of the Invention

[0003] Therefore, it is necessary to provide a parking reservation method, system, computer equipment, and readable storage medium to address the aforementioned technical problems and solve the issue of low parking space utilization in related technologies.

[0004] In a first aspect, this application provides a parking reservation method, which is applied on a server side. The method includes: receiving first reservation information sent by a first client for a first vehicle to be reserved; responding to second identity information of a second vehicle sent by a second client indicating that entry and exit information has been detected, updating the initial available parking spaces according to the second reservation information corresponding to the second identity information to obtain updated available parking spaces; selecting a target parking space from the available parking spaces according to the first reservation information, and returning the parking space information of the target parking space to the first client.

[0005] As a feasible embodiment of this application, the step of selecting a target parking space from the available parking spaces based on the first reservation information includes: filtering candidate parking spaces from the available parking spaces whose available time periods include the first preset parking time period based on the first reserved parking time period in the first reservation information and the first available time period label of the available parking spaces; and determining the target parking space from the candidate parking spaces based on the matching degree between the second available time period label of the candidate parking spaces and the first reserved parking time period when there are multiple candidate parking spaces.

[0006] As a feasible embodiment of this application, determining the target parking space from the candidate parking spaces based on the matching degree between the second idle time period of the candidate parking space and the first reserved parking time period includes: determining a first matching degree based on the idle duration in the second idle time period label and the parking duration in the first reserved parking time period; determining a second matching degree based on the idle start and end time in the second idle time period label and the parking start and end time in the first reserved parking time period; and determining the target parking space from the candidate parking spaces based on the first matching degree and / or the second matching degree.

[0007] As a feasible embodiment of this application, before filtering candidate parking spaces whose available time slots include the first preset parking time slot based on the first reserved parking time slot in the first reservation information and the first available time slot label of the available parking space, the method further includes: filtering the available parking spaces based on the demand information in the first reservation information and the demand type label of the available parking space to obtain the filtered available parking spaces; wherein, the demand information includes logistics loading and unloading information and / or charging demand information; the demand type label includes loading and unloading label and / or charging label.

[0008] As a feasible embodiment of this application, updating the available initial parking spaces based on the second reservation information corresponding to the second identity information includes: determining the reserved parking space corresponding to the second vehicle based on the second reservation information corresponding to the second identity information; in response to the second vehicle's entry / exit information being entry information, removing the reserved parking space from the available initial parking spaces to obtain updated available parking spaces; and / or in response to the second vehicle's entry / exit information being exit information, adding the reserved parking space to the available initial parking spaces to obtain updated available parking spaces.

[0009] As a feasible embodiment of this application, before selecting a target parking space from the available parking spaces based on the first reservation information, the method further includes: in response to the first identity information in the first reservation information not being in the target identity list, performing the step of selecting a target parking space from the available parking spaces based on the first reservation information.

[0010] As a feasible embodiment of this application, the method further includes: determining the overtime information of the second vehicle based on the entry and exit time information of the second vehicle and the second preset parking period in the second reservation information; and determining whether to write the second identity information of the second vehicle into the target identity list based on the statistical results of the overtime information of the second vehicle.

[0011] As a feasible embodiment of this application, the method further includes: generating a parking navigation path based on the vehicle location information in the first reservation information and the location information of the target parking space; and returning the parking navigation path to the first client.

[0012] As a feasible embodiment of this application, the method further includes: sending a prompt message to the first client at a target time corresponding to the parking termination time according to the parking termination time in the first reservation information.

[0013] As a feasible embodiment of this application, the method further includes: determining the usability status of each parking space at various times based on the idle time period label of the initial parking space; sending a status switching instruction to the third client corresponding to the first parking space, so as to switch the usability status of the first parking space through a locking mechanism communicating with the third client.

[0014] Secondly, this application provides a parking reservation system, including a server and a first client and a second client communicating with the server; the first client is used to send first reservation information of a first vehicle to be reserved to the server; the second client is used to send second identity information of a second vehicle whose entry and exit information has been detected to the server; the server is used to update the initial available parking spaces according to the second reservation information corresponding to the second identity information to obtain updated available parking spaces, and to select a target parking space from the available parking spaces according to the first reservation information, and return the parking space information of the target parking space to the first client.

[0015] As a feasible embodiment of this application, the system further includes a third client; the server is further configured to determine the availability status of each parking space at each time according to the initial parking space idle time period label, and to send a status switching instruction to the third client; the third client is configured to switch the availability status of the parking space corresponding to the status switching instruction in response to receiving the status switching instruction sent by the server.

[0016] Thirdly, this application also provides a computer device, the computer device comprising: one or more processors; a memory; and one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to implement the parking reservation method provided above.

[0017] Fourthly, this application also provides a computer-readable storage medium storing a computer program, which is loaded by a processor to execute the parking reservation method provided above.

[0018] Fifthly, embodiments of this application provide a computer program product or computer program that includes computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium and executes the computer instructions, causing the computer device to perform the parking reservation method described above.

[0019] In this embodiment, in response to the second identity information of the second vehicle detected by the second client, the second reservation information of the second identity information is used to update the initial available parking spaces to obtain updated available parking spaces. Then, based on the first reservation information of the first vehicle to be reserved, a target parking space can be selected from the updated available parking spaces and returned to the first client. In the actual reservation process, not only the reserved parking information is considered, but the available parking spaces are dynamically adjusted based on the actual parking entry and exit information, thereby ensuring the reservation effect of subsequent vehicle reservations and improving the parking management effect in the parking lot. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0021] Figure 1a is an application scenario diagram of a parking reservation method provided in an embodiment of this application; Figure 1b is a flowchart illustrating the steps of a parking reservation method provided in an embodiment of this application; Figure 1c is an interactive timing diagram of a parking reservation system provided in an embodiment of this application; Figure 2 is a flowchart illustrating the steps of updating parking spaces based on second reservation information provided in an embodiment of this application; Figure 3 is a flowchart illustrating the steps of selecting a target parking space based on first reservation information provided in an embodiment of this application; Figure 4 is a flowchart illustrating the steps of determining a target parking space based on the matching degree between an idle time period tag and a reserved parking time period provided in an embodiment of this application; Figure 5a is a flowchart illustrating the steps of controlling vehicle reservation permissions through an identity list provided in an embodiment of this application; Figure 5b is a timing interaction diagram illustrating vehicle reservation permission control in a parking reservation system provided in an embodiment of this application; Figure 6 is another interactive timing diagram of a parking reservation system provided in an embodiment of this application; Figure 7 is yet another interactive timing diagram of a parking reservation system provided in an embodiment of this application; Figure 8 is a structural schematic diagram of a parking reservation device provided in an embodiment of this application; Figure 9 is a structural schematic diagram of a computer device provided in an embodiment of this application. Detailed Implementation

[0022] 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, and 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.

[0023] In the description of this application, the terms "first" and "second" are 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. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the stated features. In the description of this application, "multiple" means two or more, unless otherwise explicitly specified.

[0024] In the description of this application, the word "for example" is used to mean "used as an example, illustration, or description." Any embodiment described as "for example" in this application is not necessarily to be construed as being more preferred or advantageous than other embodiments. The following description is provided to enable any person skilled in the art to make and use the invention. Details are set forth in the following description for purposes of explanation. It should be understood that those skilled in the art will recognize that the invention can be made without using these specific details. In other instances, well-known structures and processes will not be described in detail to avoid obscuring the description of the invention with unnecessary detail. Therefore, the invention is not intended to be limited to the embodiments shown, but is consistent with the broadest scope of the principles and features disclosed in this application.

[0025] To facilitate understanding of the parking reservation method provided in this application, a description of parking reservation methods in related technologies is first provided. These methods typically rely on users sending a reserved parking time slot to a server in advance. The server then provides parking spaces available for that time slot, and locks the reserved parking time slot so that subsequent requests for the same time slot will ignore already reserved spaces. However, in practical applications, it has been found that due to the irregularity of actual parking times, especially in some park parking lots where many vehicles enter and exit early or late, the related technologies, which only record data for reserved parking times, often result in less than ideal parking lot management, thus affecting the reservation experience for subsequent users.

[0026] To address the aforementioned issues, this application provides a parking reservation method that, during the routine process of receiving the first reservation information of the first vehicle to be reserved, simultaneously responds to the second reservation information of the second vehicle sent by the second client, which detects entry and exit information, to update the initial available parking spaces. This update involves, for example, adding or deleting spaces, thereby obtaining truly feasible available parking spaces. Consequently, when selecting a target parking space from the available spaces based on the first reservation information, more accurate and effective parking space information can be provided to the user. This improves the efficiency of parking space management and enhances the user's parking reservation experience.

[0027] Specifically, please refer to Figure 1a, which is an application scenario diagram of a parking reservation method provided by an embodiment of this application. In this method, a user can interact with the server via a first client, such as a mobile terminal device or a vehicle-mounted system, to complete the entire parking reservation process on the server. The server can be understood as the server of a parking management system, used for parking lot management. Based on this, please refer to Figure 1b, which is a flowchart illustrating the steps of a parking reservation method provided by an embodiment of this application. Specifically, the parking reservation method is applied to the server, such as the server of a parking management service system, for example. In this case, the parking reservation method specifically includes steps S110~S130: S110, receiving first reservation information sent by the first client for the first vehicle to be reserved.

[0028] In this embodiment, the first client can be understood as a client capable of remote communication with the server, used to make parking reservations. Specifically, the first client is typically located on a user's, such as a driver's, mobile terminal device. It can be in the form of an app, mini-program, or web client, although other forms are also possible. This embodiment does not limit the specific usage of the first client. When a user needs to reserve parking services, they can send the first reservation information of the first vehicle to the server through the first client. This first reservation information typically includes the first vehicle's identity information and the reserved parking time slot. To further improve the user's parking experience, the first reservation information may also include other information, such as whether the vehicle needs to load or unload goods, requiring parking in a designated area where loading and unloading is permitted, or whether it needs charging, requiring parking in a parking space with a charging station. The above description is merely one possible explanation of the information that the first reservation information may contain; subsequent embodiments will provide a more detailed explanation of the information included in the first reservation information.

[0029] S120, in response to the second identity information of the second vehicle that detected the entry and exit information sent by the second client, the initial available parking space is updated according to the second reservation information corresponding to the second identity information to obtain the updated available parking space.

[0030] Unlike the conventional method of directly selecting a target parking space that meets the parking needs of the first vehicle after receiving the first reservation information, this embodiment of the application also updates the available parking spaces based on the second identity information of the second vehicle detected by the second client, considering that in actual application scenarios there may be situations where vehicles do not enter or leave on time according to the historical reservation parking period. This results in actually available parking spaces. Typically, the second identity information can exist in the form of the license plate number of the second vehicle. Of course, it is also feasible to use other unique identification information as the identity information of the second vehicle. This embodiment of the application does not impose any restrictions on this.

[0031] Specifically, the second client can generally be understood as a client capable of detecting vehicles entering and exiting parking spaces / parking lots. For example, as a common and feasible implementation, the second client can typically be deployed at the guard booth to identify the second vehicle entering or exiting by detecting images of other vehicles. For instance, the identity information of the second vehicle is sent to the server for processing. Alternatively, the second client can also be deployed at the parking space, for example, by placing a monitoring device at the top of each parking space to identify the second vehicle detected entering or exiting. Of course, in practical applications, the specific form of the second client can be chosen based on actual needs, such as considerations of cost and detection accuracy; this application's embodiments will not elaborate further.

[0032] It is understandable that the information sent to the server, in addition to the second identity information of the second vehicle mentioned above, usually includes entry and exit information, such as exit or entry information, and entry and exit time information. At this time, the implementation of updating the initially available parking spaces also differs depending on the different entry and exit information. Specifically, please refer to Figure 2, which is a flowchart illustrating the steps for updating parking spaces based on the second reservation information provided in this application embodiment. Specifically, it includes steps S210~S230: S210, determining the reserved parking space corresponding to the second vehicle based on the second reservation information corresponding to the second identity information.

[0033] In this embodiment of the application, as can be seen from the foregoing description, the second reservation information corresponding to the second identity information usually refers to the reservation information obtained after the second vehicle makes a parking reservation, including the reserved parking space and the reserved parking time, etc.

[0034] Furthermore, the second vehicle is usually also a parking reservation request sent in advance by the corresponding first client to the server. Therefore, the server usually records the parking space allocation information associated with the second vehicle, that is, the reserved parking space. Of course, the server will also usually record the parking reservation time period of the second vehicle.

[0035] S220, in response to the second vehicle's entry and exit information being entry information, the reserved parking spaces are removed from the initial list of available parking spaces to obtain updated available parking spaces.

[0036] In this embodiment, it can be understood that when the entry / exit information of the second vehicle is entry information, it indicates that the second vehicle has entered the parking lot and will be parked in the reserved parking space assigned to it. Therefore, regardless of whether the current time is within the parking reservation period of the second vehicle, by removing the reserved parking space from the initial available parking spaces, it can be ensured that the reserved parking space is ignored when allocating parking spaces to the first vehicle in the future, so as to avoid parking space allocation conflicts. Of course, if the reserved parking space is not included in the initial available parking spaces, it does not affect the implementation of the embodiment of this application.

[0037] S230, in response to the second vehicle's entry / exit information being exit information, the reserved parking space is added to the list of initially available parking spaces to obtain the updated list of available parking spaces.

[0038] In this embodiment of the application, it is obvious that, corresponding to the above, when the entry and exit information of the second vehicle is exit information, it indicates that the second vehicle has left the parking lot, that is, it has left the reserved parking space assigned to it. At this time, by adding this reserved parking space to the initial parking spaces that can be reserved, the utilization rate of the parking space can be effectively improved in order to avoid parking conflicts, especially in the case of the second vehicle leaving the parking space in advance.

[0039] Specifically, to facilitate understanding of the foregoing, the above implementation scheme will be described below with reference to specific embodiments. Taking a second vehicle reserving to park in parking space A between 3:00 and 4:00 as an example, the server usually records that parking space A is occupied between 3:00 and 4:00. When the second vehicle actually leaves parking space A at 3:30, in related technologies, the occupancy status of the parking space is not updated. As a result, when the first vehicle needs to reserve parking for the period between 3:40 and 4:00, parking space A is not considered as a reservable parking space. However, in the technical solution of this application, since the departure information of the second vehicle is detected at 3:30, the real-time reservable initial parking spaces are updated to obtain an updated list of reservable parking spaces including parking space A. This facilitates the subsequent allocation of parking spaces to the first vehicle, thereby effectively managing the parking lot. Similarly, when it is detected that a second vehicle actually enters parking space A in advance, the initial parking space can be updated, for example, by removing parking space A, to obtain an updated parking space, so as to avoid assigning different vehicles at the same time to parking space A in the future and avoid parking conflicts.

[0040] As can be seen, by following the steps described above, available parking spaces can be selected more accurately, thereby improving the allocation of target parking spaces to the first vehicle.

[0041] S130, based on the first reservation information, select a target parking space from the available parking spaces, and return the parking space information of the target parking space to the first client.

[0042] In this embodiment of the application, after obtaining the updated available parking spaces, based on the first reservation information of the first vehicle, a more suitable target parking space for the first vehicle can be selected from the available parking spaces, and the parking space information of the target parking space is returned to the first client so that the first user of the first client can clearly know the parking space where the first vehicle needs to be parked, thereby completing the entire parking reservation process.

[0043] Of course, in the actual process of selecting a target parking space from the available parking spaces, it is usually necessary to filter based on the relevant information in the first reservation information and the relevant tag information of the available parking spaces. For example, it can be based on the reserved parking time period, or it can be combined with other information. The embodiments of this application will be explained in detail later.

[0044] It is understood that the parking reservation method provided above is usually described using the application on the server side as an example. In fact, the complete parking reservation process starts with the cooperation of the server, the first client and the second client. Therefore, in order to facilitate the understanding of the above content, the following will be combined with a specific parking reservation system to provide an interaction sequence diagram of each terminal running on the parking reservation system. Specifically, please refer to Figure 1c. Figure 1c is an interaction sequence diagram of a parking reservation system provided in the embodiment of this application. The parking reservation system mainly includes a server 140 and a first client 150 and a second client 160 communicating with the server 140. Specifically, it includes the following: (1) When a user needs to reserve parking for the first vehicle in the parking lot, the first identity information of the first vehicle, such as the license plate number, and the reserved parking time period, such as the date and time, will be provided. (1) Information such as time is associated with the first reservation information and sent to the server; (2) The second client, such as the image acquisition device on the side of the guard booth, will detect the vehicle information entering and leaving the parking lot in real time, and send the second identity information and entry and exit time of the second vehicle that has detected the entry and exit information to the server; (3) After receiving the second identity information, the server will update the initial parking space that can be reserved according to the second reservation information corresponding to the second identity information, such as adding the reserved parking space corresponding to the second vehicle that has left, or deleting the reserved parking space corresponding to the second vehicle that has entered, so as to obtain the updated parking space that can be reserved; (4) According to the preset matching rules, such as the association matching degree between the reserved parking space and the first reservation information provided above, the target parking space is selected from the reserved parking space, and then the parking space information of the target parking space is returned to the first client, so as to complete the entire parking reservation process.

[0045] In this embodiment, the initial available parking spaces are updated in response to the second identity information of the second vehicle that has detected entry and exit information sent by the second client, so as to obtain updated available parking spaces. Then, the target parking space can be selected from the updated available parking spaces based on the first reservation information of the first vehicle to be reserved, and returned to the first client. In the actual reservation process, not only the reservation information of the second vehicle is considered, but the available parking spaces are dynamically adjusted based on the actual parking entry and exit information, so as to ensure the reservation effect of the first vehicle and improve the parking management effect in the parking lot.

[0046] Of course, it is understood that the parking reservation method provided above is only one feasible embodiment of this application. In order to further improve the execution effect of the parking reservation method provided above, this application also provides several other feasible embodiments based on the parking reservation method provided above. The following will describe them in conjunction with specific embodiments.

[0047] Specifically, as a further feasible embodiment of this application, selecting a target parking space from the available parking spaces based on the first reservation information can typically be based on the reserved parking time period in the reservation information and the first available time period label of the available parking space. Specifically, please refer to Figure 3, which is a flowchart illustrating the steps of selecting a target parking space based on the first reservation information provided by an embodiment of this application. Specifically, it includes steps S310~S320: S310, based on the first reserved parking time period in the first reservation information and the first available time period label of the available parking space, candidate parking spaces whose available time period includes the first preset parking time period are selected from the available parking spaces.

[0048] In this embodiment of the application, as can be seen from the foregoing description, the first reservation information typically includes the first reserved parking time slot that the first user expects to park the first vehicle in, such as 3 pm to 4 pm tomorrow, 10 am to 12 pm the day after tomorrow, etc. Correspondingly, each available parking space is usually set with an available time slot label. For example, if the time slots of each parking space that have been reserved are removed, the remaining time slots can be understood as the available time slot labels. Obviously, in order to meet the first reserved parking time slot of the first vehicle, it can be understood that, based on the first reserved parking time slot and the first available time slot labels of the available parking spaces, candidate parking spaces whose available time slots include the first preset parking time slot can be selected from the available parking spaces. That is, the first reserved parking time slot must at least be within the first available time slot of the candidate parking space, where the candidate parking space can be understood as the parking space that meets the basic parking requirements of the first vehicle.

[0049] S320, if there are multiple candidate parking spaces, determine the target parking space from the candidate parking spaces based on the matching degree between the second available time period label of the candidate parking space and the first reserved parking time period.

[0050] In this embodiment, it can be understood that when there is only one candidate parking space, that candidate parking space is the target parking space. When there are multiple candidate parking spaces, that is, when multiple parking spaces can meet the parking needs of the first vehicle, the matching degree between the idle time period label and the first reserved parking time period can be further considered to select a more suitable target parking space from the candidate parking spaces. There are various feasible calculation schemes for the matching degree between the second idle time period label and the first reserved parking time period. For example, as a feasible embodiment of this application, in order to improve the occupancy rate of parking spaces, the target parking space can be determined at least based on the matching degree between the idle duration and / or idle start and end time in the idle time period label and the parking duration and / or parking start and end time in the reserved parking time period. Specifically, please refer to Figure 4, which is a flowchart illustrating the steps for determining a target parking space based on the matching degree between the idle time period label and the reserved parking time period provided in this embodiment of the application. Specifically, it includes steps S410~S430: S410, determining the first matching degree based on the idle duration in the second idle time period label and the parking duration in the first reserved parking time period.

[0051] In this embodiment, the idle duration in the second idle time period label can be understood as the duration between the start time and end time of the idle period. For example, for a parking space that is available at 9:00 AM and reserved after 12:00 PM, its idle duration is 3 hours. Similarly, for another parking space that is available from 10:00 AM to 2:00 PM, its idle duration is 4 hours. Correspondingly, the parking duration in the first reserved parking period can be understood as the duration for which the user expects to park the first vehicle. For example, if the first reserved parking period is from 10:00 AM to 12:00 PM, its parking duration is 2 hours. In this case, the first matching degree can usually be determined based on the ratio of parking duration to idle duration. It can be understood that the closer the parking duration is to the idle duration, the higher the first matching degree can be set; conversely, the lower the proportion of parking duration to idle duration, the lower the first matching degree can be set.

[0052] S420, determine the second matching degree based on the start and end times of the idle period in the second idle period label and the start and end times of the parking in the first reserved parking period.

[0053] Unlike the aforementioned method of determining the first matching degree based on parking duration and idle time, this embodiment also determines the second matching degree based on the idle start and end times in the second idle time period label (i.e., the aforementioned idle start time and idle end time) and the parking start and end times in the first reserved parking time period (i.e., the parking start time and parking end time). Specifically, as a feasible implementation, the closer the parking start time is to the idle start time and the closer the parking end time is to the idle end time, the higher the second matching degree can be set. Conversely, the farther the parking start time is from the idle start time and the farther the parking end time is from the idle end time, the lower the second matching degree can be set. Of course, in practical applications, to avoid the parking start time being too close to the idle start time, which could cause the first vehicle to conflict with the previous or next parked vehicle, a certain threshold, such as 10 minutes, can be set for the idle start time and idle end time to better provide users with a parking experience.

[0054] S430, determine the target parking space from the candidate parking spaces based on the first matching degree and / or the second matching degree.

[0055] In this embodiment, based on the two matching degrees of the available time slot labels for the reserved parking period obtained through two different methods, a more accurate target parking space can be determined from the candidate parking spaces by further combining the first matching degree and the second matching degree. For example, as a common and feasible implementation, different weighting coefficients can be configured for the first matching degree and the second matching degree to weight them, thereby determining the target parking space with a higher matching degree from the candidate parking spaces based on the weighted matching degree. Alternatively, the candidate parking spaces can be filtered based on the first matching degree first, and when there are multiple identical first matching degrees, further filtering can be performed based on the second matching degree to obtain the target parking space. Of course, other implementation schemes are also feasible, and will not be elaborated on in this embodiment.

[0056] Of course, the aforementioned solution provides a method for determining the target parking space based on matching information of parking time periods. However, considering that in real-world applications, parked vehicles may have different other needs, the first reservation information for the first vehicle sent by the first client can also include other requirement information. For example, as a common and feasible solution, there is often a need for logistics loading and unloading information in the park's parking lot. For instance, if the first vehicle needs to be parked and used for loading and unloading goods, it is usually required to park the first vehicle in a parking space near the cargo terminal. Similarly, the vehicle may also have charging needs, in which case it is usually required to park the first vehicle in a parking space near the cargo terminal. In parking spaces equipped with charging stations, before selecting candidate parking spaces whose available time slots include the first preset parking time slot based on the first reserved parking time slot and the first available time slot label of the available parking space in the first reservation information, a preliminary screening of the available parking spaces can usually be performed based on the aforementioned information. This also includes the following steps: screening the available parking spaces based on the demand information in the first reservation information and the demand type label of the available parking space to obtain the screened available parking spaces; wherein, the demand information includes logistics loading and unloading information and / or charging demand information; the demand type label includes loading and unloading label and / or charging label.

[0057] Of course, in addition to the logistics loading and unloading information and charging demand information provided above, the demand information may include more based on the actual vehicle type. Different demand information can usually be filtered by configuring corresponding demand type tags for parking spaces on the server side, and this application embodiment does not impose any limitations here.

[0058] In addition, in order to better manage vehicle parking reservations, the vehicle's entry and exit time information will be monitored in real time after each vehicle reservation is completed to determine whether there is any overtime behavior, thereby facilitating vehicle management. Vehicles with multiple overtime behaviors cannot be reserved for parking again. Specifically, please refer to Figure 5a. Figure 5a is a schematic diagram of the steps for controlling vehicle reservation permissions through an identity list provided in this application embodiment. Specifically, it includes steps S510~S530: S510, determine the overtime information of the second vehicle based on the entry and exit time information of the second vehicle and the second preset parking time period in the second reservation information.

[0059] In this embodiment of the application, taking the second vehicle whose entry and exit information is detected as an example, by comparing the entry and exit time information of the second vehicle with the second reserved parking time period in the second reservation information, it can be determined whether the second vehicle has any timeout information that is not subject to the reservation information during this parking reservation process, such as overtime parking, etc.

[0060] S520, based on the statistical results of the timeout information of the second vehicle, determine whether to write the second identity information of the second vehicle into the target identity list.

[0061] Furthermore, by statistically analyzing the timeout information in the historical parking reservation process of the second vehicle, for example, determining whether the number or frequency of timeouts exceeds a preset threshold, it is possible to further determine whether to write the second vehicle's second identity information into the target identity list. Specifically, the target identity list can generally be understood as a blacklist for the parking reservation service, thereby controlling the vehicle's reservation permissions.

[0062] For example, in one embodiment, if it is determined that the number of times of overdue parking exceeds a preset threshold, or the frequency of overdue parking exceeds a preset threshold, the second identity information of the second vehicle can be written into a target identity list. The identity information added to the target identity list will then be unable to select a target parking space from available spaces during subsequent reservation processes, meaning parking reservations cannot be made. Conversely, if it is determined that the number of times of overdue parking does not exceed the preset threshold, or the frequency of overdue parking does not exceed the preset threshold, the second identity information of the second vehicle can be left unprocessed.

[0063] S530, in response to the fact that the first identity information in the first reservation information is not in the target identity list, a target parking space is selected from the available parking spaces according to the first reservation information.

[0064] Based on the foregoing description, the target identity list can be understood as a blacklist for the parking reservation service, used to control vehicle reservation permissions. For example, when parking reservations are needed for vehicle number one, if vehicle number one's first identity information is not in the target identity list, it indicates that vehicle number one has not exceeded the parking time limit in its historical parking reservation history, or the frequency of such violations is low. In this case, parking reservation services can be provided to vehicle number one. Conversely, if vehicle number one's first identity information is in the target identity list, it indicates that vehicle number one has exceeded the parking time limit in its historical parking reservation history. In this case, a response message can be returned to the first client to temporarily refuse to provide parking reservation services to vehicle number one. It is understood that the target identity list is dynamically updated during this process.

[0065] Of course, the target identity list can usually be modified, such as deleted or added, by the server-side system administrator. This will not be elaborated upon in the embodiments of this application.

[0066] To better understand the effect diagram of vehicle reservation permission control through identity list provided above, specifically please refer to Figure 5b. Based on the parking reservation system provided in Figure 1c above, a timing interaction diagram for vehicle reservation permission control is provided. Specifically, unlike Figure 1c, in this embodiment, the following steps are also included: (1) After the server receives the second identity information and entry / exit time information sent by the second client, it will also determine whether the second vehicle has exceeded the time limit for parking based on the entry / exit time information in the second reservation information corresponding to the second identity information, thereby further determining whether the second identity information of the second vehicle needs to be written into the target identity list. For example, it can be determined whether to write the second identity information by statistically analyzing the behavior of exceeding the time limit for parking; (2) By maintaining the target identity list, after receiving the first reservation information of the first vehicle that needs to be reserved, it can determine whether to provide parking reservation service for the first vehicle by judging whether the first identity information is in the target identity list. For example, if it is in the target identity list, a prompt message is sent to the first client to indicate that the first vehicle has multiple parking time limits. If it is not in the target identity list, the first reservation information is matched to determine the target parking space and returned to the first client.

[0067] In addition, to further improve the parking reservation effect, as another feasible embodiment of this application, the first reservation information may also include vehicle location information, so that the server can generate a parking navigation route based on the vehicle location information and the location information of the target parking space, and return the parking navigation route to the first client so that the first user can drive the first vehicle into the target parking space.

[0068] Furthermore, while the first vehicle is parked in the target parking space, the server can send a notification message to the first client at a target time corresponding to the parking termination time in the first reservation information. For example, the target time can typically be set to at least 30 minutes, 20 minutes, or 10 minutes before the parking termination time. Of course, setting it to other times corresponding to the parking termination time is also feasible, and this embodiment does not impose any limitations. Based on this, the first user can also quickly renew the parking service through this notification message, for example, by extending the parking time if requirements are met.

[0069] Specifically, for easier understanding of the above content, please refer to Figure 6. Based on the parking reservation system provided in Figure 1c, Figure 6 is another interactive timing diagram of the parking reservation system provided in this application embodiment. Specifically, it includes the following steps: (1) After determining the target parking space, the server will generate a parking navigation path based on the location information of the target parking space and the vehicle location information in the first reservation information, and return it to the first client; (2) After completing the parking reservation, the server will also return a prompt message to the first client at a specified time to indicate that the first user's first vehicle is about to exceed the reserved parking time. For example, the prompt message may be "Your reserved parking service will be canceled in 20 minutes. Please leave in time, or click to continue the parking reservation". At this time, the first user can send a renewal request to the server to continue parking by performing the trigger operation on the first client. After meeting certain conditions, such as detecting that the subsequent parking space is vacant, the server can update the parking space information to quickly realize the parking renewal service.

[0070] Furthermore, to further improve the management effectiveness of parking spaces, based on the aforementioned parking reservation system, this application also provides a third client installed on the parking space. Specifically, the third client typically communicates with the parking space's locking mechanism to switch the parking space's usability status. For example, the locking mechanism is typically a parking space lock, although other forms of locking mechanisms are also feasible, and this application embodiment does not impose any limitations. Specifically, for ease of understanding, please refer to Figure 7. Figure 7 is an interaction timing diagram of another parking reservation system provided by this application embodiment. Compared with the parking reservation system shown in Figure 1c, it also includes a third client 170, wherein the third client 170 is typically associated with a parking space locking mechanism, such as a parking space lock, to realize the switching of the parking space's usability status. Specifically, the following steps are included: (1) After receiving the second identity information sent by the second client, the server will send a state switching instruction to the third client after updating the parking space, so as to switch the available status of the reserved parking space associated with the second identity information of the second vehicle. For example, when the second vehicle leaves, the available status of the reserved parking space of the second vehicle will be switched to the locked status to prevent others from mistakenly entering; (2) After the server completes the selection of the target parking space for the first vehicle, it will send a state switching instruction to the third client, so as to switch the available status of the target parking space at a specified time. For example, before the specified parking reservation period, the target parking space will be locked to prevent others from mistakenly entering, and during the specified parking reservation period, or when the first vehicle is detected to enter, the available status of the reserved parking space will be switched to open so that the first vehicle can enter the target parking space.

[0071] In addition to the aforementioned implementation schemes, the parking reservation system can also be configured with a check-in function on the server side. This means the first vehicle must check in within a preset time range of the reserved parking time and within a preset check-in range of the parking lot; otherwise, the reserved parking space will be released, and the driver will need to park in an available space. The preset time range is determined based on the usage time of the reserved parking space; it can be earlier than the usage time of the reserved parking space or the start time of the reserved parking space's usage. The preset check-in range can be within one kilometer of the parking lot, or it can be any other distance.

[0072] Similarly, if a reserved parking space remains vacant for a predetermined period of time during its usage period, the space can also be released.

[0073] In addition, the parking space locking mechanism can also be operated by the user on the first client to switch the availability status of the parking space. For example, the user can control the parking space lock to open or actively release the parking space.

[0074] In addition, vehicle identity management can be configured, which may include Type 1 vehicles and Type 2 vehicles. Type 1 vehicles may not have a parking reservation end time set, while Type 2 vehicles need to have a parking reservation end time set.

[0075] To better implement the parking reservation method provided in this application embodiment, based on the parking reservation method provided in this application embodiment, this application embodiment also provides a parking reservation device set on the server side, as shown in FIG8. The parking reservation device 800 includes: a receiving module 810, which receives the first reservation information sent by the first client for the first vehicle to be reserved.

[0076] The update module 820, in response to the second identity information of the second vehicle detected by the second client, updates the initial available parking spaces according to the second reservation information corresponding to the second identity information to obtain the updated available parking spaces; the selection module 830, according to the first reservation information, selects a target parking space from the available parking spaces and returns the parking space information of the target parking space to the first client.

[0077] In some embodiments of this application, the selection module 830 is further configured to filter candidate parking spaces from the available parking spaces whose available time periods include the first preset parking time period based on the first reserved parking time period in the first reservation information and the first available time period label of the available parking space; and when there are multiple candidate parking spaces, to determine the target vehicle from the candidate parking spaces based on the matching degree between the second available time period label of the candidate parking space and the first reserved parking time period.

[0078] In some embodiments of this application, the selection module 830 is further configured to determine a first matching degree based on the idle duration in the second idle time period label and the parking duration in the first reserved parking time period; determine a second matching degree based on the idle start and end time in the second idle time period label and the parking start and end time in the first reserved parking time period; and determine a target parking space from the candidate parking spaces based on the first matching degree and / or the second matching degree.

[0079] In some embodiments of this application, the selection module 830 is further configured to filter the available parking spaces based on the demand information in the first reservation information and the demand type label of the available parking spaces, to obtain the filtered available parking spaces; wherein, the demand information includes logistics loading and unloading information and / or charging demand information; the demand type label includes loading and unloading label and / or charging label.

[0080] In some embodiments of this application, the updating module 820 is further configured to determine the reserved parking space corresponding to the second vehicle based on the second reservation information corresponding to the second identity information; in response to the second vehicle's entry and exit information being entry information, remove the reserved parking space from the initial available parking spaces to obtain an updated available parking space; and / or in response to the second vehicle's entry and exit information being exit information, add the reserved parking space to the initial available parking spaces to obtain an updated available parking space.

[0081] In some embodiments of this application, the update module 820 is further configured to, in response to the first identity information in the first reservation information not being in the target identity list, select a target parking space from the available parking spaces according to the first reservation information.

[0082] In some embodiments of this application, the selection module 830 is further configured to determine the overtime information of the second vehicle based on the entry and exit time information of the second vehicle and the second preset parking period in the second reservation information; and to determine whether to write the second identity information of the second vehicle into the target identity list based on the statistical results of the overtime information of the second vehicle.

[0083] In some embodiments of this application, the selection module 830 is further configured to generate a parking navigation path based on the vehicle location information in the first reservation information and the location information of the target parking space; and return the parking navigation path to the first client.

[0084] In some embodiments of this application, the selection module 830 is further configured to send a prompt message to the first client at a target time corresponding to the parking termination time, based on the parking termination time in the first reservation information.

[0085] In some embodiments of this application, the selection module 830 is further configured to determine the available status of each parking space at various times based on the initial parking space's idle time period label; and send a status switching instruction to the third client corresponding to the first parking space to switch the available status of the first parking space through a locking mechanism communicating with the third client.

[0086] Specific limitations regarding the parking reservation device can be found in the limitations of the parking reservation method described above, and will not be repeated here. Each module in the aforementioned parking reservation device can be implemented entirely or partially through software, hardware, or a combination thereof. These modules can be embedded in or independent of the processor in a computer device in hardware form, or stored in the memory of a computer device in software form, so that the processor can call and execute the operations corresponding to each module. In this embodiment, in response to the second identity information of the second vehicle detected by the second client, the second reservation information of the second identity information is used to update the initial available parking spaces to obtain updated available parking spaces. This allows for further selection of a target parking space from the updated available spaces based on the first reservation information of the first vehicle to be reserved, and then returned to the first client. In the actual reservation process, not only is the reserved parking information considered, but the available parking spaces are dynamically adjusted based on the actual parking entry and exit information, thereby ensuring the effectiveness of subsequent vehicle reservations and improving the parking management efficiency within the parking lot.

[0087] In some embodiments of this application, the parking reservation device 800 can be implemented as a computer program, which can run on a computer device as shown in FIG9. The memory of the computer device can store various program modules constituting the parking reservation device 800, such as the receiving module 810, updating module 820, and selection module 830 shown in FIG8. The computer program composed of these program modules causes a processor to execute the steps in the parking reservation methods of the various embodiments of this application described in this specification.

[0088] For example, the computer device shown in Figure 9 can execute step S110 through the receiving module 810 in the parking reservation device 800 shown in Figure 8. The computer device can execute step S120 through the updating module 820. The computer device can execute step S130 through the selection module 830. The computer device includes a processor, memory, and network interface connected via a system bus. The processor of the computer device provides computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores the operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The network interface of the computer device is used to communicate with external computer devices via a network connection. When the computer program is executed by the processor, it implements a parking reservation method.

[0089] Those skilled in the art will understand that the structure shown in Figure 9 is merely a block diagram of a portion of the structure related to the present application and does not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than those shown in the figure, or may combine certain components, or may have different component arrangements.

[0090] In some embodiments of this application, a computer device is provided, including one or more processors; a memory; and one or more application programs, wherein the one or more application programs are stored in the memory and configured to be executed by the processor to perform the following steps: receiving first reservation information sent by a first client for a first vehicle to be reserved; responding to second identity information of a second vehicle sent by a second client indicating that entry and exit information has been detected, updating the initial available parking spaces according to the second reservation information corresponding to the second identity information to obtain updated available parking spaces; selecting a target parking space from the available parking spaces according to the first reservation information, and returning the parking space information of the target parking space to the first client.

[0091] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: based on the first reserved parking time period in the first reservation information and the first available time period label of the available parking space, it filters out candidate parking spaces from the available parking spaces whose available time period includes the first preset parking time period; when there are multiple candidate parking spaces, it determines the target parking space from the candidate parking spaces based on the matching degree between the second available time period label of the candidate parking space and the first reserved parking time period.

[0092] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: determining a first matching degree based on the idle duration in the second idle time period label and the parking duration in the first reserved parking time period; determining a second matching degree based on the idle start and end time in the second idle time period label and the parking start and end time in the first reserved parking time period; and determining a target parking space from the candidate parking spaces based on the first matching degree and / or the second matching degree.

[0093] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: filtering the available parking spaces based on the demand information in the first reservation information and the demand type label of the available parking spaces, to obtain the filtered available parking spaces.

[0094] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: determining the reserved parking space corresponding to the second vehicle based on the second reservation information corresponding to the second identity information; in response to the second vehicle's entry and exit information being entry information, removing the reserved parking space from the initial available parking spaces to obtain an updated available parking space; and / or in response to the second vehicle's entry and exit information being exit information, adding the reserved parking space to the initial available parking spaces to obtain an updated available parking space.

[0095] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: in response to the first identity information in the first reservation information not being in the target identity list, selecting a target parking space from the available parking spaces according to the first reservation information.

[0096] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: determining the timeout information of the second vehicle based on the entry and exit time information of the second vehicle and the second preset parking period in the second reservation information; and determining whether to write the second identity information of the second vehicle into the target identity list based on the statistical results of the timeout information of the second vehicle.

[0097] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: generating a parking navigation path based on the vehicle location information in the first reservation information and the location information of the target parking space; and returning the parking navigation path to the first client.

[0098] In some embodiments of this application, when the processor executes the computer program, it also performs the following steps: according to the parking termination time in the first reservation information, it sends a prompt message to the first client at a target time corresponding to the parking termination time.

[0099] In some embodiments of this application, when the processor executes the computer program, it also performs the following steps: determining the available status of each parking space at each time according to the initial parking space's idle time period label; sending a status switching instruction to the third client corresponding to the first parking space, so as to switch the available status of the first parking space through a locking mechanism communicating with the third client.

[0100] In some embodiments of this application, a computer-readable storage medium is provided, storing a computer program. The computer program is loaded by a processor, causing the processor to perform the following steps: receiving first reservation information sent by a first client for a first vehicle to be reserved; responding to second identity information of a second vehicle sent by a second client indicating that entry and exit information has been detected, updating the initial available parking spaces according to the second reservation information corresponding to the second identity information to obtain updated available parking spaces; selecting a target parking space from the available parking spaces according to the first reservation information, and returning the parking space information of the target parking space to the first client.

[0101] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: based on the first reserved parking time period in the first reservation information and the first available time period label of the available parking space, it filters out candidate parking spaces from the available parking spaces whose available time period includes the first preset parking time period; when there are multiple candidate parking spaces, it determines the target parking space from the candidate parking spaces based on the matching degree between the second available time period label of the candidate parking space and the first reserved parking time period.

[0102] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: determining a first matching degree based on the idle duration in the second idle time period label and the parking duration in the first reserved parking time period; determining a second matching degree based on the idle start and end time in the second idle time period label and the parking start and end time in the first reserved parking time period; and determining a target parking space from the candidate parking spaces based on the first matching degree and / or the second matching degree.

[0103] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: filtering the available parking spaces based on the demand information in the first reservation information and the demand type label of the available parking spaces, to obtain the filtered available parking spaces.

[0104] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: determining the reserved parking space corresponding to the second vehicle based on the second reservation information corresponding to the second identity information; in response to the second vehicle's entry and exit information being entry information, removing the reserved parking space from the initial available parking spaces to obtain an updated available parking space; and / or in response to the second vehicle's entry and exit information being exit information, adding the reserved parking space to the initial available parking spaces to obtain an updated available parking space.

[0105] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: in response to the first identity information in the first reservation information not being in the target identity list, selecting a target parking space from the available parking spaces according to the first reservation information.

[0106] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: determining the timeout information of the second vehicle based on the entry and exit time information of the second vehicle and the second preset parking period in the second reservation information; and determining whether to write the second identity information of the second vehicle into the target identity list based on the statistical results of the timeout information of the second vehicle.

[0107] In some embodiments of this application, when the processor executes the computer program, it further implements the following steps: generating a parking navigation path based on the vehicle location information in the first reservation information and the location information of the target parking space; and returning the parking navigation path to the first client.

[0108] In some embodiments of this application, when the processor executes the computer program, it also performs the following steps: according to the parking termination time in the first reservation information, it sends a prompt message to the first client at a target time corresponding to the parking termination time.

[0109] In some embodiments of this application, when the processor executes the computer program, it also performs the following steps: determining the available status of each parking space at each time according to the initial parking space's idle time period label; sending a status switching instruction to the third client corresponding to the first parking space, so as to switch the available status of the first parking space through a locking mechanism communicating with the third client.

[0110] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical storage, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0111] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0112] The above provides a detailed description of a parking reservation method, system, computer device, and readable storage medium provided in the embodiments of this application. Specific examples have been used to illustrate the principles and implementation methods of the present invention. The description of the above embodiments is only for the purpose of helping to understand the method and core ideas of the present invention. At the same time, for those skilled in the art, there will be changes in the specific implementation methods and application scope based on the ideas of the present invention. Therefore, the content of this specification should not be construed as a limitation of the present invention.

Claims

1. A parking reservation method, characterized in that, The method is applied on the server side and includes: receiving first reservation information sent by a first client for a first vehicle to be reserved; responding to second identity information of a second vehicle sent by a second client indicating that entry and exit information has been detected, updating the initial available parking spaces according to the second reservation information corresponding to the second identity information to obtain updated available parking spaces; selecting a target parking space from the available parking spaces according to the first reservation information, and returning the parking space information of the target parking space to the first client.

2. The method according to claim 1, characterized in that, The step of selecting a target parking space from the available parking spaces based on the first reservation information includes: filtering candidate parking spaces from the available parking spaces whose available time slots include the first preset parking time slot based on the first reserved parking time slot in the first reservation information and the first available time slot label of the available parking spaces; and determining the target parking space from the candidate parking spaces based on the matching degree between the second available time slot label of the candidate parking spaces and the first reserved parking time slot when there are multiple candidate parking spaces.

3. The method according to claim 2, characterized in that, The step of determining the target parking space from the candidate parking spaces based on the matching degree between the second idle time period and the first reserved parking time period includes: determining a first matching degree based on the idle duration in the second idle time period label and the parking duration in the first reserved parking time period; determining a second matching degree based on the idle start and end time in the second idle time period label and the parking start and end time in the first reserved parking time period; and determining the target parking space from the candidate parking spaces based on the first matching degree and / or the second matching degree.

4. The method according to claim 2, characterized in that, Before filtering candidate parking spaces from the available parking spaces whose available time slots include the first preset parking time slot based on the first reserved parking time slot in the first reservation information and the first available time slot label of the available parking space, the method further includes: filtering the available parking spaces based on the demand information in the first reservation information and the demand type label of the available parking space to obtain the filtered available parking spaces; wherein, the demand information includes logistics loading and unloading information and / or charging demand information; the demand type label includes loading and unloading label and / or charging label.

5. The method according to claim 1, characterized in that, The step of updating the available initial parking spaces based on the second reservation information corresponding to the second identity information includes: determining the reserved parking space corresponding to the second vehicle based on the second reservation information corresponding to the second identity information; in response to the second vehicle's entry / exit information being entry information, removing the reserved parking space from the available initial parking spaces to obtain the updated available parking spaces; and / or in response to the second vehicle's entry / exit information being exit information, adding the reserved parking space to the available initial parking spaces to obtain the updated available parking spaces.

6. The method according to claim 1, characterized in that, Before selecting a target parking space from the available parking spaces based on the first reservation information, the method further includes: in response to the first identity information in the first reservation information not being in the target identity list, performing the step of selecting a target parking space from the available parking spaces based on the first reservation information.

7. The method according to claim 6, characterized in that, The method further includes: determining the overtime information of the second vehicle based on the entry and exit time information of the second vehicle and the second preset parking period in the second reservation information; and determining whether to write the second identity information of the second vehicle into the target identity list based on the statistical results of the overtime information of the second vehicle.

8. The method according to claim 1, characterized in that, The method further includes: generating a parking navigation path based on the vehicle location information in the first reservation information and the location information of the target parking space; and returning the parking navigation path to the first client.

9. The method according to claim 1, characterized in that, The method further includes: sending a prompt message to the first client at a target time corresponding to the parking termination time, based on the parking termination time in the first reservation information.

10. The method according to any one of claims 1 to 9, characterized in that, The method further includes: determining the available status of each parking space at each time based on the initial parking space's idle time period label; sending a status switching command to the third client corresponding to the first parking space, so as to switch the available status of the first parking space through a locking mechanism communicating with the third client.

11. A parking reservation system, characterized in that, It includes a server and a first client and a second client that communicate with the server; the first client is used to send the first reservation information of the first vehicle to be reserved to the server; The second client is used to send the second identity information of the second vehicle that has detected entry and exit information to the server; The server is configured to update the initial available parking spaces based on the second reservation information corresponding to the second identity information to obtain the updated available parking spaces, and to select a target parking space from the available parking spaces based on the first reservation information, and return the parking space information of the target parking space to the first client.

12. The system according to claim 11, characterized in that, It also includes a third client; the server is further configured to determine the availability status of each parking space at each time based on the initial parking space's idle time period label, and to send a status switching instruction to the third client; the third client is configured to, in response to receiving the status switching instruction sent by the server, switch the availability status of the parking space corresponding to the status switching instruction through a locking mechanism.

13. A computer device, characterized in that, The computer device includes: one or more processors; a memory; and one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the processor to implement the parking reservation method according to any one of claims 1 to 10.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program, which is loaded by a processor to execute the parking reservation method according to any one of claims 1 to 10.

Images