Dynamic allocation system and method for urban parking spaces

Abstract

The application provides a city parking space dynamic allocation system and method, which comprises a parking lot management module, a parking space dynamic allocation module, a parking lot control module and a city parking mobile application module; when a driver initiates a parking request through the city parking mobile application module, the allocation system allocates parking space resources and adjusts the parking prices of various parking lots; the parking lot management module is used for registration, cancellation, modification and query operation of the parking lot and its affiliated parking spaces; the parking lot control module is used for identifying vehicles and accepting the instruction of the parking space dynamic allocation module to perform opening and closing operation of the parking lot barrier gate; the parking space dynamic allocation module is used for allocating parking spaces to drivers with parking requests according to the idle parking space data and parking request data in the region; the application provides the dynamic allocation function of the parking space based on the non-equilibrium auction algorithm, can guide the orderly parking of vehicles and can effectively relieve the problem of difficult parking in the city.

Description

Technical Field

[0001] This invention relates to the fields of smart city and mobile computing technology, and in particular to a dynamic allocation system and method for urban parking spaces. Background Technology

[0002] With the deepening of urbanization and the rapid development of the automotive industry, the number of motor vehicles in cities is constantly increasing, while available parking spaces are relatively scarce, making the "parking space shortage" problem increasingly prominent. Especially in areas with concentrated office areas, popular commercial districts, and tourist attractions, scenes of vehicles crowding together to compete for parking spaces easily occur, not only reducing the convenience of driving for citizens but also creating certain traffic hazards. To solve this problem, in addition to increasing the supply of parking spaces, existing technical methods mostly adopt traffic guidance or online parking space reservation systems, attempting to avoid disorderly searching and competing for parking spaces by providing real-time parking space availability information and reservation methods.

[0003] However, the above-mentioned technical methods also have certain shortcomings. First, the method of displaying the number of available parking spaces in real time on traffic guidance screens on the road means that drivers can only find out the number of available spaces when they arrive at the site. Even with real-time online updates, although drivers can know the parking lot status remotely, the lack of other decision-making information will lead them to tend to go to parking lots with more available spaces. This will further lead to some parking lots being overcrowded while others are relatively spacious due to convergent choices. Second, most existing parking space reservation systems provide reservation functions from the perspective of a single parking lot, failing to consider the overall parking space resource allocation from the perspective of multiple parking lots in adjacent areas, thus failing to achieve the goal of rationally allocating parking space demand and supply. Third, most existing parking space reservation systems require the installation of parking space locks, which not only increases the technical difficulty of parking lot implementation and renovation but also increases costs. Summary of the Invention

[0004] This invention proposes a dynamic allocation system and method for urban parking spaces. Based on an unbalanced auction algorithm, it provides a dynamic allocation function for parking spaces, which can guide vehicles to park in an orderly manner and effectively alleviate the problem of urban parking difficulties.

[0005] The present invention adopts the following technical solution.

[0006] The city parking space dynamic allocation system is designed to alleviate the problem of urban parking difficulties. It includes a parking lot management module and a connected parking space dynamic allocation module, a parking lot control module located at the parking lot, and a city parking mobile application module located on the driver's mobile device. When a driver initiates a parking request through the city parking mobile application module, the allocation system allocates parking space resources based on the request time, the driver's mobile device location, and the parking lot location, and adjusts the parking prices of each parking lot.

[0007] The parking management module is used for registering, deregistering, modifying, and querying parking lots and their associated parking spaces;

[0008] The parking lot control module is used to identify vehicles and receive instructions from the parking space dynamic allocation module to open and close the parking lot gate.

[0009] The parking space dynamic allocation module is used to allocate parking spaces to drivers who have parking requests based on the available parking space data and parking request data within the area.

[0010] The urban parking mobile application module is used to provide drivers with parking services based on mobile devices, enabling functions such as vehicle registration, vehicle location, submitting parking requests, and receiving parking arrangements.

