Vehicle dispatching method and system

Abstract

The application provides a vehicle scheduling method, comprising: obtaining parking information of each parking point in a parking lot; determining the number of vehicles expected to arrive at a same target parking point in a same time period according to the parking information; when the number of vehicles expected to arrive at the target parking point exceeds the number of remaining parking spaces in the target parking point, scheduling the vehicles expected to arrive at the target parking point in the same time period, so that the number of vehicles arriving at the target parking point in the same time period is not greater than the number of parking spaces. By obtaining the parking information of each parking point, the number of vehicles arriving at a same target parking point in a same time period is determined, and when the number of vehicles exceeds the number of remaining parking spaces, the vehicles expected to arrive are scheduled so that the number of vehicles arriving at the same target parking point in the same time period is not greater than the number of parking spaces, thereby avoiding conflicts between multiple vehicles, achieving reasonable scheduling of vehicles, and improving the safety and efficiency of vehicle scheduling.

Description

Technical Field

[0001] This invention relates to the field of intelligent driving technology, and in particular to a vehicle dispatching method and system. Background Technology

[0002] Autonomous Valet Parking (AVP) is hailed as a smart driving technology that solves the "last mile" problem. The difficulty of parking and retrieving a car is a major pain point in modern urban life, and AVP is undoubtedly a market necessity.

[0003] In the AVP design of related technologies, users can select a drop-off point or a pick-up point (such as an elevator entrance). The vehicle can then automatically drive from the parking lot entrance to the selected drop-off point. Upon arrival at the drop-off point, the user can get out of the vehicle directly, while the vehicle finds a parking space and parks itself. Alternatively, the vehicle can automatically drive from the parking space to the user's selected pick-up point. Upon arrival at the pick-up point, the user can get in the vehicle directly, while the vehicle automatically drives to the parking lot exit selected by the user.

[0004] However, the inventors discovered in their research that when multiple vehicles use the automatic valet parking function simultaneously, conflicts may occur during vehicle dispatching for the same drop-off or pick-up point. Summary of the Invention

[0005] This invention provides a vehicle dispatching method and system to solve the problem in the prior art where multiple vehicles use the automatic valet parking function at the same time, and there are certain conflicts during vehicle dispatching for the same drop-off or pick-up point.

[0006] In a first aspect, embodiments of the present invention provide a vehicle dispatching method, comprising:

[0007] Obtain parking information for each parking spot in the parking lot, where the parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space.

[0008] Based on the parking information, determine the number of vehicles expected to arrive at the same target parking point within the same time period;

[0009] When the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces at the target parking point, the vehicles expected to arrive at the target parking point are scheduled to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces.

[0010] Optionally, the dispatching of vehicles expected to arrive at the target parking point within the same time period includes:

[0011] From the vehicles expected to arrive at the target parking point within the same time period, select a first vehicle, no more than the number of available parking spaces, to park at the target parking point, and perform a temporary dispatch operation on the second vehicle other than the first vehicle.

[0012] Optionally, selecting a first vehicle, not exceeding the number of available parking spaces, to park at the target parking spot includes:

[0013] Obtain the first location information of each vehicle expected to arrive at the target parking point within the same time period, and the second location information of the target parking point;

[0014] Based on the first location information and the second location information, the distance between each vehicle and the target parking point is determined;

[0015] Based on the distance, the first vehicle, whose number of available parking locations is not greater than the selected distance, will park at the target parking spot.

[0016] Optionally, selecting a first vehicle no more than the number of available parking spaces to park at the target parking spot based on the distance includes:

[0017] The priority of each vehicle is determined based on the distance.

[0018] The vehicle whose priority meets the preset conditions is identified as the first vehicle, and the first vehicle, which is no more than the number of available parking spaces, is selected to park at the target parking point.

[0019] Optionally, after determining the priority of each vehicle based on the distance, the method further includes:

[0020] Obtain environmental data for each vehicle;

[0021] Based on the environmental data, determine the road condition information for each vehicle;

[0022] The priority is adjusted based on the road condition information to obtain the adjusted priority.

[0023] Optionally, determining the road condition information for each vehicle includes:

[0024] Determine whether there are obstacles on the driving path of each vehicle;

[0025] The step of adjusting the priority based on the road condition information includes:

[0026] If an obstacle exists, adjust the priority corresponding to the vehicle;

[0027] If there are no obstacles, the priority corresponding to the vehicle is maintained.

[0028] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point, and the method further includes:

[0029] If the obstacle exists, update the vehicle's first arrival time.

[0030] If the updated first arrival time falls within the current time period, then the steps of selecting a first vehicle (not exceeding the number of available parking spaces) from the expected arrival vehicles to the target parking point and parking it at the target parking point, and performing the temporary dispatch operation on the second vehicle other than the first vehicle, are executed.

[0031] If the updated first arrival time is outside the current time period, then the step of determining the number of expected vehicles arriving at each parking spot within the time period based on the first arrival time is performed.

[0032] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point, and the temporary dispatching operation for the second vehicle other than the first vehicle includes:

[0033] Adjust the target parking point of the second vehicle;

[0034] Alternatively, control the second vehicle to drive to a preset safe location.

[0035] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point, and the temporary dispatching operation for the second vehicle other than the first vehicle includes:

[0036] The travel route of the second vehicle to the target parking point is replanned, and the travel distance of the second vehicle is increased to adjust the first arrival time of the second vehicle expected to arrive at the target parking point;

[0037] Alternatively, the speed of the second vehicle can be reduced to adjust the first arrival time of the second vehicle as it is expected to reach the target parking point.

[0038] Optionally, obtain parking information for each parking spot within the parking lot, including:

[0039] Get the parking request sent by the user;

[0040] Based on the parking request, determine the parking information for each parking location.

[0041] Optionally, the parking information includes: the first arrival time of each vehicle expected to arrive at the target parking point; determining the number of vehicles expected to arrive at the same target parking point within the same time period based on the parking information includes:

[0042] Based on the first arrival time, determine the expected arrival status of vehicles at each parking point within the time period;

