A data processing system for enabling dedicated lanes

Abstract

The application relates to the technical field of traffic control, in particular to a data processing system for enabling a special lane, which comprises a key section list, a lane indication screen list, a processor and a memory storing a computer program, and the computer program is executed by the processor to realize the following steps: when the real-time vehicle speed of any key section is lower than the preset key average speed corresponding to the key section, and a target vehicle passes through the key section within a preset time length, a first special lane is enabled in the key section; every preset period, all target vehicle groups passing through the key section within the preset time length and time information of each target vehicle group are acquired; and whether a second special lane is opened is judged according to the time information. It is known that the application realizes dynamic enabling of a preset special lane and improves the utilization rate of road resources.

Description

Technical Field

[0001] This invention relates to the field of traffic control technology, and in particular to a data processing system for activating dedicated lanes. Background Technology

[0002] Traffic congestion frequently occurs during major events or large conferences. To ensure the passage of vehicles attending these events or conferences, dedicated lanes are typically created on roads. Traffic facilities for these dedicated lanes include road markings, signs, pavement markings, and lane screens. While the road markings and signs are set up according to the "Requirements for Setting Up Dedicated Lanes for Major Events," the current system only operates at fixed times, significantly impacting the travel needs of tourists and citizens. Therefore, this system fails to rationally plan the travel patterns of dedicated vehicles and other vehicles, and results in low utilization of road resources. Summary of the Invention

[0003] To address the aforementioned technical problems, the technical solution adopted by this invention is as follows:

[0004] A data processing system for enabling dedicated lanes, the system comprising: a list of key road segments A = {A1, A2, ..., A...} i , ..., A m The lane indicator list corresponding to lane A is B = {B1, B2, ..., B}. i , ..., B m}, processor and memory storing computer programs, wherein A i For the i-th critical segment, B i For A i The corresponding lane indicator screen, i = 1, 2, ..., m, where m is the number of key road segments. The key road segment is any road segment among several key paths from the first target location to the second target location whose historical traffic flow meets a preset traffic flow threshold. When the computer program is executed by the processor, the following steps are implemented:

[0005] S100, when A i The corresponding real-time average vehicle speed is lower than A. i The corresponding preset key average speed, and the target vehicle is in A within the preset time period. i When passing through, at A i The first dedicated lane will be activated and displayed on A. i The corresponding lane indicator screen; the lane indicator screen refers to the LED electronic indicator screen that is pre-installed for each key road section.

[0006] S200, every preset period, obtain the preset duration within A. i The target convoy list W = {W1, W2, ..., W...} corresponds to all target vehicles traveling on the road.u , ..., W s}, where W u Let be the u-th target vehicle, where u = 1, 2, ..., s, and s is the number of target vehicles.

[0007] S300, when W is an empty set, in A i Close the first dedicated lane and display the status of the first dedicated lane on A. i In the corresponding lane indicator screen.

[0008] S400, when W is not an empty set, obtain the time information list W corresponding to W. 0 ={W 0 1, W 0 2, ..., W 0 u , ..., W 0 s}, W 0 u ={W 0 u1 W 0 u2}, W 0 u1 To obtain W u The first vehicle in the process travels to A i The starting time, W 0 u2 To obtain W u The last vehicle in the procession drove away from A. i The starting time.

[0009] S500, according to W 0 , obtain W 0 The corresponding total overlap time δ w .

[0010] S600, when δ w When >δ0, in A i The second dedicated lane will be activated and displayed on A. i In the corresponding lane indicator screen, δ0 is a preset overlap time threshold.

[0011] Compared with the prior art, the present invention has significant advantages. Through the above technical solution, the data processing system for activating dedicated lanes provided by the present invention achieves considerable technological advancement and practicality, and has broad industrial application value. It has at least the following advantages:

[0012] This invention provides a data processing system for activating dedicated lanes. When the computer program is executed by a processor, if the real-time average vehicle speed of a critical road segment is lower than a preset critical average speed for that segment, and a target vehicle is traveling on the critical road segment within a preset time period, a first dedicated lane is activated on that critical road segment and displayed on the lane indicator screen corresponding to that critical road segment. Then, every preset period, a list of target convoys corresponding to target vehicles that will travel on that critical road segment within a preset time period is obtained. If no target convoy exists, the first dedicated lane is closed. If a target convoy exists, the time information of each existing target convoy is obtained, and a second dedicated lane is activated on that critical road segment based on the calculated total overlap time. Through the above steps, this invention can dynamically activate dedicated lanes based on actual road conditions and convoy time overlap information, and display this information on the lane indicator screen. This allows travelers to be aware of traffic conditions in a timely manner, ensuring priority passage and safe and punctual arrival for dedicated vehicles. It also achieves reasonable planning of travel between dedicated vehicles and other vehicles, improving the utilization rate of road resources. Attached Figure Description

[0013] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0014] Figure 1 This is a flowchart illustrating the execution of a computer program by a data processing system for enabling dedicated lanes, as provided in an embodiment of the present invention. Detailed Implementation

[0015] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0016] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or server that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.

[0017] This invention provides a data processing system for enabling dedicated lanes, the system comprising: a list of key road segments A = {A1, A2, ..., A...} i , ..., A m The lane indicator list corresponding to lane A is B = {B1, B2, ..., B}. i , ..., B m}, processor and memory storing computer programs, wherein A i For the i-th critical segment, B i For A i The corresponding lane indicator screen, i = 1, 2, ..., m, where m is the number of key road segments. The key road segment is any segment on several key paths from the first target location to the second target location whose historical traffic flow meets a preset traffic flow threshold. When the computer program is executed by the processor, the following steps are implemented: Figure 1 As shown:

[0018] S100, when A i The corresponding real-time average vehicle speed is lower than A. i The corresponding preset key average speed, and the target vehicle is in A within the preset time period. i When passing through, at A i The first dedicated lane will be activated and displayed on A. i In the corresponding lane indicator screen, it can be understood that if the preset dedicated lane is already in use, then the preset dedicated lane will remain in use.

[0019] Specifically, the lane indicator screen refers to an LED electronic indicator screen pre-installed for each key road segment; for example, based on the direction from the first target location to the second target location, a corresponding lane indicator screen is set at the starting point of each key road segment, or it can be set on the traffic light frame, or multiple screens can be set on one side of each key road segment.

[0020] Specifically, the LED electronic indicator screen refers to an indicator screen used to display several lanes of its corresponding key road section and indicate whether vehicles and personnel can pass through the preset dedicated lane in the key road section; for example, the LED electronic indicator screen displays "Target vehicle only" or "Social vehicles are allowed to use this time period" at the corresponding preset dedicated lane, and switches between the two modes according to the conditions. The target vehicle refers to the vehicle used by the participants of this meeting or this event when going to the second target location.

[0021] Specifically, the preset dedicated lane refers to a lane that is pre-set and, when activated, is only for the target vehicle to travel on, according to the instructions on the lane indicator screen.

[0022] Specifically, the first dedicated lane refers to a lane that is pre-set and activated with priority according to the instructions of the lane indicator screen, and is only for the target vehicle to travel on when activated.

[0023] The first target location is a preset starting point, and the second target location is a preset ending point; this can be understood as follows: when holding a competition or a large conference, the preset starting point refers to the place of residence of the participants or the conference, and the preset ending point is the competition venue or conference venue.

[0024] Specifically, a number of critical paths from the first target location to the second target location are obtained through a road network matching model and the A* algorithm. The critical paths refer to several paths from the first target location to the second target location that can be used for passage. Those skilled in the art know the specific implementation of the road network matching model and the A* algorithm, and will not be described in detail here.

[0025] In one specific embodiment, A is determined through the following specific steps. i :

[0026] S1, Obtain a list set C = {C1, C2, ..., C...} of the first road segments corresponding to several critical paths. j , ..., C n}, C j ={C j1 C j2 , ..., C jp , ..., C jq(j)}, where C jp Let q(j) be the p-th first segment corresponding to the j-th critical path, where j = 1, 2, ..., n, n is the number of critical paths, and p = 1, 2, ..., q(j), where q(j) is the number of first segments corresponding to the j-th critical path.

