Garage parking space allocation system and method based on parking time and aisle number

Abstract

The application discloses a garage parking space allocation system and method based on parking time and channel number, and the garage parking space allocation method comprises the following steps: acquiring vehicle information and an entry time of an entry vehicle of a parking lot; acquiring a target area, wherein the target area is a parking area with the shortest average time for the vehicle to drive into a parking space according to the entry time; acquiring a target parking space according to an empty space in the target area; generating a navigation path of the target parking space; sending the navigation path to a communication terminal corresponding to the vehicle information, and recording a driving-in time of the entry vehicle driving into the target parking space. The application provides a parking space allocation mode based on parking time and a convenient navigation method, and the parking space level navigation does not depend on real-time high-precision positioning and installation of a guiding device, so that the construction cost of the intelligent parking garage can be greatly reduced.

Description

Technical Field

[0001] This invention relates to a parking space allocation system and method based on parking time and lane number. Background Technology

[0002] With the rapid increase in car ownership, the contradiction between cars and parking spaces in cities is becoming increasingly prominent. In cities where land is extremely valuable, underground parking lots and multi-story parking garages, which occupy less space but have a large capacity, are increasingly becoming the main means of alleviating urban parking pressure.

[0003] Parking guidance in parking lots is generally based on the number of available parking spaces, and drivers will actively drive towards areas with more available parking spaces.

[0004] Immediately assigning parking spaces after vehicles enter the parking garage can guide vehicles in an orderly manner and effectively alleviate queuing congestion. However, there are two problems in actual operation: 1) Vehicle parking space-level navigation is affected by the network signal and positioning in the garage, making accurate navigation difficult and costly to implement; 2) Directly assigning parking spaces and using complex navigation methods are not conducive to actual operation. Summary of the Invention

[0005] The technical problem this invention aims to solve is to overcome the shortcomings of existing technologies, such as parking lot vehicle space allocation and navigation being affected by network signals and real-time positioning within the garage, resulting in high difficulty and implementation costs for accurate navigation, and the complexity and impracticality of direct parking space allocation. This invention provides a parking space allocation system and method based on parking time and lane numbering, which offers a more efficient and convenient parking space allocation method, avoids reliance on real-time high-precision positioning and the installation of guidance equipment for parking space-level navigation, and can significantly reduce the construction cost of smart parking garages.

[0006] The present invention solves the above-mentioned technical problems through the following technical solution:

[0007] A parking space allocation method based on parking time and lane number, characterized in that the parking space allocation method includes:

[0008] Obtain vehicle information and entry time for vehicles entering the parking lot;

[0009] Obtain the target area, which is the parking area with the shortest average time for vehicles to enter the parking space, based on the entry time.

[0010] Obtain the target berth based on the available spaces in the target area;

[0011] Generate a navigation path to the target berth;

[0012] The navigation route is sent to the communication terminal corresponding to the vehicle information, and the entry time of the vehicle into the target parking space is recorded.

[0013] Preferably, the garage parking space allocation method includes:

[0014] Record the entry time of each vehicle into the parking space;

[0015] The average entry time for each parking area in each time period is obtained based on the historical entry time.

[0016] The parking area with the shortest average entry time within the corresponding time period is selected as the target area.

[0017] Preferably, obtaining the target area includes:

[0018] Obtain the corresponding time slot based on the entry time;

[0019] For each parking area, the time taken to enter the parking area within the corresponding time period is obtained based on the historical entry time, and the average entry time of the parking area for the corresponding time period is calculated based on the time taken.

[0020] For all parking areas, the parking area with the shortest average entry time is selected as the target area.

[0021] Preferably, obtaining the target area includes:

[0022] Search for unoccupied berths for entry time;

[0023] Find parking areas with unoccupied parking spaces;

[0024] The corresponding time period is obtained with the entry time as the center.

[0025] The target area is obtained in a parking area where no parking space is occupied.

[0026] Preferably, the garage parking space allocation method includes:

[0027] Calculate the average entry time for the corresponding time period in the parking area based on the time consumption;

[0028] Identify parking areas where the average entry time is less than a preset duration;

[0029] The target area is selected as the parking area closest to the garage entrance or building entrance among parking areas where the average entry time is less than the preset time.

[0030] Preferably, each segment of the parking lot is coded, and signs indicating the codes are placed at the intersections of the segments. The parking space allocation method includes:

[0031] Generate a navigation path to the target berth;

[0032] Generate road segment code information based on the navigation path;

[0033] The road segment code information is sent to the communication terminal corresponding to the vehicle information.

[0034] Preferably, the step of generating road segment coding information based on the navigation path includes:

[0035] Obtain all navigation options for the target berth;

[0036] For each navigation scheme, obtain all codes in the navigation scheme and obtain the parking areas adjacent to the codes;

[0037] Calculate the sum of the average entry times for adjacent parking areas for all codes of each navigation scheme;

[0038] The navigation path is the one that minimizes the sum of average entry times.

[0039] Generate road segment code information based on the navigation path.

[0040] Preferably, the garage parking space allocation method includes:

[0041] Determine if the target berth is occupied. If so, determine if the occupying vehicle is the same vehicle as the one on the navigation path. If it is the same vehicle as the one on the navigation path, record the entry time of the vehicle into the target berth. If it is not the same vehicle as the one on the navigation path, repeat the step of obtaining the target area.

[0042] Preferably, the garage parking space allocation method includes:

[0043] Based on the shortest historical time taken for a vehicle to enter a parking space, determine if the occupied vehicle corresponds to the navigation path. If it does, record the entry time of the vehicle into the target parking space. If it does not correspond to the navigation path, repeat the step of obtaining the target area; or...

[0044] Based on the surveillance footage, determine whether the vehicle occupying the space is the same vehicle as the navigation path. If it is, record the entry time of the vehicle into the target parking space. If it is not the same vehicle as the navigation path, repeat the step of obtaining the target area.

[0045] The present invention also provides a garage parking space allocation system, which is used to implement the garage parking space allocation method described above.

[0046] Based on common knowledge in the field, the above-mentioned preferred conditions can be combined arbitrarily to obtain various preferred embodiments of the present invention.

[0047] The positive and progressive effects of this invention are as follows:

[0048] This invention proposes a parking space allocation method based on parking time and a convenient navigation method. This invention avoids the need for real-time high-precision positioning and installation of guidance equipment for parking space-level navigation, which can greatly reduce the construction cost of smart parking garages. Attached Figure Description

[0049] Figure 1 This is a schematic diagram of the parking lot structure in the parking space allocation system of Embodiment 1 of the present invention.

[0050] Figure 2 This is a schematic diagram of the structure of the coded information of the parking space allocation system in Embodiment 1 of the present invention.

[0051] Figure 3 This is a schematic diagram of the signage of the parking space allocation system in Embodiment 1 of the present invention.

[0052] Figure 4 This is another structural schematic diagram of the parking space allocation system sign of Embodiment 1 of the present invention.

[0053] Figure 5 This is a flowchart of the garage parking space allocation method according to Embodiment 1 of the present invention.

[0054] Figure 6 This is another flowchart of the garage parking space allocation method according to Embodiment 1 of the present invention. Detailed Implementation

[0055] The present invention will be further illustrated by way of embodiments below, but the present invention is not limited to the scope of the embodiments described herein.

[0056] Example 1

[0057] See Figure 1 , Figure 2 This embodiment provides a parking space allocation system based on parking time and lane number.

[0058] The parking space allocation system includes an image acquisition device and a processing module located at the entrance of the parking lot, as well as indicator signs for coding located at intersections in the middle of the parking lot.

[0059] In this embodiment, the processing module can be a desktop computer, tablet computer, laptop computer, or a server with computing power.

[0060] The server may be an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communication, middleware services, domain name services, security services, CDN (Content Delivery Network), and big data and artificial intelligence platforms.

