A differentiated parking space allocation method, device, equipment and storage medium

Abstract

The application discloses a differentiated parking space allocation method, device, equipment and storage medium. The method comprises the following steps: obtaining parking request information of a target vehicle; generating a corresponding parking order according to idle information of idle parking spaces in a target parking lot and a reservation parking time range in the parking request information; wherein, the idle information comprises a parking space number and an idle time period; the daily idle time period of each idle parking space is different; and allocating a parking space corresponding to the target parking space number in the parking order to the target vehicle. According to the idle information of the idle parking spaces in the target parking lot and the reservation parking time range of the target vehicle, the parking space is overall planned and allocated in the differentiated parking space allocation scene, so that the parking space allocation efficiency is fundamentally improved, the reservation failure probability is reduced, and the parking experience of the user is enhanced.

Description

TECHNICAL FIELD

[0001] Embodiments of the present application relate to the field of parking space allocation, and in particular to a differentiated parking space allocation method, device, equipment and storage medium. BACKGROUND

[0002] Currently, parking space is difficult to find has become a common problem in cities, and disputes caused by parking problems are common. The problem of parking difficulty brings many troubles to the people's life and the management of the relevant transportation departments. Moreover, the parking problem leads to an increase in parking cruising time, increases the transportation expenses of the vehicle owner, and reduces the parking experience. With the rapid growth of the number of cars, it is essential to design a practical and effective parking mechanism to alleviate the pressure of urban traffic.

[0003] In the prior art, most of the parking space reservations and allocations are made for non-differentiated parking spaces in parking lots. By calculating the parking time range, the distance between the waiting vehicle and the parking space, the energy type of the waiting vehicle and other factors, the parking space is allocated to the waiting vehicle. However, the overall parking space is not considered for overall planning and allocation in the case of time splicing, thereby not fundamentally improving the parking space allocation efficiency. At the same time, the adjustment of the parking time range is not considered, thereby increasing the possibility of reservation failure and affecting the user experience. SUMMARY

[0004] Therefore, the present application provides a differentiated parking space allocation method, device, equipment and storage medium, which improves the efficiency of differentiated parking space allocation, reduces the probability of reservation failure, and enhances the user experience.

[0005] In a first aspect, the embodiments of the present application provide a differentiated parking space allocation method, comprising:

[0006] obtaining parking request information of a target vehicle;

[0007] generating a corresponding parking order according to the idle information of the idle parking spaces in the target parking lot and the reservation parking time range in the parking request information; wherein the idle information includes: parking space number and idle time period; the daily idle time period of each idle parking space is different;

[0008] allocating the parking space corresponding to the target parking space number in the parking order to the target vehicle.

[0009] In a second aspect, the embodiments of the present application also provide a differentiated parking space allocation device, comprising:

[0010] a first obtaining module for obtaining parking request information of a target vehicle;

[0011] The first generation module is configured to generate a parking order corresponding to the target parking lot according to idle information of idle parking spaces in a target parking lot and a reservation parking time range in the parking request information, wherein the idle information comprises a parking space number and an idle time period, and the daily idle time period of each idle parking space is different.

[0012] The first allocation module is configured to allocate a parking space corresponding to the target parking space number in the parking order to the target vehicle.

[0013] In a third aspect, the embodiments of the present application further provide a differentiated parking space allocation device, which comprises a communication module, a memory, and one or more processors.

[0014] The communication module is configured to communicate with a target vehicle.

[0015] The memory is configured to store one or more programs.

[0016] When the one or more programs are executed by the one or more processors, the one or more processors implement the differentiated parking space allocation method according to any one of the above embodiments.

[0017] In a fourth aspect, a computer readable storage medium has a computer program stored thereon, which, when executed by a processor, implements the differentiated parking space allocation method according to any one of the above embodiments.

[0018] The present application discloses obtaining parking request information of a target vehicle, generating a parking order corresponding to a target parking lot according to idle information of idle parking spaces in the target parking lot and a reservation parking time range in the parking request information, wherein the idle information comprises a parking space number and an idle time period, and the daily idle time period of each idle parking space is different, and allocating a parking space corresponding to the target parking space number in the parking order to the target vehicle. The embodiments of the present application improve the parking space allocation efficiency, reduce the reservation failure probability, and enhance the user parking experience by overall planning and allocating parking spaces in the differentiated parking space allocation scenario according to the idle information of idle parking spaces in the target parking lot and the reservation parking time range of the target vehicle. BRIEF DESCRIPTION OF DRAWINGS

[0019] Figure 1 is a flowchart of a differentiated parking space allocation method provided by the embodiments of the present application;

[0020] Figure 2 is a flowchart of another differentiated parking space allocation method provided by the embodiments of the present application;

[0021] Figure 3 is a flowchart of still another differentiated parking space allocation method provided by the embodiments of the present application;

[0022] Figure 4 is a structural block diagram of a differentiated parking space allocation device provided by an embodiment of the present application;

[0023] Figure 5 is a schematic diagram of a hardware structure of a differentiated parking space allocation device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0024] The present application will be further described below in conjunction with the accompanying drawings and embodiments. It can be understood that the specific embodiments described herein are only used to explain the present application, but not to limit the present application. In addition, it should be noted that, for the convenience of description, only the parts related to the present application are shown in the drawings, but not all the structures.

[0025] In an embodiment, Figure 1 is a flowchart of a differentiated parking space allocation method provided by an embodiment of the present application, which can be applicable to the allocation of differentiated parking spaces. The differentiated parking spaces refer to different idle time periods or bookable time periods of different parking spaces. For example, some parking spaces for community owners are leased out from 8:00 to 18:00, and some parking spaces are leased out from 10:00 to 21:00. It can be understood that the differentiated parking space allocation scheme is applicable to scenarios such as private places, and the embodiment can be executed by a differentiated parking space allocation device. The differentiated parking space allocation device can be a cloud server. For example, as shown in the figure, the cloud server can be a computer device. The embodiment includes the following steps: Figure 1

[0026] S110, obtaining parking request information of a target vehicle.

[0027] The parking request information refers to a parking space application request sent by a target vehicle to a pre-configured parking reservation system. In an embodiment, a target user corresponding to the target vehicle can apply for a parking space in the parking reservation system to generate corresponding parking space request information. The parking request information includes a target user identifier, a reservation parking start time, and a reservation parking end time.