[0027] Specifically, the first road segment is any segment in any critical path; where a road segment can be understood as: a segment between an intersection and the nearest intersection.

[0028] S2, based on C and C j Deduplicatively process all first road segments to obtain a list of second road segments D = {D1, D2, ..., D...} e , ..., D f}, where D e Let f be the e-th second road segment, where e = 1, 2, ..., f; and f is the number of second road segments.

[0029] Specifically, the second road segment refers to any remaining first road segment after deduplication of all first road segments. For example, if there are two critical paths, the first critical path consists of road segment 1, road segment 2, and road segment 5, and the second critical path consists of road segment 3, road segment 4, and road segment 5, and one of road segment 5 is deleted during deduplication, the resulting list of second road segments consists of road segment 1, road segment 2, road segment 3, road segment 4, and road segment 5.

[0030] S3, obtain D e Traffic flow R within the corresponding preset historical time period e For example, the preset historical time period can be the past seven days before the start of the event.

[0031] S4, when R e When R ≥ R0, R e Determined as A i Where R0 is a preset traffic flow threshold; for example, the preset traffic flow threshold can be set based on statistical historical traffic flow data.

[0032] As described above, by filtering road segments, a list of all non-repeating key road segments containing several paths can be obtained. This allows for the statistical analysis of historical traffic flow for each key road segment, making the traffic flow statistics for each key road segment more accurate. This enables the selection of road segments with traffic flow not less than a preset traffic flow threshold, providing a basis for the installation location of lane indicator screens.

[0033] In a specific embodiment, in S100, it is determined through the following steps that a target vehicle is in A within a preset time period. i Access:

[0034] S101, based on the pre-collected target vehicle identifier for each target vehicle and the pre-driving path corresponding to each target vehicle identifier, obtain several first vehicle identifiers; the first vehicle identifier refers to a pre-driving path that includes A i The target vehicle identifier corresponding to the target vehicle.

[0035] Specifically, the target vehicle identifier is a unique identifier corresponding to the target vehicle, such as a license plate number.

[0036] S102, real-time acquisition of the location information of the first vehicle corresponding to each first vehicle identifier.

[0037] Specifically, the location information of the first vehicle includes the vehicle's position and direction; for example, the position can be obtained through GPS chips and satellites, and the vehicle's motion state and direction can be obtained through sensors such as accelerometers and gyroscopes; the methods for obtaining the vehicle's position and direction are existing technologies and will not be elaborated here.

[0038] S103, Based on the location information of each first vehicle, obtain a list of second vehicle identifiers K = {K1, K2, ..., K...} from a plurality of first vehicle identifiers. g ..., K h}, where K g Let g be the g-th second vehicle identifier, where g = 1, 2, ..., h, and h is the number of second vehicle identifiers. A second vehicle identifier refers to one that has not yet been registered in A. i The first vehicle's identifier corresponds to the first vehicle traveling on the road; this can be understood as: during the journey from the first target location to the second target location, the vehicle that has not yet reached point A... i The first vehicle on the road is used as the second vehicle.

[0039] S104, according to K g The corresponding location information of the second vehicle and the data information obtained from the map server are used to obtain K. g The corresponding second vehicle arrives at A i The target duration T at the starting point gi This can be understood as: predicting K through a map server. g The corresponding second vehicle arrives at A i The target duration at the starting point, where A i The starting point refers to the point at point A when traveling from the first target location to the second target location. i The starting point of the journey; those skilled in the art know the specific methods by which the time it takes for a vehicle to reach a certain location is predicted based on the vehicle's location information and the map server, and will not be elaborated here.

[0040] S105, when at least one T exists gi When T0 is less than or equal to 0, it is determined that there is a target vehicle in A within the preset time period. i The above is allowed, where T0 is the preset duration, for example: ten minutes.

[0041] As described above, by obtaining the location information of a second vehicle that has not yet reached a certain key road segment, the travel distance of the second vehicle to the key road segment can be calculated, and the travel time to the key road segment can be predicted. In this way, it can be predicted whether there will be a target vehicle traveling on the key road segment within a preset time period, and the state of the preset dedicated lane can be dynamically adjusted according to the prediction results, so as to rationally plan the travel of the second vehicle and other vehicles.

