A smart parking system for urban roads and control method thereof

Abstract

The present invention proposes an urban road smart parking system and a control method thereof. The urban road smart parking system includes a server, a sensing end and a client. The server includes a cloud server for running a background service program. The sensing end includes a parking space sensor and a first communication module. The client includes a positioning module, a navigation module, a second communication module and a display module. The cloud server is configured to obtain the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, calculate the ratio pcr of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road, and when pcr≥1, execute the allocation of available parking spaces on the urban road; when pcr<1, execute the cross-road parking space scheduling of the urban road, so as to safely and efficiently match vehicles seeking parking spaces with available parking spaces, and reduce the problem of road congestion or safety accidents caused by vehicles searching for available parking spaces.

Description

Technical Field

[0001] The present invention relates to the field of Internet technology, and in particular to an urban road smart parking system and a control method thereof. Background Art

[0002] With the increasing number of cars in cities, the problems of tight parking spaces and difficulty in parking have become major problems for people's daily driving. The marking of parking spaces on the side of urban roads has alleviated the problem of difficulty in parking to a certain extent. Even so, there is still a shortage of parking spaces in busy areas with dense office buildings. Even if there are a small number of parking spaces on the side of the road, due to the limited vision of the driver in the car and the obstruction of other vehicles or objects on the road, it often takes a long time to find an available parking space by taking a detour, that is, driving slowly along the roadside for a long time before it is possible to successfully find an available parking space. This way of finding a parking space not only takes too long, but also due to the slow driving of the vehicle, it may cause traffic congestion on busy roads. And because the driver needs to be distracted by looking for a parking space on the roadside while driving the vehicle, it may also cause safety accidents. Summary of the invention

[0003] Based on the above problems, the present invention proposes an urban road intelligent parking system and a control method thereof, which can safely and efficiently match vehicles looking for parking spaces with available parking spaces, thereby reducing the problem of road congestion or safety accidents caused by vehicles searching for available parking spaces.

[0004] In view of this, a first aspect of the present invention proposes an urban road smart parking system, including a server, a sensing end and a client, wherein the server includes a cloud server for running a background service program, the sensing end includes a parking space sensor arranged in each parking space on the urban road for sensing the parking space status and a first communication module for communicating with the cloud server, the client includes a positioning module for obtaining the real-time position of a vehicle corresponding to the client, a navigation module for providing a route navigation service according to the positioning information of the client, a second communication module for communicating with the cloud server and a display module for displaying available parking space information, and the cloud server is configured as follows:

[0005] Acquire the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, wherein the number of available parking spaces apn refers to the roadside parking spaces on the urban road that are currently unoccupied, and the number of vehicles seeking parking spaces scn refers to the number of vehicles on the urban road that have sent parking requests to the cloud server;

[0006] Calculate the ratio of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road:

[0007]

[0008] When pcr≥1, allocating available parking spaces on the urban road is performed;

[0009] When pcr<1, cross-road parking space scheduling of the urban road is performed.

[0010] A second aspect of the present invention provides a control method for an urban road smart parking system, comprising:

[0011] Acquire the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, wherein the number of available parking spaces apn refers to the roadside parking spaces on the urban road that are currently unoccupied, and the number of vehicles seeking parking spaces scn refers to the number of vehicles on the urban road that have sent parking requests to the cloud server;

[0012] Calculate the ratio of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road:

[0013]

[0014] When pcr≥1, allocating available parking spaces on the urban road is performed;

[0015] When pcr<1, cross-road parking space scheduling of the urban road is performed.

[0016] Furthermore, before the step of obtaining the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the method further includes:

[0017] receiving a parking request sent by a client, wherein the parking request includes location data of a destination of a vehicle corresponding to the client;

[0018] Determine the urban road where the destination of the vehicle is located according to the location data;

[0019] Determine the vehicle corresponding to the client as a location-seeking vehicle;

[0020] The identity of the vehicle corresponding to the client and the number corresponding to the urban road are associated and saved in a database.

[0021] Furthermore, the steps of allocating available parking spaces on the urban roads specifically include:

[0022] Constructing a parking-seeking vehicle queue, an allocated parking space vehicle queue, an available parking space queue, and an allocated parking space queue corresponding to each urban road;

[0023] Traverse each vehicle in the position-finding vehicle queue to perform the following steps:

[0024] Determine the vehicle currently traversed in the position-seeking vehicle queue as the first target vehicle;

[0025] Determine a first target available parking space closest to the first target vehicle in the available parking space queue;

[0026] allocating the first target available parking space to the first target vehicle;

[0027] The first target vehicle is moved from the position-seeking vehicle queue to the allocated parking space vehicle queue, and the first target available parking space is moved from the available parking space queue to the allocated parking space queue.

[0028] Furthermore, the steps of executing the cross-road parking space scheduling of the urban road specifically include:

[0029] Urban roads with pcr<1 are identified as target urban roads;

[0030] Determine whether the target city road has PCR i >1 adjacent roads, where i is 1 to n nb A positive integer between nb The target city road meets the PCR i > the number of adjacent roads with 1;

[0031] When the target city road has PCR i >1 adjacent road, the pcr i The adjacent road with a value greater than 1 is determined as the dispatching road of the target city road;

[0032] At least one location-seeking vehicle on the target city road is dispatched to the dispatching road.

[0033] Furthermore, the step of dispatching at least one location-seeking vehicle on the target city road to the dispatching road specifically includes:

[0034] Calculate the number of vehicles to be dispatched on the target city roads:

[0035] Δscn = scn - apn;

[0036] Allocate available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle;

[0037] The available parking spaces of the target urban road are allocated.

[0038] Furthermore, before the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the method further includes:

[0039] Calculate the number of available parking spaces on the dispatch road:

[0040]

[0041] where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 number of available parking spaces on adjacent roads;

[0042] Compare the number of available parking spaces apn on the dispatching road dsp The size of the number of vehicles to be dispatched Δscn on the target city road;

[0043] When apn dsp ≥Δscn, the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle is performed.

[0044] Furthermore, the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle specifically includes:

[0045] An available parking space is obtained from each of the dispatched roads to construct a nearest parking space queue, and the number of available parking spaces in the nearest parking space queue is represented as apn nst ;

[0046] Determine the number of available parking spaces apn in the nearest parking space queue nst Is it less than or equal to the number of vehicles to be dispatched Δscn?