[0028] In an embodiment, the target user identifier is used to represent the unique identifier of the target user corresponding to different target vehicles. For example, the target user identifier can include one of the following: a target user account, a license plate number of the target vehicle, an ID number of the target user, which is not limited. Of course, each target user can correspond to one or more target vehicles.

[0029] S120, generating a corresponding parking order according to the idle information of the idle parking spaces in the target parking lot and the reservation parking time range in the parking request information.​

[0030] The idle information includes: parking space number and idle time period; the daily idle time period of each idle parking space is different.

[0031] The idle parking space refers to the parking space in the target parking lot that is not occupied. It should be noted that the daily idle time period of each idle parking space is different, and the time period of each idle parking space for external leasing is different, i.e., the leasable time period is different. For example, the time period for external leasing of the parking space of owner A in a certain community is from 8 am to 6 pm, and the time period for external leasing of the parking space of owner B is from 7 am to 12 pm, i.e., the daily idle time period of the idle parking space of owner A and the idle parking space of owner B is different.

[0032] In an embodiment, the idle information of the idle parking space refers to the parking space number and idle time period of the idle parking space in the target parking lot. The target parking lot refers to the parking lot where the target vehicle is about to be parked; the idle time period refers to the time period during which the idle parking space is idle in the leasable time period. In actual operation, when the parking reservation system receives the parking request information of the target vehicle, the parking reservation system automatically obtains the idle information of the idle parking space in the target parking lot where the target vehicle is about to be parked. It can be understood that the parking reservation system pre-stores the idle information of the idle parking space in one parking lot or multiple parking lots, which is not limited. Of course, in actual operation, in order to intuitively and quickly identify the target parking lot, each parking lot can be distinguished by a parking lot number in the parking reservation system, i.e., the target vehicle submits the parking request information in the parking reservation system, and the parking lot number of the target parking lot is also included in the parking request information. Of course, different parking lots can also be distinguished by other parameter information, such as by the name of the place to distinguish different parking lots. For example, Beijing Zoo parking lot, Beijing Botanical Garden parking lot, etc.

[0033] It should be noted that the reservation parking time range can also be referred to as a reservation parking time interval, which can be composed of a reservation parking start time and a reservation parking end time, i.e., the reservation parking start time is the left end point of the reservation parking time interval, and the reservation parking end time is the right end point of the reservation parking time interval.

[0034] In an embodiment, according to the reservation parking time range and the idle time period of the idle parking space in the target parking lot, it is determined whether there is a parking space suitable for the target vehicle to park within the reservation parking time range, i.e. whether the reservation parking time range of the target vehicle is completely contained in the idle time period of any idle parking space, and if so, a corresponding parking order is generated. Of course, if the reservation parking time range of the target vehicle is not completely contained in the idle time period of any idle parking space, the idle parking space that maximally satisfies the reservation parking time range can be searched from the target parking lot, i.e. the idle parking space whose idle time period maximally contains the reservation parking time range, and then an adjustment inquiry instruction is sent to the target vehicle to determine whether the target vehicle accepts the idle parking space that maximally satisfies the reservation parking time range; if the adjustment confirmation instruction fed back by the target vehicle is received, a corresponding parking order is generated.

[0035] S130, allocating the parking space corresponding to the target parking space number in the parking order to the target vehicle.

[0036] In an embodiment, the target parking space number refers to the parking space number of the idle parking space that satisfies the reservation parking time range of the target vehicle, or the parking space number of the idle parking space that maximally satisfies the reservation parking time range of the target vehicle.

[0037] In an embodiment, when the parking space number of the idle parking space that satisfies the reservation parking time range of the target vehicle, or the parking space number of the idle parking space that maximally satisfies the reservation parking time range of the target vehicle in the target parking lot is determined, the parking space number is taken as the target parking space number and sent to the target vehicle, so that when the target vehicle drives into the target parking lot, it is parked on the parking space corresponding to the target parking space number.

[0038] The technical scheme of the embodiment improves the parking space allocation efficiency and reduces the reservation failure probability, and enhances the user's parking experience.

[0039] In an embodiment, Figure 2 is a flowchart of another method for allocating differentiated parking spaces provided by an embodiment of the application. The embodiment is a further description of the method for allocating differentiated parking spaces based on the above-mentioned embodiment. As shown in Figure 2 The method for allocating differentiated parking spaces in the embodiment includes the following steps:

[0040] S210, obtaining parking request information of a target vehicle.

[0041] S220, searching first type parking spaces in order of parking space numbers of idle parking spaces in a target parking lot.

[0042] In an embodiment, the first type of parking space refers to the idle parking space whose idle time range is completely contained in the reservation parking time range of the target vehicle. In actual operation, starting from the smallest parking space number of the idle parking space in the target parking lot, the optional parking space satisfying the reservation parking time range is searched in the order of the parking space number. It can be understood that the idle start time in the idle time range of the optional parking space is less than or equal to the reservation parking start time in the reservation parking time range of the target vehicle, and the idle end time in the idle time range of the optional parking space is greater than or equal to the reservation parking end time in the reservation parking time range of the target vehicle.

[0043] S230, whether the number of the first type of parking space is not 0, if yes, S240 is executed; if no, S280 is executed.

[0044] In an embodiment, S240 is executed when the first type of parking space exists in the target parking lot; S280 is executed when the optional parking space satisfying the reservation parking time range does not exist in the target parking lot.

[0045] S240, whether the number of the first type of parking space is greater than 1, if yes, S250 is executed; if no, S270 is executed.

[0046] In an embodiment, S250 is executed when multiple first type of parking spaces exist in the target parking lot; S270 is executed when one first type of parking space exists in the target parking lot.

[0047] S250, determining the splicing condition between the reserved parking time range of each first type of parking space and the reservation parking time range as a first splicing condition.

[0048] In an embodiment, when multiple first type of parking spaces exist in the target parking lot, the splicing condition between the reserved parking time range of each first type of parking space and the reservation parking time range is determined, that is, whether the reserved parking time range of each first type of parking space can be spliced with the reservation parking time range is determined according to the occupancy condition of the first type of parking space.

[0049] S260, generating a corresponding parking order according to the first splicing condition, the idle information of the first type of parking space and the reservation parking time range.

[0050] S260 includes two cases:

[0051] Case one: when there is a first type parking space that is spliced with the reservation parking time range, a corresponding parking order is generated according to the idle information of the first type parking space that is spliced with the reservation parking time range and the reservation parking time range.