[0043] Based on the expected arrival of vehicles at each parking spot during the time period, determine the number of vehicles expected to arrive at the same target parking spot within the same time period.

[0044] Secondly, embodiments of the present invention provide a vehicle dispatching system, comprising:

[0045] The acquisition module is used to acquire parking information of each parking spot in the parking lot. The parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space.

[0046] The determination module is used to determine the number of vehicles expected to arrive at the same target parking point within the same time period based on the parking information.

[0047] The scheduling module is used to schedule the vehicles expected to arrive at the target parking point within the same time period when the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces in the target parking point. The scheduling is used to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces.

[0048] Thirdly, embodiments of the present invention provide an electronic device, including: a processor, a communication interface, a memory, and a communication bus; wherein the processor, the communication interface, and the memory communicate with each other through the communication bus;

[0049] Memory, used to store computer programs;

[0050] When executing a program stored in memory, the processor implements the steps of the vehicle scheduling method as described in any of the preceding claims.

[0051] Fourthly, embodiments of the present invention provide a computer-readable storage medium storing a computer program, which, when executed by the processor, implements the steps of the vehicle scheduling method as described in any of the preceding claims.

[0052] Compared with prior art, the present invention has the following advantages:

[0053] In this embodiment of the invention, parking information for each parking spot within a parking lot is obtained. The parking spot is either the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space. Based on the parking information, the number of vehicles expected to arrive at the same target parking spot within the same time period is determined. When the number of vehicles expected to arrive at the target parking spot exceeds the number of remaining available parking spaces at the target parking spot, the vehicles expected to arrive at the target parking spot within the same time period are scheduled to ensure that the number of vehicles arriving at the target parking spot within the same time period is not greater than the number of available parking spaces. By acquiring parking information from various parking spots within the parking lot, and analyzing this information to determine the number of vehicles expected to arrive at the same target parking spot within the same time period, this number is compared with the number of remaining parking spaces at that target parking spot. If the number of vehicles exceeds the number of remaining parking spaces, the vehicles expected to arrive at the target parking spot within the same time period are scheduled to ensure that the number of vehicles arriving at the same target parking spot within the same time period does not exceed the number of available parking spaces. This avoids conflicts between multiple vehicles caused by the number of vehicles arriving at the target parking spot simultaneously exceeding the number of available parking spaces, thereby achieving reasonable vehicle scheduling, improving the safety and efficiency of vehicle scheduling.

[0054] The above description is merely an overview of the technical solution of the present invention. In order to better understand the technical means of the present invention and to implement it in accordance with the contents of the specification, and in order to make the above and other objects, features and advantages of the present invention more apparent and understandable, specific embodiments of the present invention are described below. Attached Figure Description

[0055] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the accompanying drawings used in the description of the embodiments will be briefly introduced below.

[0056] Figure 1 This is a parking diagram of a parking spot in a parking lot provided in an embodiment of the present invention;

[0057] Figure 2 A flowchart illustrating the steps of a vehicle dispatching method provided in an embodiment of the present invention;

[0058] Figure 3 A flowchart illustrating the steps of another vehicle dispatching method provided in this embodiment of the invention;

[0059] Figure 4 A schematic diagram of a vehicle dispatching system provided in an embodiment of the present invention;

[0060] Figure 5 A block diagram of an electronic device provided in an embodiment of the present invention. Detailed Implementation

[0061] Exemplary embodiments of the invention will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided to enable a more thorough understanding of the invention and to fully convey the scope of the invention to those skilled in the art.

[0062] This invention can be applied to various parking lots, each with at least one parking spot, and each parking spot can accommodate at least one vehicle. A parking spot refers to a location within the parking lot for temporary vehicle parking to facilitate passenger boarding and alighting, and may include either a boarding point or a drop-off point. For example, in a shopping mall parking lot, the mall's temporary parking entrance can be designated as a parking spot, or the elevator entrance of the parking lot can be designated as a parking spot.

[0063] When using the Autonomous Valet Parking (AVP) function, users can select a drop-off point via an in-vehicle terminal or mobile device. The vehicle will then automatically drive from the parking lot entrance to the selected drop-off point. Upon arrival, the user can exit the vehicle while it searches for and parks in a parking space. Alternatively, users can select a pick-up point via their mobile device. The vehicle will then automatically drive from the parking space to the user's selected pick-up point. Upon arrival, the user can board the vehicle, and the vehicle will automatically drive to the parking lot exit selected by the user. The mobile device can include a tablet, tablet, laptop, smartwatch, etc.

[0064] refer to Figure 1 This illustration shows a parking diagram of a parking spot within a parking lot provided in an embodiment of the present invention. Figure 1 As shown, when multiple vehicles use the automatic valet parking function at the same time, if the number of vehicles expected to arrive at the same parking spot at the same time exceeds the number of available parking spaces at that spot, certain conflicts may occur during vehicle scheduling.

[0065] To address the aforementioned issues, this invention provides a vehicle scheduling method and system to resolve the conflict that may occur when multiple vehicles simultaneously use the automatic valet parking function in the prior art, for the same drop-off or pick-up point, during vehicle scheduling.

[0066] refer to Figure 2 The diagram illustrates a flowchart of a vehicle scheduling method provided by an embodiment of the present invention. Figure 2 The vehicle dispatching method shown includes:

[0067] Step 101: Obtain parking information for each parking spot in the parking lot. The parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space.

[0068] In this embodiment of the invention, before the vehicle stops at a parking spot, the user can select the target parking spot through an in-vehicle terminal or a mobile terminal, and the server obtains the expected parking spot for each vehicle. During the vehicle's journey, the server can continuously acquire the vehicle's driving information, which may include: the vehicle's current position, the vehicle's current speed, and environmental data.

[0069] The server determines the parking information for each parking spot based on the user's selected parking location and the vehicle's travel information. This parking information can include: the expected vehicle, its current location, its current speed, and its estimated arrival time.