[0047] When apn nst When Δscn is less than Δscn, each available parking space in the nearest parking space queue is traversed to perform the following steps:

[0048] Determine the currently traversed available parking space in the nearest parking space queue as a second target available parking space;

[0049] Determining a second target vehicle that is closest to the second target available parking space in the position-seeking vehicle queue on the target urban road;

[0050] allocating the second target available parking space to the second target vehicle;

[0051] The second target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the second target available parking space is removed from the nearest parking space queue table.

[0052] Furthermore, after the step of moving the second target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and removing the second target available parking space from the nearest parking space queue list, the method further includes:

[0053] Determining whether the nearest parking space queue is empty;

[0054] When the nearest parking space queue is not empty, return to continue traversing the nearest parking space queue;

[0055] When the nearest parking space queue is empty, the process returns to the step of acquiring an available parking space from each of the scheduling roads to construct the nearest parking space queue.

[0056] Further, in determining the number of available parking spaces apn in the nearest parking space queue, nst After the step of determining whether the number of vehicles to be dispatched is less than or equal to the number of vehicles to be dispatched Δscn, the method further includes:

[0057] When apn nst >Δscn, calculate the distance d between each available parking space in the nearest parking space queue and each parking-seeking vehicle in the parking-seeking vehicle queue on the target urban road. jk , where j is from 1 to n ns A positive integer between t and k between 1 and n scn A positive integer between ns t is the number of available parking spaces in the nearest parking space queue, n scn is the number of vehicles in the vehicle queue on the target city road, d jk is the distance between the jth available parking space in the nearest parking space queue and the kth parking-seeking vehicle in the parking-seeking vehicle queue of the target urban road;

[0058] Determine the minimum Δscn d jk a corresponding fourth target available parking space and a fourth target vehicle;

[0059] allocating the fourth target available parking space to the fourth target vehicle;

[0060] The fourth target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the fourth target available parking space is removed from the nearest parking space queue list.

[0061] The present invention proposes an urban road smart parking system and a control method thereof. The urban road smart parking system includes a server, a sensing end and a client. The server includes a cloud server for running a background service program. The sensing end includes a parking space sensor and a first communication module. The client includes a positioning module, a navigation module, a second communication module and a display module. The cloud server is configured to obtain the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, calculate the ratio pcr of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road, and when pcr≥1, execute the allocation of available parking spaces on the urban road; when pcr<1, execute the cross-road parking space scheduling of the urban road, so as to safely and efficiently match vehicles seeking parking spaces with available parking spaces, and reduce the problem of road congestion or safety accidents caused by vehicles searching for available parking spaces. BRIEF DESCRIPTION OF THE DRAWINGS

[0062] Figure 1 is a schematic diagram of an urban road smart parking system provided by an embodiment of the present invention;

[0063] Figure 2 It is a flow chart of a control method of an urban road smart parking system provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0064] In order to more clearly understand the above-mentioned purpose, features and advantages of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be noted that the embodiments of the present application and the features in the embodiments can be combined with each other without conflict.

[0065] In the following description, many specific details are set forth to facilitate a full understanding of the present invention. However, the present invention may also be implemented in other ways different from those described herein. Therefore, the protection scope of the present invention is not limited to the specific embodiments disclosed below.

[0066] In the description of the present invention, the term "multiple" refers to two or more. Unless otherwise clearly defined, the orientation or positional relationship indicated by the terms "upper", "lower", etc. is based on the orientation or positional relationship shown in the drawings. It is only for the convenience of describing the present invention and simplifying the description, and does not indicate or imply that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation. Therefore, it cannot be understood as a limitation of the present invention. The terms "connection", "installation", "fixation", etc. should be understood in a broad sense. For example, "connection" can be a fixed connection, a detachable connection, or an integral connection; it can be directly connected or indirectly connected through an intermediate medium. For ordinary technicians in this field, the specific meanings of the above terms in the present invention can be understood according to the specific circumstances. In addition, the terms "first", "second", etc. are only used for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Therefore, the features defined as "first", "second", etc. can explicitly or implicitly include one or more of the features. In the description of the present invention, unless otherwise specified, the meaning of "multiple" is two or more.

[0067] In the description of this specification, the description of the terms "one embodiment", "some implementations", "specific embodiments", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

[0068] An urban road smart parking system and a control method thereof provided according to some embodiments of the present invention will be described below with reference to the accompanying drawings.

[0069] like Figure 1 As shown, the first aspect of the present invention proposes an urban road smart parking system, including a server, a sensing end and a client, the server including a cloud server for running a background service program, the sensing end including a parking space sensor arranged in each parking space on the urban road for sensing the parking space status and a first communication module for communicating with the cloud server, the client including a positioning module for obtaining the real-time position of a vehicle corresponding to the client, a navigation module for providing a route navigation service according to the positioning information of the client, a second communication module for communicating with the cloud server and a display module for displaying available parking space information

[0070] Specifically, the parking space sensor and the first communication module in the sensing end are pre-buried under the ground of the parking space. The parking space sensor is a geomagnetic sensor, which identifies the occupancy status of the parking space based on the induction of magnetic field changes on the parking space. The first communication module is an NB-IoT (Narrow Band-Internet of Things) communication module. The parking space sensor is connected to the first communication module, and the occupancy status of the parking space is sent to the cloud server through the first communication module. According to the occupancy status information uploaded by the parking space sensor, the cloud server identifies the parking space as an available parking space or an unavailable parking space according to the occupancy status of the corresponding parking space. The available parking space is a parking space that is currently unoccupied and can be used to park vehicles with parking needs, while the unavailable parking space is a parking space that is currently occupied and has vehicles parked thereon.

[0071] like Figure 2 As shown, the cloud server is configured as:

[0072] Acquire the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, wherein the number of available parking spaces apn refers to the roadside parking spaces on the urban road that are currently unoccupied, and the number of vehicles seeking parking spaces scn refers to the number of vehicles on the urban road that have sent parking requests to the cloud server;

[0073] Calculate the ratio of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road:

[0074]

[0075] When pcr≥1, allocating available parking spaces on the urban road is performed;

[0076] When pcr<1, cross-road parking space scheduling of the urban road is performed.

[0077] In the step of obtaining the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the sensing end sends parking space occupancy status change information to the server end when the occupancy status of a parking space changes, so that the server end stores the occupancy status data of each parking space in the database in real time, that is, the cloud server can obtain the number of available parking spaces apn on each urban road from the database.

