Intelligent barrier gate passing control method based on full-process data linkage and related equipment

Abstract

The invention provides a full-process data linkage intelligent barrier gate passing control method and related equipment, and relates to the technical field of automatic control. The method comprises the steps that when a target vehicle passes through a barrier gate, a barrier gate control server records the entering time of the target vehicle and pushes the entering intelligent navigation service to a vehicle owner through an applet, and the vehicle owner is guided to quickly find an idle parking space and park the vehicle. When the server detects that the vehicle is ready to leave through the ground induction coil, the intelligent navigation service is pushed to exit immediately, and the vehicle owner is assisted to leave efficiently. And before the vehicle arrives at the exit barrier gate, the server records departure time, calculates a parking fee in combination with a preset duration charging standard and the entrance and exit time, and pushes the parking fee to the vehicle owner. And after the vehicle enters the preset detection area of the barrier gate, the server detects the fee payment state, and if payment succeeds, the barrier gate is controlled to be opened, so that full-process intelligent linkage management and control of the vehicle from entrance, navigation, charging to release are realized, and the passing efficiency and the user experience are greatly improved.

Description

Technical Field

[0001] This application relates to the field of automatic control technology, and in particular to an intelligent barrier gate access control method and related equipment with full-process data linkage. Background Technology

[0002] With the surge in motor vehicle ownership, underground parking lots have become a core urban infrastructure. As the only gateway for vehicles to enter and exit, the efficiency of the gate directly determines the overall turnover capacity and user experience of the parking lot.

[0003] Currently, the core technology of underground parking garage gates in the industry is independent access control: the gate is equipped with a license plate recognition module, which can record the vehicle's entry time, identify the payment status, and execute the gate opening; the supporting system can provide information on available parking spaces through sensors, realize online payment through a mini-program, and some support fixed route navigation and manually triggered departure navigation; the billing rules are based on the vehicle's entry and exit time to calculate the fee, and the fee remains fixed after it is generated, supporting online advance payment or supplementary payment at the gate.

[0004] However, existing technologies suffer from data silos. The license plate recognition data of the barrier gate, the parking space status data of the sensor, the path information of the navigation system, and the fee data of the billing system are independent of each other and have not formed a real-time sharing and linkage mechanism. This results in the barrier gate still facing pain points such as "slow entry and parking space finding, long exit queues, and payment and release issues" during peak hours. The market urgently needs a smart access solution that integrates the entire process with the barrier gate as the core node. Summary of the Invention

[0005] This application provides a smart barrier gate access control method and related equipment with full-process data linkage, which can improve barrier gate access efficiency, parking lot turnover capacity and user travel experience.

[0006] Firstly, this application provides a smart gate access control method with full-process data linkage, applied to a server. The method includes: recording the entry time when a target vehicle passes through the gate; pushing access to the smart navigation service to the vehicle owner via a mini-program to guide the vehicle owner to park; pushing exit from the smart navigation service to the vehicle owner when it is determined that the target vehicle is about to leave the underground parking lot; recording the departure time of the target vehicle and determining the parking fee based on the entry and departure times according to a preset time-based charging standard; pushing the parking fee to the vehicle owner; and detecting whether the parking fee has been successfully paid when the target vehicle arrives at the preset detection area of ​​the gate; if so, opening the gate.

[0007] By adopting the above technical solution, vehicle entry and exit times are automatically recorded, and combined with a mini-program, navigation push, fee calculation and push, and gate release are linked. The navigation service upon entry reduces the time drivers spend finding parking spaces, and the advance fee push upon exit is linked with the gate's payment status detection, avoiding queues and congestion when leaving. The seamless integration of data throughout the entire process improves driver traffic efficiency and reduces the manual management costs of parking lots, achieving dual optimization of traffic flow and management.

[0008] In conjunction with some embodiments of the first aspect, in some embodiments, the step of pushing access to the intelligent navigation service to the car owner via a mini-program includes: obtaining a panoramic parking space distribution map of the underground parking lot, the panoramic parking space distribution map marking the real-time occupancy status of parking spaces in each area and the current entrance location of the car owner; sending the panoramic parking space distribution map to the car owner's user terminal via the mini-program, allowing the car owner to select a parking location; and after receiving the target parking space selected by the car owner, generating a target navigation path from the entrance location to the target parking space.

[0009] By adopting the above technical solution, the panoramic parking space distribution map integrates real-time parking space status and entrance location information, allowing drivers to intuitively select their target parking space. The subsequently generated accurate navigation route avoids blind driving. The real-time updated parking space status ensures that the selected parking space is available, and the path between the entrance location and the target parking space is matched, reducing unnecessary detours within the parking lot, improving parking space utilization and parking convenience for drivers, while also reducing the probability of traffic congestion within the parking lot.

[0010] In conjunction with some embodiments of the first aspect, in some embodiments, the step of generating a target navigation path from the entrance location to the target parking space after receiving the target parking space selected by the vehicle owner includes: obtaining all navigation paths from the entrance location to the target parking space; counting the number of vehicles passing through each channel in each navigation path in real time, and calculating the total number of vehicles passing through all channels in each navigation path; and selecting the navigation path with the smallest total number of vehicles passing through as the target navigation path.

[0011] By adopting the above technical solution, all possible navigation routes are first obtained, and then filtered based on the total number of vehicles passing through each channel in real time. The dynamic collection of real-time traffic data ensures that the route selection matches the actual traffic conditions. The route with the fewest passing vehicles can avoid congested sections to the greatest extent, allowing drivers to reach their parking spaces in a shorter time, improving the rationality and efficiency of navigation routes, and optimizing the distribution of traffic flow in the parking lot.

[0012] In conjunction with some embodiments of the first aspect, in some embodiments, after the step of selecting the navigation path with the fewest total number of passing vehicles as the target navigation path, the method further includes: if there are multiple navigation paths with the same total number of passing vehicles, then calculate the total number of channels contained in each navigation path, and select the path with the fewest total number of channels as the target navigation path; if the total number of channels is the same, then calculate the total length of each navigation path, and select the path with the shortest total length as the target navigation path.