[0011] The method for dynamic allocation of urban parking spaces adopts the dynamic allocation system for urban parking spaces described above. The method is based on an unbalanced auction algorithm and guides vehicles to park in an orderly manner by providing dynamic allocation of parking spaces. It includes the following steps:

[0012] Step S10: Before departure or during the journey, the driver specifies the destination De through the city parking mobile application module, indicating a need to park at that destination and in the surrounding area; if the estimated time from the driver's current location to the destination is greater than a threshold T... v If so, the parking request will be identified as an invalid request and rejected by the city parking mobile application module;

[0013] Step S11: The parking space dynamic allocation module at the Tth... i A total of k valid parking requests were received within a time period, R = {R1, R2, ..., R...}. k Based on the neighborhood range d1, the DBScan clustering algorithm is used to group parking requests with similar destinations into the same group, resulting in n groups, such that R = {R1, R2, ..., R...} n}, where R n Let n be the set of parking requests for the nth group, and Let R i Let .length be the number of parking requests in the i-th group, then k = R1.length + R2.length + ... + R n .length;

[0014] Step S12: For each of the above parking request groups R j (1≤j≤n), the dynamic parking space allocation module obtains all the destinations specified in the group of requirements, and obtains information on m parking lots surrounding the destinations from the parking lot management module according to the neighborhood range d2: in, It is the i-th parking lot associated with the j-th parking request group, and 1≤i≤m;

[0015] Step S13: The parking space dynamic allocation module obtains the above-mentioned information related to each parking request group R from the parking lot control module. j (1≤j≤n) The total number of currently available parking spaces in the relevant parking lot, n. j , making Where m is the total number of parking lots associated with the j-th parking request group; Let m be the number of available parking spaces in the i-th parking lot, where 1 ≤ i ≤ m;

[0016] Step S14: For each of the above parking request groups R j (1≤j≤n), the parking space dynamic allocation module will allocate M j Parking lot and R j Match parking requests within the system;

[0017] Step S15: The parking space dynamic allocation module sends the parking space allocation result to the city parking mobile application module; the city parking mobile application module uses satellite positioning navigation to guide the driver to the parking lot where the allocated parking space is located.

[0018] Step S16: The parking space dynamic allocation module sends the parking space allocation result to the parking lot control module; when a vehicle arrives at the parking lot entrance, the parking lot control module obtains the vehicle's license plate number through a video sensor and compares it with the license plate number recorded in the parking space allocation result; if the vehicle's arrival time is within a predetermined time threshold T... e If the comparison is successful, the gate will be opened to allow passage.

[0019] In step S14, the following steps are used to match parking spaces with parking requests:

[0020] Step S141: For each of the above parking request groups R j (1≤j≤n), calculate R j The real-time location of the vehicle in M j Distance matrix between parking lots

[0021]

[0022] in, It is the Rth j The distance between the real-time location of the vehicle in each of the .length requests and the m-th parking lot, in meters;

[0023] Step S142: For each of the above parking request groups R j (1≤j≤n), calculate R j The destination and M j Distance matrix between parking lots

[0024]

[0025] in, It is the Rth j The distance, in meters, between the destination in each of the .length requests and the m-th parking lot.

[0026] Step S143: Based on the above steps, put R... j The i-th parking request R j，i Assigned to the m-th parking lot Then the driver's mileage cost D j，i To calculate the distance from the current location by car to the parking lot, and then by walking from the parking lot to the destination, use the following formula:

[0027]

[0028] Among them, D j，i The distance cost is the distance to the i-th request in the j-th parking request group. This is the driving distance from the current location to the parking lot. The walking distance from the parking lot to the destination; For the driving preferences of the i-th request, Let be the walking preference for the i-th request, and

[0029] Step S144: The dynamic parking space allocation module adopts a batch optimization strategy, that is, within a fixed time period T of τ seconds, it accumulates all parking requests received during that time period, and applies an unbalanced auction algorithm to allocate parking spaces with the goal of minimizing the total travel cost; the optimization objective function is as follows:

[0030]

[0031] Step S145: If parking requests are not allocated due to insufficient available parking spaces, these requests will be delayed until the next time period for allocation, until a parking space is allocated or the waiting time exceeds the user's preset threshold.

[0032] In step S144, the parking space dynamic allocation module, in the process of allocating parking spaces using the unbalanced auction algorithm, further includes the following steps:

[0033] Step S1441: For each parking request group R j The following value function is used to calculate the value of each parking lot for a parking request:

[0034]

[0035] Step S1442: Initialize the prices for each parking lot =0;

[0036] Step S1443: Perform one round of parking allocation: for each parking request R j，i Based on the revenue calculation function in Formula 6 below, compare the revenue of each parking lot for the parking request, select the parking lot with the highest revenue and allocate it to the parking request, and reduce the number of available parking spaces of the parking lot by 1; if the number of available parking spaces of the parking lot is still greater than 1, then the parking lot can be allocated to other parking requests.

[0037]

[0038] Step S1444: Update the price of each parking lot according to the allocation relationship between parking lots and parking requests using the following formulas seven and eight;

[0039]

[0040]

[0041] Step S1445: Repeat steps S1443 and S1444 until all parking requests have been assigned to parking lots, or the number of available parking spaces in a parking lot is equal to 0, or the revenue from assigning each parking request to a parking lot is less than 0.

[0042] In step S10, the estimated time for the driver to reach the destination from the current location is estimated by the city parking mobile application module via satellite navigation.

[0043] The urban parking mobile application module estimates the estimated time for a driver to reach their destination from their current location based on the driver's route, route congestion status, and historical congestion status.

[0044] The city parking mobile application module prompts drivers with their estimated arrival time at their destination. If a driver believes they cannot arrive within the estimated time, they can cancel the parking request through the city parking mobile application module.

[0045] The mobile device is a mobile phone; the parking management module is implemented as a web application running in the cloud; the parking control module is implemented as a RESTful service running in the cloud and providing a list of reserved vehicles for the existing parking management system; the parking space dynamic allocation module is implemented as a RESTful service running in the cloud; the city parking mobile application module is implemented as an Android application, an iOS application, or a WeChat mini-program.

[0046] The parking lot management module can maintain data on parking lot location, number of parking spaces, and initial number of available parking spaces manually. The parking lot management module interacts with the parking lot control module in real time to obtain the real-time number of available parking spaces.

[0047] When controlling the barrier gate, the parking control module sends instructions to the existing parking control system through the interface to realize the barrier gate operation.

[0048] The dynamic parking space allocation module is used to allocate parking spaces to drivers with parking requests based on available parking space data and parking request data within a region. The dynamic parking space allocation module adopts a batch optimization method, aggregating multiple parking requests within a preset time period and using an unbalanced auction algorithm to allocate parking spaces.

[0049] Compared to existing technologies, this invention offers the following advantages: The proposed dynamic parking space allocation system and method for urban areas provides a dynamic parking space allocation service for car owners and parking lots. By aggregating multiple parking requests and multiple nearby parking lots, and employing an unbalanced auction algorithm to match parking lots with parking requests, it effectively guides vehicles to park in an orderly manner, avoids blind parking by car owners, and minimizes overall parking and walking distances. The system deployment does not require additional hardware modifications or investments from parking lots, offering a low deployment cost advantage. This invention can provide a solution to alleviate urban parking difficulties and traffic congestion. Attached Figure Description

[0050] The present invention will be further described in detail below with reference to the accompanying drawings and specific embodiments:

[0051] Appendix Figure 1 This is a structural diagram of a dynamic allocation system for urban parking spaces according to an embodiment of the present invention;

[0052] Appendix Figure 2 This is a flowchart of a dynamic allocation method for urban parking spaces in one embodiment of the present invention. Detailed Implementation