[0078] In the technical solution of the present invention, the ratio pcr of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road is used to represent the abundance of available parking spaces on urban roads, and corresponding available parking space allocation strategies are executed on different urban roads according to the abundance of available parking spaces on urban roads.

[0079] Furthermore, before the step of obtaining the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the cloud server is configured as follows:

[0080] receiving a parking request sent by a client, wherein the parking request includes location data of a destination of a vehicle corresponding to the client;

[0081] Determine the urban road where the destination of the vehicle is located according to the location data;

[0082] Determine the vehicle corresponding to the client as a location-seeking vehicle;

[0083] The identity of the vehicle corresponding to the client and the number corresponding to the urban road are associated and saved in a database.

[0084] In the technical solution of the present invention, the cloud server determines the vehicle corresponding to the client as a location-seeking vehicle according to the parking request sent by the client. In one embodiment of the present invention, the step of determining the vehicle corresponding to the client as a location-seeking vehicle specifically includes:

[0085] When a vehicle is driving on the road, the user clicks the "I want to park" button on the client program, triggering the client to send a parking request instruction to the cloud server;

[0086] When the cloud server receives the parking request instruction, the corresponding vehicle is determined as a location-seeking vehicle.

[0087] In the technical solution of this implementation, when the user clicks the "I want to park" button, the real-time position of the vehicle is acquired through the positioning module, and the real-time position of the vehicle is determined as the position of the destination of the vehicle.

[0088] Furthermore, the control method of the urban road intelligent parking system also includes a step of removing the positioning vehicle, and the step of removing the positioning vehicle specifically includes:

[0089] When the client program receives the user's operation of clicking the cancel parking button, the client sends an instruction to cancel the parking request to the cloud server, so that the cloud server removes the corresponding vehicle from the positioning vehicle queue when receiving the instruction to cancel the parking request.

[0090] In another embodiment of the present invention, the step of determining the vehicle corresponding to the client as a location-seeking vehicle specifically includes:

[0091] When a vehicle is navigating a route through the navigation module, the location of the vehicle's destination is obtained;

[0092] The ground positioning module monitors the real-time position of the vehicle;

[0093] predicting an arrival time of the vehicle based on the location of the destination and the real-time location of the vehicle;

[0094] Calculate the difference between the current time and the predicted arrival time;

[0095] When the difference is less than a preset value, a parking request is sent to the cloud server.

[0096] In the step of acquiring the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the cloud server acquires the number of vehicles seeking parking spaces scn from a database.

[0097] The step of associating the identity of the vehicle corresponding to the client with the number corresponding to the city road and saving it in the database specifically includes associating the identity of the vehicle corresponding to the client, the positioning data and the number corresponding to the city road and saving them in the vehicle search list of the database. After the step of associating the identity of the vehicle corresponding to the client with the number corresponding to the city road and saving them in the database, the cloud server updates the positioning data of the corresponding vehicle in the vehicle search list in real time according to the positioning data reported by the client.

[0098] After executing the step of allocating available parking spaces on the urban roads or executing the step of scheduling cross-road parking spaces on the urban roads, the cloud server allocates an available parking space to the positioning vehicle and then removes the positioning vehicle from the positioning vehicle list in the database.

[0099] Furthermore, in the step of performing the allocation of available parking spaces on the urban roads, the cloud server is configured to:

[0100] Constructing a parking-seeking vehicle queue, an allocated parking space vehicle queue, an available parking space queue, and an allocated parking space queue corresponding to each urban road;

[0101] Traverse each vehicle in the position-finding vehicle queue to perform the following steps:

[0102] Determine the vehicle currently traversed in the position-seeking vehicle queue as the first target vehicle;

[0103] Determine a first target available parking space closest to the first target vehicle in the available parking space queue;

[0104] allocating the first target available parking space to the first target vehicle;

[0105] The first target vehicle is moved from the position-seeking vehicle queue to the allocated parking space vehicle queue, and the first target available parking space is moved from the available parking space queue to the allocated parking space queue.

[0106] After the steps of moving the first target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and moving the first target available parking space from the available parking space queue to the allocated parking space queue, the cloud server is configured to:

[0107] Receiving a request for canceling parking sent by the client;

[0108] Removing the vehicle corresponding to the client from the vehicle queue of the allocated parking space;

[0109] The parking space allocated to the vehicle corresponding to the client is moved from the allocated parking space queue to the available parking space queue.

[0110] After the step of allocating the first target available parking space to the target vehicle, the client on the first target vehicle displays the information of the available parking space through its display module.

[0111] Further, after the step of allocating the first target available parking space to the first target vehicle, the cloud server is configured to:

[0112] monitoring a change in an occupancy state of the first target available parking space through a parking space sensor of the first target available parking space;

[0113] When the occupation state of the first target available parking space changes from an unoccupied state to an occupied state, acquiring the positioning information of the first target vehicle through the positioning module;

[0114] determining whether the first target vehicle is located in the first target available parking space according to the positioning information of the first target vehicle;

[0115] When the first target vehicle is located in the first target available parking space, removing the first target vehicle from the allocated parking space vehicle queue and removing the first target available parking space from the allocated parking space queue;

[0116] When the first target vehicle is located at a different position from the first target available parking space, the first target vehicle is moved from the allocated parking space vehicle queue to the position-seeking vehicle queue, and the first target available parking space is removed from the allocated parking space queue.

[0117] Furthermore, in the step of executing the cross-road parking space scheduling of the urban road, the cloud server is configured to:

[0118] Urban roads with pcr<1 are identified as target urban roads;

[0119] Determine whether the target city road has PCR i >1 adjacent roads, where i is 1 to n nb A positive integer between nb The target city road meets the PCR i > the number of adjacent roads with 1;

[0120] When the target city road has PCR i >1 adjacent road, the pcr i The adjacent road with a value greater than 1 is determined as the dispatching road of the target city road;

[0121] At least one location-seeking vehicle on the target city road is dispatched to the dispatching road.

[0122] Further, in determining whether the target city road has PCR i In the step of adjacent roads>1, the cloud server is configured as follows:

[0123] Determine an urban road that has an intersection with the target urban road as an adjacent road to the target urban road;

[0124] Calculate the number of available parking spaces apn for each adjacent road of the target city road i and the number of vehicles to be located scn i Ratio of:

[0125]

[0126] where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 Number of available parking spaces on adjacent roads.