[0013] By adopting the above technical solution, when the total number of vehicles is the same, the total number of lanes and the total length are used as the selection criteria in turn. A smaller total number of lanes can reduce extra time spent on turning and waiting, while a shorter total length can directly shorten the driving distance. The multi-dimensional selection logic forms a progressive optimization, ensuring that the optimal route can still be selected in complex scenarios, further improving navigation accuracy and the driver's travel experience.

[0014] In conjunction with some embodiments of the first aspect, in some embodiments, the step of pushing the exit from the intelligent navigation service to the car owner when it is determined that the target vehicle is preparing to leave the underground parking lot specifically includes: real-time detection of the parking space status through the ground induction coil corresponding to the parking space of the target vehicle; if the ground induction coil detects a change in vehicle signal, it is determined that the target vehicle is preparing to leave; obtaining the vehicle departure queue status at each exit; generating all navigation routes from the current location to each exit and the corresponding estimated time, for the car owner to choose from; and after the car owner determines the target exit, pushing the corresponding navigation route to the car owner via a mini-program.

[0015] By adopting the above technical solution, the inductive loop detector monitors the parking space status in real time and accurately triggers the exit navigation push, avoiding navigation service pushes that are too early or too late. Combining the queuing situation at each exit to generate a route and estimated travel time, drivers can choose the optimal exit according to their needs. The navigation route guides them away from congested exits, shortening departure time and achieving convenient navigation coverage throughout the entire parking cycle.

[0016] In conjunction with some embodiments of the first aspect, in some embodiments, the step of detecting whether the parking fee has been successfully paid after the target vehicle arrives at the preset detection area of ​​the barrier gate specifically includes: when the target vehicle arrives at the preset detection area, recording the current vehicle passage time, and simultaneously detecting whether the parking fee corresponding to the target vehicle has been paid; if not paid, sending a payment reminder to the vehicle owner; if paid, retrieving the payment time of successful payment, calculating the difference between the current vehicle passage time and the payment time, and determining whether the difference is within the preset free departure buffer period; if yes, determining whether the parking fee has been successfully paid; if not, calculating the difference between the difference and the free departure buffer period, determining it as exceeding the time limit, calculating the additional stay fee according to the preset overtime billing standard, and sending a corresponding overtime payment reminder to the vehicle owner.

[0017] By adopting the above technical solution, the payment status is automatically checked after a vehicle arrives at the inspection area. If payment is not made, a reminder to pay is sent; if payment has been made, the free departure buffer period is verified. The payment reminder ensures that no fees are missed, the buffer period is set to accommodate the reasonable departure time of car owners, and the overtime billing and reminder to pay ensures the revenue of the parking lot. The linkage between the barrier gate and payment status, buffer period, and overtime billing not only standardizes fee collection but also avoids unreasonable vehicle blocking, balancing the rights of car owners and the needs of parking lot management.

[0018] In conjunction with some embodiments of the first aspect, in some embodiments, the step of pushing a payment reminder to the vehicle owner if payment is not made includes: obtaining the entry time of the target vehicle, and determining the updated parking fee based on the entry time and the current vehicle passage time according to the time-based charging standard; updating the unpaid parking fee bill to the updated parking fee to cover the original bill amount and billing duration information; and pushing a payment reminder to the vehicle owner via a mini-program.

[0019] By adopting the above technical solution, parking fees are updated based on the elapsed time when payment is not made, overwriting the original bill and sending a payment reminder. Real-time updated fees ensure accurate billing, avoiding calculation errors due to delayed departure times, allowing drivers to clearly know the amount due, while also guaranteeing the accuracy of parking fee collection, reducing disputes, and improving the transparency and credibility of the payment process.

[0020] In some embodiments of the first aspect, after receiving the target parking space selected by the driver and generating a target navigation path from the entrance to the target parking space, the method further includes: monitoring the occupancy status of the target parking space in real time during the driver's journey to the target parking space; when the target parking space is detected to be occupied by other vehicles, triggering a parking space reallocation process, specifically including: obtaining real-time parking space information of all passages and both sides of the target navigation path; searching for available alternative parking spaces along the target navigation path based on the real-time parking space information; if an available alternative parking space exists, selecting the parking space closest to the driver's current location as the new target parking space; generating an updated navigation path from the current location to the new target parking space, and pushing a parking space change notification and the updated navigation path to the driver via a mini-program; if no available alternative parking space exists, searching for available alternative parking spaces within a preset range matching the target navigation path based on the driver's current location; and regenerating an alternative navigation path based on the alternative parking spaces according to the principle of minimizing the total number of passing vehicles and pushing it to the driver.

[0021] By adopting the above technical solution, reallocation can be triggered as soon as the target parking space is occupied, avoiding the embarrassment of drivers arriving to find the parking lot full. Priority is given to searching for alternative parking spaces along the original navigation route, maximizing the value of the route already traveled and reducing extra detours and wasted time due to replanning. By selecting the nearest parking space along the route as the new target, drivers can park nearby without having to return or significantly change their driving direction. When no available parking spaces are found along the route, the route is searched and replanned within a preset range based on the current location. This expands the range of parking space choices and ensures the new route is equally efficient and unobstructed by using the principle of minimizing the total number of passing vehicles. Real-time push notifications of parking space changes keep drivers informed of adjustments, preventing them from blindly heading to occupied spaces. The entire dynamic adjustment process represents an upgrade from "fixed target" to "intelligent adaptation," significantly improving parking lot utilization and the fault tolerance and flexibility of the driver's navigation experience.

[0022] In a second aspect, this application provides a server comprising: one or more processors and a memory; the memory being coupled to the one or more processors, the memory being used to store computer program code including computer instructions, the one or more processors invoking the computer instructions to cause the server to perform the methods described in the first aspect and any possible implementation thereof.

[0023] Thirdly, this application provides a computer program product that, when run on a server, causes the server to perform the method described in the first aspect and any possible implementation thereof.