[0052] In an embodiment, when there is a first type parking space that is spliced with the reservation parking time range, that is, the idle start time of the idle period of the first type parking space is equal to the reservation parking start time of the reservation parking time range of the target vehicle, or the idle end time of the idle period of the first type parking space is equal to the reservation parking end time of the reservation parking time range of the target vehicle, a corresponding parking order is generated according to the idle information of the first type parking space that is spliced with the reservation parking time range and the reservation parking time range, that is, the target parking space number in the parking order is the parking space number of the first type parking space that is spliced with the reservation parking time range. When there are multiple first type parking spaces that are spliced with the reservation parking time range, the idle information of the first type parking space whose idle start time of the idle period is equal to the reservation parking start time of the reservation parking time range of the target vehicle and whose idle end time of the idle period is equal to the reservation parking end time of the reservation parking time range of the target vehicle is preferentially selected to generate a corresponding parking order.

[0053] Case two: when there is no first type parking space that is spliced with the reservation parking time range, a corresponding parking order is generated according to the idle parking space information of any one first type parking space and the reservation parking time range.

[0054] In an embodiment, when there is no first type parking space that is spliced with the reservation parking time range, that is, the idle start time of the idle period of the first type parking space is not equal to the reservation parking start time of the reservation parking time range of the target vehicle, or the idle end time of the idle period of the first type parking space is not equal to the reservation parking end time of the reservation parking time range of the target vehicle, any one of the first type parking spaces is selected from the multiple first type parking spaces, and a corresponding parking order is generated according to the idle parking space information of the selected first type parking space and the reservation parking time range.

[0055] S270, a corresponding parking order is generated according to the idle information of the first type parking space and the reservation parking time range.

[0056] In an embodiment, when there is only one selectable parking space in the target parking lot that meets the reservation parking time range of the target vehicle, that is, there is only one first type parking space in the target parking lot, the parking space number of the first type parking space is directly taken as the target parking space number of the target vehicle to generate a corresponding parking order.

[0057] S280, search the second type parking space in sequence according to the parking space number of the idle parking space in the target parking lot.

[0058] The second type parking space is an optional parking space that maximally satisfies the reservation parking time range in the parking request information. In an embodiment, the second type parking space refers to an idle parking space whose reservation parking time range partially overlaps with the target vehicle's reservation parking time range. In actual operation, when there is no first type parking space in the target parking lot, the optional parking space that partially satisfies the reservation parking time range, i.e., the second type parking space, is searched in sequence according to the parking space number starting from the smallest parking space number of the idle parking space in the target parking lot. It can be understood that the idle time period of the optional parking space that maximally satisfies the reservation parking time range, i.e., the second type parking space, satisfies the following condition: the minimum value of the sum of the difference between the idle start time in the idle time period of the second type parking space and the reservation parking start time of the target vehicle and the difference between the idle end time in the idle time period of the second type parking space and the reservation parking end time of the target vehicle (i.e., the minimum value of the sum of the two differences).

[0059] S290, send an adjustment inquiry instruction to the target vehicle.

[0060] The adjustment inquiry instruction refers to an instruction for determining whether the target vehicle accepts adjustment. It can be understood that when no idle parking space that completely satisfies the target vehicle's reservation parking time range can be searched in the target parking lot, in order to ensure whether the parking demand of the target vehicle can be satisfied, the parking reservation system can send an adjustment inquiry instruction to the target vehicle, so that the target user corresponding to the target vehicle can learn about the use of the target parking lot in a timely manner and determine whether the target vehicle accepts adjustment. Of course, in actual operation, the idle information of the idle parking space that maximally satisfies the target vehicle's reservation parking time range is carried in the adjustment inquiry instruction, so that the target vehicle can confirm whether to accept adjustment according to the idle information.

[0061] S2100, determine the number of second type parking spaces when receiving the adjustment confirmation instruction fed back by the target vehicle.

[0062] The adjustment confirmation instruction refers to an instruction for the target vehicle to confirm acceptance of the idle parking space that maximally satisfies the reservation parking time range. In an embodiment, when the parking reservation system receives the adjustment confirmation instruction fed back by the target vehicle, the number of second type parking spaces in the target parking lot is determined.

[0063] S2110, when the number of second type parking spaces is at least two, determine the splicing situation between the already reserved parking time range and the reservation parking time range of each second type parking space as the second splicing situation.

[0064] The pre-reserved parking time range of the second type parking space refers to a time range in which the second type parking space is occupied. In an embodiment, when there are multiple second type parking spaces in the target parking lot, the splicing between the pre-reserved parking time range and the pre-reserved parking time range of each second type parking space is determined, that is, according to the occupancy of the second type parking space, it is determined whether the pre-reserved parking time range of each second type parking space can be spliced with the pre-reserved parking time range.

[0065] S2120, generating a corresponding parking order according to the second splicing condition, the idle information of the second type parking space, and the pre-reserved parking time range.

[0066] S2120 includes two cases:

[0067] Case one: when there is a second type parking space spliced with the pre-reserved parking time range, a corresponding parking order is generated according to the idle information of the second type parking space spliced with the pre-reserved parking time range and the pre-reserved parking time range.

[0068] In an embodiment, when there is a second type parking space spliced with the pre-reserved parking time range, that is, the idle start time of the idle period of the second type parking space is greater than the pre-reserved parking start time of the pre-reserved parking time range of the target vehicle, or the idle end time of the idle period of the second type parking space is equal to the pre-reserved parking end time of the pre-reserved parking time range of the target vehicle, a corresponding parking order is generated according to the idle information of the second type parking space spliced with the pre-reserved parking time range and the pre-reserved parking time range, that is, the target parking space number in the parking order is the parking space number of the second type parking space spliced with the pre-reserved parking time range. When there are multiple second type parking spaces spliced with the pre-reserved parking time range, the idle information and the pre-reserved parking time range of the second type parking space whose idle start time of the idle period is greater than the pre-reserved parking start time of the pre-reserved parking time range of the target vehicle and whose idle end time of the idle period is equal to the pre-reserved parking end time of the pre-reserved parking time range of the target vehicle are preferentially selected to generate a corresponding parking order.

[0069] Case two: when there is no second type parking space spliced with the pre-reserved parking time range, a corresponding parking order is generated according to the idle information of any one second type parking space and the pre-reserved parking time range.

[0070] In an embodiment, when there is no second type parking space spliced with the reservation parking time range, i.e., the free start time of the free time period of the second type parking space is greater than the reservation parking start time of the target vehicle reservation parking time range, and the free end time of the free time period of the second type parking space is greater than the reservation parking end time of the target vehicle reservation parking time range, one of the plurality of second type parking spaces is randomly selected, and a corresponding parking order is generated according to the free parking space information of the randomly selected second type parking space and the reservation parking time range.