[0070] Understandably, the location information of each parking spot can be pre-imported, and users can obtain and select the parking spot that the vehicle is expected to arrive at through the in-vehicle terminal or mobile terminal.

[0071] Optionally, in one embodiment of this application, step 101 may include:

[0072] Step 1011: Obtain the parking request sent by the user.

[0073] In this embodiment of the invention, when a user needs to use the automatic valet parking function, they can send an automatic parking request to the parking lot server through the vehicle terminal or mobile terminal. The automatic parking request may include: the current location information of the vehicle, the target parking point of the vehicle, the estimated arrival time of the vehicle, etc.

[0074] It should be noted that the estimated arrival time of this vehicle can be directly set by the user according to parking needs. The user can send the vehicle's current location and target parking spot to the server via the in-vehicle terminal, and the server will calculate the estimated arrival time. Alternatively, the user can obtain the vehicle's current location via a mobile terminal and send the vehicle's current location and target parking spot to the server, which will then calculate the estimated arrival time. For example, the server can use the historical time taken by a vehicle from its current location to the target parking spot, based on the parking lot's speed limit, as the estimated arrival time. Of course, other methods can also be used to determine the estimated arrival time, and this embodiment of the invention does not limit this method.

[0075] Step 1012: Determine the parking information of each parking location based on the parking request.

[0076] In this embodiment of the invention, the server can simultaneously receive parking requests from multiple users, and by analyzing and statistically analyzing the parking requests sent by each user, determine the parking information corresponding to each parking spot in the parking lot.

[0077] For example, user A sends a parking request including: car A's target parking point is P1, and car A's estimated arrival time is 11:15; user B sends a parking request including: car B's target parking point is P2, and car B's estimated arrival time is 10:28; car C's target parking point is P2, and car C's estimated arrival time is 11:05; car D's target parking point is P1, and car D's estimated arrival time is 11:10; that is, the parking requests sent by the four users are shown in Table 1:

[0078] Table 1 User Parking Requests

[0079] User vehicle Target parking spot Estimated arrival time of vehicle Car A P1 11:15 B car P2 10:28 C car P2 11:10 D car P1 11:05 E car P1 11:26

[0080] After receiving parking requests from the four users in Table 1, the server can obtain parking information for each parking location by performing statistical analysis:

[0081] Parking information for parking spot P1: The vehicles expected to arrive are cars A, D, and E; car A is expected to arrive at 11:05, car D at 11:10, and car E at 11:26.

[0082] Parking information for parking spot P2: The expected arrival vehicles are cars B and C; the expected arrival time for car B is 10:28 and the expected arrival time for car C is 11:05.

[0083] Step 102: Based on the parking information, determine the number of vehicles expected to arrive at the same target parking point within the same time period.

[0084] In this embodiment of the invention, corresponding parking time periods can be pre-set for each parking spot in the parking lot. Specifically, the parking time of each parking spot can be divided into different time periods with the same time interval. For example, taking a time interval of 30 minutes as an example, the daily parking time of each parking spot can be divided into: 10:00~10:30, 10:30~11:00, 11:00~11:30, and so on. Each time period includes the beginning of that time period.

[0085] It should be noted that the specific time periods corresponding to each parking spot in the parking lot can be set according to actual needs, and the embodiments of the present invention do not impose any restrictions on them.

[0086] Specifically, the time periods for each parking spot within the parking lot can be set to the same time period or different time periods. Of course, different time periods for the same parking spot can be set according to the same time interval or different time periods; in practice, the settings can be adjusted based on the parking lot's usage.

[0087] In some embodiments, time periods can be set according to parking demand, with the time interval shortened when parking demand is high and extended when parking demand is low. Specifically, parking demand in different time intervals can be obtained, and different time periods can be divided according to the magnitude of parking demand, so that the time period corresponding to the time interval with high parking demand is shorter than the time period corresponding to the time interval with low parking demand. For example, parking demand in different time intervals can be statistically analyzed based on the historical parking situation of the parking lot to determine the demand magnitude in different time intervals. Of course, other methods can also be used to determine the magnitude of parking demand, and those skilled in the art can set them as needed; this embodiment of the invention does not limit this. In addition, corresponding time periods can be set according to the actual time users spend getting in and out of the car and retrieving and placing luggage at the parking spot. Those skilled in the art can set the corresponding time periods for each parking spot according to actual needs; this embodiment of the invention does not limit this.

[0088] After the server analyzes and statistically obtains the parking information of each parking spot, it further calculates the expected number of all vehicles expected to arrive at the same target parking spot within the same time period based on the obtained parking information.

[0089] Optionally, the parking information may include: the estimated first arrival time of each vehicle at the target parking point; then step 102 may include:

[0090] 1021. Based on the first arrival time, determine the expected arrival status of vehicles at each parking point within the time period;

[0091] 1022. Based on the expected arrival of vehicles at each parking spot within the time period, determine the number of vehicles expected to arrive at the same target parking spot within the same time period.

[0092] In this embodiment of the invention, based on the estimated arrival time of each vehicle as the first arrival time, the estimated arrival situation of vehicles at each parking point in different time periods can be analyzed. Then, based on the estimated arrival situation of vehicles, the number of vehicles expected to arrive at the same target parking point in the same time period can be determined. The number of vehicles expected to arrive refers to the number of vehicles expected to arrive at the same target parking point in the same time period.

[0093] For example, based on the information in Table 1, we can analyze the expected arrival times of vehicles at each parking spot during different time periods, as shown in Table 2 below:

[0094] Table 2. Estimated vehicle arrival times at each parking spot at different times.

[0095]

[0096]

[0097] Based on the estimated arrival times of vehicles at parking points P1 and P2 obtained from Table 2, it can be further determined that: during the period from 10:30 to 11:00, the estimated number of vehicles arriving at the same target parking point P1 is 0, and the estimated number of vehicles arriving at the same target parking point P2 is 1; during the period from 11:00 to 11:30, the estimated number of vehicles arriving at the same target parking point P1 is 3, and the estimated number of vehicles arriving at the same target parking point P2 is 1.

