Parking lot vehicle scheduling method and device and computer medium

Abstract

The invention provides a parking lot vehicle scheduling method and device and a computer medium, and the method comprises the steps: carrying out the region division of a parking lot, obtaining more than one parking region, taking the current time as the starting time, taking the latest reserved vehicle taking time as the ending time, obtaining a vehicle taking time period, and obtaining a vehicle taking time period; and according to the number of the parking areas, vehicle taking time periods are averagely divided to serve as vehicle taking time windows of the parking areas, and according to the reserved vehicle taking time of the vehicles, dispatching equipment is driven to carry the vehicles to the parking areas of the corresponding vehicle taking time windows. The problem that the user takes a car for a long time is solved.

Description

Technical Field

[0001] The present application relates to the field of vehicle management, and in particular to a method, device and computer medium for dispatching vehicles in a parking lot. Background Art

[0002] With the continuous development of society, the popularity of vehicles is getting higher and higher, and parking lots are often overcrowded. This makes it difficult for car owners to store and retrieve their cars, especially when the parking space is far from the parking lot exit, which greatly increases the time for storing and retrieving the car and increases the risk of congestion between vehicles.

[0003] When users pick up their cars, since the fully automatic garage is arranged according to the parking time, the vehicles with earlier pick-up times may be placed far away from the garage. When car owners pick up their cars, they will have to wait for a long time; when there are more pick-up tasks, the pick-up time will be even longer, which greatly reduces the car owner's user experience.

[0004] Therefore, how to effectively improve the efficiency of parking lot retrieval and reduce the time of retrieval is an urgent problem to be solved. Summary of the invention

[0005] The purpose of this application is to solve the technical problem of how to effectively improve the efficiency of parking lot retrieval and reduce the time of retrieval.

[0006] According to one aspect of an embodiment of the present application, the present application provides a method for dispatching vehicles in a parking lot, the method comprising:

[0007] Divide the parking lot into more than one parking area;

[0008] Take the current time as the start time and the latest scheduled pick-up time as the end time to get the pick-up time period;

[0009] Divide the vehicle pickup time period evenly according to the number of the parking areas, and use them as the vehicle pickup time window of each parking area;

[0010] According to the scheduled pick-up time of the vehicle, the driving dispatching device moves each vehicle to the parking area corresponding to the pick-up time window.

[0011] According to one aspect of an embodiment of the present application, the step of dividing the parking lot into regions to obtain more than one parking area includes:

[0012] The parking lot is divided into areas according to the distance between the parking spaces and the parking lot exit.

[0013] According to one aspect of an embodiment of the present application, the step of dividing the parking lot into regions to obtain more than one parking area includes:

[0014] According to the ratio of the number of dispatching devices to the number of dispatching tasks in the parking lot, the parking lot is divided into a corresponding number of parking areas, and the number of the parking areas is positively correlated with the ratio.

[0015] According to one aspect of an embodiment of the present application, obtaining the latest scheduled pick-up time according to the scheduled pick-up time of each vehicle in the parking lot includes:

[0016] According to the scheduled pick-up time of each vehicle in the parking lot, the latest scheduled pick-up time is obtained;

[0017] The latest scheduled vehicle pickup time is compared with a preset time threshold, and if the latest scheduled vehicle pickup time is after the time threshold, the time threshold is updated to the latest scheduled vehicle pickup time.

[0018] According to one aspect of an embodiment of the present application, the method further includes: driving the dispatching device to move each vehicle to a parking area corresponding to the vehicle pickup time window according to the scheduled vehicle pickup time.

[0019] Get the earliest scheduled pick-up time;

[0020] If the earliest scheduled pick-up time is before the current time, a parking area is selected as an overtime parking area, and the start time of the pick-up time window of the overtime parking area is updated to the earliest scheduled pick-up time.

[0021] According to one aspect of an embodiment of the present application, the method of driving the dispatching device to move each vehicle to a parking area corresponding to the vehicle pickup time window according to the scheduled vehicle pickup time includes:

[0022] According to the scheduled pick-up time of the vehicle, determining a pick-up time window corresponding to the scheduled pick-up time;

[0023] Determining a target parking area for parking the vehicle according to a pick-up time window corresponding to the vehicle reservation pick-up time and a parking area corresponding to the time window;

[0024] If the current parking area where the vehicle is located is inconsistent with the target parking area, then the vehicle is a turnover vehicle, and the driving dispatching device moves the turnover vehicle to the target parking area.

[0025] According to one aspect of an embodiment of the present application, the parking spaces are divided into upper and lower parking spaces, and the driving and dispatching device transports the turnover vehicle to the target parking area, including:

[0026] If the target parking area has an idle parking space and the turnover vehicle is not located in an upper parking space, the dispatching device is driven to move the vehicle to the idle parking space in the target parking area.

[0027] According to one aspect of an embodiment of the present application, the driving dispatching device transports the turnover vehicle to a target parking area, including:

[0028] If the turnover vehicle is located in the upper parking space and there is a vehicle parked in the lower parking space of the turnover vehicle, the lower vehicle will be moved;

[0029] The dispatching device is driven to transport the turnover vehicle to the target parking area via the lower parking space.

[0030] According to one aspect of an embodiment of the present application, the present application provides a parking lot vehicle dispatching device, the device comprising:

[0031] A division module, used to divide the parking lot into areas to obtain more than one parking area;

[0032] The timing module is used to obtain the pick-up time period with the current time as the start time and the latest scheduled pick-up time as the end time;

[0033] An acquisition module, configured to evenly divide the vehicle pickup time period according to the number of the parking areas, and respectively serve as the vehicle pickup time window of each parking area;

[0034] The scheduling module is used to drive the scheduling equipment to move each vehicle to the parking area corresponding to the pick-up time window according to the scheduled pick-up time of the vehicle.

[0035] According to one aspect of an embodiment of the present application, the present application provides a computer-readable storage medium, characterized in that computer-readable instructions are stored thereon, and when the computer-readable instructions are executed by a processor of a computer, the computer executes any of the above methods.

[0036] In an embodiment of the present application, the parking lot is divided into areas to obtain more than one parking area, and then the pick-up time window of each parking area is determined according to the scheduled pick-up time of each vehicle in the parking lot, and then the parking area corresponding to each vehicle is determined, and finally the vehicles in the parking lot are moved so that each vehicle is parked in the corresponding parking area. During the time period overlapping with the pick-up time window, when the user picks up the vehicle, the dispatching device only needs to work in the parking area corresponding to the pick-up time window, and there is no need to search for and move the vehicle in the entire parking lot, which improves the transportation efficiency of the dispatching equipment, reduces the user's waiting time for picking up the vehicle, and greatly increases the user experience.

[0037] Other features and advantages of the present application will become apparent from the following detailed description, or may be learned in part by the practice of the present application.

[0038] It should be understood that the foregoing general description and the following detailed description are exemplary only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0039] The above and other objects, features and advantages of the present application will become more apparent by describing in detail exemplary embodiments thereof with reference to the attached drawings.

[0040] Figure 1 A system architecture diagram applied according to an embodiment of the present application is shown.

[0041] Figure 2 A flow chart of a method for dispatching vehicles in a parking lot according to an embodiment of the present application is shown.

[0042] Figure 3 A schematic diagram of parking area distribution according to an embodiment of the present application is shown.

[0043] Figure 4 A flow chart is shown for obtaining the latest scheduled pick-up time based on the scheduled pick-up time of each vehicle in a parking lot according to an embodiment of the present application.

[0044] Figure 5 A flowchart is shown of constructing an overtime parking area according to an embodiment of the present application, based on the scheduled pick-up time of the vehicle, driving the scheduling device to move each vehicle to the parking area corresponding to the pick-up time window.

[0045] Figure 6 A flow chart is shown of driving the dispatching device to move each vehicle to a parking area corresponding to a vehicle pickup time window according to the vehicle's scheduled vehicle pickup time according to one embodiment of the present application.

[0046] Figure 7 A flow chart showing a driving dispatching device moving a turnover vehicle to a target parking area according to an embodiment of the present application is shown.

[0047] Figure 8 A schematic diagram of a parking lot vehicle dispatching device according to an embodiment of the present application is shown.

[0048] Fig. 9 A hardware structure diagram of a method for scheduling parking lot vehicles according to an embodiment of the present application is shown. DETAILED DESCRIPTION

[0049] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in a variety of forms and should not be construed as limited to the examples set forth herein; rather, these example embodiments are provided so that the description of the present application will be more comprehensive and complete and the concepts of the example embodiments will be fully conveyed to those skilled in the art. The accompanying drawings are only schematic illustrations of the present application and are not necessarily drawn to scale. The same reference numerals in the figures represent the same or similar parts, and thus their repeated description will be omitted.

[0050] In addition, the described features, structures or characteristics may be combined in one or more example embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the example embodiments of the present application. However, those skilled in the art will appreciate that the technical solution of the present application may be practiced while omitting one or more of the specific details, or other methods, components, steps, etc. may be adopted. In other cases, known structures, methods, implementations or operations are not shown or described in detail to avoid obscuring the present application and making the various aspects of the present application obscure.

[0051] Some of the blocks shown in the accompanying drawings are functional entities that do not necessarily correspond to physically or logically independent entities. These functional entities can be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0052] See also Figure 1 , Figure 1 It is a system architecture used in the embodiment of the present application. The system architecture may include: at least one scheduling device 11, and a data processing device 12 that controls the scheduling device 11, the data processing device 12 divides the parking lot area, calculates the vehicle pickup time window, and controls the scheduling device 12 to move the vehicle to each parking area. The data processing device 12 controls the scheduling device 11 to execute the parking lot vehicle scheduling method, thereby realizing the scheduling of vehicles in the parking lot.