[0024] One or more technical solutions provided in the embodiments of this application have at least the following technical effects or advantages: 1. By adopting a full-process data linkage technology that uses the barrier gate as the core node and integrates vehicle entry and exit time recording, intelligent navigation via mini-program (entry guidance for parking + exit guidance), automatic fee calculation and push, and real-time detection of payment status at the barrier gate, the technical problems of "slow entry and long exit queues" caused by the isolation of barrier gate, parking space, navigation, and billing data in existing technologies are effectively solved. This achieves efficient connection of the entire process from vehicle entry to exit, improving the barrier gate's passage efficiency and parking lot turnover capacity.

[0025] 2. By adopting a technical approach that uses gate-related data as a basis to obtain the full navigation path and collects the number of vehicles passing through each channel in real time and calculates the total to select the optimal path, the technical problems of the existing technology, such as the navigation system's path information being independent of gate and parking space data and the navigation not being combined with real-time traffic flow, resulting in slow entry and parking space finding, are effectively solved. This achieves dynamic matching of navigation path with real-time traffic flow in the parking lot, shortens the vehicle entry and parking space finding time, and alleviates congestion within the parking lot.

[0026] 3. By adopting a technology centered on the barrier gate, using inductive loops to detect parking space status in real time to trigger departure navigation, and combining exit queuing information (related to barrier gate passage data) to generate paths and estimated time, the technology effectively solves the technical problems of "long departure queues" caused by manual triggering of departure navigation and disconnection from barrier gate exit data in existing technologies. This achieves the technical effect of precise triggering of departure navigation and linkage with exit passage efficiency, reducing vehicle departure waiting time and improving the smoothness of barrier gate passage. Attached Figure Description

[0027] Figure 1 This is a flowchart illustrating the intelligent barrier gate access control method with full-process data linkage in the embodiments of this application; Figure 2 This is another flowchart illustrating the intelligent barrier gate access control method with full-process data linkage in the embodiments of this application; Figure 3 This is a schematic diagram of the physical device structure of a server in an embodiment of this application. Detailed Implementation

[0028] The terminology used in the following embodiments of this application is for the purpose of describing particular embodiments only and is not intended to be limiting of this application. As used in the specification and appended claims of this application, the singular expressions “a,” “an,” “the,” “the,” “the,” and “this” are intended to include the plural expressions as well, unless the context clearly indicates otherwise. It should also be understood that the term “and / or” as used in this application refers to and includes any or all possible combinations of one or more of the listed items.

[0029] Hereinafter, the terms "first" and "second" are used for descriptive purposes only and should not be construed as implying or suggesting relative importance or implicitly indicating the number of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature, and in the description of the embodiments of this application, unless otherwise stated, "multiple" means two or more.

[0030] For ease of understanding, the method provided in this implementation is described in process below. Please refer to [link / reference]. Figure 1 This is a flowchart illustrating a smart barrier gate access control method with full-process data linkage in an embodiment of this application.

[0031] S101. When the target vehicle passes through the barrier gate, record the entry time; Among them, the target vehicle refers to a specific vehicle that is about to enter the underground parking lot and trigger the barrier gate's passage detection, used to identify the target of service and recording; the barrier gate refers to the device installed at the entrance of the underground parking lot, which has the function of raising and lowering the barrier, used to control the entry and exit of vehicles; the entry time refers to the specific time when the target vehicle completely passes through the barrier gate entrance and the barrier gate completes the lowering action, used for subsequent calculation of parking time. For example, if a car with license plate number Yue A12345 completely passes through the entrance barrier gate at 10:05:30, the recorded 10:05:30 is the entry time.

[0032] Specifically, this step is executed after the target vehicle reaches the detection area of ​​the entrance gate and triggers the gate's sensing devices (such as inductive loops or license plate recognition cameras). The server captures the vehicle's passage status in real time through the hardware devices associated with the gate. When it detects that both the front and rear wheels of the vehicle have passed through the gate's lowering area and that license plate recognition is complete (ensuring a unique vehicle identity), it immediately synchronizes the system time, accurately records this moment as the entry time, and binds and stores the entry time with the vehicle's license plate information to form the vehicle's basic entry data. This provides a time basis for subsequent processes such as parking navigation and fee calculation, avoiding data association errors caused by recording timing deviations.

[0033] It should be noted that the server in this application is a barrier gate control server, which communicates with sensing devices (including parking space ground induction coils, channel cameras, barrier gate detection area sensors, etc.) and barrier gate control devices (control modules used to execute the raising and lowering of the barrier arm). It can also obtain the vehicle owner's vehicle-related information (such as license plate binding information, mini-program login account information), parking space selection instructions, exit selection instructions, and payment operation feedback through the mini-program. Before this, the vehicle owner needs to complete the authorization consent through the mini-program, including agreeing to the server obtaining the vehicle information associated with their account, receiving navigation service push, synchronizing parking fees and payment status data, and obtaining real-time parking space and traffic flow information in the parking lot, etc., to ensure that the data interaction between the server and the vehicle owner's user terminal is legal and compliant, while ensuring the accuracy of service push and operation response.

[0034] S102. Push the intelligent navigation service to the car owner via a mini-program to guide the car owner to park; The server first retrieves a pre-stored panoramic parking space distribution map of the underground parking lot and uses this map to guide drivers to their parking spots. Details are provided in subsequent steps S201 to S206, and will not be repeated here.