[0042] In another specific embodiment, the system is also used to implement the following steps:

[0043] S11, Based on T0, obtain the third vehicle identifier list K from K. 0 ={K 0 1, K 0 2, ..., K 0 α ..., K 0 β}, where K 0 α Let α be the third vehicle identifier, where α = 1, 2, ..., β, and β is the number of third vehicle identifiers. The third vehicle identifier refers to the second vehicle identifier corresponding to any target duration not greater than T0. This can be understood as: obtaining the second vehicle identifier that meets the target duration requirement from the h target durations corresponding to K.

[0044] S12, when β≥ζ, determine that at least a target number of target vehicles are in A within the preset time period. i The passage is up, where ζ is the target quantity.

[0045] Specifically, A i The corresponding preset key average speed is based on A i Corresponding historical average vehicle speed or A i The corresponding road types are pre-set; for example, the main roads in the city are classified as low-grade road sections, and elevated expressways are classified as high-grade road sections.

[0046] In one specific embodiment, S100 further includes the step of determining A. i Corresponding preset key average speed:

[0047] S111, when A i When the road segment is a pre-defined first type, obtain the first critical average speed and define the first critical average speed as A. i The corresponding preset key average speed.

[0048] Specifically, the first type of road segment refers to a low-level road segment pre-classified by those skilled in the art based on road grade; for example, the main roads in urban areas are classified as the first type of road segment; it can be understood that the first type of road segment is a low-speed road segment.

[0049] Specifically, the first key average speed meets the following conditions:

[0050] V1 = V 0 1×θ1, where V1 is the first critical average velocity, V 0 1 represents the historical average vehicle speed corresponding to the first type of road segment, and θ1 is the preset first ratio value.

[0051] Furthermore, the value of θ1 ranges from 0.75 to 0.85. By setting a first proportional value within this range, the first critical average speed is made to be less than the historical average speed of vehicles corresponding to the first type of road segment and to be within a reasonable value. That is, only when the real-time average speed of vehicles drops to a certain threshold will the road segment be considered to be congested. This is to deal with the slight changes in the real-time average speed of vehicles caused by uneven speeds and to improve the rationality of road condition judgment.

[0052] S112, when A i When the second type of road segment is preset, obtain the second key average speed and determine the second key average speed as A. i The corresponding preset key average speed; the second type of road segment and the first type of road segment are two types of road segments divided according to road type.

[0053] Specifically, the second type of road segment refers to a high-grade road segment pre-classified by those skilled in the art based on road grade; for example, classifying elevated expressways as the second type of road segment can be understood as: the second type of road segment is a highway segment.

[0054] Specifically, the second key average speed meets the following conditions:

[0055] V2 = V 0 2×θ2, where V2 is the second critical average velocity, V 0 2 represents the historical average vehicle speed corresponding to the second type of road segment, and θ2 is the preset second ratio value.

[0056] Furthermore, the value range of θ2 is 0.8-0.9. By making a slight upward adjustment to the value range based on θ1, it can cope with the situation where the second type of road segment is generally long and there are many vehicles, which will cause the real-time average vehicle speed to decrease slowly. Therefore, when the real-time average vehicle speed is lower than the second key average speed, it is considered that there is a traffic jam in the road segment, thus improving the rationality of the road condition judgment.

[0057] The following example illustrates this:

[0058] For the collected A i After cleaning, screening and analyzing the historical vehicle speeds of the city (e.g., Hangzhou), the historical average speed of main roads was 31.16 km / h, and the historical average speed of elevated expressways was 57.17 km / h.

[0059] If A i For ground roads, when A i When the average real-time vehicle speed is below 25 km / h, and a race vehicle is expected to pass through the road within 10 minutes, A will be activated. i The corresponding dedicated lane; when the average speed is not less than 25 km / h and more than 15 race vehicles will be passing through the road within 10 minutes, lane A will be activated. i The corresponding dedicated lane.