[0127] In determining whether the target city road has PCR i After the step of adjacent roads of >1, the cloud server is configured as follows:

[0128] When the target city road does not exist PCR i>1, a reminder message of insufficient roadside parking spaces on the target city road is pushed to vehicles in the positioning vehicle queue of the target city road, so that the positioning vehicle can change the parking plan after receiving the reminder message of insufficient roadside parking spaces on the target city road, for example, find other types of parking lots nearby, such as commercial parking lots.

[0129] Furthermore, in the step of dispatching at least one location-seeking vehicle on the target city road to the dispatching road, the cloud server is configured to:

[0130] Calculate the number of vehicles to be dispatched on the target city roads:

[0131] Δscn=scn―apn;

[0132] Allocate available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle;

[0133] The available parking spaces of the target urban road are allocated.

[0134] After the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the number of position-seeking vehicles in the position-seeking vehicle queue of the target city road is the same as the number of available parking spaces in the available parking space queue of the target city road, that is, scn=apn. At this time, one available parking space can be allocated to each position-seeking vehicle on the target city road. In the step of executing the available parking space allocation step of the target city road, the cloud server is configured as follows:

[0135] Traverse each vehicle in the position-seeking vehicle queue of the target city road to perform the following steps:

[0136] Determine the vehicle currently traversed in the position-seeking vehicle queue as a third target vehicle;

[0137] Determining a third target available parking space closest to the third target vehicle in the available parking space queue;

[0138] allocating the third target available parking space to the third target vehicle;

[0139] The third target vehicle is moved from the position-seeking vehicle queue to the allocated parking space vehicle queue, and the third target available parking space is moved from the available parking space queue to the allocated parking space queue.

[0140] Furthermore, before the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the cloud server is configured to:

[0141] Calculate the number of available parking spaces on the dispatch road:

[0142]

[0143] where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 Number of available parking spaces on adjacent roads;

[0144] Compare the number of available parking spaces apn on the dispatching road dsp The size of the number of vehicles to be dispatched Δscn on the target city road;

[0145] When apn dsp ≥Δscn, the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle is performed.

[0146] In the technical solution of the above implementation, the number of vehicles scn seeking positions on the i-th adjacent road of the target urban road that satisfies pcr>1 is i and the number of available parking spaces apn of the i-th adjacent road of the target urban road that satisfies pcr>1 i These are real-time quantities read from the database.

[0147] In the technical solutions of some embodiments of the present invention, when apn dsp <Δscn, a reminder message of insufficient roadside parking spaces on the target city road is pushed to the vehicles in the positioning vehicle queue of the target city road, so that the positioning vehicles can change the parking plan after receiving the reminder message of insufficient roadside parking spaces on the target city road, for example, find other types of parking lots nearby, such as commercial parking lots.

[0148] Furthermore, in the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the cloud server is configured to:

[0149] An available parking space is obtained from each of the dispatched roads to construct a nearest parking space queue, and the number of available parking spaces in the nearest parking space queue is represented as apn nst ;

[0150] Determine the number of available parking spaces apn in the nearest parking space queue nst Is it less than or equal to the number of vehicles to be dispatched Δscn?

[0151] When apnnst When Δscn is less than Δscn, each available parking space in the nearest parking space queue is traversed to perform the following steps:

[0152] Determine the currently traversed available parking space in the nearest parking space queue as a second target available parking space;

[0153] Determining a second target vehicle that is closest to the second target available parking space in the position-seeking vehicle queue on the target urban road;

[0154] allocating the second target available parking space to the second target vehicle;

[0155] The second target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the second target available parking space is removed from the nearest parking space queue table.

[0156] In the technical solution of the above embodiment, the number of available parking spaces in the nearest parking space queue apn nst The same as the number of the scheduling roads.

[0157] In the step of moving the second target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and removing the second target available parking space from the nearest parking space queue list, the cloud server is configured to:

[0158] Moving the second target available parking space from the available parking space queue corresponding to the scheduling road to the motion allocated parking space queue;

[0159] Calculate the number of available parking spaces scn on the dispatching road i and the number of vehicles to be located i Ratio pcr i ;

[0160] When the dispatch road PCR i When ≤1, the scheduling road is determined as a non-scheduling road.

[0161] Specifically, in the i >1 as the dispatch road of the target city road, establishing the dispatch road queue of the target city road, and determining the dispatch road as a non-dispatching road is specifically as follows: i The dispatch roads with a value of ≤1 are removed from the dispatch road queue of the target city roads.

[0162] Further, after the step of moving the second target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and removing the second target available parking space from the nearest parking space queue list, the cloud server is configured to:

[0163] Determining whether the nearest parking space queue is empty;

[0164] When the nearest parking space queue is not empty, return to continue traversing the nearest parking space queue;

[0165] When the nearest parking space queue is empty, the process returns to the step of acquiring an available parking space from each of the scheduling roads to construct the nearest parking space queue.

[0166] In the technical solution of the above-mentioned implementation mode, after each available parking space in the nearest parking space queue is allocated to a vehicle seeking a space, it will be removed from the nearest parking space queue. Therefore, the available parking spaces in the nearest parking space queue will become fewer and fewer until all are allocated. When the available parking spaces in the nearest parking space queue are allocated, the nearest parking space queue is an empty queue, and the process returns to execute the step of obtaining an available parking space from each of the scheduling roads to construct the nearest parking space queue, so as to generate a new nearest parking space queue.

[0167] In the technical solutions of some embodiments of the present invention, in returning to execute the step of acquiring an available parking space from each of the scheduling roads to construct a nearest parking space queue, the cloud server is configured as follows:

[0168] An available parking space is obtained from each scheduling road in the scheduling road queue of the target city road to construct the nearest parking space queue. When any scheduling road has been removed from the scheduling road queue of the target city road, the scheduling road has been configured as a non-scheduling road, and no available parking space is obtained from the city road to construct the nearest parking space queue.

[0169] Further, in determining the number of available parking spaces apn in the nearest parking space queue, nst After the step of determining whether the number of vehicles to be dispatched is less than or equal to Δscn, the cloud server is configured as follows:

[0170] When apn nst >Δscn, calculate the distance d between each available parking space in the nearest parking space queue and each parking-seeking vehicle in the parking-seeking vehicle queue on the target urban road. jk , where j is from 1 to n ns A positive integer between t and k between 1 and n scn A positive integer between nstis the number of available parking spaces in the nearest parking space queue, n scn is the number of vehicles in the vehicle queue on the target city road, d jk is the distance between the jth available parking space in the nearest parking space queue and the kth parking-seeking vehicle in the parking-seeking vehicle queue of the target urban road;

[0171] Determine the minimum Δscn d jk a corresponding fourth target available parking space and a fourth target vehicle;

[0172] allocating the fourth target available parking space to the fourth target vehicle;

[0173] The fourth target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the fourth target available parking space is removed from the nearest parking space queue list.

[0174] In the technical solution of the above-mentioned implementation mode, when the number of available parking spaces apn in the nearest parking space queue is nst When the distance d between each available parking space in the nearest parking space queue and each position-seeking vehicle in the position-seeking vehicle queue of the target urban road is calculated, the distance d between each available parking space in the nearest parking space queue and each position-seeking vehicle in the position-seeking vehicle queue of the target urban road is calculated. jk In the steps, we get n nst ×n scn The distance value d jk , select the smallest Δscn d jk To perform available parking space allocation so that each parking-seeking vehicle can be assigned to the available parking space on the nearest dispatching road.

[0175] like Figure 2 As shown, the second aspect of the present invention proposes a control method for an urban road smart parking system, comprising:

[0176] Acquire the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, wherein the number of available parking spaces apn refers to the roadside parking spaces on the urban road that are currently unoccupied, and the number of vehicles seeking parking spaces scn refers to the number of vehicles on the urban road that have sent parking requests to the cloud server;

[0177] Calculate the ratio of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road:

[0178]

[0179] When pcr≥1, allocating available parking spaces on the urban road is performed;

[0180] When pcr<1, cross-road parking space scheduling of the urban road is performed.

[0181] In the step of obtaining the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the sensing end sends parking space occupancy status change information to the server end when the occupancy status of a parking space changes, so that the server end stores the occupancy status data of each parking space in the database in real time, that is, the cloud server can obtain the number of available parking spaces apn on each urban road from the database.

[0182] In the technical solution of the present invention, the ratio pcr of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road is used to represent the abundance of available parking spaces on urban roads, and corresponding available parking space allocation strategies are executed on different urban roads according to the abundance of available parking spaces on urban roads.

[0183] Furthermore, before the step of obtaining the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the method further includes:

[0184] receiving a parking request sent by a client, wherein the parking request includes location data of a destination of a vehicle corresponding to the client;

[0185] Determine the urban road where the destination of the vehicle is located according to the location data;

[0186] Determine the vehicle corresponding to the client as a location-seeking vehicle;

[0187] The identity of the vehicle corresponding to the client and the number corresponding to the urban road are associated and saved in a database.

[0188] In the technical solution of the present invention, the cloud server determines the vehicle corresponding to the client as a location-seeking vehicle according to the parking request sent by the client. In one embodiment of the present invention, the step of determining the vehicle corresponding to the client as a location-seeking vehicle specifically includes:

[0189] When a vehicle is driving on the road, the user clicks the "I want to park" button on the client program, triggering the client to send a parking request instruction to the cloud server;

[0190] When the cloud server receives the parking request instruction, the corresponding vehicle is determined as a location-seeking vehicle.

[0191] In the technical solution of this implementation, when the user clicks the "I want to park" button, the real-time position of the vehicle is acquired through the positioning module, and the real-time position of the vehicle is determined as the position of the destination of the vehicle.

[0192] Furthermore, the control method of the urban road intelligent parking system also includes a step of removing the positioning vehicle, and the step of removing the positioning vehicle specifically includes:

[0193] When the client program receives the user's operation of clicking the cancel parking button, the client sends an instruction to cancel the parking request to the cloud server, so that the cloud server removes the corresponding vehicle from the positioning vehicle queue when receiving the instruction to cancel the parking request.

[0194] In another embodiment of the present invention, the step of determining the vehicle corresponding to the client as a location-seeking vehicle specifically includes:

[0195] When a vehicle is navigating a route through the navigation module, the location of the vehicle's destination is obtained;

[0196] The ground positioning module monitors the real-time position of the vehicle;

[0197] predicting an arrival time of the vehicle based on the location of the destination and the real-time location of the vehicle;

[0198] Calculate the difference between the current time and the predicted arrival time;

[0199] When the difference is less than a preset value, a parking request is sent to the cloud server.

[0200] In the step of acquiring the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the cloud server acquires the number of vehicles seeking parking spaces scn from a database.

[0201] The step of associating the identity of the vehicle corresponding to the client with the number corresponding to the city road and saving it in the database specifically includes associating the identity of the vehicle corresponding to the client, the positioning data and the number corresponding to the city road and saving them in the vehicle search list of the database. After the step of associating the identity of the vehicle corresponding to the client with the number corresponding to the city road and saving them in the database, the cloud server updates the positioning data of the corresponding vehicle in the vehicle search list in real time according to the positioning data reported by the client.

[0202] After executing the step of allocating available parking spaces on the urban roads or executing the step of scheduling cross-road parking spaces on the urban roads, the cloud server allocates an available parking space to the positioning vehicle and then removes the positioning vehicle from the positioning vehicle list in the database.

[0203] Furthermore, the steps of allocating available parking spaces on the urban roads specifically include:

[0204] Constructing a parking-seeking vehicle queue, an allocated parking space vehicle queue, an available parking space queue, and an allocated parking space queue corresponding to each urban road;

[0205] Traverse each vehicle in the position-finding vehicle queue to perform the following steps:

[0206] Determine the vehicle currently traversed in the position-seeking vehicle queue as the first target vehicle;

[0207] Determine a first target available parking space closest to the first target vehicle in the available parking space queue;

[0208] allocating the first target available parking space to the first target vehicle;

[0209] The first target vehicle is moved from the position-seeking vehicle queue to the allocated parking space vehicle queue, and the first target available parking space is moved from the available parking space queue to the allocated parking space queue.

[0210] After the step of moving the first target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and moving the first target available parking space from the available parking space queue to the allocated parking space queue, the method further includes:

[0211] Receiving a request for canceling parking sent by the client;

[0212] Removing the vehicle corresponding to the client from the vehicle queue of the allocated parking space;

[0213] The parking space allocated to the vehicle corresponding to the client is moved from the allocated parking space queue to the available parking space queue.