[0098] Step 103: When the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces at the target parking point, the vehicles expected to arrive at the target parking point within the same time period are scheduled to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces.

[0099] In this embodiment of the invention, based on the number of expected arriving vehicles at the target parking point determined in step 102 above and the remaining number of parking spaces at the target parking point, it is determined whether the number of expected arriving vehicles at the target parking point in the same time period exceeds the remaining number of parking spaces.

[0100] If the number of expected arriving vehicles does not exceed the remaining parking space, then control the corresponding vehicles expected to arrive at the target parking point to park at the target parking point, and continue to execute steps 101 to 103.

[0101] If the number of expected arriving vehicles exceeds the remaining parking spaces, then the expected arriving vehicles for the target parking point within the same time period are scheduled so that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces at the target parking point, and then steps 101 to 103 are executed.

[0102] Continuing with the information in Table 1 above, during the time period of 11:00 to 11:30, the estimated number of vehicles arriving at the same target parking point P1 is 3, and the estimated number of vehicles arriving at the same target parking point P2 is 1. If both parking points P1 and P2 have 2 remaining parking spaces, then for target parking point P1, the 3 vehicles expected to arrive during the 11:00 to 11:30 time period need to be scheduled to ensure that no more than 2 vehicles arrive at the parking point during this period, thus avoiding conflicts caused by 3 vehicles arriving at parking point P1 at the same time. For target parking point P2, there is no need to schedule the 1 vehicle expected to arrive; simply control the corresponding vehicle to park at that parking point.

[0103] Specifically, the number of available parking spaces can be set for each parking spot in the parking lot. By monitoring the real-time vehicle parking situation at each parking spot, when the vehicle currently parked at the target parking spot leaves, it can be determined that there are remaining available parking spaces, thus determining the number of remaining available parking spaces at the target parking spot.

[0104] It should be noted that monitoring equipment can be installed at each parking spot within the parking lot to monitor the current parking situation in real time and determine the number of remaining available parking spaces. The monitoring equipment may include surveillance cameras, infrared sensors, etc., and the specific monitoring equipment can be selected according to actual needs; this embodiment of the invention does not impose any limitations on this.

[0105] In this embodiment of the invention, parking information of each parking spot in the parking lot is obtained. The parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space. Based on the parking information, the number of vehicles expected to arrive at the same target parking spot within the same time period is determined. When the number of vehicles expected to arrive at the target parking spot exceeds the number of remaining available parking spaces in the target parking spot, the vehicles expected to arrive at the target parking spot within the same time period are scheduled. The scheduling is used to ensure that the number of vehicles arriving at the target parking spot within the same time period is not greater than the number of available parking spaces. By acquiring parking information from various parking spots within the parking lot, and analyzing this information to determine the number of vehicles expected to arrive at the same target parking spot within the same time period, this number is compared with the number of remaining parking spaces at that target parking spot. If the number of vehicles exceeds the number of remaining parking spaces, the vehicles expected to arrive at the target parking spot within the same time period are scheduled to ensure that the number of vehicles arriving at the same target parking spot within the same time period does not exceed the number of available parking spaces. This avoids conflicts between multiple vehicles caused by the number of vehicles arriving at the target parking spot simultaneously exceeding the number of available parking spaces, thereby achieving reasonable vehicle scheduling, improving the safety and efficiency of vehicle scheduling.

[0106] refer to Figure 3 This illustrates another vehicle dispatching method provided by an embodiment of the present invention, which may specifically include the following steps:

[0107] Step 201: Obtain parking information for each parking spot within the parking lot.

[0108] Specifically, the specific implementation process of this step can be carried out by referring to step 101 in Example 1, and will not be repeated here.

[0109] Step 202: Based on the parking information, determine the number of vehicles expected to arrive at the same target parking point within the same time period.

[0110] Specifically, the specific implementation process of this step can be carried out by referring to step 102 in Embodiment 1, and will not be repeated here.

[0111] Step 203: When the number of vehicles expected to arrive at the target parking point exceeds the number of remaining parking spaces at the target parking point, select a first vehicle (not exceeding the number of available parking spaces) from the vehicles expected to arrive at the target parking point within the same time period and park it at the target parking point; and perform a temporary dispatch operation on the second vehicle other than the first vehicle.

[0112] In this embodiment of the invention, when the number of vehicles expected to arrive at the same target parking point within the same time period exceeds the number of remaining parking spaces at the target parking point, a first vehicle not exceeding the number of available parking spaces can be selected from the vehicles expected to arrive at the target parking point within the same time period, and the first vehicle can be controlled to stop at the target parking point according to the expected arrival time.

[0113] For the vehicles expected to arrive at the target parking point, the second vehicle other than the first vehicle is temporarily rescheduled. This temporary rescheduling means rescheduling the second vehicle to avoid stopping at the target parking point during the specified time period. This ensures that only the first vehicle stops during the specified time period, avoiding conflicts caused by the number of vehicles expected to arrive at the same target parking point exceeding the number of available parking spaces. This achieves reasonable vehicle scheduling, improves the safety of vehicle scheduling, and increases the efficiency of vehicle scheduling.

[0114] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point; and in step 203, a temporary dispatch operation is performed on a second vehicle other than the first vehicle, including:

[0115] Adjust the target parking point of the second vehicle;

[0116] Alternatively, control the second vehicle to drive to a preset safe location.

[0117] In some embodiments, the parking information of each parking spot obtained by the server may include: the first arrival time of the vehicle expected to arrive at the target parking spot; when the number of vehicles expected to arrive at the same target parking spot in the same time period exceeds the number of remaining parking spaces in the target parking spot, the first arrival time of the second vehicle is adjusted, for example, the first arrival time of the second vehicle may be postponed to wait for the next time period.

[0118] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point; and in step 203, a temporary dispatch operation is performed on a second vehicle other than the first vehicle, including:

[0119] The travel route of the second vehicle to the target parking point is replanned, and the travel distance of the second vehicle is increased to adjust the first arrival time of the second vehicle expected to arrive at the target parking point;

