Parking lot service system based on intelligent allocation
By setting thresholds in intelligently allocated parking lots and combining multi-module technology, intelligent allocation and route guidance for parking spaces are achieved, which solves the problem of difficulty in intelligent control when there are sufficient parking spaces, and improves the parking experience and overall utilization efficiency.
Patent Information
- Application Number
- CN202411236395.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-09-04
- Publication Date
- 2025-02-07
- Estimated Expiration
- 2044-09-04
AI Technical Summary
In the prior art, intelligently allocated parking lots are difficult to intelligently control when there are sufficient parking spaces, which makes it difficult for drivers to choose parking spaces freely, affecting the parking experience.
The operation of intelligent allocation is limited by setting corresponding thresholds, and combined with the vacancy identification module, allocation trigger module, route indication module and route optimization module, intelligent allocation and route guidance for parking spaces are realized.
While meeting driver parking needs, it reduces the intervention of intelligent allocation, improves driver's parking experience, optimizes the overall utilization efficiency of parking lots, and reduces system failure rate.
Smart Images

Figure CN118736886B_ABST
Abstract
Description
Technical Field
[0001] The invention relates to the technical field of traffic control, and in particular to a parking lot service system based on intelligent allocation. Background Art
[0002] Intelligent parking lot allocation is a modern parking management system that integrates advanced scientific and technological means. It uses Internet technology, communication technology, GPS positioning technology, GIS technology, Internet of Things technology and other advanced technologies to collect, manage and allocate urban parking spaces efficiently and intelligently. The system breaks the information isolation of traditional parking methods by updating parking space resource information in real time, and realizes the integrated service of real-time query, reservation and navigation of parking space resources.
[0003] The parking lot in the prior art can provide parking guidance for vehicles entering the lot so that they can park in the allocated parking spaces. For example, the vehicle monitoring method, device, system and server for the parking lot disclosed in China Publication No. CN113053154B can accurately plan and navigate the parking spaces of vehicles. However, since the intelligent allocation process is ongoing, each vehicle entering the parking lot needs to park in the designated parking space according to the instructions. This makes it difficult for drivers to freely choose their favorite parking spaces when there are surplus parking spaces in the parking lot, affecting the parking experience. Summary of the invention
[0004] In view of the above-mentioned shortcomings of the prior art, the present invention provides a parking lot service system based on intelligent allocation, which can effectively solve the problem in the prior art that it is difficult to intelligently control the process of intelligent allocation of parking spaces in the parking lot.
[0005] To achieve the above objectives, the present invention is implemented through the following technical solutions:
[0006] The present invention provides a parking service system based on intelligent allocation, which at least includes: a plurality of parking spaces, a plurality of direction signs arranged at the intersections of the parking lot, a plurality of direction indicator lights on the direction signs, and also includes: a vacancy recognition module, an allocation trigger module, a route indication module and a route optimization module;
[0007] The vacancy recognition module divides the parking lot into multiple parking areas, identifies whether there are vehicles parked in the parking spaces and marks the parking spaces as parked or unparked;
[0008] The allocation trigger module includes an occupancy analysis unit and a time analysis unit. The occupancy analysis unit is used to obtain an occupancy reference value reflecting the utilization rate of the parking space, and the time analysis unit is used to obtain a time reference value reflecting the parking time situation. The corresponding thresholds are set respectively. When any value of the occupancy reference value or the time reference value is greater than its corresponding threshold, an intelligent allocation instruction is generated and executed to intelligently allocate the subsequent vehicles entering the parking lot.
[0009] The route indication module includes a route planning unit and a route indication unit. After receiving the intelligent allocation instruction, the route planning unit designates a parking space with an unparked state for all vehicles that subsequently enter the parking lot and plans a route. The route indication unit controls the direction indicator on the direction indicator sign to light up according to the planned route corresponding to the vehicle, providing route directions for the vehicle.
[0010] The route optimization module compares and analyzes the optimal routes of all subsequent vehicles entering the parking lot according to the time interval between two vehicles entering the parking lot at adjacent time points, optimizes and analyzes their routes to obtain their best routes, and the route indication unit indicates the parking route to the vehicle using the best route.
[0011] Furthermore, the vacant space recognition module divides the parking lot into multiple parking areas, each parking area includes multiple parking spaces. The vacant space recognition module is provided with a first high-definition camera above each parking area to obtain a high-definition image of each parking space and record it as a high-definition parking space map. The center and four corners of each parking space are provided with a reflective coating and recorded as identification points. The number of reflective points in the high-definition parking space map is obtained. When the number of reflective points is greater than or equal to 3, the parking space status is marked as unparked, otherwise, the parking space status is marked as parked.
[0012] Furthermore, the occupancy analysis unit obtains the total number of parking spaces in the parking lot as the total number of parking spaces, obtains the total number of parking spaces in the parked state as the total number of occupied spaces, divides the total number of occupied spaces by the total number of parking spaces as the total occupancy rate UR, labels all parking areas in the order of 1, 2, 3...h, obtains the number of parking spaces in each parking area as the area number Obtain the total number of parking spaces in each parking area and record it as the area occupancy number , where g represents the number of the parking space, through the formula Calculate the area occupancy rate UD and set an area occupancy threshold , When the area occupancy rate of a parking area is greater than the area occupancy threshold and less than 1, the parking area is recorded as an underutilized area, and the number of underutilized areas is recorded as , substitute into the formula Calculate the area utilization ratio UH and substitute the area utilization ratio UH and the total occupancy rate UR into the formula Calculate the occupancy reference value .
[0013] Furthermore, the time analysis unit tracks and analyzes each vehicle entering the parking lot separately, records the tracked and analyzed vehicle as the target vehicle, obtains the time when the target vehicle enters the parking lot as the entry time, records the parking time of the target vehicle when the first high-definition camera detects that the target vehicle is located in any parking space and the state of the parking space is switched to parked, and records the parking space where the target vehicle is parked as the target parking space. The time difference between the parking time and the entry time is calculated and recorded as the parking time t, and the path distance s between the target parking space and the entrance when the target vehicle enters the parking lot is obtained and substituted into the formula Calculate and obtain the first parking parameter A plurality of second high-definition cameras are arranged along the passage at the top of the parking lot. The target vehicle is tracked by the second high-definition camera, the target vehicle's moving trajectory is drawn, and the total length of the overlapping part in the moving trajectory is calculated and recorded as the second parking parameter. , substitute the first parking parameter and the second parking parameter into the formula Calculate the time reference value , where k is the preset weight coefficient.
[0014] Furthermore, set a command storage duration , when both the occupancy reference value and the time reference value are less than their corresponding thresholds, an intelligent allocation release instruction is generated and temporarily stored. The time when the intelligent allocation release instruction is generated is , if in the time range if in the time range to If no intelligent allocation instruction is generated, the intelligent allocation release instruction is executed; otherwise, the intelligent allocation release instruction is cleared until the next intelligent allocation release instruction is generated. Furthermore, the route planning unit records the vehicle that needs to plan the route as a to-be-allocated vehicle, determines the current position and the direction of the vehicle's front through a second high-definition camera, sets a plurality of range thresholds that increase in sequence, draws a circle with the current position of the to-be-allocated vehicle as the center and the selected range threshold as the radius, obtains all parking spaces within the circular range that are not parked and records them as to-be-determined parking spaces, selects range thresholds from small to large until the number of to-be-determined parking spaces is greater than or equal to one, and plans a direct route with the current position of the to-be-allocated vehicle as the starting point and the to-be-determined parking space as the end point, obtains a plurality of direct routes, and obtains the distance value of the direct route. , get the number of turns required in the direct route and record it as the direction adjustment value , substitute into the formula Calculate in and get the route recommendation value Tj, where They are all preset weight coefficients, and the direct route with the largest route recommendation value is taken as the optimal route.
[0015] Furthermore, the route indication unit obtains and records all direction indication signs on the optimal route as route indication signs, controls the route indication sign located in front of and closest to the vehicle to be assigned, and guides the direction of the vehicle to be assigned by controlling different direction indicator lights to light up.
[0016] Furthermore, the route optimization module obtains the entry time of the vehicles to be assigned, and numbers the vehicles to be assigned in the order of their entry time. , calculate the number of adjacent vehicles to be assigned and The time interval between the vehicles entering the site is recorded as the vehicle to be assigned Approach interval , set an interval time threshold T, , when the approach interval When the interval is greater than the threshold, the optimal route is used as the best route. When the interval time is less than or equal to the threshold, the assigned vehicle The optimal route is redistributed to obtain the optimal route. The allocation process is as follows:
[0017] Get the vehicle to be assigned The best route is recorded as ZJ, and the vehicle to be assigned is obtained. All direct routes and the corresponding route recommendation values are sorted by the size of the route recommendation values. ,in Indicates the route with the highest recommendation value, in the order of 1, 2, ..., j. Coincidence with ZJ Calculation, the calculation formula is ,in Indicates direct route The length of the overlap with the optimal route ZJ, Indicates direct route The total length of the journey is calculated, and a coincidence threshold is preset. The direct route with the smallest subscript among all direct routes with a coincidence degree less than the coincidence threshold is selected as the best route.
[0018] Compared with the known prior art, the technical solution provided by the present invention has the following beneficial effects:
[0019] 1. The present invention limits the operation of intelligent allocation by setting corresponding thresholds, so that the intelligent allocation of parking spaces can be started under certain trigger conditions, making the working logic of intelligent allocation more flexible. Compared with direct intervention operation, it can limit the operation when there are sufficient parking spaces in the parking lot, allowing drivers to freely choose parking spaces, thereby improving the driver's parking experience. The intervention of intelligent allocation is reduced while meeting the driver's parking needs as much as possible. When the occupancy reference value and the time reference value are greater than the corresponding thresholds, the intelligent allocation is started to provide the driver with parking directions, which helps to improve the driver's parking experience and increase the driver's user stickiness to the parking lot.
[0020] 2. The present invention temporarily stores the intelligent allocation release instructions by setting the instruction temporary storage duration, optimizes the critical relationship between the release and triggering of intelligent allocation, avoids repeated triggering and release of intelligent allocation in a short period of time, reduces the number of instruction generation times, and thus reduces the system failure rate.
[0021] 3. The route planning unit of the present invention can allocate a suitable parking space for the vehicle to be assigned and plan a direct route for it accordingly. According to the route recommendation values of different direct routes, it can help the system determine and select the most suitable route among the direct routes, thereby reducing the parking distance and the number of turns, reducing the time required to reach the parking space, and reducing the probability of risks caused by obstructed vision when turning. At the same time, the route indication unit can guide the vehicle to be assigned to park in the selected undetermined parking space along the optimal route, reducing the time required for the driver to find a parking space, helping to optimize the driver's parking experience, and improving the overall utilization efficiency of the parking lot.
[0022] 4. The route optimization module controls the switching of parking routes of vehicles entering the parking lot at adjacent time points, so that the routes of two adjacent vehicles entering the parking lot are staggered as much as possible, and the routes of two adjacent vehicles are avoided from overlapping excessively, thereby reducing the waiting time required for vehicle parking, thereby improving parking efficiency and reducing road congestion in the parking lot. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the prior art descriptions are briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0024] Figure 1 It is the overall module block diagram of the present invention. DETAILED DESCRIPTION
[0025] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0026] The present invention will be further described below in conjunction with the embodiments.
[0027] See also Figure 1 The parking lot service system based on intelligent allocation at least includes: a plurality of numbered parking spaces, a plurality of direction signs arranged at the intersections of the parking lot, a plurality of direction indicator lights on the direction signs, and different direction indicators indicate different path directions. The direction of the vehicle is guided by controlling the direction indicator lights on the direction signs. The system also includes a vacancy recognition module, an allocation trigger module, a route indication module and a route optimization module.
[0028] The vacant space recognition module is used to identify whether there is a vehicle parked in the parking space and mark the parking space as parked or not parked. The vacant space recognition module divides the parking lot into multiple parking areas, each of which is provided with multiple parking spaces. The vacant space recognition module is located above each parking area and is provided with a first high-definition camera for obtaining a high-definition image of each parking space as a high-definition parking space map. A reflective coating (the color of the reflective coating is different from the color of the ground) is provided at the center and four corners of each parking space and is recorded as identification points. The high-definition parking space map is subjected to image analysis to obtain the number of reflective points in the high-definition parking space map. When the number of reflective points is greater than or equal to 3, the parking space status is marked as not parked, otherwise, the parking space status is marked as parked.
[0029] The allocation trigger module includes an occupancy analysis unit and a time analysis unit. The occupancy analysis unit is used to obtain an occupancy reference value reflecting the utilization rate of parking spaces (parked parking spaces divided by unparked parking spaces). The larger the occupancy reference value, the higher the utilization rate of the parking spaces in the parking lot. The time analysis unit is used to obtain a time reference value reflecting the parking time situation. The larger the time reference value, the longer the average parking time. Corresponding thresholds are set for the occupancy reference value and the time reference value respectively. When any one of the occupancy reference value or the time reference value is greater than its corresponding threshold, an intelligent allocation instruction is generated and executed, and subsequent vehicles entering the parking lot are intelligently allocated so that they can park in the allocated parking spaces.
[0030] By setting corresponding thresholds to limit the operation of intelligent allocation, the intelligent allocation of parking spaces can be started under certain trigger conditions, making the working logic of intelligent allocation more flexible. Compared with direct intervention, it can limit the operation when there are sufficient parking spaces in the parking lot, allowing drivers to freely choose parking spaces, thereby improving the driver's parking experience and minimizing the intervention of intelligent allocation while meeting the driver's parking needs.
[0031] The occupancy analysis unit obtains the total number of parking spaces in the parking lot and records it as the total number of parking spaces. The total number of parking spaces in the parked state is obtained and recorded as the total number of occupancy. The total number of occupancy is divided by the total number of parking spaces and recorded as the total occupancy rate UR. All parking areas are numbered in the order of 1, 2, 3...h, and the number of parking spaces in each parking area is obtained and recorded as the area number. , obtain the total number of parking spaces in each parking area and record it as the area occupancy number , where g represents the number of the parking space, through the formula Calculate the area occupancy rate UD and set an area occupancy threshold , When the area occupancy rate of a parking area is greater than the area occupancy threshold and less than 1, the parking area is recorded as an underutilized area, and the number of underutilized areas is recorded as , substitute into the formula Calculate the area utilization ratio UH and substitute the area utilization ratio UH and the total occupancy rate UR into the formula Calculate the occupancy reference value .
[0032] It should be noted that the occupancy reference value can indirectly reflect the overall utilization rate of parking spaces in the parking lot. When most of the parking spaces are occupied (in this case, the vacant parking spaces are scattered in various corners of the parking lot and are not easy to find) or there are a large number of underutilized areas (in this case, parking spaces in some parking areas are not full and the vacant parking spaces are blocked by vehicles, making it difficult for drivers to find vacant parking spaces), the occupancy reference value will increase accordingly, which will further make it difficult for drivers to find parking spaces. Therefore, when the occupancy reference value is greater than a certain threshold, starting intelligent allocation to provide parking directions for the driver will help improve the driver's parking experience and increase the driver's user stickiness to the parking lot.
[0033] The time analysis unit tracks and analyzes each vehicle entering the parking lot separately, records the tracked and analyzed vehicle as the target vehicle, obtains the time when the target vehicle enters the parking lot as the entry time, records the parking time of the target vehicle when the first high-definition camera detects that the target vehicle is located in any parking space and the status of the parking space is switched to parked, and records the parking space where the target vehicle is parked as the target parking space. The time difference between the parking time and the entry time is calculated and recorded as the parking time t, obtains the path distance s (non-straight-line distance) between the target parking space and the entrance when the target vehicle enters the parking lot, and substitutes it into the formula Calculate and obtain the first parking parameter , a plurality of second high-definition cameras are set up along the passage at the top of the parking lot. The target vehicle is tracked by the second high-definition camera, the target vehicle's trajectory is drawn, and the total length of the overlapping part of the trajectory (when the target vehicle repeatedly passes through the same section, the trajectory will overlap) is calculated and recorded as the second parking parameter , substitute the first parking parameter and the second parking parameter into the formula Calculate the time reference value , where k is the preset weight coefficient.
[0034] It should be noted that the first parking parameter reflects the time required for the target vehicle to travel a unit distance. The larger the first parking parameter is, the longer the unit time it takes for the target vehicle to find a parking space, which means that the parking process is more time-consuming and laborious. The second parking parameter reflects the total length of the route that the target vehicle repeatedly passes through during the parking process. The larger the second parking parameter is, the greater the difference between the actual path passed through during the parking process and the direct path. Therefore, the larger the time reference value calculated by combining the first parking parameter and the second parking parameter, the greater the cost paid by the driver in the process of finding a parking space, which means that the driver's experience in the process of finding a parking space by himself is worse. The time reference value can help staff determine whether to start the intelligent allocation system to optimize parking efficiency, which helps to improve the parking experience.
[0035] Furthermore, set a command storage duration , when both the occupancy reference value and the time reference value are less than their corresponding thresholds, an intelligent allocation release instruction is generated and temporarily stored. Suppose the time when the intelligent allocation release instruction is generated is If in the time range to If no intelligent allocation instruction is generated during the period, the intelligent allocation release instruction will be executed to stop the intelligent allocation of subsequent vehicles entering the parking lot (the change of parking space occupancy rate in the parking lot is correlated with time. The decrease of parking space occupancy rate in the same parking lot is generally concentrated in the same time period. For example, the occupancy rate of parking lots in office buildings generally decreases rapidly during the off-get off work period). On the contrary, if the parking lot is within the time range to If an intelligent allocation instruction is generated during the period, the intelligent allocation release instruction is cleared until the next intelligent allocation release instruction is generated, and the above process is repeated.
[0036] By setting the instruction temporary storage duration, the intelligent allocation release instruction is temporarily stored, the critical relationship between the release and triggering of intelligent allocation is optimized, and repeated triggering and release of intelligent allocation in a short period of time is avoided, the number of instruction generation is reduced, and the system failure rate is reduced.
[0037] The route indication module includes a route planning unit and a route indication unit. After receiving the intelligent allocation instruction, the route planning unit designates a parking space with an unparked status for all vehicles that subsequently enter the parking lot (including vehicles that are already in the parking lot after the instruction is generated) and plans a route. The route indication unit controls the direction indicator light on the direction sign according to the planned route corresponding to the car to light up, providing route directions for the car.
[0038] The route planning unit records the vehicle that needs to plan the route as a to-be-assigned vehicle, determines the current position and the direction of the front of the vehicle to be assigned through the second high-definition camera, sets multiple range thresholds that increase in sequence, draws a circle with the current position of the vehicle to be assigned as the center and the selected range threshold as the radius, obtains all parking spaces within the circular range that are not parked and records them as to-be-determined parking spaces, selects range thresholds in sequence from small to large until the number of to-be-determined parking spaces is greater than or equal to one, and plans a direct route with the current position of the vehicle to be assigned as the starting point and the to-be-determined parking space as the end point (through the existing map route planning technology, based on the road map in the parking lot, the optimal route between two points can be intelligently planned), obtains multiple direct routes (the number of direct routes is greater than or equal to one), and obtains the distance value of the direct route. , get the number of turns required in the direct route and record it as the direction adjustment value , substitute into the formula Calculate in and get the route recommendation value Tj, where They are all preset weight coefficients. The direct route with the largest route recommendation value is taken as the optimal route, and other direct routes are taken as alternative routes.
[0039] It should be noted that route planning can allocate a suitable parking space to the vehicle to be assigned and plan a direct route for it accordingly. According to the route recommendation values of different direct routes, the system can determine and select the most suitable route among the direct routes, thereby reducing the parking distance and the number of turns, reducing the time required to reach the parking space, and at the same time reducing the probability of risks caused by obstructed vision when turning.
[0040] The route indication unit obtains and records all the direction signs on the optimal route as route indication signs, controls the route indication sign that is located in front of the front of the vehicle to be assigned and is closest to it, and guides the vehicle to be assigned by controlling different direction indicator lights to light up, thereby guiding the vehicle to be assigned to park in the selected pending parking space along the optimal route, reducing the time required for the driver to find a parking space, helping to optimize the driver's parking experience, and improving the overall utilization efficiency of the parking lot.
[0041] The route optimization module compares and analyzes the optimal routes of multiple vehicles to be assigned, further optimizes the routes of the vehicles to be assigned to obtain their best routes, reduces the overlap rate of the best routes between different vehicles to be assigned, avoids route overlap during parking, and affects the parking process and traffic efficiency, and further improves the parking experience.
[0042] Get the entry time of the vehicles to be assigned, and number them according to the order of their entry time. , calculate the number of adjacent vehicles to be assigned and The time interval between the vehicles entering the site is recorded as the vehicle to be assigned Approach interval , set an interval time threshold T ( ), when the approach interval When the interval time is greater than the threshold, the optimal route is used as the best route (when the approach interval time is long, the parking process of the front vehicle and the rear vehicle generally does not affect each other). When the interval time is less than or equal to the threshold, the assigned vehicle The optimal route is redistributed to obtain the optimal route. The allocation process is as follows:
[0043] Get the vehicle to be assigned The best route is recorded as ZJ, and the vehicle to be assigned is obtained. All direct routes and the corresponding route recommendation values are sorted by the size of the route recommendation values. ,in Indicates the route with the highest recommendation value, in the order of 1, 2, ..., j. Coincidence with ZJ Calculation, the calculation formula is ,in Indicates direct route The length of the overlap with the optimal route ZJ, Indicates direct route The total length of the journey is preset with an overlap threshold, and the direct route with the smallest subscript (serial number) among all direct routes with an overlap less than the overlap threshold is selected as the optimal route. The route indication unit indicates the vehicle that needs to stop with the optimal route.
[0044] By controlling and switching the parking routes of vehicles entering the parking lot at adjacent time points, the routes of two vehicles can be staggered as much as possible, and excessive overlap of the routes of two adjacent vehicles can be avoided as much as possible, thereby reducing the waiting time required for vehicle parking, thereby improving parking efficiency and reducing road congestion in the parking lot.
[0045] The above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit it. Although the present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that they can still modify the technical solutions described in the aforementioned embodiments, or make equivalent replacements for some of the technical features therein. However, these modifications or replacements will not cause the essence of the corresponding technical solutions to deviate from the protection scope of the technical solutions of the embodiments of the present invention.
Claims
1. A parking lot service system based on intelligent allocation, comprising a plurality of parking spaces, a plurality of direction signs arranged at the intersections of the parking lot, and a plurality of direction indicator lights on the direction signs, characterized in that: Also includes: A vacancy identification module, an allocation trigger module, a route indication module, and a route optimization module; The vacancy recognition module divides the parking lot into multiple parking areas, identifies whether there are vehicles parked in the parking spaces and marks the parking spaces as parked or unparked; The vacant space recognition module divides the parking lot into a plurality of parking areas, each of which contains a plurality of parking spaces. The vacant space recognition module is provided with a first high-definition camera above each parking area, and obtains a high-definition image of each parking space as a parking space high-definition map. The center and four corners of each parking space are provided with a reflective coating and recorded as identification points. The number of reflective points in the parking space high-definition map is obtained. When the number of reflective points is greater than or equal to 3, the parking space status is marked as unparked, otherwise, the parking space status is marked as parked; The allocation trigger module includes an occupancy analysis unit and a time analysis unit. The occupancy analysis unit is used to obtain an occupancy reference value reflecting the utilization rate of the parking space, and the time analysis unit is used to obtain a time reference value reflecting the parking time situation. The corresponding thresholds are set respectively. When any value of the occupancy reference value or the time reference value is greater than its corresponding threshold, an intelligent allocation instruction is generated and executed to intelligently allocate the subsequent vehicles entering the parking lot. The time analysis unit tracks and analyzes each vehicle entering the parking lot separately, records the tracked and analyzed vehicle as the target vehicle, obtains the time when the target vehicle enters the parking lot as the entry time, records the parking time of the target vehicle when the first high-definition camera detects that the target vehicle is located in any parking space and the state of the parking space is switched to parked, and records the parking space where the target vehicle is parked as the target parking space. The time difference between the parking time and the entry time is calculated and recorded as the parking time t, obtains the path distance s between the target parking space and the entrance when the target vehicle enters the parking lot, and substitutes it into the formula Calculate and obtain the first parking parameter A plurality of second high-definition cameras are arranged along the passage at the top of the parking lot. The target vehicle is tracked by the second high-definition camera, the target vehicle's moving trajectory is drawn, and the total length of the overlapping part in the moving trajectory is calculated and recorded as the second parking parameter. , substitute the first parking parameter and the second parking parameter into the formula Calculate the time reference value , where k is the preset weight coefficient; Set a command storage duration , when both the occupancy reference value and the time reference value are less than their corresponding thresholds, an intelligent allocation release instruction is generated and temporarily stored. The time when the intelligent allocation release instruction is generated is If in the time range to If no intelligent allocation instruction is generated during the period, the intelligent allocation release instruction is executed; otherwise, the intelligent allocation release instruction is cleared until the next intelligent allocation release instruction is generated; The route indication module includes a route planning unit and a route indication unit. After receiving the intelligent allocation instruction, the route planning unit designates a parking space with an unparked state for all vehicles that subsequently enter the parking lot and plans a route. The route indication unit controls the direction indicator on the direction indicator sign to light up according to the planned route corresponding to the vehicle, providing route directions for the vehicle. The route planning unit records the vehicle that needs to plan the route as a to-be-allocated vehicle, determines the current position and the front direction of the to-be-allocated vehicle through a second high-definition camera, sets a plurality of range thresholds that increase in sequence, draws a circle with the current position of the to-be-allocated vehicle as the center and the selected range threshold as the radius, obtains all parking spaces in the circular range that are not parked and records them as to-be-determined parking spaces, selects range thresholds in sequence from small to large until the number of to-be-determined parking spaces is greater than or equal to one, plans a direct route with the current position of the to-be-allocated vehicle as the starting point and the to-be-determined parking space as the end point, obtains a plurality of direct routes, and obtains distance values of the direct routes , get the number of turns required in the direct route and record it as the direction adjustment value , substitute into the formula Calculate in and get the route recommendation value Tj, where All of them are preset weight coefficients, and the direct route with the largest route recommendation value is taken as the optimal route; The route indication unit obtains and records all direction indication signs on the optimal route as route indication signs, controls the route indication sign located in front of the vehicle to be assigned and closest to it, and guides the direction of the vehicle to be assigned by controlling different direction indicator lights to light up; The route optimization module compares and analyzes the optimal routes of all vehicles that subsequently enter the parking lot according to the time interval between two vehicles that enter the parking lot at adjacent time points, optimizes and analyzes their routes to obtain their optimal routes, and the route indication unit indicates the parking route to the vehicle using the optimal route; The route optimization module obtains the arrival time of the vehicles to be assigned, and labels the vehicles to be assigned in the order of their arrival time. , calculate the number of adjacent vehicles to be assigned and The time interval between the vehicles entering the site is recorded as the vehicle to be assigned Approach interval Set an interval time threshold T, , when the approach interval When the interval is greater than the threshold, the optimal route is used as the best route. When the interval time is less than or equal to the threshold, the assigned vehicle The optimal route is redistributed to obtain the optimal route. The allocation process is as follows: Get the vehicle to be assigned The best route is recorded as ZJ, and the vehicle to be assigned is obtained. All direct routes and the corresponding route recommendation values are sorted by the size of the route recommendation values. ,in Indicates the route with the highest recommendation value, in the order of 1, 2, ..., j. Coincidence with ZJ Calculation, the calculation formula is ,in Indicates direct route The length of the overlap with the optimal route ZJ, Indicates direct route The total length of the journey is calculated, and a coincidence threshold is preset. The direct route with the smallest subscript among all direct routes with a coincidence degree less than the coincidence threshold is selected as the best route.
2. The parking lot service system based on intelligent allocation according to claim 1 is characterized in that: The occupancy analysis unit obtains the total number of parking spaces in the parking lot as the total number of parking spaces, obtains the total number of parking spaces in the parked state as the total number of occupied spaces, divides the total number of occupied spaces by the total number of parking spaces as the total occupancy rate UR, labels all parking areas in the order of 1, 2, 3...h, obtains the number of parking spaces in each parking area as the area number , obtain the total number of parking spaces in each parking area and record it as the area occupancy number , where g represents the number of the parking space, through the formula Calculate the area occupancy rate UD and set an area occupancy threshold , When the area occupancy rate of a parking area is greater than the area occupancy threshold and less than 1, the parking area is recorded as an underutilized area, and the number of underutilized areas is recorded as , substitute into the formula Calculate the area utilization ratio UH and substitute the area utilization ratio UH and the total occupancy rate UR into the formula Calculate the occupancy reference value .
Citation Information
Patent Citations
Parking lot vehicle monitoring methods, devices, systems and servers
CN113053154B
Management system based on multi-source information
CN118314756A