Vehicle dispatching method, device, terminal equipment and medium

Abstract

The embodiments of the present invention disclose a vehicle scheduling method, apparatus, terminal equipment and medium. The vehicle scheduling method is applied to a server, including: responding to a locking request for a first vehicle, obtaining the current position and locking time of the first vehicle; judging whether the first vehicle is in a parking spot according to the current position of the first vehicle; if the first vehicle is in a parking spot, obtaining the current parking time period corresponding to the locking time, and determining the parking time threshold of the parking spot corresponding to the current parking time period; determining all second vehicles in the parking spot whose locking time is within the current parking time period, monitoring the parking time of each second vehicle; determining whether to send the first scheduling information of the corresponding parking spot to the management terminal according to the parking time of each second vehicle and the parking time threshold. This avoids the long-term idleness of parked vehicles, and avoids the vehicles in the parking spot being dispatched to other areas due to excessive parking time, resulting in failure to meet the user's vehicle needs.

Description

Technical Field

[0001] The present invention relates to the field of vehicle management, and in particular to a vehicle dispatching method, device, terminal equipment and medium. Background Art

[0002] With the development of Internet technology and vehicle control technology, shared vehicles have become an important mode of travel. In order to improve the utilization rate of shared vehicles and avoid vehicles being parked in the same location for a long time, the management of shared vehicles usually sets a time threshold for each vehicle. When the parking time of a vehicle exceeds the time threshold, the management personnel are prompted to dispatch the vehicle to an area with high demand for vehicles.

[0003] However, when users use shared vehicles in parking spots, they will give priority to vehicles that are close to their location, regardless of how long the vehicle has been parked in the parking spot. Scheduling vehicles based on the parking time will result in vehicles in the parking spot being dispatched to other areas because the parking time exceeds the time threshold before users request to use the vehicle parked in the parking spot. When there are no available vehicles in the parking spot closest to the user, some users will give up using shared vehicles, reducing the utilization rate of the vehicle. Summary of the invention

[0004] In view of the defects of the prior art, the embodiments of the present application aim to provide a vehicle scheduling method, apparatus, terminal device and medium to solve the problem of unreasonable location scheduling of shared vehicles.

[0005] In a first aspect, an embodiment of the present application provides a vehicle dispatching method, which is applied to a server. The vehicle dispatching method includes:

[0006] In response to a locking request for a first vehicle, obtaining a current position and locking time of the first vehicle;

[0007] determining, based on the current position of the first vehicle, whether the first vehicle is within a parking spot;

[0008] If the first vehicle is in a parking spot, obtaining a current parking time period corresponding to the locking time, and determining a parking time threshold of the parking spot corresponding to the current parking time period;

[0009] determining all second vehicles in the parking spot whose locking time is within the current parking time period, and monitoring the parking time of each second vehicle;

[0010] According to the parking time of each of the second vehicles and the parking time threshold, it is determined whether to send the first scheduling information corresponding to the parking point to the management terminal.

[0011] The vehicles in the parking spot are dispatched according to the set parking time threshold of the parking spot. This avoids the vehicles being idle for a long time, and also avoids the vehicles in the parking spot being dispatched to other areas due to long parking time, which results in failure to meet the users' car needs.

[0012] In combination with the first aspect, in a first possible implementation manner, determining whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold includes:

[0013] If there are second vehicles whose parking time is greater than the parking time threshold, determine the number of second vehicles whose parking time is greater than the parking time threshold, and send first scheduling information corresponding to the parking point to the management terminal, wherein the first scheduling information includes the number of second vehicles requested to be scheduled.

[0014] The vehicles in the parking spot are dispatched according to the number of the second vehicles to improve the utilization rate of the vehicles and avoid the vehicles in the parking spot being dispatched to other locations in advance, resulting in no available vehicles in the nearest parking spot when the user wants to use the vehicle.

[0015] In combination with the first aspect, in a second possible implementation manner, after determining whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold, the method further includes:

[0016] If the first vehicle has not been dispatched and the parking time of the first vehicle is greater than a first time threshold, second dispatch information corresponding to the first vehicle is sent to the management terminal, wherein the first time threshold is greater than the parking time threshold.