[0053] Some technical solutions of the embodiments of the present application can be based on Figure 1 The system architecture shown or its variant architecture is used for specific implementation.

[0054] Please refer to Figure 2 , Figure 2 A flowchart of a method for dispatching vehicles in a parking lot according to an embodiment of the present application is shown. The present application embodiment provides a method for dispatching vehicles in a parking lot, including:

[0055] Step S210, dividing the parking lot into regions to obtain more than one parking area;

[0056] Step S220, taking the current time as the start time and the latest scheduled car pick-up time as the end time, to obtain the car pick-up time period;

[0057] Step S230, dividing the vehicle pickup time period evenly according to the number of parking areas, and respectively serving as the vehicle pickup time window of each parking area;

[0058] Step S240, according to the scheduled pick-up time of the vehicle, drive the dispatching device to move each vehicle to the parking area corresponding to the pick-up time window.

[0059] The above four steps are described in detail below.

[0060] In step S210, before dividing the parking lot into areas, it is necessary to first obtain the number of parking spaces and the distribution of parking spaces in the parking lot, and then divide the parking lot into areas using parking spaces as the minimum measurement unit to divide at least two parking areas.

[0061] It should be clear that when dividing a parking lot into areas, the number of parking areas can be customized by the user, or the parking lot can be divided into areas based on a preset number.

[0062] In one embodiment of the present application, considering that the more parking areas there are, the greater the workload of the dispatching device, when the number of dispatching device tasks is large, if the number of parking areas is too large, the dispatching device will be overloaded or even unable to complete the dispatching tasks. Therefore, in an embodiment of the present application, when the parking lot is divided into areas, the ratio of the number of dispatching devices to the number of dispatching tasks is obtained. The ratio indicates the busyness of the dispatching device. The larger the ratio, the more idle the dispatching device is, and the more dispatching tasks it can carry. At this time, more parking areas can be divided. The more parking areas there are, the more detailed the dispatching summary of vehicles is, and the more the efficiency of picking up cars in the parking lot can be improved. The dispatching equipment includes but is not limited to AGV robots, and also includes all equipment with handling functions, and is not limited to land equipment.

[0063] Specifically, several numerical intervals of the quantity ratio are pre-set, and each numerical interval corresponds to a number of partitions. If the numerical intervals of the quantity ratio are different, the number of partitions corresponding to the quantity ratio will be different, that is, the parking lot is divided into different numbers of parking areas, and the larger the quantity ratio is, the more parking areas there are.

[0064] It should also be made clear that after determining the number of parking areas, the size of the parking areas also needs to be determined. For the size of the parking areas, users can customize the size of each parking area with the parking space as the minimum unit of measurement, or determine the size of each parking area based on the number of parking spaces and preset standards. If the preset standard stipulates that the sizes of each parking area are the same, then all parking spaces in the parking lot are divided equally according to the number of parking areas, and then the number of parking spaces in each parking area is determined. Alternatively, the preset standard stipulates that if there are 4 parking areas, they are divided according to the ratio of 3:3:3:1. When there are 4 parking areas, all parking spaces in the parking lot are divided according to the above ratio, and then the number of parking spaces in each parking area is determined.

[0065] It should be clear that when dividing the parking lot into rows, it is also necessary to determine the distribution of the parking areas, that is, the location of each parking area in the parking lot. The distribution of each parking area can be set according to user customization or divided according to a preset method, such as arranging each parking area in sequence according to the distance from the parking lot exit. In actual application, the distribution of parking areas can also be adaptively adjusted according to the vehicle's scheduled pick-up time or other user needs, such as selecting the parking area farthest from the parking lot exit as the overtime parking area to park vehicles that have not been picked up within the time limit or whose scheduled pick-up time is too late.

[0066] For example, see Figure 3 , Figure 3 FIG. 2 shows a schematic diagram of the parking area distribution according to an embodiment of the present application. Figure 3 As shown, the parking lot is divided equally according to the distance from the parking area to the parking lot exit, and four parking areas A, B, C, and D are obtained.

[0067] In step S220, in order to set the pick-up time window corresponding to each parking area more reasonably, the scheduled pick-up time of the vehicles in the parking lot has a corresponding pick-up time window, the current time is used as the starting time, and the latest scheduled pick-up time is used as the end time to obtain the pick-up time period, which includes the scheduled pick-up times of all vehicles to be taken away.

[0068] See also Figure 4 , Figure 4 The flowchart of obtaining the latest scheduled pick-up time according to the scheduled pick-up time of each vehicle in the parking lot according to one embodiment of the present application is shown. The embodiment of the present application provides steps for obtaining the latest scheduled pick-up time according to the scheduled pick-up time of each vehicle in the parking lot, including:

[0069] Step S301, obtaining the latest scheduled pick-up time according to the scheduled pick-up time of each vehicle in the parking lot;

[0070] Step S302, compare the latest scheduled car pick-up time with a preset time threshold, and if the latest scheduled car pick-up time is after the time threshold, update the time threshold to the latest scheduled car pick-up time.