[0053] like Figure 1As shown, the urban parking space dynamic allocation system is used to alleviate the problem of urban parking difficulties. It includes a parking lot management module and a parking space dynamic allocation module connected to it, a parking lot control module located at the parking lot, and an urban parking mobile application module located at the driver's vehicle. When the driver initiates a parking request through the urban parking mobile application module, the allocation system allocates parking space resources according to the request time, the driver's mobile device location, and the parking lot location, and adjusts the parking price of each parking lot.

[0054] The parking management module is used for registering, deregistering, modifying, and querying parking lots and their associated parking spaces;

[0055] The parking lot control module is used to identify vehicles and receive instructions from the parking space dynamic allocation module to open and close the parking lot gate.

[0056] The parking space dynamic allocation module is used to allocate parking spaces to drivers who have parking requests based on the available parking space data and parking request data within the area.

[0057] The urban parking mobile application module is used to provide drivers with parking services based on mobile devices, enabling functions such as vehicle registration, vehicle location, submitting parking requests, and receiving parking arrangements.

[0058] The urban parking space dynamic allocation method employs the aforementioned urban parking space dynamic allocation system. This method is based on an unbalanced auction algorithm and guides vehicles to park in an orderly manner by providing dynamic allocation functionality for parking spaces. Figure 2 As shown, it includes the following steps;

[0059] Step S10: Before departure or during the journey, the driver specifies the destination De through the city parking mobile application module, indicating a need to park at that destination and in the surrounding area; if the estimated time from the driver's current location to the destination is greater than a threshold T... v If so, the parking request will be identified as an invalid request and rejected by the city parking mobile application module;

[0060] Step S11: The parking space dynamic allocation module at the Tth... i A total of k valid parking requests were received within a time period, R = {R1, R2, ..., R...}. k Based on the neighborhood range d1, the DBScan clustering algorithm is used to group parking requests with similar destinations into the same group, resulting in n groups, such that R = {R1, R2, ..., R...} n}, where R n Let n be the set of parking requests for the nth group, and Let R iLet .length be the number of parking requests in the i-th group, then k = R1.length + R2.length + ... + R n .length;

[0061] Step S12: For each of the above parking request groups R j (1≤j≤n), the dynamic parking space allocation module obtains all the destinations specified in the group of requirements, and obtains information on m parking lots surrounding the destinations from the parking lot management module according to the neighborhood range d2: in, It is the i-th parking lot associated with the j-th parking request group, and 1≤i≤m;

[0062] Step S13: The parking space dynamic allocation module obtains the above-mentioned information related to each parking request group R from the parking lot control module. j (1≤j≤n) The total number of currently available parking spaces in the relevant parking lot, n. j , making Where m is the total number of parking lots associated with the j-th parking request group; Let m be the number of available parking spaces in the i-th parking lot, where 1 ≤ i ≤ m;

[0063] Step S14: For each of the above parking request groups R j (1≤j≤n), the parking space dynamic allocation module will allocate M j Parking lot and R j Match parking requests within the system;

[0064] Step S15: The parking space dynamic allocation module sends the parking space allocation result to the city parking mobile application module; the city parking mobile application module uses satellite positioning navigation to guide the driver to the parking lot where the allocated parking space is located.

[0065] Step S16: The parking space dynamic allocation module sends the parking space allocation result to the parking lot control module; when a vehicle arrives at the parking lot entrance, the parking lot control module obtains the vehicle's license plate number through a video sensor and compares it with the license plate number recorded in the parking space allocation result; if the vehicle's arrival time is within a predetermined time threshold T... e If the comparison is successful, the gate will be opened to allow passage.

[0066] In step S14, the following steps are used to match parking spaces with parking requests:

[0067] Step S141: For each of the above parking request groups R j (1≤j≤n), calculate R j The real-time location of the vehicle in Mj Distance matrix between parking lots

[0068]

[0069] in, It is the Rth j The distance between the real-time location of the vehicle in each of the .length requests and the m-th parking lot, in meters;

