Park construction intelligent management system and method
By calculating the congestion coefficient through real-time monitoring of vehicle exit image sequences, adjusting the radius of the undetermined area, and optimizing the vehicle exit route, the problem of low efficiency caused by users choosing congested exits is solved, and the efficiency of vehicles leaving the park is improved.
Patent Information
- Application Number
- CN202411392144.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-10-08
- Publication Date
- 2025-01-14
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Users' habitual choice of exit without knowing the queue at the vehicle exit may lead to inefficient vehicle exit from the park.
By monitoring real-time image sequences of vehicle exits, the congestion coefficient is calculated, the radius of the waiting area is adjusted, and vehicles are reminded to choose the optimal exit.
This improved the efficiency of vehicles leaving the park and reduced waiting time caused by choosing crowded exits.
Smart Images

Figure CN119314104A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of park management, and in particular to a smart management system and method for park construction. Background Art
[0002] In recent years, effective park management has become an important means to promote the healthy development of the park. With the continuous development of the park, the traditional management method has become less and less adapted to the needs of the rapid development of the park. The construction of a smart park is not only the inevitable result of the development of science and technology, but also the informatization, intelligence and wisdom have brought significant progress in the management of the park. Based on the perspective of park management and operation and providing high-quality services to enterprises in the park, park enterprises provide high-quality park services through advanced scientific and technological products.
[0003] With the rapid development of smart parks, more and more large-scale industrial parks or office parks have begun to implement intelligent management to improve the intelligence level of the entire smart park. Usually, smart parks will carry out in-depth management in terms of equipment, personnel, environmental protection, etc., but there are still deficiencies in the exit scheduling of vehicles leaving the park. For example, large office parks usually have several vehicle exits to facilitate the rapid entry and exit of vehicles. During the rush hour, there are many vehicles leaving the park. Users will choose the corresponding vehicle exit according to their habits without knowing which exits have fewer vehicles in line. However, since users are not clear about the vehicle queue situation at the vehicle exit, the vehicle exit that users are accustomed to choosing may have more vehicles in line, resulting in lower efficiency for users' vehicles to leave the park. Summary of the invention
[0004] The purpose of the present invention is to provide a smart management system and method for park construction to solve the following technical problems: When users do not know which exits have fewer queues, they will choose the corresponding vehicle exit according to their habits; however, since users are not clear about the vehicle queue situation at the vehicle exit, the vehicle exit that users are accustomed to choosing may have more vehicles queued, resulting in lower efficiency for users' vehicles to leave the park.
[0005] The purpose of the present invention can be achieved through the following technical solutions: A method for intelligent management of park construction includes the following steps: S1, obtain the position of each vehicle exit in the target park, set the monitoring period T to collect monitoring images at the vehicle exit in real time and generate a monitoring image sequence, identify the number of vehicles in any monitoring image and generate a curve A(t) of the number of vehicles changing with time, obtain the curve A(t) of the number of vehicles changing with time at each vehicle exit within the monitoring period T, and generate a vehicle quantity list A=(A1, A2, ..., Ai, ..., An), i=1, 2, ..., n; wherein Ai is the curve of the number of vehicles changing with time corresponding to the i-th vehicle exit, and n is the number of vehicle exits in the target park; identify the average vehicle moving speed of any vehicle exit according to the monitoring image sequence, and calculate the congestion coefficient of any vehicle exit by combining the average vehicle moving speed and the vehicle number change curve; S2, taking any vehicle exit position as the center and drawing a circle with a preset radius to determine the pending area; synchronously adjusting the radius of all pending areas until the pending area completely covers the target park, and taking the adjusted radius of the pending area as the pending radius r; S3, correcting the pending radius r of the pending area by the congestion coefficient, obtaining the corrected pending area for each vehicle exit, obtaining the target vehicle of the pending area corresponding to any vehicle exit, and reminding the target vehicles to exit from the vehicle exits corresponding to their respective pending areas.
[0006] As a further solution of the present invention: a vehicle leaving the target park parking lot is marked as a target vehicle.
[0007] As a further solution of the present invention: in S2, the calculation process of the crowding coefficient is: S11, obtain the monitoring image sequence corresponding to any vehicle exit position monitoring period T, perform grayscale processing on the monitoring image in turn according to the monitoring image sequence to obtain the monitoring grayscale image, establish a rectangular coordinate system with the central pixel point of the monitoring grayscale image as the origin, generate the coordinates (x, y) of all pixels in the monitoring grayscale image, and identify the grayscale values Pi (x, y) of all pixels in the monitoring grayscale image, i = 1, ..., n, i represents the order of the monitoring grayscale image where the pixel is located in the sequence, and use the grayscale difference formula D = |Pi+1 (x, y)-Pi (x, y)|Calculate the grayscale difference D of the pixels at the same position between adjacent monitoring grayscale images. If D is greater than a preset threshold, it indicates that the corresponding pixel is a vehicle pixel. If D is less than or equal to the preset threshold, it indicates that the corresponding pixel is a road area pixel. S12, merge adjacent vehicle pixels, and circumscribe a minimum circumscribed rectangle around the merged vehicle pixel area to obtain a pixel rectangle of any vehicle in the monitoring grayscale image, extract the pixel rectangle corresponding to any target vehicle, select the midpoint pixel of the rectangle from the pixel rectangle and mark it as a reference point, extract the real-time monitoring image sequence of the target vehicle within the observation time T, select the position information of the reference point in each frame of the monitoring image in the monitoring image sequence, and calculate the average speed of the target vehicle in each frame of the monitoring image according to the position change between adjacent frames and mark it as V, use the average speed V as the vehicle speed of the target vehicle, and calculate according to the calculation formula , where N is the total number of vehicles and Vi is the average speed of any vehicle; the average vehicle moving speed at the vehicle exit is calculated; S13, according to the calculation formula , where t∈[0, T], the congestion coefficient C of the vehicle exit is calculated. As a further solution of the present invention: in S3, the specific process of the area to be determined is: Obtain the congestion coefficients of all vehicle exits and perform normalization processing to obtain the normalized congestion coefficient C'; calculate the undetermined radius correction coefficient k=γ / C', where γ is a preset correction constant; calculate the standard radius of the vehicle exit Rj=kj*r, where Rj represents the undetermined radius of the j-th vehicle exit, and kj represents the undetermined radius correction coefficient of the j-th vehicle exit.
[0008] As a further solution of the present invention: when there are two or more overlapping areas to be determined, the vehicle exit corresponding to the overlapping part is marked as a pending exit, the distance from any target vehicle in the overlapping part to all the pending exits is obtained and the minimum value is obtained, and the pending exit corresponding to the minimum value is used as the exit of the target vehicle.
[0009] As a further solution of the present invention: if there are two or more distances that are the same and are all minimum values, the vehicle exit with the least congestion is selected as the exit for the target vehicle.
[0010] As a further solution of the present invention: all target vehicles outside the to-be-determined area are obtained, any target vehicle is selected and alternative routes from the target vehicle to all lane exits are constructed and marked as D1, D2, ..., Dm, where m is greater than or equal to n, the evaluation score of any alternative route is calculated and the vehicle exit corresponding to the alternative route with the smallest evaluation score is selected as the exit of the target vehicle; The specific calculation process of the evaluation score is as follows: Select any alternative route and determine the vehicle exit corresponding to the alternative route, obtain the number of all target vehicles M in the to-be-determined area corresponding to the vehicle exit and the number of vehicles N corresponding to the current vehicle exit, and calculate the evaluation score F corresponding to any alternative route according to the calculation formula F=C*N+α*(MN)*C+D / C, where D is the distance value from the target vehicle to the vehicle exit corresponding to the alternative route, and α is the preset correction coefficient.
[0011] As a further solution of the present invention: it also includes obtaining feedback information of all target vehicles outside the to-be-determined area, and if the target vehicle chooses a predetermined alternative route, obtaining the driving information re-reported by the vehicle and updating the park road exit information according to the driving information. A park construction intelligent management system, comprising: The data acquisition module is used to obtain the position of each vehicle exit in the target park, and set the monitoring period T to collect monitoring images at the vehicle exit in real time and generate a monitoring image sequence, identify the number of vehicles in any monitoring image and generate a curve A(t) of the change of the number of vehicles over time, obtain the curve A(t) of the change of the number of vehicles over time at each vehicle exit in the monitoring period T, and generate a vehicle quantity list A=(A1, A2, ..., Ai, ..., An), i=1, 2, ..., n; wherein Ai is the curve of the change of the number of vehicles corresponding to the i-th vehicle exit over time, and n is the number of vehicle exits in the target park; the average vehicle moving speed of any vehicle exit is identified according to the monitoring image sequence, and the congestion coefficient of any vehicle exit is calculated by combining the average vehicle moving speed and the vehicle number change curve; The data analysis module is used to draw a circle with a preset radius with any vehicle exit position as the center to determine the pending area; the radius of all pending areas is adjusted synchronously until the pending area completely covers the target park, and the radius of the adjusted pending area is used as the pending radius r; The result generation module is used to correct the pending radius r of the pending area by the congestion coefficient, obtain the corrected pending area for each vehicle exit, obtain the target vehicle of the pending area corresponding to any vehicle exit, and remind the target vehicles to exit from the vehicle exit corresponding to the pending area to which they belong.
[0012] Beneficial effects of the present invention: In actual situations, users will select corresponding vehicle exits according to their own habits. In this case, the vehicle exit selected by the user may have a large queue of vehicles, resulting in low efficiency of the user's vehicle leaving the park. Therefore, in this case, the pending range of each vehicle exit is corrected according to the congestion level of vehicles in each park. It can be understood that the lower the congestion coefficient of the vehicle exit, the larger the influence range of the vehicle exit, and the higher the congestion coefficient, the smaller the influence range of the vehicle exit. The target vehicles in the corresponding influence area of any vehicle exit are obtained and the target vehicles are reminded to exit from the vehicle exit corresponding to the respective pending area, thereby determining the corresponding vehicle exit for each user and improving the efficiency of vehicles leaving the target park. BRIEF DESCRIPTION OF THE DRAWINGS
[0013] The present invention will be further described below in conjunction with the accompanying drawings.
[0014] Figure 1 It is a flow chart of a method for intelligent management of park construction according to the present invention. DETAILED DESCRIPTION
[0015] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only 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.
[0016] See also Figure 1 As shown, the present invention is a park construction intelligent management system and method, comprising the following steps: S1, obtain the position of each vehicle exit in the target park, set the monitoring period T to collect monitoring images at the vehicle exit in real time and generate a monitoring image sequence, identify the number of vehicles in any monitoring image and generate a curve A(t) of the number of vehicles changing with time, obtain the curve A(t) of the number of vehicles changing with time at each vehicle exit within the monitoring period T, and generate a vehicle quantity list A=(A1, A2, ..., Ai, ..., An), i=1, 2, ..., n; wherein Ai is the curve of the number of vehicles changing with time corresponding to the i-th vehicle exit, and n is the number of vehicle exits in the target park; identify the average vehicle moving speed of any vehicle exit according to the monitoring image sequence, and calculate the congestion coefficient of any vehicle exit by combining the average vehicle moving speed and the vehicle number change curve; S2, taking any vehicle exit position as the center and drawing a circle with a preset radius to determine the pending area; synchronously adjusting the radius of all pending areas until the pending area completely covers the target park, and taking the adjusted radius of the pending area as the pending radius r; S3, correcting the pending radius r of the pending area by the congestion coefficient, obtaining the corrected pending area for each vehicle exit, obtaining the target vehicle of the pending area corresponding to any vehicle exit, and reminding the target vehicles to exit from the vehicle exits corresponding to their respective pending areas.
[0017] In actual situations, users will select corresponding vehicle exits according to their own habits. In this case, the vehicle exit selected by the user may have a large queue of vehicles, resulting in low efficiency of the user's vehicle leaving the park. Therefore, in this case, the pending range of each vehicle exit is corrected according to the congestion level of vehicles in each park. It can be understood that the lower the congestion coefficient of the vehicle exit, the larger the influence range of the vehicle exit, and the higher the congestion coefficient, the smaller the influence range of the vehicle exit. The target vehicles in the corresponding influence area of any vehicle exit are obtained and the target vehicles are reminded to exit from the vehicle exit corresponding to the respective pending area, thereby determining the corresponding vehicle exit for each user and improving the efficiency of vehicles leaving the target park.
[0018] In a preferred implementation of the present invention, a vehicle leaving the target park parking lot is marked as a target vehicle.
[0019] In another preferred implementation of the present invention, in S2, the calculation process of the crowding coefficient is: S11, obtaining a monitoring image sequence corresponding to a monitoring period T of any vehicle exit position, performing grayscale processing on the monitoring images in sequence according to the monitoring image sequence to obtain a monitoring grayscale image, establishing a rectangular coordinate system with the central pixel point of the monitoring grayscale image as the origin, generating the coordinates (x, y) of all pixels in the monitoring grayscale image, and identifying the grayscale values Pi (x, y) of all pixels in the monitoring grayscale image, i = 1, ..., n, i represents the order of the monitoring grayscale image where the pixel point is located in the sequence, and calculating the grayscale difference D of the pixel points at the same position between adjacent monitoring grayscale images through the grayscale difference formula D = |Pi+1 (x, y)-Pi (x, y)|, if D is greater than a preset threshold, it indicates that the corresponding pixel point is a vehicle pixel, if D is less than or equal to the preset threshold, it indicates that the corresponding pixel point is a road surface area pixel; S12, merge adjacent vehicle pixels, and circumscribe a minimum circumscribed rectangle around the merged vehicle pixel area to obtain a pixel rectangle of any vehicle in the monitoring grayscale image, extract the pixel rectangle corresponding to any target vehicle, select the midpoint pixel of the rectangle from the pixel rectangle and mark it as a reference point, extract the real-time monitoring image sequence of the target vehicle within the observation time T, select the position information of the reference point in each frame of the monitoring image in the monitoring image sequence, and calculate the average speed of the target vehicle in each frame of the monitoring image according to the position change between adjacent frames and mark it as V, take the average speed V as the speed of the target vehicle, and calculate according to the calculation formula , where N is the total number of vehicles and Vi is the average speed of any vehicle; the average vehicle moving speed at the vehicle exit is calculated; S13, according to the calculation formula , where t∈[0,T], the congestion coefficient C of the vehicle exit is calculated.
[0020] In another preferred implementation of the present invention, in S3, the specific process of determining the area to be determined is: Obtain the congestion coefficients of all vehicle exits and perform normalization processing to obtain the normalized congestion coefficient C'; calculate the undetermined radius correction coefficient k=γ / C', where γ is a preset correction constant; calculate the standard radius of the vehicle exit Rj=kj*r, where Rj represents the undetermined radius of the j-th vehicle exit, and kj represents the undetermined radius correction coefficient of the j-th vehicle exit.
[0021] In another preferred implementation of the present invention, when there are two or more overlapping areas to be determined, the vehicle exit corresponding to the overlapping part is marked as a pending exit, the distance from any target vehicle in the overlapping part to all pending exits is obtained and the minimum value is obtained, and the pending exit corresponding to the minimum value is used as the exit of the target vehicle.
[0022] It can be understood that the pending area of each vehicle exit is determined based on the congestion coefficient. The higher the congestion coefficient, the smaller the pending area, and the lower the congestion coefficient, the larger the pending area. Therefore, in the actual range determination, when there are one or more vehicle exits with a small congestion coefficient, the resulting pending area will overlap with the pending area of the adjacent vehicle exit. The distance from any target vehicle to all pending exits is selected and the minimum value is obtained. The shortest distance means that the vehicle can reach the exit faster, reducing the overall driving time and the vehicle drives directly to the nearest exit, which can avoid unnecessary detours and congestion, thereby improving the efficiency of vehicles exiting the target park.
[0023] In another preferred implementation of the present invention, if there are two or more distances that are the same and are all minimum values, the vehicle exit with the least congestion is selected as the exit for the target vehicle.
[0024] It is understandable that, since the distances to several vehicle exits are the same at this time, the user selects the safe exit with the least congestion to reduce the time of leaving the park, thereby improving the efficiency of vehicles leaving the target park.
[0025] In another preferred implementation of the present invention, the method further includes acquiring all target vehicles outside the to-be-determined area, selecting any target vehicle and constructing alternative routes for the target vehicle to all lane exits and marking them as D1, D2, ..., Dm, where m is greater than or equal to n, calculating an evaluation score for any alternative route and selecting a vehicle exit corresponding to the alternative route with the smallest evaluation score as the exit for the target vehicle; The specific calculation process of the evaluation score is as follows: Select any alternative route and determine the vehicle exit corresponding to the alternative route, obtain the number of all target vehicles M in the to-be-determined area corresponding to the vehicle exit and the number of vehicles N corresponding to the current vehicle exit, and calculate the evaluation score F corresponding to any alternative route according to the calculation formula F=C*N+α*(MN)*C+D / C, where D is the distance value from the target vehicle to the vehicle exit corresponding to the alternative route, and α is the preset correction coefficient.
[0026] Considering the number of vehicles N at the current vehicle exit, we can understand the congestion of the exit. If the N value is large, it means that there are more vehicles at the exit, which may cause congestion and increase the travel time. This indicator helps the navigation system evaluate and select a more unobstructed exit to reduce unnecessary waiting time.
[0027] By calculating the number of all target vehicles M in the area to be determined corresponding to the vehicle exit, we can have a more comprehensive understanding of the vehicle density near the exit. The larger the M value, the denser the vehicles in the area. The distance value D represents the distance from the target vehicle to the exit. In the calculation formula, D is used to measure the time or distance required to reach the exit from the current location. The shorter the distance, the faster the destination can be reached. It can be understood that by calculating the evaluation score of each alternative route in real time, the optimal exit can be dynamically selected for each vehicle, thereby reducing traffic congestion at the park exit. It can be understood that the congestion coefficient of each vehicle exit in the park represents the time consumed by any target vehicle to leave the target park to a certain extent. The number of vehicles N corresponding to the current vehicle exit is obtained. The number of vehicles N is the vehicle determined to leave from the vehicle exit. According to the calculation formula F=C*N+α*(MN)*C+D / C, the alternative route with the least time can be selected from all alternative routes as the driving route of the target vehicle, reducing the time to leave the park, thereby improving the efficiency of vehicles leaving the target park.
[0028] In another preferred implementation of the present invention, it also includes obtaining feedback information of all target vehicles outside the to-be-determined area. If the target vehicle selects a predetermined alternative route, the driving information re-reported by the vehicle is obtained and the park road exit information is updated according to the driving information.
[0029] It can be understood that based on the driving information reported by the vehicle, the road information of each vehicle exit can be updated, providing the latest road information to other users to reduce misleading information caused by outdated information, thereby optimizing the traffic flow in the park, reducing traffic congestion, and improving the efficiency of vehicles exiting the target park.
[0030] A park construction intelligent management system, characterized by comprising: The data acquisition module is used to obtain the position of each vehicle exit in the target park, and set the monitoring period T to collect monitoring images at the vehicle exit in real time and generate a monitoring image sequence, identify the number of vehicles in any monitoring image and generate a curve A(t) of the change of the number of vehicles over time, obtain the curve A(t) of the change of the number of vehicles over time at each vehicle exit in the monitoring period T, and generate a vehicle quantity list A=(A1, A2, ..., Ai, ..., An), i=1, 2, ..., n; wherein Ai is the curve of the change of the number of vehicles corresponding to the i-th vehicle exit over time, and n is the number of vehicle exits in the target park; the average vehicle moving speed of any vehicle exit is identified according to the monitoring image sequence, and the congestion coefficient of any vehicle exit is calculated by combining the average vehicle moving speed and the vehicle number change curve; The data analysis module is used to draw a circle with a preset radius with any vehicle exit position as the center to determine the pending area; the radius of all pending areas is adjusted synchronously until the pending area completely covers the target park, and the radius of the adjusted pending area is used as the pending radius r; The result generation module is used to correct the pending radius r of the pending area by the congestion coefficient, obtain the corrected pending area for each vehicle exit, obtain the target vehicle of the pending area corresponding to any vehicle exit, and remind the target vehicles to exit from the vehicle exit corresponding to the pending area to which they belong.
[0031] The above is a detailed description of an embodiment of the present invention, but the content is only a preferred embodiment of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made within the scope of the present invention should still fall within the scope of the patent coverage of the present invention.
Claims
1. A method for intelligent management of park construction, characterized in that: The following steps are involved: S1, obtain the position of each vehicle exit in the target park, set the monitoring period T to collect monitoring images at the vehicle exit in real time and generate a monitoring image sequence, identify the number of vehicles in any monitoring image and generate a curve A(t) of the number of vehicles changing with time, obtain the curve A(t) of the number of vehicles changing with time at each vehicle exit within the monitoring period T, and generate a vehicle quantity list A=(A1, A2, ..., Ai, ..., An), i=1, 2, ..., n; wherein Ai is the curve of the number of vehicles changing with time corresponding to the i-th vehicle exit, and n is the number of vehicle exits in the target park; identify the average vehicle moving speed of any vehicle exit according to the monitoring image sequence, and calculate the congestion coefficient of any vehicle exit by combining the average vehicle moving speed and the vehicle number change curve; S2, taking any vehicle exit position as the center and drawing a circle with a preset radius to determine the pending area; synchronously adjusting the radius of all pending areas until the pending area completely covers the target park, and taking the adjusted radius of the pending area as the pending radius r; S3, correcting the pending radius r of the pending area by the congestion coefficient, obtaining the corrected pending area for each vehicle exit, obtaining the target vehicle of the pending area corresponding to any vehicle exit, and reminding the target vehicles to exit from the vehicle exits corresponding to their respective pending areas.
2. A method for intelligent management of park construction according to claim 1, characterized in that: The vehicle leaving the parking lot of the target park is marked as the target vehicle.
3. A method for intelligent management of park construction according to claim 1, characterized in that: In S2, the calculation process of the crowding coefficient is: S11, obtaining a monitoring image sequence corresponding to a monitoring period T of any vehicle exit position, performing grayscale processing on the monitoring images in sequence according to the monitoring image sequence to obtain a monitoring grayscale image, establishing a rectangular coordinate system with the central pixel point of the monitoring grayscale image as the origin, generating the coordinates (x, y) of all pixels in the monitoring grayscale image, and identifying the grayscale values Pi (x, y) of all pixels in the monitoring grayscale image, i = 1, ..., n, i represents the order of the monitoring grayscale image where the pixel point is located in the sequence, and calculating the grayscale difference D of the pixel points at the same position between adjacent monitoring grayscale images through the grayscale difference formula D = |Pi+1 (x, y)-Pi (x, y)|, if D is greater than a preset threshold, it indicates that the corresponding pixel point is a vehicle pixel, if D is less than or equal to the preset threshold, it indicates that the corresponding pixel point is a road surface area pixel; S12, merge adjacent vehicle pixels, and circumscribe a minimum circumscribed rectangle around the merged vehicle pixel area to obtain a pixel rectangle of any vehicle in the monitoring grayscale image, extract the pixel rectangle corresponding to any target vehicle, select the midpoint pixel of the rectangle from the pixel rectangle and mark it as a reference point, extract the real-time monitoring image sequence of the target vehicle within the observation time T, select the position information of the reference point in each frame of the monitoring image in the monitoring image sequence, and calculate the average speed of the target vehicle in each frame of the monitoring image according to the position change between adjacent frames and mark it as V, take the average speed V as the speed of the target vehicle, and calculate according to the calculation formula Where N is the total number of vehicles, Vi is the average speed of any vehicle; the average vehicle moving speed of the vehicle exit is calculated; S13, according to the calculation formula , where t∈[0,T], the congestion coefficient C of the vehicle exit is calculated.
4. A method for intelligent management of park construction according to claim 1, characterized in that: In S3, the specific process of the pending area is as follows: Obtain the congestion coefficients of all vehicle exits and perform normalization processing to obtain the normalized congestion coefficient C'; calculate the undetermined radius correction coefficient k=γ / C', where γ is a preset correction constant; calculate the standard radius of the vehicle exit Rj=kj*r, where Rj represents the undetermined radius of the j-th vehicle exit, and kj represents the undetermined radius correction coefficient of the j-th vehicle exit.
5. A method for intelligent management of park construction according to claim 1, characterized in that: When there are two or more overlapping areas to be determined, the vehicle exit corresponding to the overlapping part is marked as the pending exit, the distance from any target vehicle in the overlapping part to all the pending exits is obtained and the minimum value is obtained, and the pending exit corresponding to the minimum value is used as the exit of the target vehicle.
6. A method for intelligent management of park construction according to claim 5, characterized in that: If there are two or more distances that are the same and are all minimum values, the vehicle exit with the least congestion will be selected as the exit for the target vehicle.
7. A method for intelligent management of park construction according to claim 1, characterized in that: Obtain all target vehicles outside the pending area, select any target vehicle and construct alternative routes for the target vehicle to all lane exits and mark them as D1, D2, ..., Dm, where m is greater than or equal to n, calculate the evaluation score of any alternative route and select the vehicle exit corresponding to the alternative route with the smallest evaluation score as the exit of the target vehicle; The specific calculation process of the evaluation score is as follows: Select any alternative route and determine the vehicle exit corresponding to the alternative route, obtain the number of all target vehicles M in the to-be-determined area corresponding to the vehicle exit and the number of vehicles N corresponding to the current vehicle exit, and calculate the evaluation score F corresponding to any alternative route according to the calculation formula F=C*N+α*(MN)*C+D / C, where D is the distance value from the target vehicle to the vehicle exit corresponding to the alternative route, and α is the preset correction coefficient.
8. A method for intelligent management of park construction according to claim 7, characterized in that: It also includes obtaining feedback information of all target vehicles outside the to-be-determined area. If the target vehicle selects a predetermined alternative route, the driving information re-reported by the vehicle is obtained and the park road exit information is updated according to the driving information.
9. A smart management system for park construction, characterized in that: include: The data acquisition module is used to obtain the position of each vehicle exit in the target park, and set the monitoring period T to collect monitoring images at the vehicle exit in real time and generate a monitoring image sequence, identify the number of vehicles in any monitoring image and generate a curve A(t) of the change of the number of vehicles over time, obtain the curve A(t) of the change of the number of vehicles over time at each vehicle exit in the monitoring period T, and generate a vehicle quantity list A=(A1, A2, ..., Ai, ..., An), i=1, 2, ..., n; wherein Ai is the curve of the change of the number of vehicles corresponding to the i-th vehicle exit over time, and n is the number of vehicle exits in the target park; the average vehicle moving speed of any vehicle exit is identified according to the monitoring image sequence, and the congestion coefficient of any vehicle exit is calculated by combining the average vehicle moving speed and the vehicle number change curve; The data analysis module is used to draw a circle with a preset radius with any vehicle exit position as the center to determine the pending area; the radius of all pending areas is adjusted synchronously until the pending area completely covers the target park, and the radius of the adjusted pending area is used as the pending radius r; The result generation module is used to correct the pending radius r of the pending area by the congestion coefficient, obtain the corrected pending area for each vehicle exit, obtain the target vehicle of the pending area corresponding to any vehicle exit, and remind the target vehicles to exit from the vehicle exit corresponding to the pending area to which they belong.