[0035] S103. When it is determined that the target vehicle is about to leave the underground parking lot, push the message to the vehicle owner to exit the intelligent navigation service; The server continuously receives electromagnetic signals from ground-sensor coils linked to the target vehicle's parking space. When a vehicle is parked in a space, the coil generates a specific induction signal due to metal obstruction (indicating "occupied"). When the vehicle starts moving away from the space, the coil's induction signal disappears (indicating "no vehicle present"). At this point, the server detects the "vehicle signal change" and immediately determines that the target vehicle is preparing to leave. Subsequently, the server sends data requests to the gate systems, cameras, and other devices at each exit to obtain the current number of vehicles queuing at each exit and the average time per vehicle to pass, calculating the estimated queuing time for each exit. Simultaneously, the server combines the internal layout of the parking lot's passageways (such as passageway direction, width, and whether it is one-way) and real-time traffic flow data (current vehicle density in each passageway) to generate all feasible navigation paths from the vehicle's current parking space location to each exit, and calculates the estimated time for each path—this time includes the vehicle's travel time within the passageway (based on path length and preset passage speed) and the queuing waiting time after reaching the exit (based on the exit queuing situation). Afterwards, the server compiles a list of navigation routes (including route maps and key turning points) and estimated travel times for all exits, and pushes this list to the driver's app via a mini-program. Drivers can view and select their target exit (e.g., the exit with the shortest estimated travel time) within the mini-program interface. Once the driver confirms the target exit in the mini-program, the server immediately optimizes the navigation route for that exit, adding real-time traffic updates (e.g., temporary congestion requiring detours), lane numbers, remaining distance to the exit, and other details. This information is then pushed back to the driver via the mini-program. Drivers can then efficiently navigate to their target exit based on the navigation guidance, avoiding excessively long departure times due to unfamiliarity with exit layouts or queue conditions.

[0036] S104. Record the departure time of the target vehicle, and determine the parking fee based on the preset time-based charging standard, according to the entry time and the departure time. The departure time refers to the specific point in time when the target vehicle arrives at the exit gate detection area of ​​the underground parking lot, and the server completes license plate recognition and confirms that the vehicle is ready to leave.

[0037] After the server completes license plate recognition and associates it with the vehicle's entry record, it first detects the vehicle using the inductive loop at the exit gate and the license plate recognition camera. Once it confirms that the vehicle is the target vehicle preparing to leave (the license plate information matches the entry record), it accurately records the system time as the departure time and binds it with the entry time recorded in S101 for storage. Subsequently, the server retrieves the preset time-based charging standard and calculates the parking duration: subtracting the entry time from the departure time to obtain the actual number of hours and minutes of parking. If there are any minutes less than 1 hour, they are rounded up or rounded down according to the charging standard (e.g., less than 1 hour is calculated as 1 hour). Based on the calculated billing duration, the charging standard is applied in segments. For example, parking for 3 hours and 20 minutes is charged as 4 hours, with 5 yuan for the first hour and 2 yuan for every 30 minutes of the remaining 3 hours (totaling 12 yuan), for a total parking fee of 17 yuan. After the server completes the fee calculation, it associates the parking fee with the vehicle's license plate, entry and exit time, billing duration, and other information to form a complete bill, preparing for subsequent push notifications and payment detection.

[0038] S105. Send the parking fee to the car owner; The server first integrates detailed parking fee information, including total amount, entry time, exit time, actual parking duration, billing duration, segmented charging details, and charging standard basis, forming a structured fee bill. Then, the server sends this fee bill to the car owner's mini-program via a push notification interface, such as pop-up alerts and service notifications, ensuring the car owner can receive and view it in real time. Simultaneously, the server includes a payment link in the bill, allowing the car owner to directly access the payment page and complete the payment. If the car owner does not view or pay in time, the server will send another reminder before the vehicle reaches the exit gate, preventing congestion at exit due to the car owner's lack of awareness of the fee and ensuring a smooth payment process that seamlessly connects to the gate's opening procedure.

[0039] S106. When the target vehicle arrives at the preset detection area of ​​the barrier gate, check whether the parking fee has been successfully paid. This step is triggered when the target vehicle reaches the preset detection area of ​​the exit gate. Its core function is to complete the final verification of the payment status and handle any abnormal situations. First, when the vehicle enters the preset detection area, the ground loop or camera immediately sends a detection signal to the server. The server records the system time at this moment as the current vehicle passage time, and at the same time retrieves the vehicle's fee record based on the license plate recognition result to check whether the parking fee has been paid.

[0040] If no payment record is found or the payment was unsuccessful, the server retrieves the vehicle's entry time (the exact time recorded upon entry) from the database based on the vehicle's license plate information. Simultaneously, it confirms the currently recorded "current vehicle passage time" (the time the vehicle arrives at the preset detection area). Next, the server uses a preset time-based pricing standard, calculating the parking duration based on both the entry and current vehicle passage times. This involves subtracting the entry time from the current vehicle passage time to obtain the actual parking duration, and then calculating the fee in segments according to the pricing standard (e.g., if the entry time is 10:00 and the current vehicle passage time is 13:12, the actual parking time is 3 hours and 12 minutes, charged as 3.5 hours, with 5 yuan per hour and 2 yuan per 30 minutes for the remaining 2.5 hours, updating the parking fee to 5+). (10 = 15 yuan); Subsequently, the server queries the unpaid bill corresponding to the vehicle, replaces all information such as the amount and billing duration in the original bill with the updated parking fee and actual billing duration calculated this time, and updates the bill generation time to ensure that the car owner sees the latest and most accurate amount due, avoiding disputes caused by the lag in the original billing; finally, the server integrates the updated bill information into the payment reminder, which includes the updated total fee, entry time, current elapsed time, actual parking duration, billing details, charging standard basis, and a direct jump to the payment portal. It is pushed to the car owner through the mini-program in the form of pop-ups, service notifications, etc., and message unread reminders are set to ensure that the car owner receives it in time, so as to facilitate the car owner to quickly complete the payment and avoid departure congestion due to inaccurate fee information or failure to remind in a timely manner.

[0041] If payment is detected, the server retrieves the successful payment time (i.e., payment time), calculates the difference between the current vehicle's transit time and the payment time (i.e., the dwell time difference), and compares this difference with a preset free departure buffer period (e.g., 15 minutes). If the dwell time difference is within the buffer period (e.g., arriving at the detection area 10 minutes after payment), the parking fee is considered successfully paid, and the vehicle is allowed to leave. If the dwell time difference exceeds the buffer period (e.g., arriving 20 minutes after payment, exceeding the limit by 5 minutes), the server calculates the excess time (5 minutes), calculates an additional dwell time fee (1 yuan) according to a preset overtime billing standard (e.g., 1 yuan per 5 minutes), and then generates an overtime payment reminder containing the reason for the overtime, the overtime duration, the additional fee, and a payment option, and pushes it to the vehicle owner. This ensures that the vehicle owner completes all payments before leaving, thus protecting parking lot revenue while also accommodating the reasonable dwell time needs of vehicle owners through the buffer period setting.