[0017] If the first vehicle has not been dispatched and the parking time of the first vehicle is greater than the first time threshold, it is determined that the vehicle has been parked in the parking spot for a long time, and second dispatch information corresponding to the first vehicle is sent to the management terminal to prompt the management personnel to check the first vehicle to avoid the idleness of the first vehicle due to a malfunction and improve the vehicle utilization rate.

[0018] In combination with the first aspect, in a third possible implementation manner, after determining whether the first vehicle is in a parking spot according to the current position of the first vehicle, the method further includes:

[0019] If the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than the second time threshold, third scheduling information corresponding to the first vehicle is sent to the management terminal.

[0020] For vehicles that are not parked in the parking spot, it is detected whether the parking time of the vehicle is greater than the second time threshold, and the vehicles with parking time greater than the second time threshold are dispatched to avoid idleness of the vehicle due to remote parking location and malfunction.

[0021] In combination with the first aspect, in a fourth possible implementation manner, the method further includes:

[0022] A parking time threshold of the parking spot is set according to the vehicle parking data of the parking spot in historical time, so as to determine different parking time thresholds of the parking spot according to the actual operation situation of each parking spot, wherein the vehicle parking data includes the locking time, parking time, vehicle turnover rate and vehicle aggregation degree of the vehicles in the parking spot.

[0023] The actual operation of each parking spot is different, and the vehicle parking data recorded at each parking spot in the historical period is also different. According to the vehicle parking data of each parking spot in the historical period, the parking time threshold that conforms to the actual situation of the parking spot is obtained. Different parking time thresholds are set for different parking spots to determine whether the vehicle is parked for too long in the parking spot.

[0024] In combination with the fourth possible implementation manner of the first aspect, in a fifth possible manner, setting the parking time threshold of the parking point according to the vehicle parking data of the parking point in a historical time period includes:

[0025] Obtaining the historical parking time period corresponding to the current parking time period and the weather information of the current parking time period;

[0026] According to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period, the parking time threshold of the parking point corresponding to the current parking time period is set to determine the parking time threshold of different parking points corresponding to the current parking time period.

[0027] According to the parking data of vehicles at the parking spot in the historical period, a parking time threshold that conforms to the actual situation of the parking spot is obtained to avoid the parking time threshold being too long or too short, which affects the normal use of the user.

[0028] In combination with the first aspect, in a sixth possible implementation manner, if the first vehicle is in a parking spot, after obtaining the parking time period corresponding to the locking time and determining the parking time threshold of the parking spot corresponding to the parking time period, the method further includes:

[0029] If the parking point does not have a parking time threshold, and the parking time of the first vehicle is greater than the third time threshold, fourth scheduling information corresponding to the first vehicle is sent to the management terminal.

[0030] For parking spots that have been recently set up, insufficient parking data can be collected to set the parking time threshold according to the actual vehicle supply demand of the parking spots. Detect whether the parking time of the vehicle is greater than the third time threshold, and dispatch vehicles whose parking time is greater than the third time threshold to avoid idleness of vehicles due to failures and other reasons.

[0031] In a second aspect, an embodiment of the present application provides a vehicle dispatching device, which is applied to a server, and the vehicle dispatching device includes:

[0032] A response module, used to respond to the locking request for the first vehicle and obtain the current position and locking time of the first vehicle;

[0033] a parking point determination module, configured to determine whether the first vehicle is within a parking point according to the current position of the first vehicle;

[0034] a time period acquisition module, configured to acquire a current parking time period corresponding to the locking time if the first vehicle is in a parking spot, and determine a parking time threshold of the parking spot corresponding to the current parking time period;

[0035] a parking duration determination module, configured to determine all second vehicles in the parking spot whose locking time is within the current parking time period, and monitor the parking duration of each second vehicle;

[0036] The scheduling information determination module is used to determine whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold.

[0037] In a third aspect, an embodiment of the present application provides a computer device, including a processor and a memory, wherein the memory stores a program or instruction, and the program or instruction is executed by the processor so that the computer device performs the steps of the above-mentioned vehicle scheduling method.

[0038] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a program or instruction is stored, and when the program or instruction is executed by a processor, the steps of the above-mentioned vehicle scheduling method are implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] In order to more clearly illustrate the technical solution of the present invention, the following is a brief introduction to the drawings required for use in the embodiments. It should be understood that the following drawings only illustrate certain embodiments of the present invention and should not be regarded as limiting the scope of protection of the present invention. In each of the drawings, similar components are numbered similarly.