[0070] Step S142: For each of the above parking request groups R j (1≤j≤n), calculate R j The destination and M j Distance matrix between parking lots

[0071]

[0072] in, It is the Rth j The distance, in meters, between the destination in each of the .length requests and the m-th parking lot.

[0073] Step S143: Based on the above steps, put R... j The i-th parking request R j，i Assigned to the m-th parking lot Then the driver's mileage cost D j，i To calculate the distance from the current location by car to the parking lot, and then by walking from the parking lot to the destination, use the following formula:

[0074]

[0075] Among them, D j，i The distance cost is the distance to the i-th request in the j-th parking request group. This is the driving distance from the current location to the parking lot. The walking distance from the parking lot to the destination; For the driving preferences of the i-th request, Let be the walking preference for the i-th request, and

[0076] Step S144: The dynamic parking space allocation module adopts a batch optimization strategy, that is, within a fixed time period T of τ seconds, it accumulates all parking requests received during that time period, and applies an unbalanced auction algorithm to allocate parking spaces with the goal of minimizing the total travel cost; the optimization objective function is as follows:

[0077]

[0078] Step S145: If parking requests are not allocated due to insufficient available parking spaces, these requests will be delayed until the next time period for allocation, until a parking space is allocated or the waiting time exceeds the user's preset threshold.

[0079] In step S144, the parking space dynamic allocation module, in the process of allocating parking spaces using the unbalanced auction algorithm, further includes the following steps:

[0080] Step S1441: For each parking request group R j The following value function is used to calculate the value of each parking lot for a parking request:

[0081]

[0082] Step S1442: Initialize the prices for each parking lot =0;

[0083] Step S1443: Perform one round of parking allocation: for each parking request R j，i According to the revenue calculation function in Formula 6 below, compare the revenue of each parking lot for the parking request, select the parking lot with the highest revenue and allocate it to the parking request, and reduce the number of available parking spaces of the parking lot by 1; if the number of available parking spaces of the parking lot is still greater than 1, then the parking lot can be allocated to other parking requests.

[0084]

[0085] Step S1444: Update the price of each parking lot according to the allocation relationship between parking lots and parking requests using the following formulas seven and eight;

[0086]

[0087]

[0088] Step S1445: Repeat steps S1443 and S1444 until all parking requests have been assigned to parking lots, or the number of available parking spaces in a parking lot is equal to 0, or the revenue from assigning each parking request to a parking lot is less than 0.

[0089] In step S10, the estimated time for the driver to reach the destination from the current location is estimated by the city parking mobile application module via satellite navigation.

[0090] The urban parking mobile application module estimates the estimated time for a driver to reach their destination from their current location based on the driver's route, route congestion status, and historical congestion status.

[0091] The city parking mobile application module prompts drivers with their estimated arrival time at their destination. If a driver believes they cannot arrive within the estimated time, they can cancel the parking request through the city parking mobile application module.

[0092] The mobile device is a mobile phone; the parking management module is implemented using a cloud-based W... e b. Application; The parking control module is implemented as a RESTful service that runs in the cloud and can provide a list of reserved vehicles for the existing parking management system; The dynamic parking space allocation module is implemented as a RESTful service that runs in the cloud; The city parking mobile application module is implemented as an Android application, an iOS application, or a WeChat mini-program.

[0093] The parking lot management module can maintain data on parking lot location, number of parking spaces, and initial number of available parking spaces manually. The parking lot management module interacts with the parking lot control module in real time to obtain the real-time number of available parking spaces.

[0094] When controlling the barrier gate, the parking control module sends instructions to the existing parking control system through the interface to realize the barrier gate operation.

[0095] The dynamic parking space allocation module is used to allocate parking spaces to drivers with parking requests based on available parking space data and parking request data within a region. The dynamic parking space allocation module adopts a batch optimization method, aggregating multiple parking requests within a preset time period and using an unbalanced auction algorithm to allocate parking spaces.

Claims