[0071] S2130, the parking space corresponding to the target parking space number in the parking order is allocated to the target vehicle.

[0072] In an embodiment, after the target vehicle enters the target parking lot, the target vehicle will be parked in the parking space corresponding to the target parking space number.

[0073] The technical scheme of the embodiment considers the splicing between the free time period of the free parking space and the reservation parking time range, and allocates the overall parking space in the target parking lot, which fundamentally improves the parking space allocation efficiency. When there is no free parking space that meets the reservation parking time range, the parking reservation system searches for a free parking space that meets the reservation parking time range to the greatest extent, and sends an adjustment inquiry instruction to the target vehicle to determine whether the target vehicle accepts the order adjustment. This not only improves the parking space allocation efficiency, but also reduces the probability of reservation failure and enhances the user experience.

[0074] In an embodiment, Figure 3 is a flowchart of another differentiated parking space allocation method provided by an embodiment of the application. The embodiment is based on the above-mentioned embodiments and is a preferred embodiment, which describes the allocation process of the differentiated parking space. As shown in Figure 3 , the allocation process of the differentiated parking space in the embodiment includes the following steps:

[0075] S310, obtaining parking request information of a target vehicle.

[0076] In an embodiment, the parking request information includes a target user identifier and a reservation parking time range, and a user parking demand feature UF k (at k ,lt k ) is generated according to the parking request information. Wherein, the subscript k represents the target user, at k and lt k represent the reservation parking start time and the reservation parking end time of the target vehicle corresponding to the target user, respectively.

[0077] The identifier of the target user can be an account number of the target user, a license plate number of the target vehicle, or an ID number of the target user, and the application does not limit the same. The identifier of the target user is used to represent the target user, and the target user can correspond to multiple target vehicles.

[0078] S320, idle information of an idle parking space in the target parking lot is acquired.

[0079] The idle information of the idle parking space includes a parking space number of the idle parking space and an idle time period. In actual operation, a parking space idle matrix can be used to represent the idle information of the idle parking space in the target parking lot. For example, a PIM n represents the parking space idle matrix, and The PIM n is composed of n rows and t columns, n represents the total number of parking spaces in the target parking lot, t represents the total number of time periods, the time interval of each time period is Δt, a ij = 0 indicates that the parking space i is occupied in the j time period, a ij = 1 indicates that the parking space i is not occupied in the j time period. I = 1, 2, …, n; j = 1, 2, …, t.

[0080] S330, starting from the smallest parking space number of the idle parking space, the selected parking space meeting the reservation parking time range is searched.

[0081] For example, assuming that the smallest parking space number of the idle parking space is 1, starting from the No. 1 parking space, the selected parking space meeting the reservation parking time range is searched in sequence. The selected parking space meets the following conditions: at(f) i -at k ≤ 0 and lt(f) i -lt k ≥ 0. Wherein, at(f) i represents the idle start time of the idle time period of the selected parking space i, at k represents the reservation start time of the reservation parking time range of the user k; lt(f) i represents the idle end time of the idle time period of the selected parking space i, lt k represents the reservation end time of the reservation parking time range of the user k.

[0082] S340, whether there is a selected parking space, if yes, S350 is executed; if not, S3120 is executed.

[0083] S350, whether there are multiple selected parking spaces, if yes, S360 is executed; if not, S3100 is executed.

[0084] S360, determine whether the optional parking space is spliced with the reserved parking time range.

[0085] S370, whether there is an optional parking space spliced with the reserved parking time range, if yes, execute S380; if no, execute S390.

[0086] S380, select an optional parking space spliced with the reserved parking time range.

[0087] In an embodiment, when there are multiple optional parking spaces meeting the reservation parking time range in the target parking lot, an optional parking space spliced with the reserved parking time range is preferentially selected from the multiple optional parking spaces meeting the reservation parking time range according to the parking space occupancy of the optional parking spaces, and a parking order is generated. Wherein, when there is an optional parking space spliced with the reserved parking time range, the time splicing meets the following conditions: at(f) i -at k =0 or lt(f) i -lt k =0. Wherein, at(f) i refers to the free start time of the free period of the optional parking space i, at k refers to the reserved parking start time of the reservation parking time range of the user k; lt(f) i refers to the free end time of the free period of the optional parking space i, lt k refers to the reserved parking end time of the reservation parking time range of the user k. When there are multiple optional parking spaces spliced with the reserved parking time range, an optional parking space meeting at(f) i -at k =0 and lt(f) i -lt k =0 is preferentially selected from the multiple optional parking spaces spliced with the reservation parking time range according to the parking space occupancy of the optional parking spaces, and a parking order is generated.

[0088] S390, randomly select an optional parking space.

[0089] In an embodiment, when there are multiple optional parking spaces meeting the reservation parking time range in the target parking lot, and there are no optional parking spaces spliced with the reservation parking time range, an optional parking space is randomly selected from the multiple optional parking spaces meeting the reservation parking time range.

[0090] S3100, generate a parking order and feed back a reservation success prompt information to the target vehicle.

[0091] After generating the parking order, a prompt information similar to "reservation success" is fed back to the target vehicle. Among them, the parking order includes: target user identifier, reservation parking time range, target parking space number and order QR code information.

[0092] S3110, update the idle information of the idle parking space.

[0093] S3120, search for optional parking spaces that can meet the reservation parking time range to the greatest extent.

[0094] In an embodiment, when there is no optional parking space that can meet the reservation parking time range in the target parking lot, traversal is performed from No. 1 parking space to search for an idle time period that can meet the reservation parking time range to the greatest extent, and an adjustment inquiry instruction of whether to accept the adjusted order is issued, and the inquiry result is received.

[0095] S3130, whether to accept the adjusted order, if yes, execute S350; if no, execute S3140.

[0096] In an embodiment, when the received inquiry result is to accept the adjusted order, it is judged whether there are multiple optional parking spaces that can meet the reservation parking time range to the greatest extent, when there are multiple optional parking spaces, the optional parking space that is spliced with the already reserved time range is preferentially selected, a parking order is generated, and a prompt information of "reservation success" is fed back to the parking applicant, and the idle parking space idle situation matrix is updated. Among them, the parking order includes target user identifier, reservation parking time range, target parking space number and order QR code information. When the received inquiry result is to refuse the adjusted order, a prompt information of "reservation failure" is fed back to the parking applicant.