[0040] Figure 1 A flow chart of a vehicle dispatching method provided by Embodiment 1 of the present invention is shown;

[0041] Figure 2 Another flow chart of the vehicle dispatching method provided in Embodiment 1 of the present invention is shown;

[0042] Figure 3 A schematic diagram of the structure of a vehicle dispatching device provided in Example 2 of the present invention is shown. DETAILED DESCRIPTION

[0043] The technical solutions in the embodiments of the present invention will be described clearly and completely below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, rather than all the embodiments.

[0044] The components of the embodiments of the present invention generally described and shown in the drawings herein may be arranged and designed in a variety of different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but merely represents selected embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0045] Hereinafter, the terms "including", "having" and their cognates, which may be used in various embodiments of the present invention, are intended only to indicate specific features, numbers, steps, operations, elements, components or combinations of the foregoing items, and should not be understood as first excluding the existence of one or more other features, numbers, steps, operations, elements, components or combinations of the foregoing items or adding the possibility of one or more features, numbers, steps, operations, elements, components or combinations of the foregoing items.

[0046] Furthermore, the terms “first”, “second”, “third”, etc. are merely used for distinguishing descriptions and are not to be understood as indicating or implying relative importance.

[0047] Unless otherwise defined, all terms (including technical terms and scientific terms) used herein have the same meanings as those generally understood by those skilled in the art to which the various embodiments of the present invention belong. The terms (such as those defined in generally used dictionaries) will be interpreted as having the same meanings as the contextual meanings in the relevant technical field and will not be interpreted as having idealized meanings or overly formal meanings unless clearly defined in the various embodiments of the present invention.

[0048] Example 1

[0049] See also Figure 1 , Figure 1A flow chart of a vehicle dispatching method provided in Example 1 of the present invention is shown. Figure 1 The vehicle scheduling method in is applied to the server, comprising the following steps:

[0050] Step 110 , responding to a locking request for a first vehicle, obtaining a current position and locking time of the first vehicle.

[0051] A positioning device is arranged on the vehicle, and a communication connection is established between the server and the positioning device. When the server receives a locking request for the first vehicle, it obtains the locking time and the current position of the vehicle sent by the positioning device.

[0052] Step 120: Determine whether the first vehicle is in a parking spot based on the current position of the first vehicle.

[0053] Specifically, the parking spot closest to the current position of the first vehicle is obtained, and the electronic fence range of the parking spot is obtained. It is determined whether the current position of the first vehicle is within the electronic fence range of the parking spot. If the current position of the first vehicle is within the electronic fence range of the parking spot, it is determined that the first vehicle is within the parking spot. If the current position of the first vehicle is not within the electronic fence range of the parking spot, it is determined that the first vehicle is not within the parking spot.

[0054] Step 130: If the first vehicle is in a parking spot, a current parking time period corresponding to the locking time is obtained, and a parking time threshold of the parking spot corresponding to the current parking time period is determined.

[0055] The parking time threshold of a parking spot is used to indicate the maximum parking time for a vehicle. If the parking spot achieves a balance between supply and demand of vehicles, that is, the number of vehicles parked in the parking spot and the number of vehicles leaving the parking spot are the same, the vehicle will leave the parking spot before the parking time reaches the parking time threshold.

[0056] Specifically, to facilitate understanding of this application, it is assumed that the parking time threshold of all parking time periods is 8 hours, and 24 parking time periods are set corresponding to the 24 hours of the day. If the locking time of the first vehicle is 8:40, the current parking time period is determined to be the parking time period from 8 to 9 o'clock, and it is determined that the monitored first vehicle should leave the parking spot before 17:00. Similarly, if the locking time of the first vehicle is 7:10, the current parking time period is determined to be the parking time period from 7 to 8 o'clock, and it is determined that the monitored first vehicle should leave the parking spot before 16:00.

[0057] As an example, the method further includes:

[0058] The parking time threshold of the parking spot is set according to the vehicle parking data of the parking spot in the historical period, so as to determine the parking time threshold of different parking spots according to the actual operation situation of each parking spot, wherein the vehicle parking data includes the locking time of the vehicle in the parking spot, the parking time of the vehicle, the vehicle turnover rate and the vehicle aggregation degree.