[0071] The above two steps are described in detail below.

[0072] In step S301, the vehicle pickup reservation time of each vehicle in the parking lot is obtained, and the latest scheduled vehicle pickup time is determined as the latest vehicle pickup reservation time.

[0073] In step S302, the latest scheduled car pickup time is compared with the preset time threshold. If the latest scheduled car pickup time is after the time threshold, the time threshold is updated to the latest scheduled car pickup time, which is then used as the end time of the car pickup time period.

[0074] In order to make the division of the car pickup time window more reasonable, the embodiment of the present application sets a time threshold to limit the latest scheduled car pickup time, so as to avoid the situation where the car pickup time window is too long, resulting in insufficient parking spaces in some parking areas and too many parking spaces in other parking areas. For example, there are 800 cars in the parking lot, and the current time is 8:00 on October 8, 2005, and the latest scheduled car pickup time is 18:00 on October 12, 2005. However, it is estimated that there are 799 vehicles to be taken away before 8:00 on October 9, 2005, and the scheduled pick-up time for the remaining vehicle is 18:00 on October 12, 2005. If 8:00 on October 8, 2005 is taken as the starting time and 18:00 on October 12, 2005 is taken as the end time, then the pick-up time period is from 8:00 on October 8, 2005 to 18:00 on October 12, 2005. When the pick-up time period is divided and the pick-up time window is obtained, the time span of the pick-up time window will be greatly increased, and then the number of vehicles corresponding to the pick-up time window will be increased, which may lead to insufficient parking spaces in some parking areas. In addition, if there is a pick-up time window in the time interval between 8:00 on October 9, 2005 and 18:00 on October 12, 2005, it means that the number of vehicles corresponding to the pick-up time window is at most 1, which makes it that there are almost no vehicles parked in the parking area corresponding to the pick-up time window, which is a great waste of parking spaces. If the time threshold is set to 10:00 on October 9, 2005, which is earlier than 18:00 on October 12, that is, 10:00 on October 9, 2005 is set as the latest scheduled pick-up time, that is, the end time of the pick-up time period, the above problem can be solved. The remaining car can be parked in a dedicated parking area or squeezed into the parking area corresponding to the latest pick-up time window.

[0075] In step S230, the vehicle pickup time period is evenly divided according to the number of parking areas to obtain the same number of vehicle pickup time windows as the number of parking areas. It should be clear that when adapting the vehicle pickup time window to each parking area, the user can customize the vehicle pickup time window to adapt to each parking area, or adapt it according to a preset standard, such as according to the distance between the parking area and the parking lot exit. The closer the distance between the parking area and the parking lot exit, the earlier the parking area is adapted to the vehicle pickup time window. In this way, each parking area has its corresponding vehicle pickup time window.

[0076] In one embodiment of the present application, when dividing the vehicle pick-up time period and obtaining the vehicle pick-up time window, the vehicle pick-up time window can also be divided according to the distribution of the scheduled vehicle pick-up time of each vehicle. Specifically, if the distribution of the scheduled vehicle pick-up time of each vehicle in the parking lot is relatively uniform, the vehicle pick-up time period is evenly divided to obtain the vehicle pick-up time window corresponding to each parking area.

[0077] If the scheduled pick-up times of the vehicles in the parking lot are relatively concentrated, then the time period with concentrated scheduled pick-up times will be divided into more pick-up time windows, that is, the time period will be divided into several shorter pick-up time windows, so that the number of parking spaces in each parking area is greater than or equal to the number of vehicles corresponding to the pick-up time windows in each parking area, to avoid insufficient parking spaces in the parking area. For the time period with dispersed scheduled pick-up times, fewer pick-up time windows will be divided, that is, several longer pick-up time windows will be divided into the time period to avoid wasting parking spaces.

[0078] It should be made clear that the vehicle corresponding to the pick-up time window refers to the vehicle whose scheduled pick-up time is within the pick-up time window. The vehicle corresponding to the parking area refers to the vehicle corresponding to the pick-up time window of the parking area. By counting the vehicles whose scheduled pick-up time is within the pick-up time window, the number of vehicles corresponding to the pick-up time window can be obtained, that is, the number of vehicles corresponding to the parking area can be obtained.

[0079] For example, there are 1,200 parking spaces in the parking lot with 1,000 cars parked. The parking lot is divided into 6 parking areas, each with 200 parking spaces, and the pick-up time period is from 8:00 to 24:00. If 150 cars have scheduled pick-up times between 8:00 and 17:00, 180 cars have scheduled pick-up times between 17:00 and 18:00, 200 cars have scheduled pick-up times between 18:00 and 19:00, 195 cars have scheduled pick-up times between 19:00 and 20:00, 185 cars have scheduled pick-up times between 20:00 and 21:00, and 150 cars have scheduled pick-up times between 20:00 and 24:00, then when dividing the pick-up time windows, in order to ensure that the number of parking spaces in each parking area is greater than or equal to the number of vehicles corresponding to the pick-up time windows in each parking area, the following 6 time windows can be obtained. They are (1) 8:00 to 17:00, (2) 17:00 to 18:00, (3) 18:00 to 19:00, (4) 19:00 to 20:00, (5) 20:00 to 21:00, and (6) 21:00 to 12:00.