[0042] S107. If so, open the gate.

[0043] This step is executed the instant after successful parking fee payment is detected in S106, without any additional waiting. Upon confirming successful payment, the server immediately sends an "open gate" command to the exit gate control module, which includes the vehicle's license plate information (to reconfirm the vehicle's eligibility). After receiving the command, the gate control module starts the motor to drive the gate arm to rise smoothly at a preset speed (e.g., within 2 seconds), while simultaneously displaying the "allowed" status (e.g., a green light) on the gate's indicator lights. Once the vehicle has completely passed through the gate's exit area (the ground loop detects the rear wheels have left), the server receives a "vehicle has passed" signal from the gate and then sends a "lower gate" command. The gate arm slowly descends to its closed state, completing one passage process. Throughout the entire process, the server communicates with the gate control module in real time to ensure accurate and smooth gate arm movement, avoiding problems such as vehicle damage or passage errors due to command delays or errors.

[0044] In this embodiment, by adopting a full-process data linkage technology that integrates automatic recording of vehicle entry and exit times, intelligent navigation throughout the entire process (entry guidance + exit guidance) via a mini-program, real-time calculation and push of parking fees, and linkage detection of payment status at the gate, the technology achieves real-time sharing and efficient collaboration of data from each stage of vehicle entry to exit. This effectively solves the industry pain points of "slow entry and parking space finding, long exit queues, and payment and release issues" caused by the isolation of gate, parking space, navigation, and billing data in the prior art. As a result, it achieves the technical effects of improving gate passage efficiency, optimizing parking lot turnover capacity, and improving the parking experience for car owners.

[0045] Based on the above, the following is a more detailed description of the process provided in this implementation. Please refer to [link / reference]. Figure 2 This is another flowchart illustrating the intelligent barrier gate access control method with full-process data linkage in this application embodiment.

[0046] S201. Obtain a panoramic parking space distribution map of the underground parking lot. This panoramic parking space distribution map marks the real-time occupancy status of parking spaces in each area and the current driver's entrance location. The panoramic parking space distribution map refers to an electronic map covering the entire area of ​​the underground parking lot, presenting the parking space layout in a visual format, including spatial information such as parking space numbers, passageway directions, and entrance / exit locations. Real-time parking space occupancy status refers to the parking space usage updated in real time by sensors, including three categories: "vacant," "occupied," and "reserved," reflecting whether a parking space is currently available. The current vehicle owner's entrance location refers to the specific coordinates of the entrance (e.g., entrance 1, entrance A) used by the target vehicle when entering the underground parking lot, and is linked to the gate location. For example, in the panoramic parking space distribution map of an underground parking lot, parking space number 12 in area B is marked as "vacant," and entrance A in area A is marked as the current entrance location for the vehicle owner. Specifically, this step is performed after the target vehicle completes the S101 entry time recording and before pushing the intelligent navigation service; its core purpose is to provide basic data support for subsequent navigation. Specifically, the server establishes real-time communication with sensors such as ground loops and cameras in each parking space within the parking lot, synchronously collecting occupancy status data for all parking spaces to ensure that the usage status of each parking space can be dynamically updated. At the same time, based on the entrance gate information recorded in S101, the server accurately locates the coordinates of the driver's entrance. Subsequently, the server integrates the real-time occupancy status data of the parking spaces, the coordinates of the entrance, and the preset parking lot spatial layout map to generate a complete panoramic parking space distribution map. The map clearly marks the parking space status with different colors (such as green for vacancy and red for occupation) and marks the entrance location with special icons to ensure that drivers can intuitively identify key information, laying a data foundation for subsequent parking space selection and route planning.

[0047] S202. Send the panoramic parking space distribution map to the car owner's client via a mini-program so that the car owner can select a parking location; The "car owner user interface" refers to the mini-program interface where car owners log in and bind their vehicle information, offering features such as map viewing and interactive selection. The "parking location" refers to the parking space selected by the car owner from the panoramic parking space distribution map that meets their needs (e.g., close to the entrance, near the elevator) and is marked as "vacant." For example, if a car owner opens the received panoramic parking space distribution map in the mini-program and sees parking space C08 marked as vacant (green) and close to their entrance, they can select it as their parking location.

[0048] The server sends the generated panoramic parking space distribution map to the car owner's client in a zoomable and draggable interactive format via the mini-program's message push interface. When the map loads, a "vacant parking space" filter button and a distance sorting function are displayed simultaneously for the car owner to quickly filter. The car owner can freely view the layout of each area of ​​the parking lot on the client, and click on any vacant parking space to view the parking space details (such as parking space size, whether it is close to the elevator / exit). Based on their own needs, the car owner can choose a parking location and submit the selection command. The server receives the car owner's selection feedback in real time and locks the destination for subsequent navigation route generation.

[0049] After receiving the target parking space selected by the car owner, a target navigation path is generated from the entrance location to the target parking space, specifically including S203 to S205: S203. Obtain all navigation paths from the entrance location to the target parking space; All navigation routes refer to all feasible routes from the entrance to the target parking space, based on the layout of the underground parking garage's passageways, excluding routes that violate traffic rules (such as driving in the wrong direction or crossing restricted areas). For example, from entrance A to parking space 08 in area C, feasible routes include "Passage 2 → Passage 5" and "Passage 3 → Passage 6 → Passage 5," which are all navigation routes obtained in this step. Specifically, this step is executed after the server has locked the entrance location and the coordinates of the target parking space, and is a fundamental prerequisite for route selection.