[0061] In the specification and claims of this application, the terms “comprising” and “having”, and any variations thereof, are used to indicate a non-exclusive inclusion, for example, a process, method, product, or apparatus that includes a series of method steps or modules is not necessarily limited to those steps or modules that are explicitly listed, but may include other steps or modules that are not explicitly listed or that are inherent to such process, method, product, or apparatus.

[0062] The processing module is used for:

[0063] The system uses image capture devices to obtain vehicle information and entry time of vehicles entering the parking lot.

[0064] Image recognition can be used to obtain vehicle license plate information and gate opening time, thereby enabling the acquisition of vehicle information and entry time for vehicles entering the parking lot.

[0065] Multiple image acquisition devices can be used to monitor the direction of vehicles entering the site. Each image acquisition device can correspond to a road segment. Through image recognition, the movement of vehicles entering the site can be obtained in real time, which can be used for indoor navigation and positioning.

[0066] The processing module obtains the target area, which is the parking area with the shortest average time for vehicles to enter the parking space, based on the entry time.

[0067] See Figure 1 The parking lot can be divided into several parking areas. In this embodiment, the division is carried out by road segments, and each road segment is coded.

[0068] The target parking space is obtained based on the available spaces in the target area. The target parking space can be a randomly obtained vacant parking space in the target area, or it can be a parking space that is closest to the entrance or the exit. The specific location can be set by the user.

[0069] Generate a navigation path to the target berth.

[0070] The navigation route is sent to the communication terminal corresponding to the vehicle information.

[0071] After allocating parking spaces according to the above process, provide parking spaces to drivers based on the shortest route. To reduce the inconvenience of online real-time navigation and positioning errors, provide parking routes to drivers using a parking app or mini-program, or notify the mobile phone number corresponding to the license plate number via SMS. Specific methods can be found in [reference needed]. Figure 2 As shown.

[0072] Record the entry time of the vehicles entering the target parking space. The recorded entry time can be used as a training sample for big data analysis or artificial intelligence.

[0073] Specifically, the processing module is also used for:

[0074] Record the entry time of each vehicle into the parking space.

[0075] The average entry time for each parking area in each time period is obtained based on historical entry times.

[0076] The parking area with the shortest average entry time within the corresponding time period is selected as the target area.

[0077] Each time period can be subdivided into one hour, half an hour, ten minutes or five minutes. The average entry time of the entry time period in the past few days or months can be obtained, and the parking area with the shortest average entry time is selected as the target area.

[0078] This embodiment prioritizes the shortest average parking time when allocating parking spaces to characterize the congestion and parking convenience within the garage. The specific process includes two steps:

[0079] 1) Using video capture equipment, identify the entry and parking time of each vehicle and record historical data with time information;

[0080] 2) Divide the parking areas into zones and find the parking zone with the shortest historical average time.

[0081] In other embodiments, the processing module is further configured to:

[0082] Obtain the corresponding time slot based on the entry time;

[0083] For each parking area, the time taken to enter the parking area within the corresponding time period is obtained based on the historical entry time.

[0084] The average entry time for the corresponding time period is calculated based on the time consumed.

[0085] For all parking areas, the parking area with the shortest average entry time is selected as the target area.

[0086] Furthermore, the processing module is also used for:

[0087] Search for unoccupied berths with entry times.

[0088] Find parking areas with unoccupied parking spaces.

[0089] The corresponding time period is obtained with the entry time as the center.

[0090] The target area is obtained in a parking area where no parking space is occupied.

[0091] See Figure 1 As shown, parking spaces are marked as several areas from a to f. Within the same area, six adjacent parking spaces are marked (the size of the area and the number of parking spaces it covers can be adjusted according to the actual situation and the structure of the parking garage). Adjacent parking spaces use a unified passage for entry and exit, and the parking time and passage congestion are basically the same.