[0080] In one embodiment of the present application, the following method can be used to obtain the time window for picking up a vehicle in a parking area. First, the parking spaces in the parking lot are sorted to obtain the serial numbers of the parking spaces. The basis for sorting can be the distance between the parking space and the exit of the parking lot or other factors, such as the distance between the parking space and the entrance of the parking lot. Secondly, the vehicles in the parking lot are sorted according to the scheduled pick-up time of each vehicle to obtain the number of the vehicle. Then, the parking lot is divided into several parking areas according to the serial numbers of the parking spaces. Finally, the vehicles parked in the parking area are determined according to the serial numbers of the parking spaces in the parking area and the numbers of the vehicles, and the time window for picking up the vehicles in the parking area is determined according to the scheduled pick-up time of the vehicles parked in the parking area. Exemplarily, if the serial numbers of the parking spaces in a parking area are 400 to 600, then the vehicles parked in the parking area with the serial numbers of 400 to 600 are determined with the scheduled pick-up time of vehicle 400 as the starting point and the scheduled pick-up time of vehicle 600 as the ending point.

[0081] In another embodiment of the present application, after determining the pick-up time window of each parking area, the size of the parking area can also be changed according to the number of vehicles corresponding to each parking area. Specifically, after adapting the pick-up time window to each parking area, the number of vehicles corresponding to each pick-up time window is calculated according to the scheduled pick-up time of each vehicle. If the number of vehicles corresponding to each pick-up time window is less than or equal to the number of parking spaces in the parking area corresponding to each time window, the number of each parking area will no longer be changed. If the number of vehicles corresponding to the pick-up time window is greater than the number of parking spaces in the parking area corresponding to the pick-up time window, the scope of the parking area is expanded, that is, the number of parking spaces in the parking area is increased, and the scope of at least one adjacent parking area is reduced until the number of vehicles corresponding to each pick-up time window is less than or equal to the number of parking spaces in the parking area corresponding to each time window.

[0082] In another embodiment of the present application, when setting the size of each parking area, after determining the pick-up time window corresponding to each parking area, the size of the parking area can also be determined in the following manner. Specifically, after determining the number of parking areas, the pick-up time period is evenly divided to obtain the same number of pick-up time windows as the number of parking areas. The pick-up time window is adapted to each parking area according to the distance between the parking area and the parking lot exit. The closer the distance between the parking area and the parking lot exit, the earlier the timing of the adapted pick-up time window. Then, the expected number of parking spaces corresponding to the pick-up time window is compared with the average number of parking spaces in the parking area, and the larger one is taken as the number of parking spaces in the parking area. In this way, the size of each parking area is determined. The expected number of parking spaces refers to the number of vehicles picked up under the pick-up time window obtained based on the previous vehicle pick-up records.

[0083] See also Figure 5 , Figure 5The flowchart of driving the dispatching device to move each vehicle to a parking area corresponding to the vehicle pickup time window according to the vehicle's scheduled pickup time to construct an overtime parking area is shown. The embodiment of the present application provides a step of driving the dispatching device to move each vehicle to a parking area corresponding to the vehicle pickup time window according to the vehicle's scheduled pickup time to construct an overtime parking area, including:

[0084] Step S401, obtaining the earliest scheduled car pick-up time;

[0085] Step S402, if the earliest scheduled pick-up time is before the current time, select a parking area as an overtime parking area, and update the start time of the overtime parking area pick-up time window to the earliest scheduled pick-up time.

[0086] The above two steps are described in detail below.

[0087] In step S401, the earliest scheduled pick-up time is determined according to the scheduled pick-up time corresponding to each vehicle in the parking lot.

[0088] In step S402, it is determined whether the earliest scheduled pick-up time is before the current time. If the earliest scheduled pick-up time is after the current time, it means that there are no overdue vehicles, and only the vehicles that need to be picked up later need to be scheduled. If the earliest scheduled pick-up time is before the current time, it means that there are overdue vehicles. When scheduling vehicles, these overdue vehicles should be considered. Specifically, a parking area is selected from multiple parking areas, which is specially used to park overdue vehicles. The parking area can be selected to a location far away from the exit of the parking lot. On the one hand, when the user comes to pick up the car, it is convenient for the dispatching equipment to find and move the overdue vehicles. On the other hand, the parking area close to the exit of the parking lot can be cleared out to place the vehicles in front when the appointment is made to pick up the car, so as to reduce the time to pick up the car and increase the user experience.

[0089] For example, vehicles that have not been picked up in time can be placed in the set overtime parking area or in any parking area. You only need to increase the time window of the parking area. For example, if the pick-up time window of a parking area is selected as 12:00 to 14:00 on October 1, 2023, you can add a pick-up time window - before the current time. You can also directly change the pick-up time window to before 14:00 on October 1, 2023.

