A global parking lot information sharing method and system

Abstract

This invention discloses a method and system for sharing information across a comprehensive parking lot, belonging to the field of data processing. The method includes the following steps: collecting the unique identifier of each vehicle entering and exiting, along with its precise entry and exit timestamps, in real time using data collection devices deployed at each entrance and exit of the parking lot; simultaneously obtaining the total number and distribution of remaining parking spaces in each parking zone to acquire raw parking space data. Compared with existing technologies, the advantages of this invention are: by collecting vehicle entry and exit data in real time and quantifying the congestion level of each entrance and exit, this invention guides users to avoid congested entrances; simultaneously, it uses short-term entry and exit behavior to identify invalid entries, cross-validating with the raw parking space data to correct the actual parking space data, effectively shielding against misleading information caused by sensor failure; finally, by combining the congestion level with the corrected actual parking space data, it dynamically generates optimal parking lot and entrance / exit recommendations, ensuring users receive accurate, efficient, and practical parking guidance.

Description

Technical Field

[0001] This invention belongs to the field of data processing, and in particular relates to a method and system for sharing parking information across the entire area. Background Technology

[0002] Existing technologies typically acquire real-time parking space occupancy data by deploying sensors such as geomagnetic sensors and cameras in multiple parking lots, and then upload the data to a cloud platform for aggregation and updates. Users can then use a mobile app or information screens to find available parking spaces in each area.

[0003] However, this solution has two obvious drawbacks in practical applications: First, even if a parking lot shows available parking spaces, if its entrance and exit are severely congested due to queuing, slow payment, or other reasons, vehicles will spend a lot of extra time entering and exiting, and users may miss better options as a result; Second, when sensors malfunction or are affected by environmental interference, the number of remaining parking spaces displayed in the cloud may not match the actual situation, causing users to arrive to find that there are no available parking spaces at all, which seriously affects the user experience and needs to be improved. Summary of the Invention

[0004] Therefore, it is necessary to provide a method and system for sharing parking information across the entire area to address the above-mentioned problems.

[0005] The present invention is implemented as follows: a method for sharing parking information across an entire area includes the following steps:

[0006] By deploying data collection devices (such as gate cameras, geomagnetic sensors, or Bluetooth beacons) at each entrance and exit of the parking lot, the unique identifier (such as license plate number) of each vehicle entering and exiting is collected in real time, along with its precise entry and exit timestamps; at the same time, the total number and distribution of the current remaining parking spaces in each parking zone (or the entire area) are obtained to acquire the raw parking space data.

[0007] For each entrance and exit, the dwell time of vehicles passing through within a first preset time (such as the past 10 minutes) is analyzed independently (i.e., the time difference from when a vehicle arrives at the gate and queues until it has completely passed through the gate). Combined with the current number of vehicles in the queue, the average waiting time at the entrance and the average waiting time at the exit are quantified to obtain the congestion level of each entrance and exit.

[0008] If the same vehicle enters and then exits within the second preset time window (e.g., less than 3 minutes), it is marked as an invalid entry; the number and proportion of all invalid entries within the third preset time (e.g., the past 15 minutes) are accumulated to infer the inferred parking space data;

[0009] Cross-validate the inferred parking space data with the original parking space data. If the difference between the two parking space data is less than a first threshold, the original parking space data is used as the actual parking space data. If the difference between the two parking space data is greater than the first threshold, the inferred parking space data is used as the actual parking space data, and an alert is triggered.

[0010] Based on the congestion levels at the entrances and exits of each parking lot and the actual parking space data, personalized guidance is dynamically generated for vehicles waiting to park.

[0011] In one embodiment, the present invention provides a method for sharing parking information across the entire area. The step of independently analyzing the dwell time of vehicles passing through each entrance / exit within a first preset time period, and combining this with the current number of vehicles in queue, quantifies the average waiting time at the entrance and the average waiting time at the exit to obtain the congestion level of each entrance / exit includes:

[0012] Let the j-th entrance / exit be at the first preset time. The total number of vehicles passing through within 10 minutes (e.g.) The dwell time of the i-th vehicle The average waiting time at an entrance is defined as the time difference between a vehicle arriving at the gate and queuing (or triggering the entrance geomagnetic field) at the j-th entrance and completely passing through the gate. and average waiting time for exports Calculated separately as follows:

[0013] ;

[0014] ;

[0015] The superscript "in" indicates entering, and the superscript "out" indicates exiting.

[0016] At the same time, the number of vehicles queuing at the current entrance / exit is obtained in real time. (Estimated through video analysis or geomagnetic sequences), define the congestion index. for: ;

[0017] In the formula Pick Or take separately , calculate, Set a preset baseline waiting time (e.g., 60 seconds). The preset baseline queue length (e.g., 5 vehicles) is used, with α and β as weighting coefficients (α+β=1); the congestion level is based on... The numerical range is divided into multiple levels (such as low, medium, and high).

[0018] In one embodiment, the present invention provides a method for sharing parking lot information across the entire area. In the step of marking a vehicle as invalid if it enters and then exits within a second preset time window, and then accumulating the number and proportion of all invalid vehicles entering within a third preset time period to infer parking space data:

[0019] The current time is t, and the length of the second preset time window is . The third preset time window length is Defined in the time interval [t- The set of events for all vehicles entering within [t] is: ,in [t- [t], p is the unique identifier of the vehicle (such as the license plate number). For entry time, The departure time (if the vehicle has not yet left, then...) (If the current time is empty or greater than the current time t, invalid entries are not counted.)

[0020] Define the set of invalid entry events as: ,in - ≤ That is, after the vehicle enters It departed within a specified time;

[0021] Let the total number of entries within this time window be... Based on sets Obtain, invalid entry attempts Based on sets Obtain. If If the number of invalid entries is greater than 0, then the invalid entry ratio R is: ;

[0022] Set invalid entry ratio threshold (e.g., 0.6), then the inferred parking space data Output according to the following rules: If R> If so, it is inferred that the actual number of available parking spaces is close to zero, and the output is... =0 (or marked as "no parking space"); otherwise, no special inference is made, and the original parking space data is maintained.

[0023] In one embodiment, the present invention provides a method for sharing information across a comprehensive parking lot. The step of dynamically generating personalized guidance for vehicles to be parked, by combining the congestion levels at the entrances and exits of each parking lot with actual parking space data, specifically includes:

[0024] Obtain the actual parking space data and congestion level of each entrance and exit of all parking lots within a preset range around the current location of the vehicle; if the actual parking space data of a parking lot is greater than the second threshold and there is at least one entrance and exit with a congestion level lower than the preset level, then the parking lot is included in the first candidate set, and the one with the shortest estimated entry waiting time (or closest to the direction the vehicle is approaching) is selected from all its qualified entrances and exits as the recommended entrance of the parking lot.

[0025] For each candidate parking lot, calculate the estimated path time (i.e., travel time) for a vehicle to travel from its current location to its recommended entrance, and add it to the obtained entry waiting time at that entrance to get the overall time;

[0026] The system selects the parking lot with the shortest overall travel time from all candidate parking lots and recommends it, outputting the parking lot's name, recommended entrance / exit, estimated travel time, and entry waiting time. If no parking lot meets the criteria (candidate set is empty), the system suggests that the user detour or try again later. Finally, the recommendation results are pushed to the electronic guidance screen or mobile app.

[0027] In one embodiment, the present invention provides a method for sharing information across a comprehensive parking lot, wherein the step of dynamically generating personalized guidance for vehicles to be parked by combining the congestion levels at the entrances and exits of each parking lot and actual parking space data further includes:

[0028] The system obtains the new energy type (pure electric, plug-in hybrid, or non-new energy) of the vehicles waiting to be parked and the user's current charging needs (whether they need to recharge, expected charging power, etc.). If the vehicle is a new energy vehicle and needs to be charged, the system further filters out parking lots with available and normal charging piles (not faulty, not reserved) from the first candidate set to obtain the second candidate set. If the second candidate set is not empty, it is used as the basis for subsequent recommendations, that is, comprehensive time calculation and parking lot recommendation are performed based on the second candidate set.

[0029] In one embodiment, the present invention provides a comprehensive parking information sharing system, comprising:

[0030] The raw parking space data acquisition module is used to collect the unique identifier (such as license plate number) of each vehicle entering and exiting the parking lot in real time and its precise entry and exit timestamps through the collection devices (such as gate cameras, geomagnetic sensors or Bluetooth beacons) deployed at each entrance and exit of the parking lot; at the same time, it obtains the current total number and distribution of parking spaces in each parking zone (or the entire area) to obtain raw parking space data.

[0031] The entrance / exit congestion level calculation module is used to independently analyze the dwell time of vehicles passing through each entrance / exit within a first preset time (such as the past 10 minutes) (i.e., the time difference from when a vehicle arrives at the gate to queue until it has completely passed through the gate), and combine it with the current number of vehicles in the queue to quantify the average waiting time at the entrance and the average waiting time at the exit, and obtain the congestion level of each entrance / exit.

[0032] The inferred parking space data acquisition module is used to mark a vehicle as invalid if it leaves within a second preset time window (e.g., less than 3 minutes) after entering the parking space; and to infer the inferred parking space data by accumulating the number and proportion of all invalid vehicles entering the parking space within a third preset time window (e.g., the past 15 minutes).

[0033] The actual parking space data acquisition module is used to cross-validate the inferred parking space data with the original parking space data. If the difference between the two parking space data is less than a first threshold, the original parking space data is used as the actual parking space data; if the difference between the two parking space data is greater than the first threshold, the inferred parking space data is used as the actual parking space data, and an alert is triggered.

[0034] The parking guidance module is used to dynamically generate personalized guidance for vehicles waiting to park by combining the congestion level of each parking lot's entrance and exit with actual parking space data.

[0035] In one embodiment, the present invention provides a comprehensive parking lot information sharing system, wherein the entrance / exit congestion level calculation module includes:

[0036] Let the j-th entrance / exit be at the first preset time. The total number of vehicles passing through within 10 minutes (e.g.) The dwell time of the i-th vehicle The average waiting time at an entrance is defined as the time difference between a vehicle arriving at the gate and queuing (or triggering the entrance geomagnetic field) at the j-th entrance and completely passing through the gate. and average waiting time for exports Calculated separately as follows:

[0037] ;

[0038] ;

[0039] The superscript "in" indicates entering, and the superscript "out" indicates exiting.

[0040] At the same time, the number of vehicles queuing at the current entrance / exit is obtained in real time. (Estimated through video analysis or geomagnetic sequences), define the congestion index. for: ;

[0041] In the formula Pick Or take separately , calculate, Set a preset baseline waiting time (e.g., 60 seconds). The preset baseline queue length (e.g., 5 vehicles) is used, with α and β as weighting coefficients (α+β=1); the congestion level is based on... The numerical range is divided into multiple levels (such as low, medium, and high).

[0042] In one embodiment, the present invention provides a comprehensive parking lot information sharing system, wherein the parking space data acquisition module includes:

[0043] The current time is t, and the length of the second preset time window is . The third preset time window length is Defined in the time interval [t- The set of events for all vehicles entering within [t] is: ,in [t- [t], p is the unique identifier of the vehicle (such as the license plate number). For entry time, The departure time (if the vehicle has not yet left, then...) (If the current time is empty or greater than the current time t, invalid entries are not counted.)

[0044] Define the set of invalid entry events as: ,in - ≤ That is, after the vehicle enters It departed within a specified time;

[0045] Let the total number of entries within this time window be... Based on sets Obtain, invalid entry attempts Based on sets Obtain. If If the number of invalid entries is greater than 0, then the invalid entry ratio R is: ;

[0046] Set invalid entry ratio threshold (e.g., 0.6), then the inferred parking space data Output according to the following rules: If R> If so, it is inferred that the actual number of available parking spaces is close to zero, and the output is... =0 (or marked as "no parking space"); otherwise, no special inference is made, and the original parking space data is maintained.

[0047] In one embodiment, the present invention provides a city-wide parking lot information sharing system, wherein the parking guidance module includes:

[0048] The data collection unit is used to obtain the actual parking space data of all parking lots within a preset range around the current location of the vehicle and the congestion level of each entrance and exit. If the actual parking space data of a parking lot is greater than the second threshold and there is at least one entrance and exit with a congestion level lower than the preset level, then the parking lot is included in the first candidate set, and the one with the shortest estimated entry waiting time (or closest to the direction of vehicle approach) is selected from all its qualified entrances and exits as the recommended entrance of the parking lot.

[0049] The comprehensive time calculation unit is used to calculate the estimated path time (i.e., travel time) for a vehicle to travel from its current location to its recommended entrance for each candidate parking lot, and add it to the obtained entry waiting time at that entrance to get the comprehensive time;

[0050] The parking recommendation unit selects the parking lot with the shortest overall travel time from all candidate parking lots and outputs the name of the parking lot, the recommended entrance / exit, the estimated travel time, and the entry waiting time. If no parking lot meets the criteria (the candidate set is empty), the user is advised to detour or try again later. Finally, the recommendation results are pushed to the electronic guidance screen or mobile APP.

[0051] In one embodiment, the present invention provides a comprehensive parking lot information sharing system, wherein the parking guidance module further includes:

[0052] The charging adjustment unit is used to obtain the new energy type (pure electric, plug-in hybrid, or non-new energy) of the vehicle to be parked and the user's current charging needs (whether it needs to be recharged, expected charging power, etc.). If the vehicle is a new energy vehicle and needs to be charged, then within the first candidate set, parking lots with available and normal charging piles (not faulty, not reserved) are further filtered to obtain the second candidate set. If the second candidate set is not empty, then the second candidate set is used as the basis for subsequent recommendations, that is, comprehensive time calculation and parking lot recommendation are performed based on the second candidate set.

[0053] Compared with existing technologies, the beneficial effects of this invention are as follows: This invention guides users to avoid congested entrances by collecting vehicle entry and exit data in real time and quantifying the congestion level of each entrance and exit; at the same time, it uses short-term entry and exit behavior to identify invalid entries and cross-validates with the original parking space data to correct the actual parking space data, effectively shielding the misleading information caused by sensor failure; finally, by combining the congestion level and the corrected actual parking space data, it dynamically generates the optimal parking lot and entrance / exit recommendations, ensuring that users receive accurate, efficient, and practical parking guidance. Attached Figure Description

[0054] Figure 1 This is a flowchart illustrating a method for sharing parking information across the entire area, as provided in an embodiment of the present invention.

[0055] Figure 2 This is a schematic diagram illustrating the process of recommending parking lots based on parking space information and entrance / exit congestion information, as provided in an embodiment of the present invention.

[0056] Figure 3 This is a schematic diagram of the process for filtering candidate sets based on charging demand, provided in an embodiment of the present invention.

[0057] Figure 4 This is a schematic diagram of a comprehensive parking information sharing system provided in an embodiment of the present invention.

[0058] Figure 5 This is a schematic diagram of the first part of the parking guidance module provided in an embodiment of the present invention.

[0059] Figure 6 This is a schematic diagram of the second part of the parking guidance module provided in an embodiment of the present invention. Detailed Implementation

[0060] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0061] It is understood that the terms "first," "second," etc., used in this application may be used herein to describe various elements, but unless otherwise specified, these elements are not limited by these terms. These terms are used only to distinguish one element from another. For example, without departing from the scope of this application, a first script may be referred to as a second script, and similarly, a second script may be referred to as a first script.

[0062] In one embodiment, such as Figure 1 As shown, a method for sharing parking information across an entire area includes the following steps:

[0063] Step S1: By deploying data collection devices (such as gate cameras, geomagnetic sensors, or Bluetooth beacons) at each entrance and exit of the parking lot, the unique identifier (such as license plate number) of each vehicle entering and exiting is collected in real time, along with its precise entry and exit timestamps; at the same time, the total number and distribution of the current remaining parking spaces in each parking zone (or the entire area) are obtained to acquire the raw parking space data.

[0064] Step S2: For each entrance and exit, independently analyze the dwell time of vehicles passing through within a first preset time (such as the past 10 minutes) (i.e., the time difference from when a vehicle arrives at the gate to queue until it has completely passed through the gate), and combine this with the current number of vehicles in the queue to quantify the average waiting time at the entrance and the average waiting time at the exit, and obtain the congestion level of each entrance and exit.

[0065] Step S3: When the same vehicle enters and then exits within the second preset time window (e.g., less than 3 minutes), it is marked as an invalid entry; the number and proportion of all invalid entries within the third preset time (e.g., the past 15 minutes) are accumulated to infer the inferred parking space data;

[0066] Step S4: Cross-validate the inferred parking space data with the original parking space data. If the difference between the two parking space data is less than the first threshold, the original parking space data is used as the actual parking space data; if the difference between the two parking space data is greater than the first threshold, the inferred parking space data is used as the actual parking space data, and an alert is triggered.

[0067] Step S5: Based on the congestion level of each parking lot's entrance and exit and the actual parking space data, dynamically generate personalized guidance for vehicles to be parked.

[0068] Considering that existing technologies only focus on the number of remaining parking spaces and do not take into account issues such as entrance / exit congestion and sensor malfunction, a design was therefore developed. Figure 1 The main process is shown below. Step S1 collects vehicle entry and exit data and parking space occupancy data; step S2 quantifies the congestion level of each entrance and exit; step S3 identifies invalid entries based on short-term entry and exit behavior; step S4 cross-validates the inferred parking space data with the original parking space data to correct the actual parking space data; and step S5 dynamically generates personalized guidance by combining the congestion level and the actual parking space data. This systematically solves the two major pain points of users wasting time due to congestion or making a wasted trip due to sensor misleading information.

[0069] In one embodiment, a method for sharing parking information across the entire area, step S2, involves independently analyzing the dwell time of vehicles passing through each entrance and exit within a first preset time period, and combining this with the current number of vehicles in queue to quantify the average waiting time at the entrance and the average waiting time at the exit, thereby obtaining the congestion level for each entrance and exit.

[0070] Let the j-th entrance / exit be at the first preset time. The total number of vehicles passing through within 10 minutes (e.g.) The dwell time of the i-th vehicle The average waiting time at an entrance is defined as the time difference between a vehicle arriving at the gate and queuing (or triggering the entrance geomagnetic field) at the j-th entrance and completely passing through the gate. and average waiting time for exports Calculated separately as follows:

[0071] ;

[0072] ;

[0073] The superscript "in" indicates entering, and the superscript "out" indicates exiting.

[0074] At the same time, the number of vehicles queuing at the current entrance / exit is obtained in real time. (Estimated through video analysis or geomagnetic sequences), define the congestion index. for: ;

[0075] In the formula Pick Or take separately , calculate, Set a preset baseline waiting time (e.g., 60 seconds). The preset baseline queue length (e.g., 5 vehicles) is used, with α and β as weighting coefficients (α+β=1); the congestion level is based on... The numerical range is divided into multiple levels (such as low, medium, and high).

[0076] To address the shortcomings of traditional methods that only consider the number of available spaces and not traffic efficiency, a congestion quantification formula based on dwell time and the number of vehicles in queue is designed. This is achieved by calculating the average waiting time and number of vehicles in queue at each entrance / exit within a preset time period. And integrate them into the congestion index. It can accurately distinguish the congestion levels of different entrances and exits, providing a quantitative basis for guiding users to choose smooth entrances and avoiding users wasting a lot of time by blindly driving into congested entrances.

[0077] In one embodiment, in a method for sharing parking information across a whole area, step S3 involves marking a vehicle as invalid if it enters and then exits within a second preset time window; and accumulating the number and proportion of all invalid vehicles entering within a third preset time period to infer parking space data.

[0078] The current time is t, and the length of the second preset time window is . The third preset time window length is Defined in the time interval [t- The set of events for all vehicles entering within [t] is: ,in [t- [t], p is the unique identifier of the vehicle (such as the license plate number). For entry time, The departure time (if the vehicle has not yet left, then...) (If the current time is empty or greater than the current time t, invalid entries are not counted.)

[0079] Define the set of invalid entry events as: ,in - ≤ That is, after the vehicle enters It departed within a specified time;

[0080] Let the total number of entries within this time window be... Based on sets Obtain, invalid entry attempts Based on sets Obtain. If If the number of invalid entries is greater than 0, then the invalid entry ratio R is: ;

[0081] Set invalid entry ratio threshold (e.g., 0.6), then the inferred parking space data Output according to the following rules: If R> If so, it is inferred that the actual number of available parking spaces is close to zero, and the output is... =0 (or marked as "no parking space"); otherwise, no special inference is made, and the original parking space data is maintained.

[0082] To address the issue of inaccurate cloud-based parking space data caused by sensor malfunctions or obstructions, a parking space data inference mechanism based on short-term entry and exit behavior is designed. By statistically analyzing the proportion of vehicles entering and exiting within a very short period, the true state of "no parking available" is identified, thus compensating for the lag and unreliability of sensor data. This design effectively avoids the unpleasant experience of users arriving at a parking space based on incorrect information only to find no space available.

[0083] In one embodiment, such as Figure 2 As shown, a method for sharing parking information across the entire area, step S5, which involves dynamically generating personalized guidance for vehicles to be parked by combining the congestion levels at the entrances and exits of each parking lot with actual parking space data, specifically includes:

[0084] Step S51: Obtain the actual parking space data of all parking lots within a preset range around the current location of the vehicle and the congestion level of each entrance and exit; if the actual parking space data of a parking lot is greater than the second threshold and there is at least one entrance and exit with a congestion level lower than the preset level, then the parking lot is included in the first candidate set, and the one with the shortest estimated entry waiting time (or closest to the direction of vehicle approach) is selected from all its qualified entrances and exits as the recommended entrance of the parking lot.

[0085] Step S52: For each candidate parking lot, calculate the estimated path time (i.e., travel time) for the vehicle to travel from its current location to its recommended entrance, and add it to the obtained entry waiting time at that entrance to get the comprehensive time;

[0086] Step S53: Select the parking lot with the shortest overall travel time from all candidate parking lots and output the name of the parking lot, recommended entrance / exit, estimated travel time, and entry waiting time. If there are no parking lots that meet the criteria (candidate set is empty), suggest that the user detour or try again later. Finally, push the recommendation results to the electronic guidance screen or mobile APP.

[0087] To address the challenge of selecting the best parking lot from multiple options, a step-by-step filtering and comprehensive cost calculation mechanism was designed. First, candidate parking lots and recommended entrances are filtered based on actual parking space data and entrance / exit congestion levels. Then, the sum of travel time and entry waiting time is calculated as the comprehensive cost. Finally, the parking lot and entrance / exit with the lowest cost are recommended. This ensures that users achieve optimal overall time while still finding a parking spot, rather than relying solely on the number of available parking spaces or distance for a one-sided recommendation.

[0088] In one embodiment, such as Figure 3 As shown, in a method for sharing information across a comprehensive parking lot, step S5, which involves dynamically generating personalized guidance for vehicles to be parked by combining the congestion levels at the entrances and exits of each parking lot with actual parking space data, further includes:

[0089] Step S54: Obtain the new energy type (pure electric, plug-in hybrid, or non-new energy) of the vehicle to be parked and the user's current charging needs (whether it needs to be recharged, expected charging power, etc.). If the vehicle is a new energy vehicle and needs to be charged, further filter out parking lots with available and normal charging piles (not faulty, not reserved) in the first candidate set to obtain the second candidate set. If the second candidate set is not empty, use the second candidate set as the basis for subsequent recommendations, that is, perform comprehensive time calculation and parking lot recommendation based on the second candidate set.

[0090] If the second candidate set is empty, the user will be prompted that there are no available charging parking spaces nearby and asked if they would accept regular parking spaces. If they accept, the first candidate set will be used for recommendations. If they refuse, the user will be advised to expand their search scope or try again later.

[0091] Considering the essential charging needs of new energy vehicle users, a charging demand screening step has been added to the original recommendation process. By identifying the new energy type of the vehicle and the user's charging intentions, parking lots equipped with available charging stations are further filtered from the first candidate set. If such parking lots exist, they are given priority for recommendation; otherwise, a downgrade option (accepting regular parking spaces or expanding the search scope) is provided. This design fully caters to the charging needs of new energy vehicle owners.

[0092] In one embodiment, such as Figure 4 As shown, a comprehensive parking information sharing system includes:

[0093] The original parking space data acquisition module 1 is used to collect the unique identifier (such as license plate number) of each vehicle entering and exiting the parking lot in real time and its precise entry and exit timestamps through the collection devices (such as gate cameras, geomagnetic sensors or Bluetooth beacons) deployed at each entrance and exit of the parking lot; at the same time, it obtains the current total number and distribution of parking spaces in each parking zone (or the entire area) to obtain the original parking space data.

[0094] The entrance / exit congestion level calculation module 2 is used to independently analyze the dwell time of vehicles passing through each entrance / exit within a first preset time (such as the past 10 minutes) (i.e., the time difference from when a vehicle arrives at the gate to queue until it has completely passed through the gate), and combine it with the current number of vehicles in the queue to quantify the average waiting time at the entrance and the average waiting time at the exit, and obtain the congestion level of each entrance / exit.

[0095] The inferred parking space data acquisition module 3 is used to mark a vehicle as invalid if it leaves within a second preset time window (e.g., less than 3 minutes) after entering; and to infer the inferred parking space data by accumulating the number and proportion of all invalid vehicles entering within a third preset time (e.g., the past 15 minutes).

[0096] The actual parking space data acquisition module 4 is used to cross-validate the inferred parking space data with the original parking space data. If the difference between the two parking space data is less than a first threshold, the original parking space data is used as the actual parking space data; if the difference between the two parking space data is greater than the first threshold, the inferred parking space data is used as the actual parking space data, and an early warning is triggered.

[0097] Parking guidance module 5 is used to dynamically generate personalized guidance for vehicles to be parked by combining the congestion level of the entrances and exits of each parking lot and the actual parking space data.

[0098] Considering that some parking lots have multiple entrances sharing the same passage or merging entrances and exits, resulting in complex data associations, based on the original parking space data acquisition module 1, the physical topology relationship of the parking lot entrances and exits can be established (such as two entrances sharing the same passage, or an exit sharing a gate with an entrance). The collected vehicle events can be merged and calculated according to the actual passage, accurately reflecting the congestion status at the passage level and avoiding the distortion of congestion assessment caused by the mismatch between entrance / exit numbers and physical passages.

[0099] In one embodiment, in a parking lot information sharing system covering the entire area, the entrance / exit congestion level calculation module 2 includes:

[0100] Let the j-th entrance / exit be at the first preset time. The total number of vehicles passing through within 10 minutes (e.g.) The dwell time of the i-th vehicle The average waiting time at an entrance is defined as the time difference between a vehicle arriving at the gate and queuing (or triggering the entrance geomagnetic field) at the j-th entrance and completely passing through the gate. and average waiting time for exports Calculated separately as follows:

[0101] ;

[0102] ;

[0103] The superscript "in" indicates entering, and the superscript "out" indicates exiting.

[0104] At the same time, the number of vehicles queuing at the current entrance / exit is obtained in real time. (Estimated through video analysis or geomagnetic sequences), define the congestion index. for: ;

[0105] In the formula Pick Or take separately , calculate, Set a preset baseline waiting time (e.g., 60 seconds). The preset baseline queue length (e.g., 5 vehicles) is used, with α and β as weighting coefficients (α+β=1); the congestion level is based on... The numerical range is divided into multiple levels (such as low, medium, and high).

[0106] Considering that entrance and exit congestion may be affected by external factors (such as traffic lights on surrounding roads and temporary construction), an additional external traffic fusion analysis unit can be designed based on the entrance and exit congestion level calculation module 2. This unit accesses real-time traffic data from the surrounding road network to mark and differentiate entrance queues caused by external factors, making the congestion level more reflective of the parking lot's own service capacity, rather than simply being affected by external traffic.

[0107] In one embodiment, in a parking space information sharing system, the inferred parking space data acquisition module 3:

[0108] The current time is t, and the length of the second preset time window is . The third preset time window length is Defined in the time interval [t- The set of events for all vehicles entering within [t] is: ,in [t- [t], p is the unique identifier of the vehicle (such as the license plate number). For entry time, The departure time (if the vehicle has not yet left, then...) (If the current time is empty or greater than the current time t, invalid entries are not counted.)

[0109] Define the set of invalid entry events as: ,in - ≤ That is, after the vehicle enters It departed within a specified time;

[0110] Let the total number of entries within this time window be... Based on sets Obtain, invalid entry attempts Based on sets Obtain. If If the number of invalid entries is greater than 0, then the invalid entry ratio R is: ;

[0111] Set invalid entry ratio threshold (e.g., 0.6), then the inferred parking space data Output according to the following rules: If R> If so, it is inferred that the actual number of available parking spaces is close to zero, and the output is... =0 (or marked as "no parking space"); otherwise, no special inference is made, and the original parking space data is maintained.

[0112] Considering the significant differences in parking lot size and turnover rate, and the varying normal baseline values ​​for short-term entry and exit behaviors, an additional parking lot feature normalization unit can be designed based on the parking space data acquisition module 3. This unit incorporates features such as the total number of parking spaces and average turnover rate, normalizes the invalid entry ratio, and then compares it with a ratio threshold. Comparison enables the inference logic to adapt to parking lots of different sizes and types, improving the algorithm's versatility.

[0113] In one embodiment, such as Figure 5 As shown, a comprehensive parking information sharing system includes a parking guidance module 5 comprising:

[0114] The data collection unit 51 is used to obtain the actual parking space data of all parking lots within a preset range around the current location of the vehicle and the congestion level of each entrance and exit; if the actual parking space data of a parking lot is greater than the second threshold and there is at least one entrance and exit with a congestion level lower than the preset level, then the parking lot is included in the first candidate set, and the one with the shortest estimated entry waiting time (or closest to the direction of vehicle approach) is selected from all its qualified entrances and exits as the recommended entrance of the parking lot.

[0115] The comprehensive time calculation unit 52 is used to calculate the estimated path time (i.e., travel time) for a vehicle to travel from its current location to its recommended entrance for each candidate parking lot, and add it to the obtained entrance waiting time to get the comprehensive time.

[0116] The parking recommendation unit 53 is used to select the parking lot with the shortest overall travel time from all candidate parking lots and output the name of the parking lot, the recommended entrance / exit, the estimated travel time, and the waiting time for entry. If there are no parking lots that meet the criteria (the candidate set is empty), the user is advised to detour or try again later. Finally, the recommendation results are pushed to the electronic guidance screen or mobile APP.

[0117] Considering that users may be sensitive to walking distance (such as carrying heavy objects, or traveling with elderly people or children), the parking recommendation unit 53 can be improved by incorporating not only travel time and entry waiting time into the cost function when calculating the overall cost. This would also allow users to set walking distance preference weights (such as "prioritize the nearest entrance"), making the recommendation results more in line with users' personalized travel needs.

[0118] In one embodiment, such as Figure 6 As shown, in a comprehensive parking information sharing system, the parking guidance module 5 further includes:

[0119] The charging adjustment unit 54 is used to obtain the new energy type (pure electric, plug-in hybrid or non-new energy) of the vehicle to be parked and the user's current charging needs (whether it needs to be recharged, expected charging power, etc.). If the vehicle is a new energy vehicle and needs to be charged, then within the first candidate set, parking lots with available and normal charging piles (not faulty, not reserved) are further filtered to obtain the second candidate set. If the second candidate set is not empty, then the second candidate set is used as the basis for subsequent recommendations, that is, comprehensive time calculation and parking lot recommendation are performed based on the second candidate set.

[0120] Considering that charging stations have different power levels (fast charging / slow charging) and users have different expectations for charging speed, when selecting charging stations, further filtering can be performed based on the user's charging power requirements (such as "accepting fast charging only" or "accepting slow charging"). Priority should be given to recommending charging stations that match the user's expectations, avoiding the awkward situation where a station is recommended but its power is not compatible, forcing the user to search elsewhere.

[0121] It should be understood that although the steps in the flowcharts of the various embodiments of the present invention are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the various embodiments may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least a portion of the sub-steps or stages of other steps.

[0122] Those skilled in the art will understand that all or part of the processes in the systems described in the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments described above. Any references to memory, storage, databases, or other media used in the embodiments provided in this application can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), Rambus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0123] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0124] The embodiments described above are merely illustrative of several implementations of the present invention, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these modifications and improvements all fall within the scope of protection of the present invention. Therefore, the scope of protection of this patent should be determined by the appended claims.

[0125] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

[0126] Furthermore, it should be understood that although this specification describes embodiments, not every embodiment contains only one independent technical solution. This narrative style is merely for clarity. Those skilled in the art should consider the specification as a whole, and the technical solutions in each embodiment can also be appropriately combined to form other embodiments that can be understood by those skilled in the art.

Claims

1. A method of sharing information of a parking lot in a whole area, characterized by, The method for sharing parking information across the entire area includes the following steps: By deploying data collection devices at each entrance and exit of the parking lot, the unique identifier of each vehicle entering and exiting, as well as its precise entry and exit timestamps, are collected in real time; at the same time, the total number and distribution of the current remaining parking spaces in each parking zone are obtained to acquire the raw parking space data. For each entrance and exit, the dwell time of vehicles passing through within the first preset time is analyzed independently. Combined with the current number of vehicles in the queue, the average waiting time at the entrance and the average waiting time at the exit are quantified to obtain the congestion level of each entrance and exit. If the same vehicle enters and then exits within the second preset time window, it is marked as an invalid entry; the number and proportion of all invalid entries within the third preset time period are accumulated to infer the inferred parking space data. Cross-validate the inferred parking space data with the original parking space data. If the difference between the two parking space data is less than a first threshold, the original parking space data is used as the actual parking space data. If the difference between the two parking space data is greater than the first threshold, the inferred parking space data is used as the actual parking space data, and an alert is triggered. Based on the congestion levels at the entrances and exits of each parking lot and the actual parking space data, personalized guidance is dynamically generated for vehicles waiting to park.

2. The global parking lot information sharing method of claim 1, wherein, The step of independently analyzing the dwell time of vehicles passing through each entrance / exit within a first preset time period, and combining this with the current number of vehicles in the queue to quantify the average waiting time at the entrance and the average waiting time at the exit, and obtaining the congestion level for each entrance / exit, is as follows: Let the j-th entrance / exit be at the first preset time. The total number of vehicles passing through is The dwell time of the i-th vehicle The average waiting time at an entrance is defined as the time difference between when a vehicle arrives at the gate and queues until it has completely passed through the gate at the j-th entrance / exit. and average waiting time for exports Calculated separately as follows: ； ； The superscript "in" indicates entering, and the superscript "out" indicates exiting. At the same time, the number of vehicles queuing at the current entrance / exit is obtained in real time. Define the congestion index for: ; In the formula Pick Or take separately , calculate, The preset baseline waiting time, The preset baseline queue length is defined, and α and β are weighting coefficients; the congestion level is based on... The numerical range is divided into multiple levels.

3. The method for sharing parking information across the entire area according to claim 1, characterized in that, In the step of marking a vehicle as invalid if it enters and then exits within a second preset time window, and accumulating the number and proportion of all invalid vehicles entering within a third preset time period to infer parking space data: The current time is t, and the length of the second preset time window is . The third preset time window length is Defined in the time interval [t- The set of events for all vehicles entering within [t] is: ,in [t- [t], p is the unique identifier of the vehicle. For entry time, This refers to the departure time; Define the set of invalid entry events as: ,in - ≤ That is, after the vehicle enters It departed within a specified time; Let the total number of entries within this time window be... Based on sets Obtain, invalid entry attempts Based on sets Obtain; if If the number of invalid entries is greater than 0, then the invalid entry ratio R is: ; Set invalid entry ratio threshold Then the inferred parking space data Output according to the following rules: If R> If so, it is inferred that the actual number of available parking spaces is close to zero, and the output is... =0; otherwise, no special inference is made, and the original parking space data is maintained.

4. The method for sharing parking information across the entire area according to any one of claims 1 to 3, characterized in that, The process of dynamically generating personalized guidance for vehicles seeking parking by combining the congestion levels at the entrances and exits of each parking lot with actual parking space data specifically includes: Obtain the actual parking space data and congestion level of each entrance and exit of all parking lots within a preset range around the current location of the vehicle; if the actual parking space data of a parking lot is greater than the second threshold and there is at least one entrance and exit with a congestion level lower than the preset level, then the parking lot is included in the first candidate set, and the one with the shortest estimated entry waiting time is selected from all its qualified entrances and exits as the recommended entrance of the parking lot. For each candidate parking lot, calculate the estimated path time for a vehicle to travel from its current location to its recommended entrance, and add it to the obtained entry waiting time at that entrance to get the overall time; The system selects the parking lot with the shortest overall travel time from all candidate parking lots and recommends it, outputting the parking lot's name, recommended entrance / exit, estimated travel time, and entry waiting time. If no parking lot meets the criteria, the system suggests that the user take a detour or try again later. Finally, the recommendation results are pushed to the electronic guidance screen or mobile app.

5. The method for sharing parking information across the entire area according to claim 4, characterized in that, The process of dynamically generating personalized guidance for vehicles to be parked, which combines the congestion levels at the entrances and exits of each parking lot with actual parking space data, also includes: The system obtains the new energy vehicle type of the vehicle to be parked and the user's current charging needs. If the vehicle is a new energy vehicle and needs to be charged, it further filters out parking lots with available and normal charging piles from the first candidate set to obtain the second candidate set. If the second candidate set is not empty, it is used as the basis for subsequent recommendations, that is, comprehensive time calculation and parking lot recommendation are performed based on the second candidate set.

6. A city-wide parking lot information sharing system, characterized in that, include: The raw parking space data acquisition module is used to collect the unique identifier of each vehicle entering and exiting the parking lot and its precise entry and exit timestamps in real time through the collection devices deployed at each entrance and exit of the parking lot; at the same time, it obtains the current total number and distribution of parking spaces in each parking zone to obtain raw parking space data. The entrance / exit congestion level calculation module is used to independently analyze the dwell time of vehicles passing through each entrance / exit within a first preset time, and combine it with the current number of vehicles in the queue to quantify the average waiting time at the entrance and the average waiting time at the exit, and obtain the congestion level of each entrance / exit. The inferred parking space data acquisition module is used to mark a vehicle as an invalid entry if it enters and then exits within a second preset time window; and to infer the inferred parking space data by accumulating the number and proportion of all invalid entries within a third preset time period. The actual parking space data acquisition module is used to cross-validate the inferred parking space data with the original parking space data. If the difference between the two parking space data is less than the first threshold, the original parking space data is used as the actual parking space data. If the difference between the two parking space data is greater than the first threshold, the inferred parking space data will be used as the actual parking space data, and an alert will be triggered. The parking guidance module is used to dynamically generate personalized guidance for vehicles waiting to park by combining the congestion level of each parking lot's entrance and exit with actual parking space data.

7. The city-wide parking information sharing system according to claim 6, characterized in that, In the entrance / exit congestion level calculation module: Let the j-th entrance / exit be at the first preset time. The total number of vehicles passing through is The dwell time of the i-th vehicle The average waiting time at an entrance is defined as the time difference between when a vehicle arrives at the gate and queues until it has completely passed through the gate at the j-th entrance / exit. and average waiting time for exports Calculated separately as follows: ； ； The superscript "in" indicates entering, and the superscript "out" indicates exiting. At the same time, the number of vehicles queuing at the current entrance / exit is obtained in real time. Define the congestion index for: ; In the formula Pick Or take separately , calculate, The preset baseline waiting time, The preset baseline queue length is defined, and α and β are weighting coefficients; the congestion level is based on... The numerical range is divided into multiple levels.

8. The city-wide parking information sharing system according to claim 6, characterized in that, In the inference parking space data acquisition module: The current time is t, and the length of the second preset time window is . The third preset time window length is Defined in the time interval [t- The set of events for all vehicles entering within [t] is: ,in [t- [t], p is the unique identifier of the vehicle. For entry time, This refers to the departure time; Define the set of invalid entry events as: ,in - ≤ That is, after the vehicle enters It departed within a specified time; Let the total number of entries within this time window be... Based on sets Obtain, invalid entry attempts Based on sets Obtain; if If the number of invalid entries is greater than 0, then the invalid entry ratio R is: ; Set invalid entry ratio threshold Then the inferred parking space data Output according to the following rules: If R> If so, it is inferred that the actual number of available parking spaces is close to zero, and the output is... =0; otherwise, no special inference is made, and the original parking space data is maintained.

9. The city-wide parking information sharing system according to any one of claims 6 to 8, characterized in that, The parking guidance module includes: The data collection unit is used to obtain the actual parking space data of all parking lots within a preset range around the current location of the vehicle and the congestion level of each entrance and exit. If the actual parking space data of a parking lot is greater than the second threshold and there is at least one entrance and exit with a congestion level lower than the preset level, then the parking lot is included in the first candidate set, and the one with the shortest estimated entry waiting time is selected from all its qualified entrances and exits as the recommended entrance of the parking lot. The comprehensive time calculation unit is used to calculate the estimated path time for a vehicle to travel from its current location to its recommended entrance for each candidate parking lot, and add it to the obtained entry waiting time at that entrance to obtain the comprehensive time; The parking recommendation unit selects the parking lot with the shortest overall travel time from all candidate parking lots and outputs the name of the parking lot, the recommended entrance / exit, the estimated travel time, and the entry waiting time. If no parking lot meets the criteria, the user is advised to detour or try again later. Finally, the recommendation results are pushed to the electronic guidance screen or mobile APP.

10. The city-wide parking lot information sharing system according to claim 9, characterized in that, The parking guidance module also includes: The charging adjustment unit is used to obtain the new energy type of the vehicle to be parked and the user's current charging needs. If the vehicle is a new energy vehicle and needs to be charged, it further filters out parking lots with available and normal charging piles in the first candidate set to obtain the second candidate set. If the second candidate set is not empty, it is used as the basis for subsequent recommendations, that is, comprehensive time calculation and parking lot recommendation are performed based on the second candidate set.

Images