[0120] Alternatively, the speed of the second vehicle can be reduced to adjust the first arrival time of the second vehicle as it is expected to reach the target parking point.

[0121] In this embodiment of the invention, a new driving route can be replanned for the second vehicle based on the map data of the parking lot, the current first location information of the vehicle and the second location information of the target parking point. The new driving route increases the driving distance of the second vehicle to the target parking point, thereby adjusting the first arrival time of the second vehicle and delaying the expected arrival time of the second vehicle.

[0122] The first arrival time of the second vehicle can also be adjusted by reducing its current speed to extend its estimated travel time to the target parking point, thus delaying its estimated arrival time.

[0123] Of course, other methods can be used to adjust the first arrival time of the second vehicle. Those skilled in the art can set it according to the actual situation, and the embodiments of the present invention do not limit this.

[0124] In some embodiments, the target parking point of the second vehicle can be adjusted, selecting a parking point other than the current target parking point as the new target parking point for the second vehicle. Specifically, the second vehicle may include at least two vehicles, and the corresponding new target parking point is adjusted for each vehicle, thereby enabling the evacuation of multiple vehicles and preventing multiple vehicles from crowding into the same target parking point at the same time.

[0125] It should be noted that when selecting a new target parking spot for each vehicle, calculations will also be performed according to steps 102 and 103 to avoid conflicts caused by the number of vehicles needing to arrive at the same target parking spot at the same time exceeding the number of available parking spaces at the target parking spot.

[0126] In some embodiments, a corresponding safe location can be preset in the parking lot, and then the second vehicle can be controlled to drive to the preset safe location to wait for the remaining parking spaces in the target parking space to appear, and then the second vehicle corresponding to the number of remaining parking spaces can be controlled to park at the target parking point.

[0127] The safe location can be a pre-defined fixed temporary parking location; or it can be a comprehensive planning of a safe location by combining the surrounding environmental information of the target parking spot and the surrounding environmental information of the second vehicle, thereby controlling the second vehicle to park at the safe location.

[0128] Furthermore, the safe location can be sent to the server, which then transmits it to all vehicles in the parking lot to warn other vehicles against approaching or parking at the currently set safe location. Understandably, once the server controls the second vehicle to leave the safe location, the restrictions on other vehicles are lifted.

[0129] Optionally, step 203, which involves selecting a first vehicle, not exceeding the number of available parking spaces, to park at the target parking spot, includes:

[0130] Step 2031: Obtain the first location information of each vehicle expected to arrive at the target parking point, and the second location information of the target parking point.

[0131] In this embodiment of the invention, each vehicle in the parking lot can obtain its current location information in real time and send the location information to the server. The server obtains the first location information of each vehicle expected to reach the target parking point. At the same time, the server can also obtain the second location information of the target parking point.

[0132] Understandably, the location information of each parking spot in the parking lot can be uploaded to the server in advance, and the server can retrieve the second location information of the corresponding target parking spot as needed.

[0133] Step 2032: Determine the distance between each vehicle and the target parking point based on the first location information and the second location information.

[0134] In this embodiment of the invention, the server can plan a corresponding driving path for each vehicle based on the first location information and the second location information obtained in step 2031, combined with the map data information in the parking lot, and calculate the distance between each vehicle and the target parking point.

[0135] Understandably, the map data of the parking lot can be imported into the server in advance. The server can plan multiple driving routes for the vehicle based on the vehicle's current first location information and the second location information of the target parking point, and select the driving route with the shortest driving distance as the planned driving route. The shortest driving distance is then used as the distance between the vehicle and the target parking point.

[0136] Step 2033: Based on the distance, select no more than the number of available parking spaces for the first vehicle to park at the target parking point.

[0137] In this embodiment of the invention, based on the distance between each vehicle and the target parking point calculated above, the distances of each vehicle are compared, and the vehicle with the relatively closer distance is selected as the first vehicle. That is, the vehicle that is closer to the target parking point is selected as the first vehicle, and the selected first vehicle is controlled to park at the target parking point.

[0138] Optionally, step 2033, based on the distance, determines that the first vehicle will stop at the target parking point, including:

[0139] S11, determine the priority of each vehicle based on the distance;

[0140] S12, determine the vehicles whose priority meets the preset conditions as the first vehicles, and select no more than the number of available parking spaces for the first vehicles to park at the target parking point.

[0141] In this embodiment of the invention, based on the distance between each vehicle and the target parking point determined in step 2032, all vehicles expected to reach the target parking point are prioritized according to the magnitude of the distance value corresponding to each vehicle. Priority sorting may include: vehicles with smaller distances are ranked higher.

[0142] From all vehicles sorted by priority, select the vehicle whose priority meets the preset condition and designate it as the first vehicle. Then, select the first vehicle whose number is no greater than the number of remaining available parking spaces at the target parking spot, and move the selected first vehicle to the target parking spot. The preset condition means that the number N of the top N priority vehicles is no greater than the number of remaining available parking spaces at the target parking spot.

[0143] Optionally, after determining the priority of each vehicle based on the distance, the method further includes:

[0144] S21, Obtain environmental data for each vehicle.

[0145] In this embodiment of the invention, sensing components, such as vision sensors, can be installed on the vehicle to collect the current environmental data of each vehicle in real time and transmit the environmental data to the server.

[0146] Alternatively, multiple sensing devices, such as visual sensors, can be installed in the parking lot. The server can control the sensing devices at each vehicle's initial location to collect the corresponding vehicle's current environmental data and transmit the data to the server. This environmental data refers to information about the vehicle's current environment, such as information about objects around the vehicle and the road conditions it is traveling on.

[0147] It is understood that sensing components can acquire environmental data around the vehicle, for example, by collecting images of the environment around the vehicle. Of course, other methods can also be used to acquire environmental data for each vehicle, and this embodiment of the invention does not limit this.

[0148] S22, Based on the environmental data, determine the road condition information for each vehicle.