[0090] In step S240, the pick-up time window of each vehicle is determined according to the scheduled pick-up time of each vehicle, and then the parking area corresponding to each vehicle is obtained according to the parking area corresponding to the pick-up time window. If the vehicle is parked in the corresponding parking area, it will not be moved. If the vehicle is not parked in the corresponding parking area, it will be moved to the parking area where it should be parked.

[0091] See also Figure 6 , Figure 6 The flowchart of driving the dispatching device to move each vehicle to a parking area corresponding to the vehicle pickup time window according to the vehicle's scheduled vehicle pickup time according to one embodiment of the present application is shown. The present application provides a step S240 of driving the dispatching device to move each vehicle to a parking area corresponding to the vehicle pickup time window according to the vehicle's scheduled vehicle pickup time, including:

[0092] Step S241, according to the scheduled pick-up time of the vehicle, determining the pick-up time window corresponding to the scheduled pick-up time;

[0093] Step S242, determining a target parking area for parking the vehicle according to the vehicle pickup time window corresponding to the vehicle reservation pickup time and the parking area corresponding to the time window;

[0094] Step S243: If the current parking area where the vehicle is located is inconsistent with the target parking area, the vehicle is a turnover vehicle, and the driving and dispatching equipment moves the turnover vehicle to the target parking area.

[0095] The above three steps are described in detail below.

[0096] In step S241, according to the scheduled pick-up time of the vehicle, the pick-up time window in which the scheduled pick-up time falls is determined, and then the pick-up time window corresponding to the vehicle is determined.

[0097] In step S242, the parking area where the vehicle should be parked, that is, the target parking area of ​​the vehicle, is determined according to the corresponding relationship between the vehicle pickup time window and the parking area. The target parking area of ​​each vehicle in the parking lot can be determined according to the method described in steps S241 and S242.

[0098] In step S243, it is determined whether the parking area where the vehicle is parked is consistent with its target parking area. If they are consistent, the vehicle does not need to be dispatched. If they are inconsistent, it means that the vehicle needs to be moved to the target parking area. This type of vehicle is called a turnover vehicle, and then the dispatching device is driven to move the turnover vehicle to the target parking area of ​​the vehicle.

[0099] In one embodiment of the present application, the parking spaces in the parking lot are divided into upper and lower parking spaces, namely the upper parking spaces and the lower parking spaces of the parking spaces. It is necessary to clarify that the vehicles in the lower parking spaces can be directly transported by the dispatching equipment, and the vehicles in the upper parking spaces cannot be directly transported. The vehicles need to be moved to the lower parking spaces before they can be transported. Therefore, when transporting the vehicles located in the upper parking spaces, it is necessary to first determine whether there are vehicles in the lower parking spaces. If there are no parked vehicles in the lower parking spaces, the dispatched vehicles in the upper parking spaces are moved to the lower parking spaces, and then the dispatching equipment is controlled to transport the dispatched vehicles to their target parking areas.

[0100] See also Figure 7 , Figure 7 A flowchart of a driving and dispatching device according to an embodiment of the present application to transport a turnover vehicle to a target parking area is shown. The embodiment of the present application provides steps for a driving and dispatching device to transport the turnover vehicle to a target parking area, including:

[0101] Step S501: if the turnover vehicle is located in the upper parking space and there is a vehicle parked in the lower parking space for the turnover vehicle, the lower vehicle is moved;

[0102] Step S502, driving the dispatching device to move the turnover vehicle to the target parking area via the lower parking space.

[0103] The above two steps are described in detail below.

[0104] In step S501, if the turnover vehicle is located in the upper parking space of a parking space and there is a vehicle parked in the lower parking space of the parking space, the vehicle in the lower parking space needs to be moved to other vacant parking spaces to free up the lower parking space.

[0105] In step S502, after the lower parking space under the turnover vehicle becomes idle, the turnover vehicle on the upper layer is transferred to the lower parking space, and then the maneuvering device is driven to move the turnover vehicle to its target parking area.

[0106] In one embodiment of the present application, before the vehicle in the lower parking space is moved to other vacant parking spaces, it is determined whether the vehicle parked in the lower parking space is a turnover vehicle. If the vehicle in the lower parking space is a turnover vehicle, the turnover vehicle parked in the lower parking space is first moved to its target parking area via the dispatching device. If the vehicle parked in the lower parking space is not a turnover vehicle, that is, the target parking area of ​​the vehicle is the parking area where it is located, a vacant parking space is preferentially searched in the parking area where the vehicle is located for transportation. If there is no vacant parking space in the current parking area, a vacant parking space is searched in other parking areas to transport and transfer the vehicle. After the turnover vehicle in the upper parking space is transported, the vehicle is transported back to its original parking space.

[0107] See also Figure 8 , Figure 8 A schematic diagram of a parking lot vehicle dispatching device according to an embodiment of the present application is shown.