[0059] It should be understood that the vehicle aggregation degree refers to the number of vehicles parked per unit area. The vehicle turnover rate refers to the average number of vehicles parked in all parking spaces within a parking spot within a fixed period of time. The more frequently vehicles park and leave a parking spot, the higher the vehicle turnover rate. For parking spots with higher vehicle turnover rates, the average parking time for vehicles parked in the parking spot is lower, and for parking spots with lower vehicle turnover rates, the average parking time for vehicles parked in the parking spot is higher.

[0060] The actual operation of each parking spot is different, and the vehicle parking data recorded at each parking spot in the historical period is also different. Based on the vehicle parking data of the parking spot in the historical period, the predicted parking time of each vehicle after parking at the parking spot is predicted, and the parking time threshold of the parking spot is set according to the predicted parking time. Based on the vehicle parking data of the parking spot in the historical period, the parking time threshold that conforms to the actual situation of the parking spot is obtained. Different parking time thresholds are set for different parking spots to determine whether the vehicle is parked for too long in the parking spot.

[0061] In an optional example, setting the parking time threshold of the parking spot according to the vehicle parking data of the parking spot in a historical time period includes:

[0062] Obtaining the historical parking time period corresponding to the current parking time period and the weather information of the current parking time period;

[0063] According to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period, the parking time threshold of the parking point corresponding to the current parking time period is set to determine the parking time threshold of different parking points corresponding to the current parking time period.

[0064] It should be understood that the weather and the current parking time will affect the parking time of the vehicle in the parking spot. For example, if the current weather is raining, the parking time of the vehicle will be longer. Whether it is a weekday time period, the weather in the area, the turnover rate of vehicles in the parking spot, and the degree of vehicle aggregation can be used as constraints, the locking time and parking time of the vehicle in the historical parking time period can be used as input samples, and the parking time threshold of the parking spot can be used as output to create a parking time model for the parking spot. According to the parking data of the vehicle at the parking spot in the historical time, the parking time threshold that meets the actual situation of the parking spot is obtained to avoid the parking time threshold being too long or too short, which affects the normal use of the user.

[0065] Step 140: determine all second vehicles in the parking spot whose locking time is within the current parking time period, and monitor the parking time of each second vehicle.

[0066] For example, suppose that there are 2 vehicles parked at the parking spot between 8:00 and 9:00. The first vehicle parks at the parking spot at 8:40, and the first vehicle is updated to the second vehicle. At this time, the server updates that there are 3 vehicles parked at the parking spot between 8:00 and 9:00, and monitors the parking time of the 3 second vehicles in real time.

[0067] Step 150: Determine whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold.

[0068] According to the parking time of each second vehicle and the parking time threshold, it is determined whether there are idle vehicles in the parking spot. When there are idle vehicles, the first scheduling information corresponding to the parking spot is sent to the management terminal.

[0069] As an example, determining whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold includes:

[0070] If there are second vehicles whose parking time is greater than the parking time threshold, determine the number of second vehicles whose parking time is greater than the parking time threshold, and send first scheduling information corresponding to the parking point to the management terminal, wherein the first scheduling information includes the number of second vehicles requested to be scheduled.

[0071] It should be understood that in the actual use of the vehicle, the user will not actively choose to request to unlock the vehicle according to the order of the parking time of the vehicles in the parking spot. When there are idle vehicles, the first scheduling information is sent to the management terminal according to the number of idle vehicles. Compared with directly scheduling vehicles parked for a long time, the present application schedules the vehicles in the parking spot according to the number of the second vehicle, thereby improving the utilization rate of the vehicle and avoiding the vehicles in the parking spot from being scheduled to other locations in advance, resulting in no available vehicles in the nearest parking spot when the user wants to use the vehicle.