[0097] In an embodiment, the idle time period that can meet the reservation parking time range to the greatest extent needs to meet the target function: min((at(f) i -at k )+(lt k -lt(f) i )), wherein at(f) i indicates the idle start time of the idle time period of the optional parking space i, at k indicates the reservation start time of the reservation parking time range of the user k; lt(f) i indicates the idle end time of the idle time period of the optional parking space i, lt k indicates the reservation end time of the reservation parking time range of the user k.

[0098] S3140, feed back a reservation failure prompt information to the target vehicle.

[0099] S3150, complete the operation and end.

[0100] It should be noted that, when there is an optional parking space meeting the reservation parking time range, the optional parking space in S350 is the optional parking space meeting the reservation parking time range, and when there are multiple optional parking spaces meeting the reservation parking time range, the optional parking spaces after S360 all refer to the optional parking spaces meeting the reservation parking time range; when there is no optional parking space meeting the reservation parking time range, the optional parking space meeting the reservation parking time range is searched, and when the adjusted order is accepted, S350 and the optional parking spaces after S350 all refer to the optional parking space meeting the reservation parking time range.

[0101] The technical scheme of the embodiment combines parking request information, plans and allocates overall parking spaces in a differentiated parking space allocation scenario, fundamentally improves parking space allocation efficiency, reduces the probability of reservation failure, and enhances user experience.

[0102] In an embodiment, the differentiated parking space allocation process is described by taking an example in which all parking spaces in a target parking lot are in an idle state. Specifically, the differentiated parking space allocation process in the embodiment includes the following steps:

[0103] S11, obtaining parking request information of a target vehicle.

[0104] In an embodiment, the differentiated parking space allocation process is described by taking an example in which a target user with an account number of 123 and a target vehicle under the target user as a parking applicant. It is assumed that the parking applicant with the account number of 123 applies for a reservation parking time range of 8:00 on January 1 to 11:00 on January 1.

[0105] S12, obtaining idle information of idle parking spaces in a target parking lot.

[0106] In an embodiment, the parking spaces in the target parking lot where the target vehicle is to be parked are all in an idle state, that is, the parking space idle matrix PIM n is as follows: Table 1 is a schematic table of occupancy of parking spaces in a target parking lot provided by an embodiment of the application.

[0107] Table 1 is a schematic table of occupancy of parking spaces in a target parking lot

[0108] 1 2 3 4 8:00 8:10 8:20 8:30 8:40 8:50 9:00 9:10 9:20 9:30 9:40 9:50 10:00 10:10 10:20 10:30 10:40 10:50 11:00 11:10 11:20 11:30 11:40 11:50

[0109] As shown in Table 1, all parking spaces with numbers 1-4 in the target parking lot are in an idle state from 8:00 to 12:00 on January 1.

[0110] S13, judging whether there is a parking space suitable for the target vehicle to park in the target parking lot within the reservation parking time range according to the parking request information and the idle information of the idle parking space, generating a parking order, and feeding back the judgment result to the parking applicant.

[0111] The parking order includes a target user identifier corresponding to the target vehicle, a reservation parking time range, a target parking space number, and order QR code information.

[0112] In an embodiment, the reservation parking time range of the parking order is from 8:00 on January 1 to 11:00 on January 1. Each parking space in the target parking lot is in an idle state on January 1, so the order is traversed in sequence from the first parking space to search for a selectable parking space that meets the reservation parking time range. Then, it is found that all parking spaces meet the reservation parking time range, so the first parking space is selected as the parking space corresponding to the target parking space number in the parking order, and the parking space idle matrix PIM is updated n , a parking order (i.e., order one) is generated, and a prompt information of "reservation success" is fed back to the parking applicant. The parking order includes a target user identifier, a reservation parking time range, a target parking space number, and order QR code information. Table 2 is another schematic table of the occupancy of parking spaces in a target parking lot according to an embodiment of the present application. As shown in Table 2, the target vehicle in the parking order one occupies the first parking space from 8:00 on January 1 to 11:00 on January 1.

[0113] Table 2 is another schematic table of the occupancy of parking spaces in a target parking lot

[0114]

[0115] In an embodiment, the target parking lot already has order one, and the differentiated parking space allocation process is described. Specifically, the differentiated parking space allocation process in this embodiment includes the following steps:

[0116] S21, obtaining parking request information of a target vehicle.

[0117] In an embodiment, a target user with an account number of 234 and a target vehicle under his name are taken as an example to describe the differentiated parking space allocation process. It is assumed that the reservation parking time range applied by the parking applicant with the account number of 234 is from 11:00 on January 1 to 12:00 on January 1.

[0118] S22, obtaining idle information of idle parking spaces in a target parking lot.

[0119] In the embodiment, there is already an order in the target parking lot that occupies parking space number 1, and the time period from 8:00 AM to 11:00 AM on January 1st is when parking space number 1 is occupied. The occupancy status of parking spaces in the target parking lot is shown in Table 2.

[0120] S23. Based on the parking request information and the availability of parking spaces, determine whether there are suitable parking spaces in the target parking lot for the target vehicle to park within the reserved parking time range, generate a parking order, and provide feedback on the judgment result to the parking applicant.

[0121] The parking order includes: the target user identifier corresponding to the target vehicle, the reserved parking time range, the target parking space number, and the order QR code information.

[0122] In this embodiment, the reserved parking time range for the parking order is from 11:00 AM to 12:00 PM on January 1st. The vacancy status of parking spaces in the target parking lot is shown in Table 2. Starting from parking space number 1, the system sequentially searches for available parking spaces that meet the reserved parking time range. The search finds that all parking spaces meet the reserved parking time range, but the reserved parking time range of the current order can be concatenated with the reserved parking time range of parking space number 1. Therefore, parking space number 1 is selected as the parking space corresponding to the target parking space number in the parking order, and the parking space vacancy matrix PIM is updated. n A parking order (i.e., Order Two) is generated, and a "Reservation Successful" notification is sent to the parking applicant. The parking order includes the target user identifier, the reserved parking time range, the target parking space number, and the order QR code information. Table 3 is a schematic table illustrating the occupancy status of parking spaces in a target parking lot according to another embodiment of the present invention. As shown in Table 3, the target vehicle in Parking Order One occupies parking space No. 1 from 8:00 AM to 11:00 AM on January 1st, and the target vehicle in Parking Order Two occupies parking space No. 1 from 11:00 AM to 12:00 PM on January 1st.