[0108] A division module 810 is used to divide the parking lot into multiple parking areas;

[0109] The timing module 820 is used to obtain a pick-up time period with the current time as the start time and the latest scheduled pick-up time as the end time;

[0110] An acquisition module 830 is used to evenly divide the vehicle pickup time period according to the number of parking areas, and respectively serve as the vehicle pickup time window of each parking area;

[0111] The scheduling module 840 is used to drive the scheduling device to move each vehicle to the parking area corresponding to the vehicle pickup time window according to the vehicle's scheduled pickup time.

[0112] In one embodiment of the present application, the method provided by the present application can be applied in the following scenarios.

[0113] When dividing the parking lot into areas, obtain the ratio of the number of dispatching devices to the number of dispatching tasks, and determine the number of parking areas to be divided according to the numerical range of the ratio. Divide the parking lot into areas according to the exit location of the parking lot, and the parking areas are distributed in sequence according to the distance between the parking area and the exit of the parking lot. Determine the pick-up time period according to the current time and the latest scheduled pick-up time of the vehicle. Divide the pick-up time period evenly according to the number of parking areas to obtain each pick-up time window. According to the sequence of the pick-up time windows, adapt the pick-up time windows to each parking area in sequence. The parking area closer to the parking lot exit will be adapted to the pick-up time window with an earlier sequence, so as to reduce the pick-up time and improve the user experience.

[0114] Next, according to the scheduled pick-up time of each vehicle, the number of vehicles corresponding to each pick-up time window is obtained, and the size of each parking area, that is, the number of parking spaces in each parking area, is determined based on the number of vehicles corresponding to each pick-up time window. If the parking spaces in the parking lot are divided equally according to the number of parking areas, and the number of parking spaces in each parking area is greater than or equal to the number of vehicles corresponding to each pick-up time window, the parking spaces in the parking lot are divided equally according to the number of parking areas.

[0115] If the parking spaces in the parking lot are evenly divided according to the number of parking areas, and there are parking areas with fewer parking spaces than the number of vehicles corresponding to the pick-up time window or the expected number of parking spaces, more parking spaces will be allocated to the parking areas with insufficient parking spaces to meet the number of vehicles corresponding to the pick-up time window and the expected number of parking spaces. A small number of parking spaces will be allocated to the parking areas with too many parking spaces.

[0116] Finally, each vehicle is judged to be the parking area where it is located, whether it is the parking area where it should be parked, i.e. the target parking area. If not, these vehicles are dispatching vehicles, and then the dispatching equipment is controlled to carry the dispatching vehicle to its target parking area.

[0117] The parking lot vehicle dispatching method of the embodiment of the present application can be performed by Fig. 9 The hardware device shown is implemented. Fig. 9 To describe the hardware device according to the embodiment of the present application. Fig. 9The hardware device shown is only an example and should not bring any limitation to the functions and scope of application of the embodiments of the present application.

[0118] like Fig. 9 As shown, the hardware device may be in the form of a general computing device. The components of the hardware device may include, but are not limited to: at least one processing unit 810, at least one storage unit 820, and a bus 830 connecting different system components (including the storage unit 820 and the processing unit 810).

[0119] The storage unit stores program codes, which can be executed by the processing unit 810, so that the processing unit 810 performs the steps according to various exemplary embodiments of the present invention described in the description of the exemplary method described above in this specification. For example, the processing unit 810 can perform the following steps: Figure 3 The steps shown in .

[0120] The storage unit 820 may include a readable medium in the form of a volatile storage unit, such as a random access memory unit (RAM) 8201 and / or a cache memory unit 8202 , and may further include a read-only memory unit (ROM) 8203 .

[0121] The storage unit 820 may also include a program / utility 8204 having a set (at least one) of program modules 8205, such program modules 8205 including but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which or some combination may include an implementation of a network environment.

[0122] Bus 830 may represent one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

[0123] The hardware device may also communicate with one or more external devices 700 (e.g., keyboards, pointing devices, Bluetooth devices, etc.), may communicate with one or more devices that enable a user to interact with the hardware device, and / or may communicate with any device that enables the hardware device to communicate with one or more other computing devices (e.g., routers, modems, etc.). Such communication may be performed via an input / output (I / O) interface 850. Furthermore, the hardware device may also communicate with one or more networks (e.g., local area networks (LANs), wide area networks (WANs), and / or public networks, such as the Internet) via a network adapter 860. As shown, the network adapter 860 communicates with other modules of the data processing device 12 via a bus 830. It should be understood that, although not shown in the figure, other hardware and / or software modules may be used in conjunction with the hardware device, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems.

[0124] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the implementation methods of the present application.

[0125] In an exemplary embodiment of the present application, a computer program medium is further provided, on which computer-readable instructions are stored. When the computer-readable instructions are executed by a processor of a computer, the computer is enabled to execute the method described in the above method embodiment.