[0214] After the step of allocating the first target available parking space to the target vehicle, the client on the first target vehicle displays the information of the available parking space through its display module.

[0215] Further, after the step of allocating the first target available parking space to the first target vehicle, the method further includes:

[0216] monitoring a change in an occupancy state of the first target available parking space through a parking space sensor of the first target available parking space;

[0217] When the occupation state of the first target available parking space changes from an unoccupied state to an occupied state, acquiring the positioning information of the first target vehicle through the positioning module;

[0218] determining whether the first target vehicle is located in the first target available parking space according to the positioning information of the first target vehicle;

[0219] When the first target vehicle is located in the first target available parking space, removing the first target vehicle from the allocated parking space vehicle queue and removing the first target available parking space from the allocated parking space queue;

[0220] When the first target vehicle is located at a different position from the first target available parking space, the first target vehicle is moved from the allocated parking space vehicle queue to the position-seeking vehicle queue, and the first target available parking space is removed from the allocated parking space queue.

[0221] Furthermore, the steps of executing the cross-road parking space scheduling of the urban road specifically include:

[0222] Urban roads with pcr<1 are identified as target urban roads;

[0223] Determine whether the target city road has PCR i >1 adjacent roads, where i is 1 to n nb A positive integer between nb The target city road meets the PCR i > the number of adjacent roads with 1;

[0224] When the target city road has PCR i >1 adjacent road, the pcr i The adjacent road with a value greater than 1 is determined as the dispatching road of the target city road;

[0225] At least one location-seeking vehicle on the target city road is dispatched to the dispatching road.

[0226] Further, it is determined whether the target city road has PCR i The steps for adjacent roads with a value greater than 1 specifically include:

[0227] Determine an urban road that has an intersection with the target urban road as an adjacent road to the target urban road;

[0228] Calculate the number of available parking spaces apn for each adjacent road of the target city road i and the number of vehicles to be located scn i Ratio of:

[0229]

[0230] where scni The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i The number of available parking spaces on adjacent roads >1.

[0231] In determining whether the target city road has PCR i After the step of adjacent roads of >1, it also includes:

[0232] When the target city road does not exist PCR i >1, a reminder message of insufficient roadside parking spaces on the target city road is pushed to vehicles in the positioning vehicle queue of the target city road, so that the positioning vehicle changes its parking plan after receiving the reminder message of insufficient roadside parking spaces on the target city road, for example, looking for other types of parking lots nearby, such as commercial parking lots.

[0233] Furthermore, the step of dispatching at least one location-seeking vehicle on the target city road to the dispatching road specifically includes:

[0234] Calculate the number of vehicles to be dispatched on the target city roads:

[0235] Δscn = scn - apn;

[0236] Allocate available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle;

[0237] The available parking spaces of the target urban road are allocated.

[0238] After the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the number of position-seeking vehicles in the position-seeking vehicle queue of the target city road is the same as the number of available parking spaces in the available parking space queue of the target city road, that is, scn=apn. At this time, one available parking space can be allocated to each position-seeking vehicle on the target city road, and the step of allocating available parking spaces on the target city road specifically includes:

[0239] Traverse each vehicle in the position-seeking vehicle queue of the target city road to perform the following steps:

[0240] Determine the vehicle currently traversed in the position-seeking vehicle queue as a third target vehicle;

[0241] Determining a third target available parking space closest to the third target vehicle in the available parking space queue;

[0242] allocating the third target available parking space to the third target vehicle;

[0243] The third target vehicle is moved from the position-seeking vehicle queue to the allocated parking space vehicle queue, and the third target available parking space is moved from the available parking space queue to the allocated parking space queue.

[0244] Furthermore, before the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the method further includes:

[0245] Calculate the number of available parking spaces on the dispatch road:

[0246]

[0247] where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 number of available parking spaces on adjacent roads;

[0248] Compare the number of available parking spaces apn on the dispatching road dsp The size of the number of vehicles to be dispatched Δscn on the target city road;

[0249] When apn dsp ≥Δscn, the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle is performed.

[0250] In the technical solution of the above implementation, the number of vehicles scn seeking positions on the i-th adjacent road of the target urban road that satisfies pcr>1 is i and the number of available parking spaces apn of the i-th adjacent road of the target urban road that satisfies pcr>1 i These are real-time quantities read from the database.

[0251] In the technical solutions of some embodiments of the present invention, when apn dsp <Δscn, a reminder message of insufficient roadside parking spaces on the target city road is pushed to the vehicles in the positioning vehicle queue of the target city road, so that the positioning vehicles can change the parking plan after receiving the reminder message of insufficient roadside parking spaces on the target city road, for example, find other types of parking lots nearby, such as commercial parking lots.

[0252] Furthermore, the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle specifically includes:

[0253] An available parking space is obtained from each of the dispatched roads to construct a nearest parking space queue, and the number of available parking spaces in the nearest parking space queue is represented as apn nst ;

[0254] Determine the number of available parking spaces apn in the nearest parking space queue nst Is it less than or equal to the number of vehicles to be dispatched Δscn?

[0255] When apn nst When Δscn is less than Δscn, each available parking space in the nearest parking space queue is traversed to perform the following steps:

[0256] Determine the currently traversed available parking space in the nearest parking space queue as a second target available parking space;

[0257] Determining a second target vehicle that is closest to the second target available parking space in the position-seeking vehicle queue on the target urban road;

[0258] allocating the second target available parking space to the second target vehicle;

[0259] The second target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the second target available parking space is removed from the nearest parking space queue table.

[0260] In the technical solution of the above embodiment, the number of available parking spaces in the nearest parking space queue apn nst The same as the number of the scheduling roads.

[0261] In the step of moving the second target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and removing the second target available parking space from the nearest parking space queue table, the method further includes:

[0262] Moving the second target available parking space from the available parking space queue corresponding to the scheduling road to the motion allocated parking space queue;

[0263] Calculate the number of available parking spaces scn on the dispatching road i and the number of vehicles to be located i Ratio pcr i ;

[0264] When the dispatch road PCR i When ≤1, the scheduling road is determined as a non-scheduling road.

[0265] Specifically, in the i >1 as the dispatch road of the target city road, establishing the dispatch road queue of the target city road, and determining the dispatch road as a non-dispatching road is specifically as follows: i The dispatch roads with a value of ≤1 are removed from the dispatch road queue of the target city roads.

[0266] Furthermore, after the step of moving the second target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and removing the second target available parking space from the nearest parking space queue list, the method further includes:

[0267] Determining whether the nearest parking space queue is empty;

[0268] When the nearest parking space queue is not empty, return to continue traversing the nearest parking space queue;

[0269] When the nearest parking space queue is empty, the process returns to the step of acquiring an available parking space from each of the scheduling roads to construct the nearest parking space queue.

[0270] In the technical solution of the above-mentioned implementation mode, after each available parking space in the nearest parking space queue is allocated to a vehicle seeking a space, it will be removed from the nearest parking space queue. Therefore, the available parking spaces in the nearest parking space queue will become fewer and fewer until all are allocated. When the available parking spaces in the nearest parking space queue are allocated, the nearest parking space queue is an empty queue, and the process returns to execute the step of obtaining an available parking space from each of the scheduling roads to construct the nearest parking space queue, so as to generate a new nearest parking space queue.

[0271] In the technical solutions of some embodiments of the present invention, returning to execute the step of acquiring an available parking space from each of the scheduling roads to construct the nearest parking space queue specifically includes:

[0272] An available parking space is obtained from each scheduling road in the scheduling road queue of the target city road to construct the nearest parking space queue. When any scheduling road has been removed from the scheduling road queue of the target city road, the scheduling road has been configured as a non-scheduling road, and no available parking space is obtained from the city road to construct the nearest parking space queue.

[0273] Further, in determining the number of available parking spaces apn in the nearest parking space queue, nst After the step of determining whether the number of vehicles to be dispatched is less than or equal to the number of vehicles to be dispatched Δscn, the method further includes:

[0274] When apn nst>Δscn, calculate the distance d between each available parking space in the nearest parking space queue and each parking-seeking vehicle in the parking-seeking vehicle queue on the target urban road. jk , where j is from 1 to n nst A positive integer between 1 and n. scn A positive integer between nst is the number of available parking spaces in the nearest parking space queue, n scn is the number of vehicles in the vehicle queue on the target city road, d jk is the distance between the jth available parking space in the nearest parking space queue and the kth parking-seeking vehicle in the parking-seeking vehicle queue of the target urban road;

[0275] Determine the minimum Δscn d jk a corresponding fourth target available parking space and a fourth target vehicle;

[0276] allocating the fourth target available parking space to the fourth target vehicle;

[0277] The fourth target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the fourth target available parking space is removed from the nearest parking space queue list.

[0278] In the technical solution of the above-mentioned implementation mode, when the number of available parking spaces apn in the nearest parking space queue is nst When the distance d between each available parking space in the nearest parking space queue and each position-seeking vehicle in the position-seeking vehicle queue of the target urban road is calculated, the distance d between each available parking space in the nearest parking space queue and each position-seeking vehicle in the position-seeking vehicle queue of the target urban road is calculated. jk In the steps, we get n nst ×n scn The distance value d jk , select the smallest Δscn d jk To perform available parking space allocation so that each parking-seeking vehicle can be assigned to the available parking space on the nearest dispatching road.

[0279] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the statement "comprise a ..." do not exclude the presence of other identical elements in the process, method, article or device including the elements.

[0280] According to the embodiments of the present invention as described above, these embodiments do not describe all the details in detail, nor do they limit the invention to the specific embodiments described. Obviously, many modifications and changes can be made based on the above description. This specification selects and specifically describes these embodiments in order to better explain the principles and practical applications of the present invention, so that those skilled in the art can make good use of the present invention and the modified use based on the present invention. The present invention is limited only by the claims and their full scope and equivalents.

Claims

1. An urban road intelligent parking system, characterized in that: The system comprises a server, a sensing end and a client, wherein the server comprises a cloud server for running a background service program, the sensing end comprises a parking space sensor arranged in each parking space on an urban road for sensing the parking space status and a first communication module for communicating with the cloud server, the client comprises a positioning module for obtaining the real-time position of a vehicle corresponding to the client, a navigation module for providing a route navigation service according to the positioning information of the client, a second communication module for communicating with the cloud server and a display module for displaying available parking space information, and the cloud server is configured as follows: Acquire the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, wherein the number of available parking spaces apn refers to the roadside parking spaces on the urban road that are currently unoccupied, and the number of vehicles seeking parking spaces scn refers to the number of vehicles on the urban road that have sent parking requests to the cloud server; Calculate the ratio of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road: When pcr≥1, allocating available parking spaces on the urban road is performed; When pcr<1, the cross-road parking space scheduling of the urban road is performed; In the step of performing the allocation of available parking spaces on the urban road, the cloud server is configured to: Constructing a parking-seeking vehicle queue, an allocated parking space vehicle queue, an available parking space queue, and an allocated parking space queue corresponding to each urban road; Traverse each vehicle in the position-finding vehicle queue to perform the following steps: Determine the vehicle currently traversed in the position-seeking vehicle queue as the first target vehicle; Determine a first target available parking space closest to the first target vehicle in the available parking space queue; allocating the first target available parking space to the first target vehicle; Moving the first target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue, and moving the first target available parking space from the available parking space queue to the allocated parking space queue; In the step of executing the cross-road parking space scheduling of the urban road, the cloud server is configured to: Urban roads with pcr<1 are identified as target urban roads; Determine whether the target city road has PCR i >1 adjacent road, where i is 1 to n nb A positive integer between nb The target city road meets the PCR i >1 number of adjacent roads; In determining whether the target city road has PCR i In the step of adjacent roads>1, the cloud server is configured as: Determine an urban road that has an intersection with the target urban road as an adjacent road to the target urban road; Calculate the number of available parking spaces apn for each adjacent road of the target city road i and the number of vehicles to be located scn i Ratio of: where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 Number of available parking spaces on adjacent roads; When the target city road has PCR i >1 adjacent road, the pcr i >1 adjacent road is determined as the dispatching road of the target city road; Dispatching at least one location-seeking vehicle on the target city road to the dispatching road; In the step of dispatching at least one location-seeking vehicle on the target city road to the dispatching road, the cloud server is configured to: Calculate the number of vehicles to be dispatched on the target city roads: Δscn=scn―apn; Allocate available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle; Execute allocation of available parking spaces on the target urban roads; Before the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the cloud server is configured to: Calculate the number of available parking spaces on the dispatch road: where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 Number of available parking spaces on adjacent roads; Compare the number of available parking spaces apn on the dispatching road dsp The size of the number of vehicles to be dispatched Δscn on the target city road; When apn dsp ≥Δscn, executing the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle; In the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the cloud server is configured to: An available parking space is obtained from each of the dispatching roads to construct a nearest parking space queue, and the number of available parking spaces in the nearest parking space queue is represented as apn nst ; Determine the number of available parking spaces apn in the nearest parking space queue nst Is it less than or equal to the number of vehicles to be dispatched Δscn? When the APN nst <Δscn, traverse each available parking space in the nearest parking space queue to perform the following steps: Determine the currently traversed available parking space in the nearest parking space queue as a second target available parking space; Determining a second target vehicle that is closest to the second target available parking space in the position-seeking vehicle queue on the target urban road; allocating the second target available parking space to the second target vehicle; The second target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the second target available parking space is removed from the nearest parking space queue table.