[0072] For example, according to the parking data of vehicles in the historical parking time period, it is found that there are usually 2 vehicles parked in the parking spot during the parking time period from 8 to 9 o'clock, and the parking time threshold is 8 hours. If the parking spot achieves a balance between the supply and demand of vehicles, the 2 vehicles will be unlocked by the user before 17:00 and drive out of the parking spot. Assuming that there are 5 vehicles parked in the parking spot during the current parking time period from 8 to 9 o'clock, according to the supply and demand relationship of the parking spot, when the time reaches 17:00, there will be 3 vehicles whose parking time is greater than the parking time threshold of 8 hours. The first dispatching information for dispatching 3 vehicles is sent to the management terminal, prompting the management personnel to dispatch any 3 vehicles in the parking spot to other locations.

[0073] As an example, after determining whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold, the method further includes:

[0074] If the first vehicle has not been dispatched and the parking time of the first vehicle is greater than a first time threshold, second dispatch information corresponding to the first vehicle is sent to the management terminal, wherein the first time threshold is greater than the parking time threshold.

[0075] It should be understood that the first duration threshold is set according to actual needs and is not limited here. If the first vehicle is not dispatched and the parking time of the first vehicle is greater than the first duration threshold, it is determined that the vehicle is parked in the parking spot for a long time, and the second dispatch information corresponding to the first vehicle is sent to the management terminal to prompt the management personnel to check the first vehicle to avoid the idleness of the first vehicle due to a fault and improve the vehicle utilization rate.

[0076] Please also read Figure 2 , Figure 2 Another flow chart of the vehicle dispatching method provided in Embodiment 1 of the present invention is shown. As an example, after determining whether the first vehicle is in a parking spot according to the current position of the first vehicle, the method further includes:

[0077] Step 160: If the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than the second time threshold, third scheduling information corresponding to the first vehicle is sent to the management terminal.

[0078] It should be understood that the second time threshold is set according to actual needs and is not limited here. For vehicles that are not parked in the parking spot, it is detected whether the parking time of the vehicle is greater than the second time threshold, and the vehicle with a parking time greater than the second time threshold is dispatched to avoid idleness of the vehicle due to remote parking location and malfunction.

[0079] As an example, if the first vehicle is in a parking spot, after obtaining the parking time period corresponding to the locking time and determining the parking time threshold of the parking spot corresponding to the parking time period, the method further includes:

[0080] If the parking point does not have a parking time threshold, and the parking time of the first vehicle is greater than the third time threshold, fourth scheduling information corresponding to the first vehicle is sent to the management terminal.

[0081] It should be understood that the third duration threshold is set according to actual needs, and the third duration threshold can be the same as the second duration threshold, which is not limited here. Usually, the parking duration threshold of a parking spot is set based on the vehicle parking data of the parking spot in the past few days. For parking spots set up recently, insufficient vehicle parking data can be collected, and the parking duration threshold cannot be set according to the actual vehicle supply demand of the parking spot. Detect whether the parking duration of the vehicle is greater than the third duration threshold, and dispatch vehicles with parking duration greater than the third duration threshold to avoid idleness of the vehicle due to failures and other reasons.

[0082] The present application provides a vehicle scheduling method, which is applied to a server, including: responding to a locking request for a first vehicle, obtaining the current position and locking time of the first vehicle; judging whether the first vehicle is in a parking spot according to the current position of the first vehicle; if the first vehicle is in a parking spot, obtaining the current parking time period corresponding to the locking time, and determining the parking time threshold of the parking spot corresponding to the current parking time period; determining all second vehicles in the parking spot whose locking time is within the current parking time period, and monitoring the parking time of each second vehicle; determining whether to send the first scheduling information corresponding to the parking spot to a management terminal according to the parking time of each second vehicle and the parking time threshold. Dispatch the vehicles in the parking spot according to the set parking time threshold of the parking spot. This avoids the long-term idleness of the vehicle, and avoids the vehicles in the parking spot being dispatched to other areas due to excessive parking time, resulting in failure to meet the user's vehicle needs.

[0083] Example 2

[0084] See also Figure 3 , Figure 3 FIG. 2 shows a schematic diagram of the structure of a vehicle dispatching device provided in Embodiment 2 of the present invention. Figure 3 The vehicle dispatching device 200 in the embodiment includes:

[0085] A response module 210, for responding to a locking request for a first vehicle, and obtaining a current position and locking time of the first vehicle;

[0086] A parking point determination module 220, configured to determine whether the first vehicle is in a parking point according to the current position of the first vehicle;