[0050] Specifically, the server calls the preset parking lot lane topology data (including the connection relationship between lanes and traffic direction restrictions), takes the entrance position as the starting point and the target parking space as the ending point, and uses a path search algorithm (such as Dijkstra's algorithm) to traverse all possible lane combinations, select all feasible routes that do not violate the traffic rules, and store the lane sequence, path node coordinates and other information of each route as structured data, providing a complete candidate set for subsequent congestion statistics and optimal route selection.

[0051] S204. Count the number of vehicles passing through each channel in each navigation path in real time, and calculate the total number of vehicles passing through all channels in each navigation path. Here, "channel" refers to a segment of road within a parking lot connecting different areas for vehicle traffic, with each channel having an independent number and a fixed direction of travel. "Real-time vehicle count" refers to the total number of vehicles currently traveling in a channel, detected in real-time by cameras and inductive loops within that channel. "Total vehicle count" is the sum of the real-time vehicle counts of all channels included in a navigation path, used to reflect the overall congestion level of that path. For example, if a navigation path includes channels 2 and 5, with 3 vehicles passing through channel 2 and 2 vehicles passing through channel 5, then the total vehicle count for that path is 5. Specifically, this step is executed immediately after the server obtains all navigation paths, and its core function is to quantify the congestion situation of each path. Specifically, the server establishes a data connection with the real-time monitoring equipment deployed in each channel to synchronously collect the current number of vehicles passing through each channel included in each candidate path, ensuring the real-time nature of the data (delay not exceeding 10 seconds). Subsequently, for each navigation path, the number of vehicles passing through all the channels it includes is summed to obtain the total number of vehicles passing through each path. The larger the sum, the higher the current congestion level of the path, providing a quantitative basis for subsequent selection of the optimal path.

[0052] S205. Select the navigation path with the fewest total number of passing vehicles and determine it as the target navigation path; The server sorts all candidate navigation routes by the total number of passing vehicles from smallest to largest, and directly selects the first-ranked route (i.e., the route with the smallest total) as the target navigation route; if multiple routes have the same total (e.g., route A and route B both have a total of 4 vehicles), then proceeds to the second screening step S206 to ensure that the routes are further optimized under the same level of congestion, ultimately providing drivers with the navigation guidance with the highest traffic efficiency.

[0053] S206. If there are multiple navigation paths with the same total number of passing vehicles, calculate the total number of channels contained in each navigation path and select the path with the fewest total channels as the target navigation path. For candidate routes with the same total number of passing vehicles, the server counts the total number of lane segments contained in each route and uses the total number of lanes as the second filtering dimension. By comparing the total number of lanes, the route with the fewest lanes is selected as the target navigation route. This is because the fewer lanes there are, the fewer turns the driver needs to make during the journey and the less difficult it is to remember the route, which reduces the probability of getting lost or taking detours and further improves the practicality and convenience of navigation. If there are still routes with the same total number of lanes, the process proceeds to S207 for a third filtering step.

[0054] S207. If the total number of channels is the same, calculate the total length of each navigation path and select the path with the shortest total length as the target navigation path.

[0055] The server retrieves the length data of parking lanes (pre-set in the system database, containing the actual length of each lane). For candidate paths with the same total number of lanes, it calculates the total length of each path (by adding up the lengths of all lanes included in the path). By comparing the total lengths, the shortest path is selected as the target navigation path, ensuring that drivers travel the shortest distance and take the least amount of time under the same level of congestion and driving complexity. This achieves comprehensive optimization of the navigation path, maximizing the parking efficiency and experience for drivers.

[0056] In this embodiment, a panoramic parking space distribution map marked with the real-time occupancy status and entrance location is used to allow car owners to select their target parking space. The optimal navigation route is generated through multi-dimensional filtering (first by the total number of passing vehicles, then by the total number of passageways, and finally by the total length). This achieves accurate matching between the entry navigation and the real-time traffic flow and spatial layout of the parking lot. It effectively solves the problem in the prior art where the navigation route does not combine the real-time parking space status and traffic flow, leading to car owners blindly taking detours and causing congestion in the parking lot. As a result, it enables car owners to quickly locate and reach their target parking space, and improves the utilization rate of parking spaces and the efficiency of traffic flow in the parking lot.

[0057] In some embodiments, during the process of a driver parking according to a target navigation route, the target parking space may be occupied by another vehicle before the driver arrives. To address this issue, this application also provides a dynamic parking space reallocation mechanism to ensure that when a driver encounters an occupied target parking space during their journey, they can obtain a timely and efficient alternative, avoiding ineffective driving and a decline in the parking experience.

[0058] Specifically, as the driver travels to the target parking space, the server maintains a real-time communication connection with the inductive loop connected to that space, continuously monitoring its occupancy status. The inductive loop sends electromagnetic induction signals to the server at a preset detection frequency (e.g., once every 2 seconds). When the parking space is vacant, the loop signal maintains a stable "no vehicle" characteristic value. Once another vehicle enters and parks in the space, the loop signal abruptly changes from "no vehicle" to "occupied" due to metal obstruction. Upon detecting this signal change, the server immediately updates the target parking space's status from "vacant" to "occupied," and compares it with the driver's currently linked target parking space information to confirm that the occupied space is indeed the one the driver is heading to. At this point, the server triggers a parking space reallocation process, initiating a series of intelligent alternative parking space searches and route replanning operations.

[0059] When a target parking space is detected to be occupied by another vehicle, the server first obtains real-time parking space information for all lanes along the target navigation path and the parking spaces on both sides. Specifically, the server retrieves pre-stored parking lot spatial topology data, parses out the complete lane sequence contained in the current target navigation path (e.g., "Valley A → Lane B → Lane C"), and identifies all parking space numbers and their spatial coordinates distributed on both sides of each lane. Subsequently, the server sends data requests to sensors such as inductive loops and cameras corresponding to the parking spaces along these lanes, collecting the current occupancy status data of each parking space in real time, ensuring that the data delay does not exceed 3 seconds, forming a structured real-time parking space information set containing "parking space number, occupancy status (free / occupied), and parking space coordinates". Through this step, the server can accurately grasp the parking space resources along the original navigation path, laying a data foundation for subsequent selection of alternative parking spaces.

[0060] Next, the server uses the real-time parking information to search for available parking spaces along the target navigation path. The server iterates through the real-time parking information set obtained in the previous step, filtering out all spaces marked as "available," and uses these spaces as a candidate set. At this point, the server checks if the candidate set is empty: if an available parking space exists, it proceeds with the priority processing logic—selecting the parking space closest to the driver's current location as the new target parking space. Specifically, the server uses a mini-program to obtain the driver's current location coordinates in real-time (based on parking lot internal positioning technologies such as Bluetooth beacons, WiFi positioning, or vehicle trajectory estimation), calculates the straight-line distance or the actual path distance along the passage from the driver's current location to each available parking space in the candidate set, and selects the parking space with the smallest distance value as the new target parking space. This filtering logic ensures that the driver can park as close as possible along the original route, minimizing the extra driving distance and time cost caused by the target parking space being occupied.

[0061] Once a new target parking space is identified, the server immediately generates an updated navigation route from the current location to that new target parking space. Using the driver's current location coordinates as the starting point and the new target parking space coordinates as the ending point, the server uses a route planning algorithm, combined with the parking lot's lane layout and traffic direction restrictions, to calculate the optimal driving route. Simultaneously, the server compares and analyzes the updated navigation route with the original target navigation route, marking key nodes of the route change (e.g., "change from right turn to straight at intersection B"), providing a clear explanation of the route adjustment. Subsequently, the server pushes a parking space change notification and the updated navigation route to the driver via a mini-program. The notification includes the text "The original target parking space is occupied. You have been reassigned a parking space along the route [new parking space number], please follow the updated route." Combined with the updated navigation map (highlighting the new parking space location and the new route), voice prompts, and other multimodal prompts, this ensures that the driver receives and understands the change information immediately, quickly adjusts their driving direction, and seamlessly connects to the new target parking space.

[0062] If the server finds no available parking spaces along the target navigation path (i.e., the candidate set is empty), it enters an emergency processing logic to expand the search range. Based on the driver's current location, the server searches for available parking spaces within a preset range matching the target navigation path. Specifically, the preset range can be defined as a circular area centered on the driver's current location with a radius of 50 or 100 meters, or a rectangular area extending a certain distance to both sides (e.g., to adjacent lanes) along the original target navigation path. The server flexibly chooses the range definition method based on the actual layout of the parking lot. Within this preset range, the server sends data requests to the sensors of all parking spaces to collect real-time occupancy status information and filters out all parking spaces with a "vacant" status as a new set of candidate parking spaces. Subsequently, the server regenerates a candidate navigation path based on the principle of minimizing the total number of passing vehicles. The specific operation is as follows: Starting from the driver's current location, the server calculates all feasible navigation routes to each available parking space within a preset range. It then counts and sums the real-time number of vehicles passing through all lanes included in each route, selecting the route with the lowest total number of passing vehicles as the optimal alternative navigation route. If multiple routes have the same total number of passing vehicles, a second and third round of selection are performed based on the principles of minimum total number of lanes and shortest total length, ensuring that the final generated route balances traffic efficiency and driving convenience. After route generation, the server pushes the alternative navigation route along with the available parking space information (parking space number, location, and estimated arrival time) to the driver for confirmation and travel.

[0063] By adopting the aforementioned dynamic parking space reallocation mechanism, this application effectively solves the navigation failure problem caused by the high mobility of parking spaces during peak hours and the easy occupancy of target parking spaces. It realizes a technical upgrade from "static target locking" to "dynamic intelligent adaptation", significantly improving the robustness and user experience of the parking navigation system.

[0064] The server in the embodiments of this invention is described below from the perspective of hardware processing. Please refer to [link / reference]. Figure 3 This is a schematic diagram of the physical device structure of a server in an embodiment of this application.

[0065] It should be noted that, Figure 3 The server structure shown is merely an example and should not impose any limitations on the functionality and scope of use of the embodiments of the present invention.

[0066] like Figure 3 As shown, the server includes a Central Processing Unit (CPU) 301, which can perform various appropriate actions and processes based on a program stored in Read-Only Memory (ROM) 302 or a program loaded from storage portion 308 into Random Access Memory (RAM) 303, such as performing the methods described in the above embodiments. The RAM 303 also stores various programs and data required for system operation. The CPU 301, ROM 302, and RAM 303 are interconnected via a bus 304. An Input / Output (I / O) interface 305 is also connected to the bus 304.

[0067] The following components are connected to I / O interface 305: input section 306 including audio input devices, push-button switches, etc.; output section 307 including a liquid crystal display (LCD) and audio output devices, indicator lights, etc.; storage section 308 including a hard disk, etc.; and communication section 309 including a network interface card such as a LAN (Local Area Network) card, modem, etc. Communication section 309 performs communication processing via a network such as the Internet. Drive 310 is also connected to I / O interface 305 as needed. Removable media 311, such as a disk, optical disk, magneto-optical disk, semiconductor memory, etc., are installed on drive 310 as needed so that computer programs read from them can be installed into storage section 308 as needed.

[0068] In particular, according to embodiments of the present invention, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, embodiments of the present invention include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing computer programs for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via communication section 309, and / or installed from removable medium 311. When the computer program is executed by central processing unit (CPU) 301, it performs the various functions defined in the present invention.

[0069] It should be noted that specific examples of computer-readable storage media may include, but are not limited to: electrical connections having one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable compact disc read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination thereof. In this invention, a computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

[0070] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. Each block in a flowchart or block diagram may represent a module, program segment, or portion of code, which contains one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those shown in the drawings.

[0071] Specifically, the server in this embodiment includes a processor and a memory. The memory stores a computer program. When the computer program is executed by the processor, it implements the intelligent barrier gate access control method with full-process data linkage provided in the above embodiment.

[0072] In another aspect, the present invention also provides a computer-readable storage medium, which may be included in the server described in the above embodiments; or it may exist independently and not assembled into the server. The storage medium carries one or more computer programs that, when executed by a processor of the server, enable the server to implement the intelligent gate access control method with full-process data linkage provided in the above embodiments.

[0073] The above-described embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit it. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of this application.

[0074] As used in the above embodiments, depending on the context, the term "when..." can be interpreted as meaning "if...", "after...", "in response to determining...", or "in response to detecting...". Similarly, depending on the context, the phrase "when determining..." or "if (the stated condition or event) is interpreted as meaning "if determining...", "in response to determining...", "when (the stated condition or event) is detected", or "in response to detecting (the stated condition or event)".

[0075] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. This program can be stored in a computer-readable storage medium, and when executed, it can include the processes described in the above method embodiments. The aforementioned storage medium includes various media capable of storing program code, such as ROM or random access memory (RAM), magnetic disks, or optical disks.

Claims

1. A full-process data linkage intelligent barrier passage control method applied to a server, characterized in that, The method comprises: When the target vehicle passes through the barrier gate, record the entering time; Through the applet, push the entering intelligent navigation service to the vehicle owner to guide the vehicle owner to park; When it is determined that the target vehicle is ready to leave the underground parking lot, push the exiting intelligent navigation service to the vehicle owner; Record the leaving time of the target vehicle, and determine the parking fee according to the entering time and the leaving time based on the preset time length charging standard; Push the parking fee to the vehicle owner; When the target vehicle arrives at the preset detection area of the barrier gate, detect whether the parking fee is paid successfully; If yes, open the barrier arm.

2. The method of claim 1, wherein, The step of pushing the entering intelligent navigation service to the vehicle owner through the applet comprises: Obtain the panoramic parking lot distribution map of the underground parking lot, and the panoramic parking lot distribution map is marked with the real-time occupancy state of each area and the entrance position of the current vehicle owner; Send the panoramic parking lot distribution map to the vehicle owner user end through the applet for the vehicle owner to select the parking position; After receiving the target parking position selected by the vehicle owner, generate the target navigation path from the entrance position to the target parking position.

3. The method of claim 2, wherein, The step of generating the target navigation path from the entrance position to the target parking position after receiving the target parking position selected by the vehicle owner comprises: Obtain all navigation paths from the entrance position to the target parking position; Count the real-time number of passing vehicles in each channel included in each navigation path, and calculate the total number of passing vehicles of all channels in each navigation path; Select the navigation path with the least total number of passing vehicles as the target navigation path.

4. The method of claim 3, wherein, After the step of selecting the navigation path with the least total number of passing vehicles as the target navigation path, the method further comprises: If there are multiple navigation paths with the same total number of passing vehicles, calculate the total number of channels included in each navigation path, and select the path with the least total number of channels as the target navigation path; If the total number of channels is the same, calculate the total length of each navigation path, and select the path with the shortest total length as the target navigation path.

5. The method of claim 1, wherein, The step of pushing the exiting intelligent navigation service to the vehicle owner when it is determined that the target vehicle is ready to leave the underground parking lot comprises: Real-time detect the parking space state through the ground inductive coil corresponding to the parking space of the target vehicle: If the ground inductive coil detects a vehicle signal change, it is determined that the target vehicle is ready to leave; Obtain the vehicle departure queuing situation of each exit; Generate all navigation paths from the current position to each exit and the corresponding estimated time for the vehicle owner to select; After the vehicle owner determines the target exit, push the corresponding navigation path to the vehicle owner through the applet.

6. The method of claim 1, wherein, The step of detecting whether the parking fee is paid successfully when the target vehicle arrives at the preset detection area of the barrier gate comprises: When the target vehicle arrives at the preset detection area, record the current vehicle passing time, and detect whether the parking fee corresponding to the target vehicle is paid: If not, push the payment prompt to the vehicle owner; If the payment is successful, the payment time of the successful payment of the parking fee is called, the stay difference between the current vehicle passing time and the payment time is calculated, and it is determined whether the stay difference is within a preset free departure buffer period; If yes, it is determined whether the parking fee is paid successfully; If no, the difference between the stay difference and the free departure buffer period is calculated, it is determined that the time is exceeded, the additional stay fee is calculated according to a preset overtime charging standard, and the corresponding overtime payment prompt is pushed to the vehicle owner.

7. The method of claim 6, wherein, The step of pushing the payment prompt to the vehicle owner if the payment is not successful, comprises: obtaining the entering time of the target vehicle, and determining an updated parking fee according to the entering time and the current vehicle passing time based on a time length charging standard; updating the unpaid parking fee bill to the updated parking fee to cover the original bill amount and charging time length information; pushing a payment prompt to the vehicle owner through a mini program.

8. The method of claim 2, wherein, After the step of generating a target navigation path from the entrance position to the target parking space after the vehicle owner selects the target parking space, the step further comprises: monitoring the occupancy state of the target parking space in real time during the vehicle owner going to the target parking space; when it is detected that the target parking space is occupied by other vehicles, triggering a parking space re-allocation process, which specifically comprises: obtaining real-time parking space information of all passages and both sides passed by the target navigation path; combining the real-time parking space information to search for an idle alternative parking space along the target navigation path; if there is an idle alternative parking space, selecting the parking space closest to the current position of the vehicle owner as a new target parking space; generating an updated navigation path from the current position to the new target parking space, and pushing a parking space change prompt and the updated navigation path to the vehicle owner through a mini program; if there is no idle alternative parking space, searching for an available alternative parking space within a preset range matching the target navigation path based on the current position of the vehicle owner; regenerating an alternative navigation path according to the alternative parking space according to the principle of least total number of passing vehicles and pushing it to the vehicle owner.

9. A server, characterized by The server comprises one or more processors and a memory; the memory is coupled to the one or more processors, the memory is used to store computer program code, the computer program code comprises computer instructions, and the one or more processors invoke the computer instructions to enable the server to perform the method of any one of claims 1-8.

10. A computer program product, characterised in that, When the computer program product runs on the server, the server performs the method of any one of claims 1-8. When the computer program product runs on the server, the server performs the method of any one of claims 1-8.

Images