2. A control method for an urban road intelligent parking system, characterized in that: include: Acquire the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, wherein the number of available parking spaces apn refers to the roadside parking spaces on the urban road that are currently unoccupied, and the number of vehicles seeking parking spaces scn refers to the number of vehicles on the urban road that have sent parking requests to the cloud server; Calculate the ratio of the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road: When pcr≥1, allocating available parking spaces on the urban road is performed; When pcr<1, the cross-road parking space scheduling of the urban road is performed; The steps of allocating available parking spaces on the urban roads specifically include: Constructing a parking-seeking vehicle queue, an allocated parking space vehicle queue, an available parking space queue, and an allocated parking space queue corresponding to each urban road; Traverse each vehicle in the position-finding vehicle queue to perform the following steps: Determine the vehicle currently traversed in the position-seeking vehicle queue as the first target vehicle; Determine a first target available parking space closest to the first target vehicle in the available parking space queue; allocating the first target available parking space to the first target vehicle; Moving the first target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue, and moving the first target available parking space from the available parking space queue to the allocated parking space queue; The steps of executing the cross-road parking space scheduling of the urban road specifically include: Urban roads with pcr<1 are identified as target urban roads; Determine whether the target city road has PCR i >1 adjacent road, where i is 1 to n nb A positive integer between nb The target city road meets the PCR i >1 number of adjacent roads; Determine whether the target city road has PCR i The steps for adjacent roads >1 specifically include: Determine an urban road that has an intersection with the target urban road as an adjacent road to the target urban road; Calculate the number of available parking spaces apn for each adjacent road of the target city road i and the number of vehicles to be located scn i Ratio of: where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 Number of available parking spaces on adjacent roads; When the target city road has PCR i >1 adjacent road, the pcr i >1 adjacent road is determined as the dispatching road of the target city road; Dispatching at least one location-seeking vehicle on the target city road to the dispatching road; The step of dispatching at least one location-seeking vehicle on the target city road to the dispatching road specifically includes: Calculate the number of vehicles to be dispatched on the target city roads: Δscn=scn―apn; Allocate available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle; Execute allocation of available parking spaces on the target urban roads; Before the step of allocating the available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle, the method further includes: Calculate the number of available parking spaces on the dispatch road: where scn i The i-th road in the target city satisfies the pcr i >1 The number of vehicles seeking position on adjacent roads, apn i The i-th road in the target city satisfies the pcr i >1 Number of available parking spaces on adjacent roads; Compare the number of available parking spaces apn on the dispatching road dsp The size of the number of vehicles to be dispatched Δscn on the target city road; When apn dsp ≥Δscn, executing the step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle; The step of allocating available parking spaces on the dispatching road that match the number of vehicles to be dispatched to the position-seeking vehicle specifically includes: An available parking space is obtained from each of the dispatching roads to construct a nearest parking space queue, and the number of available parking spaces in the nearest parking space queue is represented as apn nst ; Determine the number of available parking spaces apn in the nearest parking space queue nst Is it less than or equal to the number of vehicles to be dispatched Δscn? When the APN nst <Δscn, traverse each available parking space in the nearest parking space queue to perform the following steps: Determine the currently traversed available parking space in the nearest parking space queue as a second target available parking space; Determining a second target vehicle that is closest to the second target available parking space in the position-seeking vehicle queue on the target urban road; allocating the second target available parking space to the second target vehicle; The second target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the second target available parking space is removed from the nearest parking space queue table.

3. The control method of the urban road intelligent parking system according to claim 2 is characterized in that: Before the step of obtaining the number of available parking spaces apn and the number of vehicles seeking parking spaces scn on each urban road in real time, the method further includes: receiving a parking request sent by a client, wherein the parking request includes location data of a destination of a vehicle corresponding to the client; Determine the urban road where the destination of the vehicle is located according to the location data; Determine the vehicle corresponding to the client as a location-seeking vehicle; The identity of the vehicle corresponding to the client and the number corresponding to the urban road are associated and saved in a database.

4. The control method of the urban road intelligent parking system according to claim 2 is characterized in that: After the step of moving the second target vehicle from the position-seeking vehicle queue to the allocated parking space vehicle queue and removing the second target available parking space from the nearest parking space queue table, the method further includes: Determining whether the nearest parking space queue is empty; When the nearest parking space queue is not empty, return to continue traversing the nearest parking space queue; When the nearest parking space queue is empty, the process returns to the step of acquiring an available parking space from each of the scheduling roads to construct the nearest parking space queue.

5. The control method of the urban road intelligent parking system according to claim 2 is characterized in that: Determine the number of available parking spaces apn in the nearest parking space queue nst After the step of determining whether the number of vehicles to be dispatched is less than or equal to the number of vehicles to be dispatched Δscn, the method further includes: When apn nst >Δscn, calculate the distance d between each available parking space in the nearest parking space queue and each parking-seeking vehicle in the parking-seeking vehicle queue on the target urban road. jk , where j is from 1 to n nst A positive integer between 1 and n. scn A positive integer between nst is the number of available parking spaces in the nearest parking space queue, n scn is the number of vehicles in the vehicle queue on the target city road, d jk is the distance between the jth available parking space in the nearest parking space queue and the kth parking-seeking vehicle in the parking-seeking vehicle queue of the target urban road; Determine the minimum Δscn d jk a corresponding fourth target available parking space and a fourth target vehicle; allocating the fourth target available parking space to the fourth target vehicle; The fourth target vehicle is moved from the position-seeking vehicle queue to the assigned parking space vehicle queue, and the fourth target available parking space is removed from the nearest parking space queue list.

Images