[0123] Table 3. Schematic diagram of parking space occupancy in another type of target parking lot.

[0124]

[0125] In one embodiment, taking orders one through six already existing in the target parking lot as an example, the process of allocating differentiated parking spaces is described. Specifically, the differentiated parking space allocation process in this embodiment includes the following steps:

[0126] S31. Obtain the parking request information of the target vehicle.

[0127] In the embodiment, the target user with the account number 456 is taken as an example, and the target vehicle under the target user is taken as an example of a parking application party, and the differentiated parking space allocation process is described. It is assumed that the reservation parking time range of the parking application party with the account number 456 is from 9:00 on January 1 to 11:00 on January 1.

[0128] S32, obtain idle information of an idle parking space in the target parking lot.

[0129] In the embodiment, orders one to six already exist in the target parking lot, and the occupancy of the parking spaces in the target parking lot is shown in Table 4.

[0130] Table 4 is another schematic table of the occupancy of the parking spaces in the target parking lot

[0131]

[0132] S33, according to the parking request information and the idle information of the idle parking space, it is judged whether there is a parking space suitable for parking the target vehicle in the reservation parking time range in the target parking lot, a parking order is generated, and the judgment result is fed back to the parking application party.

[0133] The parking order includes: a target user identifier corresponding to the target vehicle, a reservation parking time range, a target parking space number, and order two-dimensional code information.

[0134] In the embodiment, the reservation parking time range of the parking order is from 9:00 on January 1 to 11:00 on January 1, and the idle state of the parking spaces in the target parking lot is shown in Table 4, then the order traversal is started from the No. 1 parking space, and the optional parking space satisfying the reservation parking time range is searched; then it is found that there is no optional parking space satisfying the reservation parking time range.

[0135] When there is no optional parking space satisfying the reservation parking time range in the target parking lot, the traversal is started from the No. 1 parking space, and the idle time period satisfying the reservation parking time range to the greatest extent is searched. Table 5 is a schematic table of an idle time period provided by the embodiment of the application. As shown in Table 5, after the orders one to six are completed in the target parking lot, the idle time period of the parking spaces in the target parking lot includes the following three cases:

[0136] Table 5 is a schematic table of an idle time period

[0137] Free period 1 Bay 2 9.10 - 11.00 Free period 2 Bay 3 10.00 - 12.00 Free period 3 Bay 4 9.10 - 12.00