[0149] In this embodiment of the invention, based on the received environmental data, the real-time road condition information of each vehicle can be determined by identifying and analyzing the environmental data. The road condition information may include: whether there are obstacles ahead, whether there is a fork in the road ahead, and whether there are other vehicles driving around.

[0150] S23, The priority is corrected according to the road condition information to obtain the corrected priority.

[0151] In this embodiment of the invention, based on the road condition information determined in the above steps, the priority of each vehicle is corrected and the existing priority is updated to obtain the corrected priority, and all vehicles are sorted according to priority.

[0152] Based on the vehicle's road condition information, the complexity of the vehicle's driving path can be determined. For example, if there are obstacles in the vehicle's driving path, the complexity of the driving path is considered high; or, if there are intersections in the vehicle's driving path that require turning, the complexity of the driving path is considered high; or, it can be determined whether the vehicle's driving path is straight or curved, with curved driving being more complex than straight driving.

[0153] Understandably, obstacles can include roadblocks, warning signs, or vehicles reversing into parking spaces. When there are obstacles in a vehicle's path, the vehicle needs to stop and wait, which can lower the vehicle's priority.

[0154] The priority of each vehicle is adjusted according to the complexity of its travel path. The more complex the travel path, the lower the priority of the vehicle.

[0155] Optionally, determining the road condition information of each vehicle in step S22 may include: determining whether there are obstacles on the driving path of each vehicle;

[0156] Then, the step S23 of correcting the priority based on the road condition information may include:

[0157] If an obstacle exists, adjust the priority corresponding to the vehicle;

[0158] If there are no obstacles, the priority corresponding to the vehicle is maintained.

[0159] In this embodiment of the invention, the received environmental data is identified and analyzed to determine whether there are obstacles on the driving path of each vehicle.

[0160] If an obstacle is detected in the vehicle's path, the priority of that vehicle is adjusted, lowering its priority and raising the priority of vehicles following it in the original priority list.

[0161] If it is determined that there are no obstacles in the vehicle's driving path, the vehicle's priority is maintained, and real-time environmental data for the vehicle continues to be acquired.

[0162] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point, and the method further includes:

[0163] If the obstacle exists, update the vehicle's first arrival time.

[0164] If the updated first arrival time falls within the current time period, then step 203 is executed;

[0165] If the updated first arrival time is outside the current time period, then step 202 is executed.

[0166] In this embodiment of the invention, if it is determined that there is an obstacle on the vehicle's driving path, the estimated first arrival time of the vehicle to the target parking point is updated. For example, the driving route of the vehicle to the target parking point can be replanned by combining the map data of the parking lot, the vehicle's current third location information, and the second location information of the target parking point. The estimated arrival time of the vehicle to the target parking point is then recalculated based on the new driving route, and the estimated first arrival time of the vehicle to the target parking point is adjusted based on the recalculated time.

[0167] Of course, other methods can also be used to update the vehicle's first arrival time. Those skilled in the art can set these methods according to actual conditions, and this embodiment of the invention does not limit this.

[0168] Based on the updated first arrival time, compared with the current time period, if the updated first arrival time is still within the current time period, then continue with step 203 above: select a first vehicle from the expected arrival vehicles at the target parking point that is no more than the number of remaining available parking spaces at the target parking point, and control it to park at the target parking point. Simultaneously, perform the temporary scheduling operation on the second vehicle (other than the first vehicle) among the expected arrival vehicles at the target parking point.

[0169] Based on the updated first arrival time, compare it with the current time period. If the updated first arrival time is outside the current time period, then perform the step of determining the number of expected vehicles arriving at each parking point within the time period based on the updated first arrival time, and redetermine the number of expected vehicles arriving at the target parking point.

[0170] Optionally, in this embodiment of the invention, driving rules for vehicles within the parking lot can also be set. These rules include: vehicles going straight have priority, and vehicles turning left have priority over vehicles turning right; and / or, when the vehicle lane is a single lane, vehicles traveling in the same preset direction as the lane have priority; and when the vehicle lane is a two-lane lane, two vehicles are controlled to travel simultaneously. By setting these driving rules within the parking lot, multiple vehicles can be scheduled according to the rules, improving vehicle safety.

[0171] In this embodiment of the invention, by acquiring parking information of each parking spot in the parking lot, and based on statistical analysis of the parking information, the number of vehicles expected to arrive at the same target parking spot within the same time period is obtained. This number is compared with the number of remaining parking spaces at the target parking spot. When the number of vehicles exceeds the number of remaining parking spaces at the target parking spot, a first vehicle not exceeding the number of available parking spaces is selected from the expected vehicles to arrive at the target parking spot and parked at the target parking spot. At the same time, a temporary scheduling operation is performed on the second vehicle other than the first vehicle, so that the number of vehicles arriving at the same target parking spot within the same time period does not exceed the number of available parking spaces. This avoids conflicts between multiple vehicles caused by the number of vehicles arriving at the target parking spot at the same time exceeding the number of available parking spaces, thereby achieving reasonable vehicle scheduling, improving the safety of vehicle scheduling, and improving the efficiency of vehicle scheduling.

[0172] refer to Figure 4 In this embodiment of the invention, a vehicle dispatching system is also provided, comprising:

[0173] The acquisition module is used to acquire parking information of each parking spot in the parking lot. The parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space.

[0174] The determination module is used to determine the number of vehicles expected to arrive at the same target parking point within the same time period based on the parking information.

[0175] The scheduling module is used to schedule the vehicles expected to arrive at the target parking point within the same time period when the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces in the target parking point. The scheduling is used to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces.

[0176] The vehicle dispatching system in this embodiment of the invention can implement the steps in the aforementioned method embodiments, and will not be repeated here to avoid repetition.

[0177] Optionally, the scheduling module includes:

[0178] The first scheduling submodule is used to select a first vehicle, not greater than the number of available parking spaces, from the expected vehicles expected to arrive at the target parking point within the same time period and park it at the target parking point.

