Parking lot vehicle dispatching method, device and computer medium

Abstract

The application provides a parking lot vehicle scheduling method, device and computer medium, the method comprising: dividing a parking lot into more than one parking area, taking the current time as the starting time and the latest reservation time as the ending time to obtain a pickup time period, dividing the pickup time period according to the number of parking areas to obtain pickup time windows of each parking area, and driving a scheduling device to move each vehicle to the parking area corresponding to the pickup time window according to the reservation pickup time of the vehicle. The application solves the problem of long pickup time of users.

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 park and retrieve their cars, especially when the parking space is far from the parking lot exit, which greatly increases the parking and retrieval time 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, vehicles with earlier pick-up times may be placed farther 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] Use 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 time period for picking up the vehicle evenly according to the number of the parking areas, and serve as the time window for picking up the vehicle in each parking area;

[0010] According to the scheduled pick-up time of the vehicle, the dispatching device is driven to move 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, dividing the parking lot into 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, dividing the parking lot into 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 based on 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, obtain the latest scheduled pick-up time;

[0017] The latest scheduled car pickup time is compared with a 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.

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

[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 overdue parking area, and the start time of the overdue parking area pick-up time window 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 vehicle's scheduled pickup time includes:

[0022] Determining a vehicle pickup time window corresponding to the scheduled vehicle pickup time according to the scheduled vehicle pickup time;

[0023] Determining a target parking area for parking the vehicle based on 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 and dispatching equipment moves the turnover vehicle to the target parking area.

[0025] According to one aspect of an embodiment of the present application, parking spaces are divided into upper and lower parking spaces, and a driving and dispatching device transports the turnover vehicle to a 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 transport 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 and 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 is 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. Finally, the vehicles in the parking lot are moved so that each vehicle is parked in the corresponding parking area. During the time period coinciding with the pick-up time window, when the user picks up the vehicle, the dispatching equipment only needs to work in the parking area corresponding to the pick-up time window, and there is no need to search for and transport 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 enhances 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 practice of the present application.

[0038] It should be understood that the foregoing general description and the following detailed description are merely illustrative 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 example embodiments thereof with reference to the attached drawings.

[0040] Figure 1 A system architecture diagram 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 flowchart 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 one embodiment of the present application.

[0044] Figure 5 A flowchart is shown for constructing an overtime parking area before driving 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 according to one embodiment of the present application.

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

[0046] Figure 7 A flow chart of driving a dispatching device to transport 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] Figure 9 A hardware structure diagram of a method for scheduling parking 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 this application will be more comprehensive and complete and will fully convey the concepts of the example embodiments to those skilled in the art. The accompanying drawings are merely schematic illustrations of the present application and are not necessarily drawn to scale. Identical reference numerals in the figures indicate identical or similar parts, and thus repeated descriptions thereof 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 solutions 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 main content and making various aspects of the present application vague.