[0138] In the embodiment, according to the obtained schematic table of the idle time period, the target function min((at(f) i -at k )+(lt k -lt(f) iThe idle time periods satisfying the target function are idle time period 1 and idle time period 3 according to Table 5. Compared with the parking time range 9:00-11:00 applied by the parking applicant, the parking start time of the two idle time periods is delayed by 10 minutes, and an adjustment inquiry instruction of whether to accept the adjusted order is sent to the target vehicle, and an adjustment inquiry result is received.

[0139] When the received adjustment inquiry result is to accept the adjusted order, it is determined whether there are multiple selectable parking spaces, and when there are multiple selectable parking spaces, a parking space that can be spliced with the already reserved parking time range is preferentially selected. Since the idle time period 9:10-11:00 of the No. 2 parking space is exactly splicable with the already reserved parking time range of the No. 2 parking space, the No. 2 parking space is selected, a parking order is generated, a prompt information of "reservation success" is fed back to the parking applicant, and a parking space idle matrix PIM is updated. n The parking order includes a target user identifier, a reserved parking time range, a target parking space number, and order QR code information. Table 6 is another parking space occupation situation table in a target parking lot provided by the embodiment of the application. As shown in Table 6, after the update, the parking space occupation situation is that the No. 1 parking space and the No. 2 parking space are occupied between 8:00-12:00, the No. 3 parking space is occupied between 8:00-10:00, and the No. 4 parking space is occupied between 8:00-9:10.

[0140] Table 6 is another parking space occupation situation table in a target parking lot

[0141]

[0142] Of course, when the received inquiry result is to refuse the adjusted order, a prompt information of "reservation failure" is fed back to the parking applicant, and the parking space occupation situation in the target parking lot is as shown in Table 4.

[0143] The technical solution of the embodiment of the application is applicable to a scenario of sharing differentiated parking space distribution such as private parking space, and idle information of idle parking spaces is published by a parking space owner. Of course, the solution is also applicable to non-differentiated parking spaces in a parking lot. Meanwhile, parking space distribution is performed according to a reserved parking time range, a parking space idle situation, and a preset time range splicing rule, and an order QR code is fed back, so that the parking space distribution efficiency is improved. Meanwhile, an adjustment inquiry mechanism is added, that is, when there is no idle time period satisfying the reserved parking time range in a target parking lot, an idle time period satisfying the reserved parking time range to the maximum extent is automatically searched, and an inquiry of whether to accept the adjusted order is sent to the target vehicle, so that the parking space distribution efficiency is improved, the probability of reservation failure is reduced, and the user experience is enhanced.

[0144] In an embodiment, Figure 4is a structural block diagram of a differentiated parking space allocation device provided by an embodiment of the present application, which is suitable for the case of allocating differentiated parking spaces, and can be implemented by hardware / software. Figure 4 As shown in the figure, the differentiated parking space allocation device includes a first acquisition module 410, a first generation module 420, and a first allocation module 430.

[0145] The first acquisition module 410 is configured to acquire parking request information of a target vehicle.

[0146] The first generation module 420 is configured to generate a corresponding parking order according to the idle information of the idle parking spaces in the target parking lot and the reservation parking time range in the parking request information; wherein the idle information includes a parking space number and an idle time period; the daily idle time period of each idle parking space is different.

[0147] The first allocation module 430 is configured to allocate the parking space corresponding to the target parking space number in the parking order to the target vehicle.

[0148] The technical solution of the embodiment, by combining the reservation parking time range of the target vehicle according to the idle information of the idle parking spaces in the target parking lot, overall plans and allocates the parking spaces in the differentiated parking space allocation scenario, fundamentally improves the parking space allocation efficiency, reduces the reservation failure probability, and enhances the user's parking experience.

[0149] On the basis of the above-mentioned embodiment, the first generation module 420 includes:

[0150] A first searching unit is configured to search the first type parking spaces in order according to the parking space numbers of the idle parking spaces in the target parking lot, and the first type parking spaces are optional parking spaces meeting the reservation parking time range in the parking request information.

[0151] A first determining unit is configured to, when the number of the first type parking spaces is at least two, determine the splicing situation between the reserved parking time range of each first type parking space and the reservation parking time range as a first splicing situation.

[0152] A first generation unit is configured to generate a corresponding parking order according to the first splicing situation, the idle information of the first type parking spaces, and the reservation parking time range.

[0153] On the basis of the above-mentioned embodiment, the first generation unit is specifically configured to, when there is a first type parking space spliced with the reservation parking time range, generate a corresponding parking order according to the idle information of the first type parking space spliced with the reservation parking time range and the reservation parking time range.

[0154] On the basis of the above-mentioned embodiments, the first generation unit is specifically configured to: when there is no first type parking space spliced with the reservation parking time range, generating a corresponding parking order according to the idle parking space information of any one first type parking space and the reservation parking time range.

[0155] On the basis of the above-mentioned embodiments, the first generation module 420 comprises:

[0156] The first search unit is configured to search first type parking spaces in the target parking lot in order according to the parking space numbers of the idle parking spaces in the target parking lot, the first type parking spaces being optional parking spaces meeting the reservation parking time range in the parking request information;

[0157] The second search unit is configured to search second type parking spaces in the target parking lot in order according to the parking space numbers of the idle parking spaces in the target parking lot when the number of the first type parking spaces is 0, the second type parking spaces being optional parking spaces meeting the reservation parking time range in the parking request information to the greatest extent;

[0158] The sending unit is configured to send an adjustment query instruction to the target vehicle;

[0159] The second generation unit is configured to generate a corresponding parking order according to the determined number of the second type parking spaces, the idle information of the second type parking spaces and the reservation parking time range when receiving the adjustment confirmation instruction fed back by the target vehicle;

[0160] The feedback unit is configured to feed back reservation failure prompt information to the target vehicle when receiving the rejection adjustment instruction fed back by the target vehicle.

[0161] On the basis of the above-mentioned embodiments, the second generation unit comprises:

[0162] The first determination sub-unit is configured to determine the splicing condition between the reserved parking time range of each second type parking space and the reservation parking time range as a second splicing condition when the number of the second type parking spaces is at least two.

[0163] The first generation sub-unit is configured to generate a corresponding parking order according to the second splicing condition, the idle information of the second type parking spaces and the reservation parking time range.

[0164] On the basis of the above-mentioned embodiments, the first generation sub-unit is specifically configured to: when there is a second type parking space spliced with the reservation parking time range, generate a corresponding parking order according to the idle information of the second type parking space spliced with the reservation parking time range and the reservation parking time range.

[0165] On the basis of the above-mentioned embodiment, the first generation sub-unit is specifically configured to: when there is no second type parking space spliced with the reservation parking time range, generate a corresponding parking order according to the idle information of any one second type parking space and the reservation parking time range.

[0166] On the basis of the above-mentioned embodiment, the differentiated parking space allocation device further comprises:

[0167] The feedback module is configured to, after generating a corresponding parking order according to the idle information of the idle parking space in the target parking lot and the reservation parking time range in the parking request information, feed back reservation success prompt information to the target vehicle.

[0168] On the basis of the above-mentioned embodiment, the parking order comprises: a target user identifier corresponding to the target vehicle, an order two-dimensional code, a reservation parking time range, a target parking space number, and a license plate number of the target vehicle.

[0169] The above-mentioned differentiated parking space allocation device can execute the differentiated parking space allocation method provided by any embodiment of the present application, and has the corresponding function modules and beneficial effects of executing the differentiated parking space allocation method.

[0170] Figure 5 is a hardware structure schematic diagram of a differentiated parking space allocation device provided by an embodiment of the present application. The differentiated parking space allocation device in the embodiment of the present application is taken as an example to be described by taking a computer device as an example. Figure 5 As shown in the figure, the computer device provided by the embodiment of the present application comprises: a processor 510, a memory 520, an input device 530, an output device 540, and a communication module 550. The processor 510 in the computer device can be one or more, Figure 5 In the embodiment, the processor 510 in the computer device, the memory 520, the input device 530, the output device 540, and the communication module 550 can be connected through a bus or other means, Figure 5 In the embodiment, the connection through the bus is taken as an example.

[0171] The memory 520 in the computer device, as a kind of computer readable storage medium, can be used to store one or more programs, and the program can be a software program, a computer executable program and a module, such as the program instructions / modules (for example, Figure 4 The modules in the differentiated parking space allocation device shown in the figure comprise: a first acquisition module 910, a first generation module 920, and a first allocation module 930). The processor 510 executes the software program, instruction and module stored in the memory 520, thereby executing various function applications and data processing of the computer device, that is, realizing the differentiated parking space allocation method in the above-mentioned method embodiment.

[0172] The memory 520 can include a program storage area and a data storage area, where the program storage area can store an operating system, application programs required by at least one function, and the like; the data storage area can store data created according to the use of the device, and the like. In addition, the memory 520 can include a high-speed random access memory, and can also include a nonvolatile memory, such as at least one magnetic disk storage device, a flash memory device, or other nonvolatile solid-state memory device. In some examples, the memory 520 can further include a memory disposed remotely with respect to the processor 510, which can be connected to the device through a network. Examples of the above network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0173] The input device 530 can be used to receive digital or character information input by a user, to generate key signal input related to user settings and function control of the terminal device. The output device 540 can include a display device such as a display screen. The communication module 550 is used for communication interaction with the target vehicle.

[0174] And when the one or more programs included in the above computer device are executed by the one or more processors 510, the programs perform the following operations: obtaining parking request information of a target vehicle; generating a corresponding parking order according to idle information of idle parking spaces in a target parking lot and a reservation parking time range in the parking request information; wherein the idle information includes: parking space number and idle time period; the daily idle time period of each idle parking space is different; and allocating the parking space corresponding to the target parking space number in the parking order to the target vehicle.

[0175] The embodiment of the application also provides a computer readable storage medium, which stores a computer program, and the program is executed by a processor to implement the differentiated parking space allocation method provided by the embodiment of the application, and the method comprises the following steps: obtaining parking request information of a target vehicle; generating a corresponding parking order according to idle information of idle parking spaces in a target parking lot and a reservation parking time range in the parking request information; wherein the idle information includes: parking space number and idle time period; the daily idle time period of each idle parking space is different; and allocating the parking space corresponding to the target parking space number in the parking order to the target vehicle.

[0176] The computer storage medium of the embodiments of the present application can adopt any combination of one or more computer readable media. The computer readable medium can be a computer readable signal medium or a computer readable storage medium. The computer readable storage medium may, for example, be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or apparatus, or any combination of the above. More specific examples (non-exhaustive list) of the computer readable storage medium include: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In this document, the computer readable storage medium can be any tangible medium that contains or stores a program that can be used by or in connection with an instruction execution system, apparatus or device.

[0177] The computer readable signal medium can include a data signal propagated in baseband or propagated as a carrier wave in a propagated data signal, in which the computer readable program code is contained. Such propagated data signal can take many forms, including but not limited to electro-magnetic, optical or any suitable combination thereof. The computer readable signal medium can also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate or transport program for use by or in connection with an instruction execution system, apparatus or device.

[0178] The program code contained on the computer readable medium can be transmitted using any suitable medium, including but not limited to wireless, wire line, optical cable, RF, etc., or any suitable combination of the above.

[0179] Computer program code for carrying out operations of the present application can be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code can execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection can be made to an external computer (for example, through the Internet using an Internet Service Provider).

[0180] It should be noted that the above-mentioned embodiments illustrate rather than limit the application, and that those skilled in the art will be able to design many alternative embodiments without departing from the scope of the application. The word "comprising" does not exclude the presence of elements or steps other than those listed and the word "a" or "an" preceding the usage of an element does not exclude the presence of a plurality of such elements. It is anticipated that, depending on the specific design choices made for a given embodiment, the application can be implemented in a variety of ways, all of which are intended to fall within the scope of the present application as defined by the subjoined claims.

Claims

1. A method of differentiated parking space allocation, characterized in that, The method comprises the following steps: acquiring parking request information of a target vehicle; generating a parking order corresponding to the target parking lot according to idle information of idle parking spaces in the target parking lot and a reservation parking time range in the parking request information, wherein the idle information comprises a parking space number and an idle time period, and the idle time period of each idle parking space is different; allocating a target parking space corresponding to the target parking space number in the parking order to the target vehicle; the step of generating a parking order corresponding to the target parking lot according to the idle information of the idle parking spaces in the target parking lot and the reservation parking time range in the parking request information comprises the following steps: sequentially searching for a first type of parking space according to the parking space number of the idle parking space in the target parking lot, wherein the first type of parking space is a selectable parking space meeting the reservation parking time range in the parking request information; when the number of the first type of parking space is at least two, determining a splicing condition between the reserved parking time range of each first type of parking space and the reservation parking time range as a first splicing condition; generating a parking order corresponding to the first splicing condition, the idle information of the first type of parking space and the reservation parking time range; the step of generating a parking order corresponding to the first splicing condition, the idle information of the first type of parking space and the reservation parking time range comprises the following steps: when there is a first type of parking space spliced with the reservation parking time range, generating a parking order corresponding to the idle information of the first type of parking space spliced with the reservation parking time range and the reservation parking time range; the step of generating a parking order corresponding to the idle information of the first type of parking space and the reservation parking time range comprises the following steps: when there is no first type of parking space spliced with the reservation parking time range, generating a parking order corresponding to the idle information of any one of the first type of parking space and the reservation parking time range.

2. The method of claim 1, wherein, the step of generating a parking order corresponding to the idle information of the idle parking space in the target parking lot and the reservation parking time range in the parking request information comprises the following steps: sequentially searching for a first type of parking space according to the parking space number of the idle parking space in the target parking lot, wherein the first type of parking space is a selectable parking space meeting the reservation parking time range in the parking request information; when the number of the first type of parking space is 0, sequentially searching for a second type of parking space according to the parking space number of the idle parking space in the target parking lot, wherein the second type of parking space is a selectable parking space meeting the reservation parking time range in the parking request information to the greatest extent; sending an adjustment inquiry instruction to the target vehicle; when receiving an adjustment confirmation instruction fed back by the target vehicle, generating a parking order corresponding to the number of the determined second type of parking space, the idle information of the second type of parking space and the reservation parking time range; when receiving a refusal adjustment instruction fed back by the target vehicle, feeding back reservation failure prompt information to the target vehicle.

3. The method of claim 2, wherein, The generating the parking order corresponding to the second type parking space according to the determined number of the second type parking space, the idle information of the second type parking space and the reservation parking time range comprises: When the number of the second type parking space is at least two, determining a splicing condition between the reserved parking time range of each second type parking space and the reservation parking time range as a second splicing condition; Generating the parking order corresponding to the second type parking space according to the second splicing condition, the idle information of the second type parking space and the reservation parking time range.

4. The method of claim 3, wherein, The generating the parking order corresponding to the second type parking space according to the second splicing condition, the idle information of the second type parking space and the reservation parking time range comprises: When there is a second type parking space spliced with the reservation parking time range, generating the parking order corresponding to the second type parking space according to the idle information of the second type parking space spliced with the reservation parking time range and the reservation parking time range.

5. The method of claim 3, wherein, The generating the parking order corresponding to the second type parking space according to the second splicing condition, the idle information of the second type parking space and the reservation parking time range comprises: When there is no second type parking space spliced with the reservation parking time range, generating the parking order corresponding to the second type parking space according to the idle information of any one of the second type parking space and the reservation parking time range.

6. The method of claim 1, wherein, After the generating the parking order corresponding to the second type parking space according to the determined number of the second type parking space, the idle information of the second type parking space and the reservation parking time range, the method further comprises: feeding back a reservation success prompt information to the target vehicle.

7. The method according to any of claims 1 to 6, characterized in that, The parking order comprises a target user identifier corresponding to the target vehicle, an order two-dimensional code, a reservation parking time range, a target parking space number and a license plate number of the target vehicle.

8. A differentiated parking space allocation apparatus characterized by comprising: The device for performing the differentiated parking space allocation method according to any one of claims 1-7 comprises: a first obtaining module configured to obtain parking request information of a target vehicle; a first generating module configured to generate a parking order corresponding to a target parking space according to idle information of idle parking spaces in a target parking lot and a reservation parking time range in the parking request information; wherein the idle information comprises a parking space number and an idle time period; a daily idle time period of each idle parking space is different; a first allocating module configured to allocate a parking space corresponding to the target parking space number in the parking order to the target vehicle.

9. A differentiated parking space allocation apparatus characterized by comprising: The device comprises a communication module, a memory and one or more processors; The communication module is configured to communicate with a target vehicle; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the differentiated parking space allocation method according to any one of claims 1-7.

10. A computer-readable storage medium having stored thereon a computer program, characterized in that, The program is executed by a processor to implement the differentiated parking space allocation method according to any one of claims 1-7.

Images