[0179] The second scheduling submodule is used to perform a first temporary scheduling operation on a second vehicle other than the first vehicle.

[0180] Optionally, the first scheduling submodule includes:

[0181] The location acquisition module is used to acquire the first location information of each vehicle expected to arrive at the target parking point within the same time period, and the second location information of the target parking point;

[0182] The distance determination module is used to determine the distance between each vehicle and the target parking point based on the first location information and the second location information;

[0183] The vehicle determination module is used to select the first vehicle, which is no more than the number of available parking locations, based on the distance.

[0184] Optionally, the vehicle determination module includes:

[0185] A priority determination module is used to determine the priority of each vehicle based on the distance.

[0186] The vehicle determination submodule is used to determine the vehicle whose priority meets the preset conditions as the first vehicle.

[0187] Optionally, the vehicle determination module further includes:

[0188] An environmental data acquisition module is used to determine the priority of each vehicle based on the distance and then acquire the environmental data of each vehicle.

[0189] The road condition information determination module is used to determine the road condition information of each vehicle based on the environmental data.

[0190] The priority correction module is used to correct the priority based on the road condition information to obtain the corrected priority.

[0191] Optionally, the road condition information determination module includes:

[0192] The judgment module is used to determine whether there are obstacles on the driving path of each vehicle;

[0193] The priority correction module is further configured to adjust the priority of the vehicle if an obstacle exists, and maintain the priority of the vehicle if no obstacle exists.

[0194] Optionally, the vehicle dispatching system further includes:

[0195] The update module is configured to update the first arrival time of the vehicle if the obstacle exists; if the updated first arrival time is within the current time period, then step 203 is executed; if the updated first arrival time is outside the current time period, then step 202 is executed.

[0196] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point, and the execution of a first temporary dispatch operation on the second vehicle other than the first vehicle includes:

[0197] Adjust the target parking point of the second vehicle;

[0198] Alternatively, control the second vehicle to drive to a preset safe location.

[0199] Optionally, the parking information includes: the estimated first arrival time of the vehicle at the target parking point; the first temporary dispatch operation on the second vehicle other than the first vehicle further includes:

[0200] The travel route of the second vehicle to the target parking point is replanned, and the travel distance of the second vehicle is increased to adjust the first arrival time of the second vehicle expected to arrive at the target parking point;

[0201] Alternatively, the speed of the second vehicle can be reduced to adjust the first arrival time of the second vehicle as it is expected to reach the target parking point.

[0202] Optionally, the acquisition module includes:

[0203] The first acquisition submodule is used to acquire parking requests sent by users;

[0204] The second acquisition submodule is used to determine the parking information of each parking point based on the parking request.

[0205] Optionally, the parking information includes: the estimated first arrival time of each vehicle at the target parking point, and the determining module includes:

[0206] The first determining submodule is used to determine the expected arrival status of vehicles at each parking point within the time period based on the first arrival time;

[0207] The second determining submodule is used to determine the number of vehicles expected to arrive at the same target parking point within the same time period based on the expected arrival status of vehicles at each parking point within the time period.

[0208] The vehicle dispatching system in this embodiment of the invention can implement the various processes in the aforementioned method embodiments, and will not be repeated here to avoid repetition.

[0209] In this embodiment of the invention, parking information for each parking spot within a parking lot is acquired; based on the parking information, the number of vehicles expected to arrive at the same target parking spot within the same time period is determined; when the number of vehicles expected to arrive at the target parking spot exceeds the number of remaining available parking spaces at the target parking spot, the vehicles expected to arrive at the target parking spot within the same time period are scheduled, the scheduling being used to ensure that the number of vehicles arriving at the target parking spot within the same time period does not exceed the number of available parking spaces. By acquiring parking information for each parking spot within a parking lot, and based on statistical analysis of the parking information, the number of vehicles expected to arrive at the same target parking spot within the same time period is obtained. This number is compared with the number of remaining parking spaces at the target parking spot. When the number of vehicles exceeds the number of remaining parking spaces, these vehicles are scheduled to ensure that the number of vehicles arriving at the same target parking spot within the same time period does not exceed the number of available parking spaces, thereby avoiding conflicts between multiple vehicles caused by the number of vehicles arriving at the target parking spot simultaneously exceeding the number of available parking spaces, achieving reasonable vehicle scheduling, improving the safety of vehicle scheduling, and improving the efficiency of vehicle scheduling.

[0210] This invention also provides an electronic device, such as... Figure 5 As shown, it includes: processor 401, communication interface 402, memory 403 and communication bus 404, wherein processor 401, communication interface 402 and memory 403 communicate with each other through communication bus 404.

[0211] Memory 403 is used to store computer programs.

[0212] When processor 401 executes a program stored in memory 403, it performs the following steps:

[0213] Obtain parking information for each parking spot within the parking lot;

[0214] Based on the parking information, determine the number of vehicles expected to arrive at the same target parking point within the same time period;

[0215] When the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces at the target parking point, the vehicles expected to arrive at the target parking point within the same time period are scheduled to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces.

[0216] The processor 401 can also implement other steps in the above vehicle scheduling method. For details, please refer to the foregoing content.

[0217] The communication bus mentioned in the above electronic devices can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This communication bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used to represent it in the diagram, but this does not indicate that there is only one bus or one type of bus.

[0218] The communication interface is used for communication between the aforementioned electronic devices and other devices.

[0219] The memory may include random access memory (RAM) or non-volatile memory, such as at least one disk storage device. Optionally, the memory may also be at least one storage device located remotely from the aforementioned processor.

[0220] The processors mentioned above can be general-purpose processors, including central processing units (CPUs), network processors (NPs), etc.; they can also be digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0221] In another embodiment of the present invention, a computer-readable storage medium is also provided, which stores a computer program that, when executed by a processor, implements the steps of the vehicle scheduling method described in the above embodiments.

[0222] The specific steps in the vehicle dispatching method can be found in the aforementioned content and will not be repeated here.

[0223] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present invention are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid state disk (SSD)).