1. A dynamic urban parking space allocation system, used to alleviate the problem of urban parking difficulties, characterized by: It includes a parking management module and a connected dynamic parking space allocation module, a parking control module located at the parking lot, and a city parking mobile application module located at the driver's vehicle. When a driver initiates a parking request through the city parking mobile application module, the allocation system allocates parking space resources based on the request time, the driver's mobile device location, and the parking lot location, and adjusts the parking prices of each parking lot. The parking management module is used for registering, deregistering, modifying, and querying parking lots and their associated parking spaces; The parking lot control module is used to identify vehicles and receive instructions from the parking space dynamic allocation module to open and close the parking lot gate. The parking space dynamic allocation module is used to allocate parking spaces to drivers who have parking requests based on the available parking space data and parking request data within the area. The urban parking mobile application module is used to provide drivers with parking services based on mobile devices, enabling functions such as vehicle registration, vehicle location, submitting parking requests, and receiving parking arrangements. The aforementioned dynamic allocation method for urban parking spaces is based on an unbalanced auction algorithm. It guides vehicles to park in an orderly manner by providing dynamic allocation functionality for parking spaces. Includes the following steps; Step S11: The parking space dynamic allocation module at the Tth... i A total of k valid parking requests were received within a time period, R = {R1, R2, ..., R...} k Based on the neighborhood range d1, the DBScan clustering algorithm is used to group parking requests with similar destinations into the same group, resulting in n groups such that R = {R1, R2, ..., R}. n }, where R n Let n be the set of parking requests for the nth group, and Let R i Let .length be the number of parking requests in the i-th group, then k = R1.length + R2.length + ... + R n .length; Step S12: For each parking request group R j ( The parking space dynamic allocation module obtains all the destinations specified in the group of requirements, and obtains information on m parking lots surrounding the destinations from the parking lot management module based on the neighborhood range d2. ;in, It is the i-th parking lot associated with the j-th parking request group, and ; Step S13: The parking space dynamic allocation module obtains the information of each parking request group R from the parking lot control module. j ( The total number of currently available parking spaces in the relevant parking lot. , making , where m is the total number of parking lots associated with the j-th parking request group; Let be the number of available parking spaces in the i-th parking lot, and ; Step S14: For each of the above parking request groups R j ( The parking space dynamic allocation module (hereinafter referred to as the module) will... Parking lot and R j Match parking requests within the system; In step S14, the following steps are used to match parking spaces with parking requests: Step S141: For each of the above parking request groups R j ( ), calculate R j Real-time vehicle location and Distance matrix between parking lots : Formula 1; in, It is the first The distance between the real-time location of the vehicle in each request and the m-th parking lot, in meters; Step S142: For each of the above parking request groups R j ( ), calculate R j The destination and Distance matrix between parking lots : Formula 2; in, It is the first The distance between the destination in each request and the m-th parking lot, in meters; Step S143: Based on the above steps, put R... j The i-th parking request Assigned to the m-th parking lot Then the driver's mileage cost To calculate the distance from the current location by car to the parking lot, and then by walking from the parking lot to the destination, use the following formula: Formula 3; in, The distance cost is the distance to the i-th request in the j-th parking request group. This is the driving distance from the current location to the parking lot. The walking distance from the parking lot to the destination; For the driving preferences of the i-th request, Let be the walking preference for the i-th request, and , , ; Step S144: The parking space dynamic allocation module adopts a batch optimization strategy, that is, when the time is fixed at a certain duration... of Within a given time period, all parking requests received during that period are accumulated. With the goal of minimizing the total travel cost, an unbalanced auction algorithm is applied to allocate parking spaces. The optimization objective function is as follows: Formula 4; Step S145: If parking requests are not allocated due to insufficient available parking spaces, these requests will be delayed until the next time period for allocation, until a parking space is allocated or the waiting time exceeds the user's preset threshold. In step S144, the parking space dynamic allocation module, in the process of allocating parking spaces using the unbalanced auction algorithm, further includes the following steps: Step S1441: For each parking request group The following value function is used to calculate the value of each parking lot for a parking request: Formula 5; Step S1442: Initialize the prices for each parking lot =0; Step S1443: Perform a round of parking allocation: for each parking request According to the revenue calculation function in Formula 6 below, compare the revenue of each parking lot for the parking request, select the parking lot with the highest revenue and allocate it to the parking request, and reduce the number of available parking spaces of the parking lot by 1; if the number of available parking spaces of the parking lot is still greater than 1, then the parking lot can be allocated to other parking requests. Formula Six; Step S1444: Update the price of each parking lot according to the allocation relationship between parking lots and parking requests using the following formulas seven and eight; Formula 7; Formula 8; Step S1445: Repeat steps S1443 and S1444 until all parking requests have been assigned to parking lots, or the number of available parking spaces in a parking lot is equal to 0, or the revenue from assigning each parking request to a parking lot is less than 0.

2. A method for dynamic allocation of urban parking spaces, employing the dynamic allocation system for urban parking spaces as described in claim 1, characterized in that: The aforementioned dynamic allocation method for urban parking spaces is based on an unbalanced auction algorithm. It guides vehicles to park in an orderly manner by providing dynamic allocation functionality for parking spaces. Includes the following steps; Step S10: Before departure or during the journey, the driver specifies the destination De through the city parking mobile application module, indicating a need to park at that destination and in the surrounding area; if the estimated time from the driver's current location to the destination is greater than a threshold T... v If so, the parking request will be identified as an invalid request and rejected by the city parking mobile application module; Step S15: The parking space dynamic allocation module sends the parking space allocation result to the city parking mobile application module; the city parking mobile application module uses satellite positioning navigation to guide the driver to the parking lot where the allocated parking space is located. Step S16: The parking space dynamic allocation module sends the parking space allocation result to the parking lot control module; when a vehicle arrives at the parking lot entrance, the parking lot control module obtains the vehicle's license plate number through a video sensor and compares it with the license plate number recorded in the parking space allocation result; if the vehicle's arrival time is within a predetermined time threshold T... e If the comparison is successful, the gate will be opened to allow passage.

3. The method for dynamic allocation of urban parking spaces according to claim 2, characterized in that: In step S10, the estimated time for the driver to reach the destination from the current location is estimated by the city parking mobile application module via satellite navigation.

4. The method for dynamic allocation of urban parking spaces according to claim 2, characterized in that: The urban parking mobile application module estimates the estimated time for a driver to reach their destination from their current location based on the driver's route, route congestion status, and historical congestion status.

5. The method for dynamic allocation of urban parking spaces according to claim 2, characterized in that: The city parking mobile application module prompts drivers with their estimated arrival time at their destination. If a driver believes they cannot arrive within the estimated time, they can cancel the parking request through the city parking mobile application module.

6. The method for dynamic allocation of urban parking spaces according to claim 2, characterized in that: The mobile device is a mobile phone; the parking management module is implemented as a web application running in the cloud; the parking control module is implemented as a RESTful service running in the cloud and providing a list of reserved vehicles for the existing parking management system; the parking space dynamic allocation module is implemented as a RESTful service running in the cloud; the city parking mobile application module is implemented as an Android application, an iOS application, or a WeChat mini program.

7. The method for dynamic allocation of urban parking spaces according to claim 2, characterized in that: The parking lot management module can maintain data on parking lot location, number of parking spaces, and initial number of available parking spaces manually. The parking lot management module interacts with the parking lot control module in real time to obtain the real-time number of available parking spaces. When controlling the barrier gate, the parking control module sends instructions to the existing parking control system through the interface to realize the barrier gate operation. The dynamic parking space allocation module is used to allocate parking spaces to drivers with parking requests based on available parking space data and parking request data within a region. The dynamic parking space allocation module adopts a batch optimization method, aggregating multiple parking requests within a preset time period and using an unbalanced auction algorithm to allocate parking spaces.

Images