[0087] a time period acquisition module 230, configured to acquire a current parking time period corresponding to the locking time if the first vehicle is in a parking spot, and determine a parking time threshold of the parking spot corresponding to the current parking time period;

[0088] A parking duration determination module 240, configured to determine all second vehicles in the parking spot whose locking time is within the current parking time period, and monitor the parking duration of each second vehicle;

[0089] The scheduling information determination module 250 is used to determine whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold.

[0090] As an example, the scheduling information determination module 250 is also used to determine the number of second vehicles whose parking time is greater than the parking time threshold if there are second vehicles whose parking time is greater than the parking time threshold, and send the first scheduling information corresponding to the parking point to the management terminal, wherein the first scheduling information includes the number of second vehicles requested for scheduling.

[0091] As an example, the vehicle dispatching device 200 further includes:

[0092] The second scheduling module is used to send second scheduling information corresponding to the first vehicle to the management terminal if the first vehicle is not scheduled and the parking time of the first vehicle is greater than a first time threshold, wherein the first time threshold is greater than the parking time threshold.

[0093] As an example, the vehicle dispatching device 200 further includes:

[0094] The third scheduling module is used to send third scheduling information corresponding to the first vehicle to the management terminal if the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than a second time threshold.

[0095] As an example, the vehicle dispatching device 200 further includes:

[0096] A threshold setting module is used to set a parking time threshold of the parking spot according to the vehicle parking data of the parking spot in the historical time, so as to determine the parking time threshold of different parking spots according to the actual operation of each parking spot, wherein the vehicle parking data includes the locking time, parking time, vehicle turnover rate and vehicle aggregation degree of the vehicles in the parking spot.

[0097] As an example, the threshold setting module is further used to obtain the historical parking time period corresponding to the current parking time period, and the weather information of the current parking time period;

[0098] According to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period, the parking time threshold of the parking point corresponding to the current parking time period is set to determine the parking time threshold of different parking points corresponding to the current parking time period.

[0099] As an example, the vehicle dispatching device 200 further includes:

[0100] The fourth scheduling module is used to send fourth scheduling information corresponding to the first vehicle to the management terminal if there is no parking time threshold at the parking spot and the parking time of the first vehicle is greater than the third time threshold.

[0101] The vehicle dispatching device 200 is used to execute the corresponding steps in the above-mentioned vehicle dispatching method, and the specific implementation of each function is not described one by one here. In addition, the optional examples in embodiment 1 are also applicable to the vehicle dispatching device 200 of embodiment 2.

[0102] An embodiment of the present application also provides a computer device, including a processor and a memory, wherein the memory stores a program or instruction, and the program or instruction is executed by the processor so that the computer device executes the above-mentioned vehicle dispatching method.

[0103] An embodiment of the present application also provides a computer-readable storage medium, wherein the computer-readable storage medium stores a program or instruction, and when the program or instruction is executed by a processor, the above-mentioned vehicle scheduling method is implemented.

[0104] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can also be implemented in other ways. The device embodiments described above are merely schematic. For example, the flowcharts and structure diagrams in the accompanying drawings show the possible architecture, functions and operations of the devices, methods and computer program products according to multiple embodiments of the present invention. In this regard, each box in the flowchart or block diagram can represent a module, a program segment or a part of a code, and the module, a program segment or a part of a code contains one or more executable instructions for implementing the specified logical function. It should also be noted that in an alternative implementation, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two consecutive boxes can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the structure diagram and / or the flow chart, and the combination of boxes in the structure diagram and / or the flow chart, can be implemented with a dedicated hardware-based system that performs a specified function or action, or can be implemented with a combination of dedicated hardware and computer instructions.

[0105] In addition, the functional modules or units in the various embodiments of the present invention may be integrated together to form an independent part, or each module may exist independently, or two or more modules may be integrated to form an independent part.

[0106] If the functions are implemented in the form of software function modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, or the part that contributes to the prior art or the part of the technical solution, can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for a computer device (which can be a smart phone, a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0107] The above description is only a specific implementation mode of the present invention, but the protection scope of the present invention is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed by the present invention, which should be covered by the protection scope of the present invention.

Claims