[0126] According to one embodiment of the present application, a program product for implementing the method in the above method embodiment is also provided, which can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited to this. In this document, a readable storage medium can be any tangible medium containing or storing a program, which can be used by or in combination with an instruction execution system, an apparatus or a device.

[0127] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0128] Computer readable signal media may include data signals propagated in baseband or as part of a carrier wave, in which readable program code is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Readable signal media may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0129] The program code embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the foregoing.

[0130] Program code for performing the operations of the present invention may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server. In cases involving a remote computing device, the remote computing device may be connected to the user computing device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computing device (e.g., through the Internet using an Internet service provider).

[0131] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0132] In addition, although the steps of the method in the present application are described in a specific order in the drawings, this does not require or imply that the steps must be performed in this specific order, or that all the steps shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps, etc.

[0133] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to execute the method according to the implementation methods of the present application.

[0134] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the inventions applied for herein. The present application is intended to cover any modification, use or adaptation of the present application, which follows the general principles of the present application and includes common knowledge or customary techniques in the art that the present application does not apply for. The specification and embodiments are intended to be exemplary only, and the true scope and spirit of the present application are indicated by the appended claims.

Claims

1. A method for dispatching vehicles in a parking lot, characterized in that: The method comprises: Divide the parking lot into more than one parking area; Take the current time as the start time and the latest scheduled pick-up time as the end time to get the pick-up time period; Divide the vehicle pickup time period evenly according to the number of the parking areas, and use them as the vehicle pickup time window of each parking area; According to the scheduled pick-up time of the vehicle, the driving dispatching device moves each vehicle to the parking area corresponding to the pick-up time window.

2. The method according to claim 1, characterized in that The parking lot is divided into more than one parking area, including: The parking lot is divided into areas according to the distance between the parking spaces and the parking lot exit.

3. The method according to claim 1, characterized in that The parking lot is divided into more than one parking area, including: According to the ratio of the number of dispatching devices to the number of dispatching tasks in the parking lot, the parking lot is divided into a corresponding number of parking areas, and the number of the parking areas is positively correlated with the ratio.

4. The method according to claim 1, characterized in that: The method of obtaining the latest scheduled pick-up time according to the scheduled pick-up time of each vehicle in the parking lot includes: According to the scheduled pick-up time of each vehicle in the parking lot, the latest scheduled pick-up time is obtained; The latest scheduled vehicle pickup time is compared with a preset time threshold, and if the latest scheduled vehicle pickup time is after the time threshold, the time threshold is updated to the latest scheduled vehicle pickup time.

5. The method according to claim 1, characterized in that According to the scheduled vehicle pickup time, the dispatching device is driven to move each vehicle to a parking area corresponding to the vehicle pickup time window, and the method further includes: Get the earliest scheduled pick-up time; If the earliest scheduled pick-up time is before the current time, a parking area is selected as an overtime parking area, and the start time of the pick-up time window of the overtime parking area is updated to the earliest scheduled pick-up time.

6. The method according to claim 1, characterized in that According to the scheduled pick-up time of the vehicle, the dispatching device is driven to move each vehicle to a parking area corresponding to the pick-up time window, including: According to the scheduled pick-up time of the vehicle, determining a pick-up time window corresponding to the scheduled pick-up time; Determining a target parking area for parking the vehicle according to a pick-up time window corresponding to the vehicle reservation pick-up time and a parking area corresponding to the time window; If the parking area where the vehicle is currently located is inconsistent with the target parking area, then the vehicle is a turnover vehicle, and the driving dispatching device moves the turnover vehicle to the target parking area.

7. The method according to claim 6, characterized in that The parking spaces are divided into upper and lower parking spaces, and the driving dispatching equipment moves the turnover vehicles to the target parking area, including: If the target parking area has an idle parking space and the turnover vehicle is not located in an upper parking space, the dispatching device is driven to move the vehicle to the idle parking space in the target parking area.

8. The method according to claim 5, characterized in that The driving and dispatching device transports the turnover vehicle to the target parking area, including: If the turnover vehicle is located in the upper parking space and there is a vehicle parked in the lower parking space of the turnover vehicle, the lower vehicle will be moved; The dispatching device is driven to transport the turnover vehicle to the target parking area via the lower parking space.

9. A parking lot vehicle dispatching device, characterized in that: The device comprises: A division module, used to divide the parking lot into areas to obtain more than one parking area; The timing module is used to obtain the pick-up time period with the current time as the start time and the latest scheduled pick-up time as the end time; An acquisition module, configured to evenly divide the vehicle pickup time period according to the number of the parking areas, and respectively serve as the vehicle pickup time window of each parking area; The scheduling module is used to drive the scheduling equipment to move each vehicle to the parking area corresponding to the pick-up time window according to the scheduled pick-up time of the vehicle.

10. A computer-readable storage medium, characterized in that: Computer-readable instructions are stored thereon, and when the computer-readable instructions are executed by a processor of a computer, the computer is caused to execute the method according to any one of claims 1 to 8.

Images