[0092] Taking region i as an example, we have i1~i 12 There are 12 parking spaces in total. For the unoccupied spaces, we can retrieve the historical parking time data for the 15 minutes before and after the current time point within the past 10 days (a total of half an hour) to calculate the average parking time t of a single parking space in area i within half an hour. i .

[0093] Specifically, the processing module is also used for:

[0094] The average entry time for the corresponding time period is calculated based on the time consumed.

[0095] Identify parking areas where the average entry time is less than a preset time.

[0096] The target area is selected as the parking area closest to the garage entrance or building entrance among parking areas where the average entry time is less than the preset time.

[0097] Each section of the parking lot is coded, and signs indicating the codes are placed at the intersections of the sections. The processing module is also used for:

[0098] Generate a navigation path to the target berth.

[0099] Generate road segment code information based on the navigation path.

[0100] The road segment code information is sent to the communication terminal corresponding to the vehicle information.

[0101] by Figure 1 Taking parking space f2 as an example, its navigation path is L0-L2-L 2-2 -L3.

[0102] When navigating a route, use intersection signs to guide drivers to the next turn and which lane to take. Figure 3 As shown.

[0103] The passageway allows for both left and right turns simultaneously, but at the end of the passageway, such as... Figure 1 As shown in L3, for ease of navigation, the turning principle is shortest path navigation. Therefore, at each intersection, only a single left turn or right turn needs to be marked in addition to straight-ahead traffic. For example, for Figure 1 In terms of parking space navigation (F2), the final L3 only shows a left turn, such as... Figure 4 As shown.

[0104] Furthermore, obtain all navigation options for the target berth;

[0105] For each navigation scheme, obtain all codes in the navigation scheme and obtain the parking areas adjacent to the codes;

[0106] Calculate the sum of the average entry times for adjacent parking areas for all codes of each navigation scheme;

[0107] The navigation path is the one that minimizes the sum of average entry times.

[0108] Generate road segment code information based on the navigation path.

[0109] The processing module is also used for:

[0110] Determine if the target berth is occupied. If so, determine if the occupying vehicle is the same vehicle as the one on the navigation path. If it is the same vehicle as the one on the navigation path, record the entry time of the vehicle into the target berth. If it is not the same vehicle as the one on the navigation path, repeat the step of obtaining the target area.

[0111] If a parking space is occupied during the process of a vehicle entering the parking space, and the occupied vehicle has a license plate number that is not assigned to it, the above steps will be repeated to allocate a parking space again.

[0112] Furthermore, the processing module is also used for:

[0113] Based on the shortest historical time taken for a vehicle to enter a parking space, determine whether the vehicle is the one corresponding to the navigation path. If it is the vehicle corresponding to the navigation path, record the entry time of the vehicle into the target parking space. If it is not the vehicle corresponding to the navigation path, repeat the step of obtaining the target area.

[0114] In other embodiments, the processing module is further configured to:

[0115] Based on the surveillance footage, determine whether the vehicle occupying the space is the same vehicle as the navigation path. If it is, record the entry time of the vehicle into the target parking space. If it is not the same vehicle as the navigation path, repeat the step of obtaining the target area.

[0116] See Figure 5Using the above-mentioned parking space allocation system, this embodiment also provides a parking space allocation method based on parking time and lane number, including:

[0117] Step 100: Obtain vehicle information and entry time of vehicles entering the parking lot;

[0118] Step 101: Obtain the target area, which is the parking area with the shortest average time for vehicles to enter the parking space based on the entry time.

[0119] Step 102: Obtain the target berth based on the available spaces in the target area;

[0120] Step 103: Generate the navigation path to the target berth;

[0121] Each section of the parking lot is coded, and signs indicating the codes are placed at the intersections of the sections.

[0122] Step 104: Generate road segment code information based on the navigation path;

[0123] Step 105: Send the road segment code information to the communication terminal corresponding to the vehicle information.