[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 may be implemented in software, 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 This is a system architecture used in the embodiments of the present application. This system architecture may include: at least one dispatching device 11, and a data processing device 12 that controls the dispatching device 11. The data processing device 12 divides the parking lot area, calculates vehicle pickup time windows, and controls the dispatching device 12 to move vehicles to various parking areas. The data processing device 12 controls the dispatching device 11 to execute a method for dispatching vehicles in the parking lot, thereby scheduling vehicles in the parking lot.

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

[0054] Please refer to the following for details: 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 embodiment of the present application provides a method for dispatching vehicles in a parking lot, including the following steps:

[0055] Step S210, dividing the parking lot into areas to obtain one or more parking areas;

[0056] Step S220: Using the current time as the start time and the latest scheduled car pickup time as the end time, obtain the car pickup time period;

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

[0058] Step S240: According to the scheduled pick-up time of the vehicle, the dispatching device is driven 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 number of parking areas can be preset to divide the parking lot into areas.

[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 efficient the parking lot pick-up efficiency can be. Dispatching equipment includes but is not limited to AGV robots, but also includes all equipment with a handling function, 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. The larger the quantity ratio, the more parking areas there are.

[0064] It should also be clarified that after determining the number of parking areas, the size of the parking areas must also be determined. Regarding the size of the parking areas, users can customize the size of each parking area using parking spaces as the minimum unit of measurement, or they can determine the size of each parking area based on the number of parking spaces and a preset standard. If the preset standard stipulates that all parking areas are the same size, then all parking spaces in the parking lot are divided equally according to the number of parking areas, thereby determining the number of parking spaces in each parking area. Alternatively, if the preset standard stipulates that if there are four parking areas, then the ratio of 3:3:3:1 is used. If there are four parking areas, then all parking spaces in the parking lot are divided according to the above ratio, thereby determining the number of parking spaces in each parking area.

[0065] It should be noted that when dividing a parking lot into zones, the distribution of parking areas, i.e., the location of each parking area within the parking lot, also needs to be determined. The distribution of parking areas can be customized by the user or divided according to a preset method, such as arranging each parking area in order of distance from the parking lot exit. In actual application, the distribution of parking areas can also be adaptively adjusted based on the vehicle's scheduled pickup time or other user needs. For example, the parking area farthest from the parking lot exit can be selected as an overdue parking area to accommodate vehicles that have not been picked up by the time limit or whose scheduled pickup time is too late.

[0066] For example, see Figure 3 , Figure 3 A schematic diagram of the parking area distribution according to an embodiment of the present application is shown. Figure 3 As shown, the parking lot is divided evenly 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, so that 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. The pick-up time period includes the scheduled pick-up times of all vehicles to be taken away.

[0068] See also Figure 4 , Figure 4 A flowchart of obtaining the latest scheduled pickup time based on the scheduled pickup time of each vehicle in a parking lot according to one embodiment of the present application is shown. This embodiment of the present application provides steps for obtaining the latest scheduled pickup time based on the scheduled pickup time of each vehicle in a parking lot, including:

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

[0070] Step S302: compare the latest scheduled car pickup time with a preset time threshold. If the latest scheduled car pickup time is after the time threshold, update the time threshold to the latest scheduled car pickup 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 pick-up time is compared with the preset time threshold. If the latest scheduled car pick-up time is after the time threshold, the time threshold is updated to the latest scheduled car pick-up time, which is then used as the end time of the car pick-up time period.

[0074] To make the time window for vehicle pickup more reasonable, this embodiment of the application sets a time threshold to limit the latest scheduled vehicle pickup time. This prevents excessively long pickup windows, which can lead to insufficient parking spaces in some parking areas and excessive spaces in others. For example, if there are 800 vehicles in a parking lot and the current time is 8:00 AM on October 8, 2005, the latest scheduled vehicle pickup time is 6:00 PM on October 12, 2005. However, it is estimated that there are 799 vehicles to be picked up before 8:00 on October 9, 2005, and the reserved pick-up time of 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 period is from 8:00 on October 8, 2005 to 18:00 on October 12, 2005. When the pick-up 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 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 means 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 used as the latest scheduled pickup time, which is also the end time of the pickup period. This can solve the above problem. The remaining car can be parked in a separate designated parking area or squeezed into the parking area corresponding to the latest pickup time window.

[0075] In step S230, the vehicle pickup time period is evenly divided according to the number of parking areas, resulting in a number of pickup time windows equal to the number of parking areas. It should be noted that when adapting the pickup time windows to each parking area, the user can customize the pickup time windows to suit each parking area, or the time windows can be adapted based on a preset standard, such as the distance between the parking area and the parking lot exit. The closer the parking area is to the parking lot exit, the earlier the pickup time window will be adapted. This ensures that each parking area has its own corresponding pickup time window.

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

[0077] If the scheduled pickup times for vehicles in a parking lot are relatively concentrated, the time period with concentrated pickup times will be divided into more pickup time windows. In other words, the time period will be divided into several shorter pickup time windows. This will ensure that the number of parking spaces in each parking area is greater than or equal to the number of vehicles corresponding to the pickup time windows in each parking area, thus avoiding insufficient parking spaces in the parking area. The time period with dispersed pickup times will be divided into fewer pickup time windows. In other words, the time period will be divided into several longer pickup time windows to avoid wasting parking spaces.

[0078] It should be noted that the vehicles corresponding to the pickup time window are those whose scheduled pickup times fall within that window. The vehicles corresponding to the parking area are those whose scheduled pickup times fall within that window. By counting the vehicles whose scheduled pickup times fall within that window, we can determine the number of vehicles corresponding to the pickup time window, and thus the number of vehicles corresponding to the parking area.

[0079] For example, a parking lot has 1,200 parking spaces for 1,000 cars. The parking lot is divided into six parking areas, each with 200 spaces. The pick-up time period is from 8:00 to midnight. 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 midnight, then when dividing the pick-up time windows, 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 window in each parking area, the following six 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 midnight.

[0080] In an embodiment of the present application, the method for obtaining the time window of taking a car in a parking area can also be as follows: first, the parking spaces in the parking lot are sorted to obtain the serial numbers of the parking spaces. The sorting basis can be the distance between the parking space and the exit of the parking lot or other factors, for example, the distance between the parking space and the entrance of the parking lot. Second, the vehicles in the parking lot are sorted according to the reserved time of taking a car of each vehicle to obtain the serial numbers of the vehicles. 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 serial numbers of the vehicles, and the time window of taking a car in the parking area is determined according to the reserved time of taking a car of the vehicle parked in the parking area. For example, if the serial numbers of the parking spaces in a parking area are 400 to 600, the vehicles with serial numbers from 400 to 600 are parked in the parking area, the reserved time of taking a car of the vehicle with serial number 400 is the starting point, and the reserved time of taking a car of the vehicle with serial number 600 is the end point, the time window of taking a car in the parking area is determined.

[0081] In another embodiment of the present application, after the time window of taking a car in each parking area is determined, the size of the parking area can also be changed according to the number of vehicles corresponding to each parking area. Specifically, after the time window of taking a car in each parking area is adapted, the number of vehicles corresponding to each time window of taking a car is calculated according to the reserved time of taking a car of each vehicle. If the number of vehicles corresponding to each time window of taking a car is less than or equal to the number of parking spaces in the parking area corresponding to each time window, the number of parking areas is not changed. If the number of vehicles corresponding to the time window of taking a car is greater than the number of parking spaces in the parking area corresponding to the time window of taking a car, the range of the parking area is expanded, that is, the number of parking spaces in the parking area is increased, and the range of at least one adjacent parking area is reduced, until the number of vehicles corresponding to each time window of taking a car 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 the size of each parking area is set, after the time window of taking a car corresponding to each parking area is determined, the size of the parking area can also be determined in the following manner. Specifically, after the number of parking areas is determined, the time window of taking a car is equally divided to obtain the same number of time windows of taking a car as the number of parking areas. The time window of taking a car is adapted to each parking area according to the distance between the parking area and the exit of the parking lot. The closer the distance between the parking area and the exit of the parking lot, the earlier the time sequence of the adapted time window of taking a car. Then, the expected number of parking spaces corresponding to the time window of taking a car 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 taking a car in the time window of taking a car obtained according to the taking a car records of the vehicles in the past.

[0083] Please refer to Figure 5 , Figure 5A flowchart illustrating a method for driving a dispatching device to move each vehicle to a parking area corresponding to a vehicle pickup time window based on a vehicle's scheduled pickup time, thereby creating an overtime parking area, according to one embodiment of the present application. The method provides a method for driving a dispatching device to move each vehicle to a parking area corresponding to a vehicle pickup time window based on a vehicle's scheduled pickup time, thereby creating an overtime parking area, including:

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

[0085] Step S402: If the earliest scheduled car pickup time is before the current time, a parking area is selected as an overdue parking area, and the start time of the overdue parking area car pickup time window is updated to the earliest scheduled car pickup time.

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

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

[0088] In step S402, a determination is made as to whether the earliest scheduled pickup time is before the current time. If the earliest scheduled pickup time is after the current time, there are no overdue vehicles, and only the vehicles that need to be picked up later need to be scheduled. If the earliest scheduled pickup time is before the current time, there are overdue vehicles, and these overdue vehicles must be considered when scheduling vehicles. Specifically, a parking area is selected from multiple parking areas specifically for parking overdue vehicles. This parking area can be located far from the parking lot exit. This facilitates the dispatching equipment to locate and move overdue vehicles when users come to pick up their vehicles. Furthermore, parking areas closer to the parking lot exit can be cleared to accommodate vehicles that were previously scheduled for pickup, reducing pickup time and improving the user experience.

[0089] For example, vehicles that have not been picked up by the designated overdue parking area can be placed in any parking area by simply increasing the time window for that parking area. For example, if the pick-up time window for a parking area is from 12:00 to 14:00 on October 1, 2023, you can add a pick-up time window to 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 vehicle's scheduled pickup time is used to determine the pickup window for each vehicle. The corresponding parking area is then determined based on the parking area corresponding to the pickup window. If the vehicle is parked in its corresponding parking area, no vehicle is moved. If the vehicle is not parked in its corresponding parking area, the vehicle is moved to its intended parking area.

[0091] Referring to Figure 6 , Figure 6 A flow chart of driving the scheduling device to move each vehicle to the parking area corresponding to the pickup time window according to the scheduled pickup time of the vehicle is shown according to an embodiment of the present application. The present application provides step S240 of driving the scheduling device to move each vehicle to the parking area corresponding to the pickup time window according to the scheduled pickup time of the vehicle, comprising:

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

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

[0094] Step S243, if the current parking area of the vehicle is inconsistent with the target parking area, the vehicle is a turnover vehicle, and the scheduling device is driven to move the turnover vehicle to the target parking area.

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

[0096] In step S241, the pickup time window of the scheduled pickup time of the vehicle is determined according to the scheduled pickup time of the vehicle, and the pickup time window corresponding to the vehicle is determined.

[0097] In step S242, the parking area where the vehicle should be parked, i.e. the target parking area of the vehicle, is determined according to the correspondence between the 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 judged whether the parking area where the vehicle is parked is consistent with the target parking area. If consistent, the vehicle does not need to be scheduled. If inconsistent, it means that the vehicle needs to be moved to the target parking area, which is called a turnover vehicle, and then the scheduling device is driven to move the turnover vehicle to the target parking area of the vehicle.

[0099] In an embodiment of the present application, the parking spaces in the parking lot are upper and lower parking spaces, i.e. the upper parking space and the lower parking space of the parking space. The vehicle in the lower parking space can be directly moved by the scheduling device, and the vehicle in the upper parking space cannot be directly moved and needs to be moved to the lower parking space before being moved. Therefore, when moving the vehicle in the upper parking space, it is necessary to first judge whether there is a vehicle in the lower parking space. If there is no vehicle parked in the lower parking space, the scheduling vehicle in the upper parking space is moved to the lower parking space, and then the scheduling device is controlled to move the scheduling vehicle to the target parking area.

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

[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, 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 first to free up the lower parking space.

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

[0106] In one embodiment of the present application, before a vehicle in a lower parking space is moved to another vacant parking space, a determination is made as to 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 for the vehicle is the parking area where the vehicle is located, a vacant parking space is preferentially searched for in the parking area where the vehicle is located for movement. If there are no vacant parking spaces in the current parking area, a vacant parking space is searched for in another parking area to move the vehicle. After the turnover vehicle in the upper parking space is moved, the vehicle is moved 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 using the current time as the start time and the latest scheduled pick-up time as the end time;

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

[0111] The scheduling module 840 is used to drive the scheduling equipment 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 zoning a parking lot, the ratio of the number of dispatching devices to the number of dispatching tasks is obtained. The number of parking areas to be divided is determined based on the numerical range of this ratio. The parking lot is divided into zones based on the exit locations, with parking areas distributed sequentially based on their distance from the exit. The pickup time period is determined based on the current time and the vehicle's latest scheduled pickup time. The pickup time period is evenly divided based on the number of parking areas to obtain pickup time windows. These pickup time windows are then sequentially adapted to each parking area based on their order. Parking areas closer to the exit are assigned pickup time windows closer in time, thereby reducing pickup time and improving the user experience.

[0114] Next, based on each vehicle's scheduled pickup time, the number of vehicles corresponding to each pickup time window is obtained. 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 pickup time window. If the parking spaces in the parking lot are evenly divided 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 pickup time window, the parking lot spaces are evenly divided 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 spaces than the number of vehicles corresponding to the pickup time window or the expected number of parking spaces, then the parking areas with insufficient spaces will be allocated more spaces to meet the number of vehicles corresponding to the pickup time window and the expected number of parking spaces. Parking areas with too many spaces will be allocated fewer spaces.

[0116] At last each vehicle is judged its place parking area, whether it is the parking area that should be parked, i.e. target parking area. If not, these vehicles are dispatching vehicles, and then the control dispatching device is carried to its target parking area by dispatching vehicles.

[0117] The parking lot vehicle scheduling method of the embodiment of the present application can be Figure 9 The hardware device shown is implemented. Figure 9 To describe the hardware device according to the embodiment of the present application. Figure 9The hardware device shown is only an example and should not limit the functions and scope of application of the embodiments of the present application.

[0118] like Figure 9 As shown, the hardware device may be in the form of a general-purpose computing device. Components of the hardware device may include, but are not limited to: the at least one processing unit 810, the 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 that 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 above. 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 bus or memory 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 can also communicate with one or more external devices 700 (e.g., a keyboard, a pointing device, a Bluetooth device, etc.), one or more devices that enable a user to interact with the hardware device, and / or any device that enables the hardware device to communicate with one or more other computing devices (e.g., a router, a modem, etc.). Such communication can occur via an input / output (I / O) interface 850. Furthermore, the hardware device can communicate with one or more networks (e.g., a local area network (LAN), a wide area network (WAN), and / or a public network 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 can 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 embodiments, it is easy for those skilled in the art to understand that the example embodiments described herein can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the embodiments 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 embodiments 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 caused 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. The program product may be a portable compact disc read-only memory (CD-ROM) and includes 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 thereto. In this document, a readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0127] The program product can take any combination of one or more computer-readable media. The computer-readable media can be a computer-readable storage medium or a computer-readable signal medium. The computer-readable storage medium can be, for example but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include an electrical connection having 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 disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0128] The computer-readable signal medium can include a computer-readable storage medium that is configured to store and deliver a computer-readable program code. The computer-readable program code can be propagated as a computer-readable signal medium.

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

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

[0131] It should be noted that, although several modules or units for device for action execution are mentioned in the foregoing detailed description, such division into modules or units is not mandatory. Indeed, according to an embodiment of the present application, features and functionalities of two or more modules or units described above can be embodied in one module or unit. Conversely, features and functionalities of one module or unit described above can be further divided into several modules or units.

[0132] Furthermore, although individual steps of the methods in the present application are described in a particular order in the drawings, this is not required or implied as to the order in which the steps are performed, nor is it required that all of the steps shown be performed to achieve the desired result. Additionally or alternatively, certain steps can be omitted, combined into a single step, broken into multiple steps, and / or the like.

[0133] Those skilled in the art will readily understand that the example embodiments described herein can be implemented by software and / or by software in combination with the necessary hardware. Thus, the technical solutions according to the embodiments 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 disk, a mobile hard disk, or the like) or a network, and includes a number of instructions to enable a computing device (which can be a personal computer, a server, a mobile terminal, or a network device, etc.) to perform the methods according to the embodiments of the present application.

[0134] Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. It is intended that the present application cover any and all variations of the application that come within the scope of the general inventive concepts described herein and including all such variations as fall within the scope of the claims. It is intended that the specification and examples be considered exemplary only, with the true scope and spirit of the application being indicated by the following claims.

Claims

1. A method for dispatching vehicles in a parking lot, characterized in that: The method comprises: Dividing the parking lot into a corresponding number of parking areas according to a ratio of the number of dispatching devices to the number of dispatching tasks in the parking lot, and determining the sizes of the parking areas, wherein the number of parking areas is positively correlated with the ratio; The current time is used as the starting time and the latest scheduled pick-up time is used as the ending time to obtain the pick-up time period. Each vehicle in the parking lot has a corresponding scheduled pick-up time. Divide the vehicle pickup time period according to the number of the parking areas, and serve as the vehicle pickup time window for each parking area; According to the scheduled pick-up time of the vehicle, the dispatching device is driven to move each vehicle to the parking area corresponding to the pick-up time window; After the pick-up time window is adapted for 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 a 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 corresponding to the pick-up time window will be expanded, the number of parking spaces in the parking area corresponding to the pick-up time window will be increased, and the scope of at least one parking area adjacent to the parking area corresponding to the pick-up time window will be reduced; until the number of vehicles corresponding to each of the pick-up time windows is less than or equal to the number of parking spaces in the parking area corresponding to each of the pick-up time windows.

2. The method according to claim 1, characterized in that The step of dividing the parking lot into a corresponding number of parking areas comprises: 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 method further comprises: According to the scheduled pick-up time of each vehicle in the parking lot, obtain the latest scheduled pick-up time; The latest scheduled car pickup time is compared with a 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.

4. The method according to claim 1, wherein 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 vehicle's scheduled pickup time; 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 overdue parking area, and the start time of the overdue parking area pick-up time window is updated to the earliest scheduled pick-up time.

5. The method according to claim 1, wherein 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 vehicle's scheduled pickup time includes: Determining a vehicle pickup time window corresponding to the scheduled vehicle pickup time according to the scheduled vehicle pickup 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 pick-up time window; 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 and dispatching equipment moves the turnover vehicle to the target parking area.

6. The method according to claim 5, characterized in that The parking spaces are divided into upper and lower parking spaces. The driving and 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 transport the vehicle to the idle parking space in the target parking area.

7. The method according to claim 5, characterized in that The driving and dispatching device transports the turnover vehicle to the target parking area, further comprising: 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.

8. A parking lot vehicle dispatching device, characterized in that: The device comprises: a division module for dividing the parking lot into a corresponding number of parking areas according to a ratio of the number of dispatching devices to the number of dispatching tasks in the parking lot, and determining the sizes of the parking areas, wherein the number of parking areas is positively correlated with the ratio; A timing module is used to obtain a pick-up time period using the current time as the start time and the latest scheduled pick-up time as the end time. Each vehicle in the parking lot has a corresponding scheduled pick-up time; An acquisition module is 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; A dispatching module, configured to drive 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; The acquisition module is further configured to calculate the number of vehicles corresponding to each pick-up time window according to the scheduled pick-up time of each vehicle after the pick-up time window is adapted to each parking area; if the number of vehicles corresponding to a pick-up time window is greater than the number of parking spaces in the parking area corresponding to the pick-up time window, the range of the parking area corresponding to the pick-up time window is expanded, the number of parking spaces in the parking area corresponding to the pick-up time window is increased, and the range of at least one adjacent parking area to the parking area corresponding to the pick-up time window 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 pick-up time window.

9. 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 7.

Images