1. A vehicle dispatching method, characterized in that: Applied to a server, the method comprises: In response to a locking request for a first vehicle, obtaining a current position and locking time of the first vehicle; determining, based on the current position of the first vehicle, whether the first vehicle is within a parking spot; If the first vehicle is in a parking spot, obtaining a current parking time period corresponding to the locking time, and determining a parking time threshold of the parking spot corresponding to the current parking time period; Determine all second vehicles in the parking spot whose locking time is within the current parking time period, and monitor the parking time of each second vehicle; the second vehicles include the first vehicle; According to the parking time of each of the second vehicles and the parking time threshold, determine whether to send the first scheduling information corresponding to the parking point to the management terminal; wherein the first scheduling information includes the number of the second vehicles requested to be scheduled.

2. The vehicle dispatching method according to claim 1, characterized in that: The determining, according to the parking time of each of the second vehicles and the parking time threshold, whether to send the first scheduling information corresponding to the parking point to the management terminal includes: If there is a second vehicle whose parking time is longer than the parking time threshold, the number of the second vehicles whose parking time is longer than the parking time threshold is determined, and the first scheduling information corresponding to the parking point is sent to the management terminal.

3. The vehicle dispatching method according to claim 1, characterized in that: After determining whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold, the method further includes: If the first vehicle has not been dispatched and the parking time of the first vehicle is greater than a first time threshold, second dispatch information corresponding to the first vehicle is sent to the management terminal, wherein the first time threshold is greater than the parking time threshold.

4. The vehicle dispatching method according to claim 1, characterized in that: After determining whether the first vehicle is in a parking spot according to the current position of the first vehicle, the method further includes: If the first vehicle is not in the parking spot and the parking time of the first vehicle is greater than the second time threshold, third scheduling information corresponding to the first vehicle is sent to the management terminal.

5. The vehicle dispatching method according to claim 1, characterized in that: The method further comprises: The parking time threshold of the parking spot is set according to the vehicle parking data of the parking spot in the historical period, so as to determine the parking time threshold of different parking spots according to the actual operation situation of each parking spot, wherein the vehicle parking data includes the locking time of the vehicle in the parking spot, the parking time of the vehicle, the vehicle turnover rate and the vehicle aggregation degree.

6. The vehicle dispatching method according to claim 5, characterized in that: The step of setting the parking time threshold of the parking point according to the vehicle parking data of the parking point in the historical time period includes: Obtaining the historical parking time period corresponding to the current parking time period and the weather information of the current parking time period; According to the weather information of the historical parking time period, the weather information of the current parking time period and the vehicle parking data of the historical parking time period, the parking time threshold of the parking point corresponding to the current parking time period is set to determine the parking time threshold of different parking points corresponding to the current parking time period.

7. The vehicle dispatching method according to claim 1, characterized in that: If the first vehicle is in a parking spot, after obtaining the parking time period corresponding to the locking time and determining the parking time threshold of the parking spot corresponding to the parking time period, the method further includes: If the parking point does not have a parking time threshold, and the parking time of the first vehicle is greater than the third time threshold, fourth scheduling information corresponding to the first vehicle is sent to the management terminal.

8. A vehicle dispatching device, characterized in that: Applied to a server, the device comprises: A response module, used to respond to the locking request for the first vehicle and obtain the current position and locking time of the first vehicle; a parking point determination module, configured to determine whether the first vehicle is within a parking point according to the current position of the first vehicle; a time period acquisition module, configured to acquire a current parking time period corresponding to the locking time if the first vehicle is in a parking spot, and determine a parking time threshold of the parking spot corresponding to the current parking time period; a parking duration determination module, configured to determine all second vehicles in the parking spot whose locking time is within the current parking time period, and monitor the parking duration of each second vehicle; the second vehicle includes the first vehicle; The scheduling information determination module is used to determine whether to send the first scheduling information corresponding to the parking point to the management terminal according to the parking time of each of the second vehicles and the parking time threshold; wherein the first scheduling information includes the number of second vehicles requested for scheduling.

9. A computer device, characterized in that: The method comprises a processor and a memory, wherein the memory stores a program or an instruction, and when the program or the instruction is executed by the processor, the steps of the vehicle dispatching method as claimed in any one of claims 1 to 7 are implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a program or instruction, and when the program or instruction is executed by a processor, the steps of the vehicle dispatching method according to any one of claims 1 to 7 are implemented.

Images