[0124] After allocating parking spaces according to the above process, provide parking spaces to drivers based on the shortest route. To reduce the inconvenience of online real-time navigation and positioning errors, provide parking routes to drivers using a parking app or mini-program, or notify the mobile phone number corresponding to the license plate number via SMS. Specific methods can be found in [reference needed]. Figure 2 As shown.

[0125] Step 106: Determine if the target berth is occupied. If yes, proceed to step 107; otherwise, proceed to step 106 again.

[0126] Step 107: Determine whether the vehicle occupying the route is the vehicle corresponding to the navigation route. If yes, proceed to step 108; otherwise, proceed to step 101.

[0127] Step 108: Record the entry time of the vehicle entering the target parking space.

[0128] If the vehicle corresponds to the navigation path, the entry time of the vehicle into the target parking space is recorded. If the vehicle does not correspond to the navigation path, the step of obtaining the target area is executed again.

[0129] The garage parking space allocation method includes:

[0130] Record the entry time of each vehicle into the parking space;

[0131] The average entry time for each parking area in each time period is obtained based on the historical entry time.

[0132] The above steps can be completed before step 100 in this embodiment, and historical data can be directly called for processing when step 100 is executed.

[0133] Step 101 specifically involves: obtaining the parking area with the shortest average entry time within the time period corresponding to the entry time as the target area.

[0134] See Figure 6 In other embodiments, step 101 includes:

[0135] Step 1011: Search for unoccupied berths for the entry time;

[0136] Step 1012: Obtain parking areas with unoccupied parking spaces;

[0137] Step 1013: Obtain the corresponding time period centered on the entry time;

[0138] In this embodiment, for parking spaces that are not currently occupied, historical parking time data for 15 minutes (30 minutes in total) before and after a specific time point within the past 10 days is retrieved to calculate the average parking time t for a single parking space in area i within that 30-minute period. i .

[0139] Step 1014: For each parking area, obtain the time taken to enter the parking area within the corresponding time period based on the historical entry time.

[0140] Step 1015: Calculate the average entry time for the corresponding time period of the parking area based on the time consumed;

[0141] Step 1016: Obtain the parking area with the shortest average entry time;

[0142] Step 1017: Determine if the number of parking areas with the shortest average entry time is unique. If so, proceed to step 1018; otherwise, proceed to step 1019.

[0143] Step 1018: Select the parking area with the shortest average entry time as the target area, and then proceed to step 102.

[0144] Step 1019: Select the parking area closest to the garage entrance or building entrance among the parking areas with the shortest average entry time as the target area, and then proceed to step 102.

[0145] In other embodiments, in the above process, step 1016 is replaced by obtaining parking areas with an average entry time of less than a preset duration;

[0146] Step 1017 is replaced by determining whether the number of parking areas with an average entry time less than the preset time is unique. If so, proceed to step 1018; otherwise, proceed to step 1019.

[0147] Step 1019 is replaced by selecting the parking area closest to the garage entrance or building entrance in the parking area with an average entry time of less than a preset time as the target area, and then step 102 is executed.

[0148] Further, step 104 includes:

[0149] Obtain all navigation options for the target berth;

[0150] For each navigation scheme, obtain all codes in the navigation scheme and obtain the parking areas adjacent to the codes;

[0151] Calculate the sum of the average entry times for adjacent parking areas for all codes of each navigation scheme;

[0152] The navigation path is the one that minimizes the sum of average entry times.

[0153] Generate road segment code information based on the navigation path.

[0154] Further, step 107 includes:

[0155] Based on the shortest historical time taken for a vehicle to enter a parking space, determine whether the vehicle is the one corresponding to the navigation path. If it is the vehicle corresponding to the navigation path, record the entry time of the vehicle into the target parking space. If it is not the vehicle corresponding to the navigation path, repeat the step of obtaining the target area.

[0156] In other embodiments, step 107 includes:

[0157] Based on the surveillance footage, determine whether the vehicle occupying the space is the same vehicle as the navigation path. If it is, record the entry time of the vehicle into the target parking space. If it is not the same vehicle as the navigation path, repeat the step of obtaining the target area.