[0224] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0225] The various embodiments in this specification are described in a related manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. For embodiments of devices, electronic devices, computer-readable storage media, and computer program products containing instructions, the descriptions are relatively simple because they are basically similar to the method embodiments; relevant parts can be referred to the descriptions of the method embodiments.

[0226] The above description is merely a preferred embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention are included within the scope of protection of the present invention.

Claims

1. A vehicle dispatching method, characterized in that, include: Obtain parking information for each parking spot in the parking lot, where the parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space. Based on the parking information, determine the number of vehicles expected to arrive at the same target parking point within the same time period; When the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces at the target parking point, the vehicles expected to arrive at the target parking point within the same time period are scheduled to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces. The scheduling of vehicles expected to arrive at the target parking point within the same time period includes: From the vehicles expected to arrive at the target parking point within the same time period, select a first vehicle, no more than the number of available parking spaces, to park at the target parking point, and perform a temporary dispatch operation on the second vehicle other than the first vehicle. The step of selecting a first vehicle, not exceeding the number of available parking spaces, to park at the target parking spot includes: Obtain the first location information of each vehicle expected to arrive at the target parking point within the same time period, and the second location information of the target parking point; Based on the first location information and the second location information, the distance between each vehicle and the target parking point is determined; Based on the distance, select no more than the number of available parking spaces for the first vehicle to park at the target parking spot.

2. The vehicle dispatching method according to claim 1, characterized in that, The step of selecting a first vehicle, not exceeding the number of available parking spaces, to park at the target parking spot based on the distance includes: The priority of each vehicle is determined based on the distance. The vehicle whose priority meets the preset conditions is identified as the first vehicle, and the first vehicle, which is no more than the number of available parking spaces, is selected to park at the target parking point.

3. The vehicle dispatching method according to claim 2, characterized in that, After determining the priority of each vehicle based on the distance, the method further includes: Obtain environmental data for each vehicle; Based on the environmental data, determine the road condition information for each vehicle; The priority is adjusted based on the road condition information to obtain the adjusted priority.

4. The vehicle dispatching method according to claim 3, characterized in that, Determining the road condition information for each vehicle includes: Determine whether there are obstacles on the driving path of each vehicle; The step of adjusting the priority based on the road condition information includes: If an obstacle exists, adjust the priority corresponding to the vehicle; If there are no obstacles, the priority corresponding to the vehicle is maintained.

5. The vehicle dispatching method according to claim 4, characterized in that, The parking information includes: the estimated first arrival time of the vehicle at the target parking point; the method further includes: If the obstacle exists, update the vehicle's first arrival time. If the updated first arrival time falls within the current time period, then the steps of selecting a first vehicle (not exceeding the number of available parking spaces) from the expected arrival vehicles to the target parking point and parking it at the target parking point, and performing the temporary dispatch operation on the second vehicle other than the first vehicle, are executed. If the updated first arrival time is outside the current time period, then the step of determining the number of expected vehicles arriving at each parking spot within the time period based on the first arrival time is performed.

6. The vehicle dispatching method according to claim 1, characterized in that, The parking information includes: the estimated first arrival time of the vehicle at the target parking point; the temporary dispatch operation for the second vehicle other than the first vehicle includes: Adjust the target parking point of the second vehicle; Alternatively, control the second vehicle to drive to a preset safe location.

7. The vehicle dispatching method according to claim 1, characterized in that, The parking information includes: the estimated first arrival time of the vehicle at the target parking point; the temporary dispatch operation for the second vehicle other than the first vehicle includes: The travel route of the second vehicle to the target parking point is replanned, and the travel distance of the second vehicle is increased to adjust the first arrival time of the second vehicle expected to arrive at the target parking point; Alternatively, the speed of the second vehicle can be reduced to adjust the first arrival time of the second vehicle as it is expected to reach the target parking point.

8. The vehicle dispatching method according to claim 1, characterized in that, The parking information includes: the first arrival time of each vehicle expected to arrive at the target parking point; determining the number of vehicles expected to arrive at the same target parking point within the same time period based on the parking information includes: Based on the first arrival time, determine the expected arrival status of vehicles at each parking point within the time period; Based on the expected arrival of vehicles at each parking spot during the time period, determine the number of vehicles expected to arrive at the same target parking spot within the same time period.

9. A vehicle dispatching system, characterized in that, include: The acquisition module is used to acquire parking information of each parking spot in the parking lot. The parking spot is the user's pick-up point after the vehicle leaves the parking space or the user's drop-off point before the vehicle enters the parking space. The determination module is used to determine the number of vehicles expected to arrive at the same target parking point within the same time period based on the parking information. The scheduling module is used to schedule the vehicles expected to arrive at the target parking point within the same time period when the number of vehicles expected to arrive at the target parking point exceeds the number of remaining available parking spaces in the target parking point. The scheduling is used to ensure that the number of vehicles arriving at the target parking point within the same time period is not greater than the number of available parking spaces. The scheduling module includes: The first scheduling submodule is used to select a first vehicle, not exceeding the number of available parking spaces, from the vehicles expected to arrive at the target parking point within the same time period and park it at the target parking point. The second scheduling submodule is used to perform temporary scheduling operations on the second vehicle other than the first vehicle. The first scheduling submodule includes: The location acquisition module is used to acquire the first location information of each vehicle expected to arrive at the target parking point within the same time period, and the second location information of the target parking point; The distance determination module is used to determine the distance between each vehicle and the target parking point based on the first location information and the second location information; The vehicle determination module is used to select, based on the distance, no more than the number of available parking locations for the first vehicle to park at the target parking point.

10. An electronic device, characterized in that, include: The system includes a processor, a communication interface, a memory, and a communication bus; the processor, communication interface, and memory communicate with each other via the communication bus. Memory, used to store computer programs; The processor, when executing a program stored in memory, implements the steps of the vehicle scheduling method as described in any one of claims 1 to 8.

11. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, implements the steps of the vehicle scheduling method as described in any one of claims 1 to 8.

Images