[0060] If A i It is an elevated expressway, when A i When the average real-time vehicle speed is below 50 km / h, and a race vehicle is expected to pass through the road within 10 minutes, A will be activated. i The corresponding dedicated lane; when the average speed is not less than 50km / h and more than 15 race vehicles will be passing through the road within 10 minutes, lane A will be activated. i The corresponding dedicated lane.

[0061] In addition, when a race vehicle encounters an emergency, several dedicated lanes that the race vehicle needs to pass through will be opened in real time based on the request from the race vehicle to activate the dedicated lane.

[0062] S200, every preset period, obtain the preset duration within A. i The target convoy list W = {W1, W2, ..., W...} corresponds to all target vehicles traveling on the road. u , ..., W s}, where W u Let be the u-th target vehicle, where u = 1, 2, ..., s, and s is the number of target vehicles.

[0063] Specifically, the target convoy refers to a convoy that has been pre-collected and includes one or more target vehicles.

[0064] As mentioned above, since the number of target vehicles traveling on key road sections changes at any time as the target vehicle's location moves, the target vehicle fleet list needs to be updated every preset period to improve the accuracy of target vehicle fleet acquisition and thus reduce the time overlap of various target vehicle fleets.

[0065] S300, when W is an empty set, in A i Close the first dedicated lane and display the status of the first dedicated lane on A. i In the corresponding lane indicator screen.

[0066] As mentioned above, when the target vehicle list is empty, it indicates that there are no target vehicles traveling on the critical road segment. Therefore, the first dedicated lane is closed and updated to a regular lane, allowing other vehicles to enter the lane and thus improving the utilization rate of road resources.

[0067] S400, when W is not an empty set, obtain the time information list W corresponding to W. 0 ={W 0 1, W 0 2, ..., W 0 u , ..., W 0 s}, W 0 u ={W 0 u1 W 0 u2}, W 0 u1 To obtain W u The first vehicle in the process travels to A i The starting time, W 0 u2 To obtain W u The last vehicle in the procession drove away from A. i The starting time.

[0068] S500, according to W 0 , obtain W 0 The corresponding total overlap time δ w .

[0069] Specifically, δ w The following conditions must be met:

[0070] δ w =∑ s u＝1 (∑ u-1 z＝1 δ z ), where δ z Let be the overlap time between the u-th target vehicle and the z-th target vehicle.

[0071] S600, when δ w When >δ0, in A i The second dedicated lane will be activated and displayed on A. i In the corresponding lane indicator screen, δ0 is a preset overlap time threshold; this can be understood as: displaying the activated second dedicated lane and the first dedicated lane together on lane A. i In the corresponding lane indicator screen.

[0072] Specifically, the second dedicated lane refers to a lane that is pre-set and activated with second priority according to the instructions of the lane indicator screen, and is only for the target vehicle to travel when activated; it can be understood that the activation priority of the second dedicated lane is lower than that of the first dedicated lane.

[0073] The above-mentioned method obtains the target vehicle fleet that will travel on a certain key road segment within a preset time period every preset cycle, determines the total overlap time of several target vehicle fleets, and predicts the degree of congestion that will occur on the key road segment. When the total overlap time is large, a second dedicated lane is opened in addition to the first dedicated lane to alleviate the congestion of target vehicles and ensure that target vehicles can arrive at the corresponding location safely and on time.

[0074] In one specific embodiment, the method further includes the following steps:

[0075] S10, within a preset number of days, obtain the daily log report; the log report includes B within that day. i The corresponding preset number of dedicated lane adjustments, B i The corresponding preset dedicated lane utilization rate λ i And the average activation time ε of the preset dedicated lane.

[0076] Specifically, B within that day i The corresponding preset number of dedicated lane adjustments refers to B within the same day. i The number of times a preset dedicated lane is activated and deactivated; this can be understood as: the number of times B is activated and deactivated within a single day. i If an operation involves both activating and deactivating a preset dedicated lane, it is counted as one adjustment. If there is only an activation or only a deactivation record, the operation is ignored and not counted as an adjustment.

[0077] Specifically, λ i The following conditions must be met:

[0078] λ i =(L i ×T i ) / (∑ m i＝1 L i ×24), where L i For B i The corresponding preset length of the dedicated lane, T i For B i The corresponding pre-set dedicated lane will be available at the designated time of day.

[0079] Specifically, ε satisfies the following conditions:

[0080] ε=(∑ m i＝1 T i) / φ, where φ is the number of pre-set dedicated lanes that are activated on that day.

[0081] S20, upload and store the log report in the target database.

[0082] The above-mentioned data collection and statistics on the daily usage of the designated lanes during the event period, uploaded to the platform's database, enables the platform to record all operation logs of the lane indicator screens. This ensures the safe operation of the lane indicator screens during the event or meeting, and allows staff to conduct statistical analysis on the recorded data.

[0083] In summary, this invention provides a data processing system for activating dedicated lanes. When the computer program is executed by the processor, if the real-time average vehicle speed corresponding to a critical road segment is lower than the preset critical average speed corresponding to the critical road segment, and target vehicles are traveling on the critical road segment within a preset time period, a first dedicated lane is activated in this critical road segment and displayed on the lane indicator screen corresponding to this critical road segment. Then, every preset period, a list of target convoys corresponding to target vehicles that will travel on the critical road segment within a preset time period is obtained. When there are no target convoys, the first dedicated lane is closed. When there are target convoys, the time information of each existing target convoy is obtained, and a second dedicated lane in this critical road segment is activated based on the calculated total overlap time. Through the above steps, this invention can dynamically activate dedicated lanes based on actual road conditions and convoy time overlap information, and display them on the lane indicator screen, so that travelers can understand the traffic situation in a timely manner, ensuring priority passage and safe and timely arrival of dedicated vehicles, while also realizing the rational planning of travel between dedicated vehicles and social vehicles, and improving the utilization rate of road resources.

[0084] While specific embodiments of the invention have been described in detail by way of example, those skilled in the art should understand that the above examples are for illustrative purposes only and are not intended to limit the scope of the invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.

Claims

1. A data processing system for activating dedicated lanes, characterized in that, The system includes: a list of key road segments A = {A1, A2, ..., A...} i , ..., A m The lane indicator list corresponding to lane A is B = {B1, B2, ..., B}. i , ..., B m }, processor and memory storing computer programs, wherein A i For the i-th critical segment, B i For A i The corresponding lane indicator screen, i = 1, 2, ..., m, where m is the number of key road segments. The key road segment is any road segment among several key paths from the first target location to the second target location whose historical traffic flow meets a preset traffic flow threshold. When the computer program is executed by the processor, the following steps are implemented: S100, when A i The corresponding real-time average vehicle speed is lower than A. i The corresponding preset key average speed, and the target vehicle is in A within the preset time period. i When passing through, at A i The first dedicated lane will be activated and displayed on A. i The corresponding lane indicator screen; the lane indicator screen refers to the LED electronic indicator screen pre-installed for each key road section; S200, every preset period, obtain the preset duration within A. i The target convoy list W = {W1, W2, ..., W...} corresponds to all target vehicles traveling on the road. u , ..., W s }, where W u Let u be the target convoy, where u = 1, 2, ..., s, and s is the number of target convoys; S300, when W is an empty set, in A i Close the first dedicated lane and display the status of the first dedicated lane on A. i In the corresponding lane indicator screen; S400, when W is not an empty set, obtain the time information list W corresponding to W. 0 ={W 0 1, W 0 2, ..., W 0 u , ..., W 0 s }, W 0 u ={W 0 u1 W 0 u2 }, W 0 u1 To obtain W u The first vehicle in the process travels to A i The starting time, W 0 u2 To obtain W u The last vehicle in the procession drove away from A. i The starting time; S500, according to W 0 , obtain W 0 The corresponding total overlap time δ w ; S600, when δ w When >δ0, in A i The second dedicated lane will be activated and displayed on A. i In the corresponding lane indicator screen, δ0 is a preset overlap time threshold.