[0158] This embodiment of the parking space allocation system and method based on parking time and lane number proposes a parking space allocation method based on parking time and a convenient navigation method. This invention avoids the situation where parking space-level navigation relies on real-time high-precision positioning and the installation of guidance equipment, which can greatly reduce the construction cost of smart parking garages.

[0159] While specific embodiments of the present invention have been described above, those skilled in the art should understand that these are merely illustrative examples, and the scope of protection of the present invention is defined by the appended claims. Those skilled in the art can make various changes or modifications to these embodiments without departing from the principles and essence of the present invention, but all such changes and modifications fall within the scope of protection of the present invention.

Claims

1. A parking space allocation method for a garage based on parking time and lane number, characterized in that, The garage parking space allocation method includes: Obtain vehicle information and entry time for vehicles entering the parking lot; Obtain the target area, which is the parking area with the shortest average time for vehicles to enter the parking space, based on the entry time. The acquisition of the target area includes: Search for unoccupied berths for entry time; Find parking areas with unoccupied parking spaces; Obtain the corresponding time slot based on the entry time; The target area is obtained in a parking area where no parking space is occupied; Obtain the corresponding time slot based on the entry time; For each parking area, the time taken to enter the parking area within the corresponding time period is obtained based on the historical entry time, and the average entry time of the parking area for the corresponding time period is calculated based on the time taken. For all parking areas, the parking area with the shortest average entry time is selected as the target area. Obtain the target berth based on the available spaces in the target area; Each segment of the parking lot is coded, and signs indicating the codes are placed at the intersections of the segments. The parking space allocation method includes: Generate a navigation path to the target berth; Generate road segment code information based on the navigation path; The road segment code information is sent to the communication terminal corresponding to the vehicle information. The navigation path is sent to the communication terminal corresponding to the vehicle information, and the entry time of the vehicle into the target parking space is recorded. Determine if the target berth is occupied. If so, determine if the occupying vehicle is the vehicle corresponding to the navigation path. If it is the vehicle corresponding to the navigation path, record the entry time of the vehicle entering the target berth. If it is not the vehicle corresponding to the navigation path, execute the step of obtaining the target area again. Record the entry time of each vehicle into the parking space; The average entry time for each parking area in each time period is obtained based on the historical entry time. The parking area with the shortest average entry time within the corresponding time period is selected as the target area.

2. The parking space allocation method for a garage as described in claim 1, characterized in that, The garage parking space allocation method includes: Calculate the average entry time for the corresponding time period in the parking area based on the time consumption; Identify parking areas where the average entry time is less than a preset duration; The target area is selected as the parking area closest to the garage entrance or building entrance among parking areas where the average entry time is less than the preset time.

3. The parking space allocation method for a garage as described in claim 1, characterized in that, The step of generating road segment coding information based on the navigation path includes: Obtain all navigation options for the target berth; For each navigation scheme, obtain all codes in the navigation scheme and obtain the parking areas adjacent to the codes; Calculate the sum of the average entry times for adjacent parking areas for all codes of each navigation scheme; The navigation path is the one that minimizes the sum of average entry times. Generate road segment code information based on the navigation path.

4. The parking space allocation method for a garage as described in claim 1, characterized in that, The garage parking space allocation method includes: Based on the shortest historical time taken for a vehicle to enter a parking space, determine if the occupied vehicle corresponds to the navigation path. If it does, record the entry time of the vehicle into the target parking space. If it does not correspond to the navigation path, repeat the step of obtaining the target area; or... Based on the surveillance footage, determine whether the vehicle occupying the space is the same vehicle as the navigation path. If it is, record the entry time of the vehicle into the target parking space. If it is not the same vehicle as the navigation path, repeat the step of obtaining the target area.

5. A parking space allocation system for a garage, characterized in that, The garage parking space allocation system is used to implement the garage parking space allocation method as described in any one of claims 1 to 4.

Images