2. The data processing system for activating dedicated lanes according to claim 1, characterized in that, A is determined through the following specific steps. i : S1, Obtain a list set C = {C1, C2, ..., C...} of the first road segments corresponding to several critical paths. j , ..., C n }, C j ={C j1 C j2 , ..., C jp , ..., C jq(j) }, where C jp Let q(j) be the p-th first segment corresponding to the j-th critical path, where j = 1, 2, ..., n, n is the number of critical paths, and p = 1, 2, ..., q(j), where q(j) is the number of first segments corresponding to the j-th critical path. S2, based on C and C j Deduplicatively process all first road segments to obtain a list of second road segments D = {D1, D2, ..., D...} e , ..., D f }, where D e Let f be the e-th second segment, where e = 1, 2, ..., f; and f be the number of second segments. S3, obtain D e Traffic flow R within the corresponding preset historical time period e ; S4, when R e When R ≥ R0, R e Determined as A i Where R0 is the preset traffic flow threshold.

3. The data processing system for activating dedicated lanes according to claim 1, characterized in that, In S100, the following steps are used to determine whether a target vehicle is in A within a preset time period. i Access: S101, based on the pre-collected target vehicle identifier for each target vehicle and the pre-driving path corresponding to each target vehicle identifier, obtain several first vehicle identifiers; the first vehicle identifier refers to a pre-driving path that includes A i The target vehicle identifier corresponding to the target vehicle; S102, real-time acquisition of the location information of the first vehicle corresponding to each first vehicle identifier; S103, Based on the location information of each first vehicle, obtain a list of second vehicle identifiers K = {K1, K2, ..., K...} from a plurality of first vehicle identifiers. g ..., K h }, where K g Let g be the g-th second vehicle identifier, where g = 1, 2, ..., h, and h is the number of second vehicle identifiers. A second vehicle identifier refers to one that has not yet been registered in A. i The first vehicle identifier corresponding to the first vehicle traveling on the road; S104, according to K g The corresponding location information of the second vehicle and the data information obtained from the map server are used to obtain K. g The corresponding second vehicle arrives at A i The target duration T at the starting point gi ; S105, when at least one T exists gi When T0 is less than or equal to 0, it is determined that there is a target vehicle in A within the preset time period. i The passage is accessible, where T0 is the preset duration.

4. The data processing system for activating dedicated lanes according to claim 1, characterized in that, A i The corresponding preset key average speed is based on A i Corresponding historical average vehicle speed or A i The corresponding road type is preset.

5. The data processing system for activating dedicated lanes according to claim 1, characterized in that, S100 also includes the following steps to determine A i Corresponding preset key average speed: S111, when A i When the road segment is a pre-defined first type, obtain the first critical average speed and define the first critical average speed as A. i The corresponding preset key average speed; S112, when A i When the second type of road segment is preset, obtain the second key average speed and determine the second key average speed as A. i The corresponding preset key average speed; the second type of road segment and the first type of road segment are two types of road segments divided according to road type.

6. The data processing system for activating dedicated lanes according to claim 5, characterized in that, The first critical average speed meets the following conditions: V1 = V 0 1×θ1, where V1 is the first critical average velocity, V 0 1 represents the historical average vehicle speed corresponding to the first type of road segment, and θ1 is the preset first ratio value.

7. The data processing system for activating dedicated lanes according to claim 5, characterized in that, The second key average speed meets the following conditions: V2 = V 0 2×θ2, where V2 is the second critical average velocity, V 0 2 represents the historical average vehicle speed corresponding to the second type of road segment, and θ2 is the preset second ratio value.

8. The data processing system for activating dedicated lanes according to claim 1, characterized in that, The target convoy refers to a convoy that has been pre-collected and includes one or more target vehicles.

9. The data processing system for activating dedicated lanes according to claim 1, characterized in that, δ w The following conditions must be met: δ w =∑ s u＝1 (∑ u-1 z＝1 δ z ), where δ z Let be the overlap time between the u-th target vehicle and the z-th target vehicle.

10. The data processing system for activating dedicated lanes according to claim 1, characterized in that, The LED electronic indicator screen refers to an indicator screen used to display several lanes of its corresponding key road section and to indicate whether vehicles and personnel can pass through the preset dedicated lane in the key road section.

Images