Traffic Diversion Method, Device, Electronic Device and Storage Medium

Abstract

The present disclosure provides a traffic guidance method, apparatus, electronic device and storage medium, relating to the field of artificial intelligence, and particularly to fields such as intelligent transportation and vehicle-road collaboration. The specific implementation solution is as follows: obtain the historical traffic flow information of the congested arterial road; determine the set of traffic flow merging nodes upstream of the congested arterial road according to the historical traffic flow information; plan at least one detour route based on the set of traffic flow merging nodes; generate guidance indication information based on the at least one detour route, so as to conduct traffic guidance through the guidance indication information. By adopting the present disclosure, the congestion relief effect for the congested arterial road can be improved, thereby effectively solving the congestion problem of the congested arterial road.

Description

Technical Field

[0001] The present disclosure relates to the field of artificial intelligence, and in particular to fields such as intelligent transportation and vehicle-road collaboration. Background Art

[0002] In the urban traffic road network, arterial roads are the main paths for vehicle passage. Therefore, congestion on arterial roads will directly restrict the traffic efficiency of the areas where they are located. Currently, traffic guidance is usually carried out by signal control, in the hope that serious congestion imbalance or intersection overflow will not occur on each section of the arterial road.

[0003] However, the signal control method only adjusts the passing time in each direction of the intersection. Therefore, both the adjustment space and the adjustment ability are relatively limited, and the congestion problem on arterial roads cannot be effectively solved. Summary of the Invention

[0004] The present disclosure provides a traffic guidance method, device, electronic device, and storage medium.

[0005] According to one aspect of the present disclosure, there is provided a traffic guidance method, including:

[0006] Obtaining historical traffic flow information of a congested arterial road;

[0007] Determining a set of traffic flow merging nodes upstream of the congested arterial road according to the historical traffic flow information;

[0008] Planning at least one detour path based on the set of traffic flow merging nodes;

[0009] Generating guidance indication information based on at least one detour path to conduct traffic guidance through the guidance indication information.

[0010] According to a second aspect of the present disclosure, there is provided a traffic guidance device, including:

[0011] An information acquisition unit for obtaining historical traffic flow information of a congested arterial road;

[0012] A set determination unit for determining a set of traffic flow merging nodes upstream of the congested arterial road according to the historical traffic flow information;

[0013] A path planning unit for planning at least one detour path based on the set of traffic flow merging nodes;

[0014] A traffic guidance unit for generating guidance indication information based on at least one detour path to conduct traffic guidance through the guidance indication information.

[0015] According to a third aspect of the present disclosure, there is provided an electronic device, including:

[0016] At least one processor;

[0017] A memory communicatively connected to at least one processor;

[0018] The memory stores instructions executable by at least one processor, and the instructions are executed by at least one processor to enable the at least one processor to execute the method provided in the first aspect.

[0019] According to a fourth aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium storing computer instructions, wherein the computer instructions are used to cause a computer to execute the method provided in the first aspect.

[0020] According to a fifth aspect of the present disclosure, there is provided a computer program product including a computer program, and the computer program implements the method provided in the first aspect when executed by a processor.

[0021] Adopting the present disclosure can improve the congestion relief effect for congested arterial roads, thereby effectively solving the congestion problem of congested arterial roads.

[0022] It should be understood that the content described in this part is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it used to limit the scope of the present disclosure. Other features of the present disclosure will become easily understandable through the following description. Description of the Drawings

[0023] The drawings are used to better understand the solution and do not constitute a limitation to the present disclosure. Among them:

[0024] Figure 1 is a schematic flowchart of a traffic guidance method provided by an embodiment of the present disclosure;

[0025] Figure 2 is a road network space topology map provided by an embodiment of the present disclosure;

[0026] Figure 3 is an explanatory diagram of a determination method for a congested arterial road provided by an embodiment of the present disclosure;

[0027] Figure 4 is an explanatory diagram of a determination method for a driving trajectory provided by an embodiment of the present disclosure;

[0028] Figure 5 is an explanatory diagram of a composition method for a set of vehicle flow merging nodes provided by an embodiment of the present disclosure;

[0029] Figure 6 is an explanatory diagram of a selection method for a detour path provided by an embodiment of the present disclosure;

[0030] Figure 7 is an explanatory diagram of a selection method for a detour end point provided by an embodiment of the present disclosure;

[0031] Figure 8 It is a diagram for explaining an update method of the proportion of the remaining node inflow into the traffic flow provided by an embodiment of the present disclosure;

[0032] Figure 9 It is a diagram for explaining an update method of the actual predicted traffic flow of a detour section provided by an embodiment of the present disclosure;

[0033] Figure 10 It is a diagram for explaining a display method of traffic guidance information provided by an embodiment of the present disclosure;

[0034] Figure 11 It is a schematic flow chart of the integrity of a traffic guidance method provided by an embodiment of the present disclosure;

[0035] Figure 12 It is a schematic diagram of an application scenario of a traffic guidance method provided by an embodiment of the present disclosure;

[0036] Figure 13 It is a schematic structural block diagram of a traffic guidance device provided by an embodiment of the present disclosure;

[0037] Figure 14 It is a schematic structural block diagram of an electronic device provided by an embodiment of the present disclosure. Detailed implementation manners

[0038] The following makes an explanation of the exemplary embodiments of the present disclosure with reference to the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, and they should be considered merely exemplary. Therefore, those of ordinary skill in the art should recognize that various changes and modifications can be made to the embodiments described herein without departing from the scope of the present disclosure. Similarly, for clarity and conciseness, the description of well-known functions and structures is omitted below.

[0039] As described in the background art, in an urban traffic road network, arterial roads are the main paths for vehicle passage. Therefore, congestion on arterial roads will directly restrict the traffic efficiency of the areas where they are located. Currently, traffic guidance is usually carried out by signal control methods in order to expect that there will be no serious congestion imbalance or intersection overflow phenomena on each section of the arterial road. Among them, the signal control method can specifically be based on signal control strategies such as green wave coordination, slow in and fast out, and cut-off control to adjust the traffic light time on the arterial road. However, the signal control method only adjusts the passing time in each direction of the intersection. Therefore, both the adjustment space and the adjustment ability are relatively limited, and the congestion problem of the arterial road cannot be effectively solved.

[0040] Based on the above background, the embodiments of the present disclosure provide a congestion guidance method, and this congestion guidance method can be applied to an electronic device. The following will be combined with Figure 1The following is a schematic flowchart for explaining a congestion relief method provided by an embodiment of the present disclosure. It should be noted that although the logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in other orders.

[0041] Step S101, obtain the historical traffic flow information of the congested trunk line;

[0042] Step S102, determine the set of traffic flow convergence nodes upstream of the congested trunk line according to the historical traffic flow information;

[0043] Step S103, plan at least one detour route based on the set of traffic flow convergence nodes;

[0044] Step S104, generate traffic guidance information based on at least one detour route to conduct traffic guidance through the traffic guidance information.

[0045] Among them, the congested trunk line can be a trunk road in a congested state in the area to be relieved, and the congested trunk line includes at least two congested sections. The historical traffic flow information can be traffic video information collected by multiple video monitoring devices arranged upstream, on, and downstream of the congested trunk line. Among them, the video monitoring device can be a bayonet camera, an electronic police, a bayonet electronic police integrated machine, etc., and the embodiments of the present disclosure do not make specific limitations on this.

[0046] After obtaining the historical traffic flow information of the congested trunk line, the total traffic volume of the congested trunk line during the target period can be determined according to the historical traffic flow information, and at least one target convergence node that makes a large contribution to the total traffic volume can be determined from the upstream of the congested trunk line to form a set of traffic flow convergence nodes. For example, multiple traffic intersections that make contributions to the total traffic volume can be determined from the upstream of the congested trunk line as candidate convergence nodes, and then, from the multiple candidate convergence nodes, the candidate convergence node with the largest proportion of the incoming traffic flow can be selected as the target convergence node to form a set of traffic flow convergence nodes including only one target convergence node. For another example, multiple traffic intersections that make contributions to the total traffic volume can be determined from the upstream of the congested trunk line as candidate convergence nodes, and then, from the multiple candidate convergence nodes, the first number of candidate convergence nodes with the largest proportion of the incoming traffic flow can be selected as the target convergence nodes to form a set of traffic flow convergence nodes including the first number of target convergence nodes. Among them, the proportion of the incoming traffic flow is the proportion of the traffic volume that enters the congested trunk line through the current candidate convergence node in the total traffic volume, and the first number can be an integer greater than or equal to 2. The embodiments of the present disclosure do not make specific limitations on this.

[0047] After determining the set of vehicle flow merging nodes upstream of the congested trunk line, at least one detour route can be planned based on the set of vehicle flow merging nodes. For example, for each target merging node in the set of vehicle flow merging nodes, a detour route can be planned with the target merging node as the starting point and any vehicle exit node downstream of the congested trunk line as the target point.

[0048] Finally, based on at least one detour route, traffic guidance information is generated to conduct traffic guidance through the traffic guidance information. For example, traffic guidance information including the detour route is generated, and then the traffic guidance information is sent to the indication output device to be displayed through the indication output device, so as to achieve the invention purpose of traffic guidance through the traffic guidance information. Among them, the indication output device is set at the location of the node to be processed, and the indication output device can be at least one of a road information board, an induction screen, and a light strip screen.

[0049] By using the congestion guidance method provided in the embodiments of the present disclosure, the historical vehicle flow information of the congested trunk line can be obtained; according to the historical vehicle flow information, the set of vehicle flow merging nodes upstream of the congested trunk line can be determined; based on the set of vehicle flow merging nodes, at least one detour route can be planned; based on at least one detour route, traffic guidance information is generated to conduct traffic guidance through the traffic guidance information. Since in the embodiments of the present disclosure, the set of vehicle flow merging nodes is upstream of the congested trunk line, therefore, based on the set of vehicle flow merging nodes, at least one planned detour route can start from the traffic demand side and reduce the traffic demand on the congested trunk line, which can fundamentally solve the problem that the traffic demand on the congested trunk line is much greater than the traffic supply. Compared with the prior art solution of using signal control methods for traffic guidance, there is a greater improvement in the adjustment space and adjustment ability. Therefore, the congestion guidance effect for the congested trunk line can be improved, and thus the congestion problem of the congested trunk line can be effectively solved.

[0050] In the embodiments of the present disclosure, the congested trunk line can be a trunk road that often gets congested designated in the area to be dredged according to historical experience. However, considering that the congestion situation of each trunk road in the area to be dredged is dynamically changing, in the embodiments of the present disclosure, the congested trunk line can also be automatically and dynamically identified.

[0051] Based on this, the congestion guidance method provided in the embodiments of the present disclosure may further include:

[0052] According to the historical vehicle flow information, determine multiple congested sections in the area to be dredged that are in a congested state during the target time period;

[0053] Form a congested trunk line by at least two congested sections that have spatial continuity and traffic flow correlation during the target time period among the multiple congested sections.

[0054] Among them, the area to be dredged can be any traffic area in the urban traffic road network.

[0055] Please combine Figure 2 , in the embodiments of the present disclosure, an abstract road network representation process can be performed on the area to be dredged. For example, each traffic intersection in the area to be dredged can be abstracted into a node, and the road section between two adjacent traffic intersections can be abstracted into a line segment, so as to form a road network space topology graph composed of "nodes - line segments", and there is at least one line segment between two adjacent nodes, which is used to represent single-lane roads, two-lane roads (for example, one-way two-lane or two-way two-lane) and multi-lane roads (for example, one-way three-lane, two-way four-lane, etc.). Among them, more specifically, the direction of the road section can be represented by an arrow, that is, the road section between two adjacent traffic intersections can be abstracted into a directed arrow line segment. As Figure 2 shown, there are 2 directed arrow line segments between node 201 and node 202, which are respectively used to represent two road sections with opposite traffic flow directions between two adjacent traffic intersections, that is, the road between these two adjacent traffic intersections is a two-lane road, specifically a two-way two-lane road.

[0056] In addition, in the embodiments of the present disclosure, when identifying congested trunk lines, first, according to historical traffic flow information, a plurality of congested road sections in a congested state during the target time period can be determined from the area to be dredged. Among them, the target time period is a specified time period that is about to come, has a corresponding time period type, and the time length can be 30 minutes (min), 1 hour (h), 2h, etc., and the embodiments of the present disclosure do not make specific limitations on this. Among them, the time period type can be weekdays, holidays, Monday, Tuesday, Wednesday, Wednesday, Thursday, Friday, etc., and the embodiments of the present disclosure do not make the same specific limitations on this.

[0057] In the embodiments of the present disclosure, for each road section in the area to be dredged, according to historical traffic flow information, the average congestion index of the road section in the second number of historical time periods that is closest to the current time and corresponds to the target time period can be obtained, and then according to the average congestion index, it can be determined whether the road section belongs to a congested road section during the target time period. For example, when the average congestion index is greater than or equal to a preset index threshold, it is determined that the road section belongs to a congested road section during the target time period, and when the average congestion index is less than the preset index threshold, it is determined that the road section belongs to an unobstructed road section during the target time period. Among them, the congestion index of the road section is the ratio of the actual travel time of the road section to the unobstructed travel time, the second number can be values such as 3, 5, 8, etc., and the preset index threshold can be values such as 1.5, 1.8, 2, etc., and the embodiments of the present disclosure do not make specific limitations on this.

[0058] Exemplarily, the second number is 5, the time period type of the target time period is Monday, the time length is 1 hour, specifically, 8:00 to 9:00 a.m. on the upcoming next Monday, and the preset index threshold is 1.8. Then, for each road section in the area to be diverted, the average congestion index of the road section from 8:00 to 9:00 a.m. on the 5 Mondays closest to the current time can be obtained based on the historical traffic information. Specifically, the 5 Mondays from 8:00 to 9:00 a.m. can be divided into 60 5-minute time periods according to the granularity of 5 minutes, and the average congestion index of the road section in these 60 5-minute time periods is obtained. When the average congestion index is greater than 1.8, it is determined that the road section is also a congested section from 8:00 to 9:00 a.m. on the upcoming next Monday.

[0059] After determining multiple congested sections that are in a congested state within the target time period from the area to be diverted, a congested trunk line can be formed based on the road network spatial topology map through at least two congested sections that have spatial continuity among the multiple congested sections and have traffic correlation within the target time period. The existence of spatial continuity means that the two sections are adjacent and have the same traffic flow direction, and the existence of traffic correlation within the target time period can be understood as: within the target time period, among the two sections, more than a preset relevant proportion of all vehicles on the next section are merged from the previous section. The preset relevant proportion can be 40%, 50%, 60%, etc., and the embodiments of the present disclosure do not impose specific restrictions on this.

[0060] Please combine Figure 3 , illustratively, multiple congested sections that are in a congested state within the target time period are determined from the area to be relieved, including section 301, section 302, section 303, section 304, and section 305, wherein section 301 and section 302 do not have spatial continuity with other congested sections, and therefore cannot form a congested trunk line, and section 303, section 304, and section 305 have spatial continuity and traffic flow correlation within the target time period, and therefore, a congested trunk line can be formed by section 303, section 304, and section 305. In addition, it should be noted that in the disclosed embodiment, if there is the same congested section in two congested trunk lines, the one of the two congested trunk lines with more serious congestion within the target time period can be used as the congested trunk line finally determined.

[0061] In the embodiment of the present disclosure, the above steps included in the congestion relief method can determine multiple congested road sections that are in a congested state within the target time period from the area to be relieved based on historical traffic flow information, and then form a congested trunk line through at least two congested road sections that have spatial continuity and traffic flow correlation within the target time period among the multiple congested road sections, thereby realizing automatic identification of congested trunk lines through advance prediction to improve the degree of automation of the traffic relief method.

[0062] In some alternative embodiments, "determining a plurality of congested road segments in a congested state during a target time period from a to-be-diverted area according to historical traffic flow information" may include the following steps:

[0063] According to a preset time interval and based on historical traffic flow information, determine a plurality of congested road segments in a congested state during a target time period from a to-be-diverted area.

[0064] Among them, the preset time interval can be determined according to the time period type of the target time period.

[0065] For example, if the time period type is a working day, the preset time interval can be the second number of working days. For another example, if the time period type is a holiday, the preset time interval can be the second number of holidays. For yet another example, if the time period type is Monday, Tuesday, Wednesday, Wednesday, Thursday, or Friday, the preset time interval can be the second number of weeks.

[0066] In the embodiments of the present disclosure, according to a preset time interval and based on historical traffic flow information, a plurality of congested road segments in a congested state during a target time period can be determined from a to-be-diverted area, and then at least two congested road segments with spatial continuity and traffic flow correlation during the target time period among the plurality of congested road segments are combined to form a congested trunk line. In this way, dynamic update of the congested trunk line can be realized, so that the recognition result of the congested trunk line has real-time performance, that is, it more conforms to the real-time traffic congestion situation, thereby improving the actual application effect of the traffic congestion diversion method.

[0067] In some alternative embodiments, "determining a set of traffic flow convergence nodes upstream of a congested trunk line according to historical traffic flow information" may include the following steps:

[0068] According to historical traffic flow information, determine the total traffic volume of the congested trunk line during the target time period and a plurality of candidate convergence nodes upstream of the congested trunk line;

[0069] Select at least one target convergence node with a convergence traffic flow ratio greater than or equal to a preset convergence ratio from the plurality of candidate convergence nodes to form a set of traffic flow convergence nodes, where the convergence traffic flow ratio is the ratio of the traffic volume entering the congested trunk line via the current candidate convergence node in the total traffic volume.

[0070] In the embodiments of the present disclosure, according to historical traffic flow information, the driving trajectories of all historical vehicles entering the congested trunk line in the second number of historical time periods closest to the current moment and corresponding to the target time period can be identified and completed to realize historical traffic volume counting, and then the average traffic volume of the congested trunk line in the second number of historical time periods is obtained as the total traffic volume.

[0071] Exemplarily, if the second quantity is 5, then, based on the historical traffic flow information, the driving trajectories of all historical vehicles entering the congested arterial road within these 5 historical time periods can be identified and complemented to achieve historical traffic flow counting. Specifically, as shown in Figure 4 Taking historical vehicle 404 entering the congested arterial road (including congested section 401, congested section 402, and congested section 403) as an example, after identifying and complementing the driving trajectory of historical vehicle 404 according to the historical traffic flow information, it is determined that it has driving trajectory 405. Suppose the historical traffic flows entering the congested arterial road within these 5 historical time periods are 105 vehicles, 95 vehicles, 98 vehicles, 102 vehicles, and 100 vehicles respectively, then the average traffic flow can be obtained as 100 vehicles, which is used as the overall traffic flow.

[0072] In addition, in the embodiments of the present disclosure, for each of the second quantity of historical time periods, after determining the historical traffic flow corresponding to this historical time period, multiple traffic intersections that have an inflow contribution to this historical traffic flow can be determined from the upstream of the congested arterial road as candidate inflow nodes, and the proportion of the inflow contribution provided by each candidate inflow node to this historical traffic flow is calculated. Finally, for each candidate inflow node, its average inflow contribution proportion is obtained as the proportion of the inflowing traffic. Among them, the inflow contribution proportion is the proportion of the traffic flow that enters the congested arterial road via the current candidate inflow node in the historical traffic flow.

[0073] Please refer to Figure 5 , exemplarily, the second quantity is 5. For the convenience of description, the 5 historical time periods can be respectively characterized as the first historical time period, the second historical time period, the third historical time period, the fourth historical time period, and the fifth historical time period. Suppose:

[0074] The historical traffic flow corresponding to the first historical time period is 105 vehicles, and two first-level traffic intersections that have an inflow contribution to this historical traffic flow are determined from the upstream of the congested arterial road (including congested section 501, congested section 502, and congested section 503), which are candidate inflow node 504 and candidate inflow node 505 respectively. Among them, the proportion of the inflow contribution provided by candidate inflow node 504 to this historical traffic flow is 60 / 105, and the proportion of the inflow contribution provided by candidate inflow node 505 to this historical traffic flow is 45 / 105;

[0075] The historical traffic flow corresponding to the second historical time period is 95 vehicles, and two first-level traffic intersections that have an inflow contribution to this historical traffic flow are determined from the upstream of the congested arterial road (including congested section 501, congested section 502, and congested section 503), which are candidate inflow node 504 and candidate inflow node 505 respectively. Among them, the proportion of the inflow contribution provided by candidate inflow node 504 to this historical traffic flow is 55 / 95, and the proportion of the inflow contribution provided by candidate inflow node 505 to this historical traffic flow is 40 / 95;

[0076] The historical traffic volume corresponding to the third historical period is 98 vehicles, and two first-level traffic intersections that contribute to the inflow of this historical traffic volume are determined from the upstream of the congested arterial road (including congested section 501, congested section 502, and congested section 503), namely candidate inflow node 504 and candidate inflow node 505. Among them, the proportion of the inflow contribution provided by candidate inflow node 504 to this historical traffic volume is 58 / 98, and the proportion of the inflow contribution provided by candidate inflow node 505 to this historical traffic volume is 40 / 98;

[0077] The historical traffic volume corresponding to the fourth historical period is 102 vehicles, and two first-level traffic intersections that contribute to the inflow of this historical traffic volume are determined from the upstream of the congested arterial road (including congested section 501, congested section 502, and congested section 503), namely candidate inflow node 504 and candidate inflow node 505. Among them, the proportion of the inflow contribution provided by candidate inflow node 504 to this historical traffic volume is 57 / 102, and the proportion of the inflow contribution provided by candidate inflow node 55 to this historical traffic volume is 45 / 102;

[0078] The historical traffic volume corresponding to the fifth historical period is 100 vehicles, and two first-level traffic intersections that contribute to the inflow of this historical traffic volume are determined from the upstream of the congested arterial road (including congested section 501, congested section 502, and congested section 503), namely candidate inflow node 504 and candidate inflow node 505. Among them, the proportion of the inflow contribution provided by candidate inflow node 504 to this historical traffic volume is 55 / 100, and the proportion of the inflow contribution provided by candidate inflow node 505 to this historical traffic volume is 45 / 100.

[0079] Specifically, as shown in Table 1:

[0080]

[0081] Finally, the average proportion of the inflow contribution of candidate inflow node 504 can be obtained as:

[0082] (60 / 105 + 55 / 95 + 58 / 98 + 57 / 102 + 55 / 100) / 5 = 60%

[0083] That is, the proportion of the inflowing vehicle flow of candidate inflow node 504 is 60%.

[0084] Similarly, the average proportion of the inflow contribution of candidate inflow node 505 can be obtained as:

[0085] (40 / 105 + 35 / 95 + 40 / 98 + 42 / 102 + 42 / 100) / 5 = 40%

[0086] That is, the proportion of the inflowing vehicle flow of candidate inflow node 505 is 40%.

[0087] Among them, the first-level traffic intersection is the traffic intersection that is only separated from the congested trunk line by one section. In this example, after determining the candidate merging nodes 504 and 505 that belong to the first-level traffic intersection, multiple candidate merging nodes that belong to the second-level traffic intersection, the third-level traffic intersection, the fourth-level traffic intersection, and even other higher-level traffic intersections can be further obtained to obtain multiple candidate merging nodes. Finally, all target merging nodes with a merging traffic flow ratio greater than or equal to the preset merging ratio are selected from the multiple candidate merging nodes to form a traffic flow merging node set. Among them, the preset merging ratio can be values such as 10%, 15%, 20%, etc., and the embodiments of the present disclosure do not make specific limitations on this.

[0088] In this example, assume that the preset merging ratio is 10%. Then, candidate merging nodes 504 and 505 with a merging traffic flow ratio greater than 10% and belonging to the first-level traffic intersection can be selected from the multiple candidate merging nodes. At the same time, candidate merging nodes 506, 507, and 508 with a merging traffic flow ratio greater than 10% and belonging to the second-level traffic intersection are selected, and candidate merging node 509 with a merging traffic flow ratio greater than 10% and belonging to the third-level traffic intersection is selected. Finally, a traffic flow merging node set is formed. Among them, the merging traffic flow ratio of candidate merging node 504 is 60%, the merging traffic flow ratio of candidate merging node 505 is 40%, the merging traffic flow ratio of candidate merging node 506 is 40%, the merging traffic flow ratio of candidate merging node 507 is 10%, the merging traffic flow ratio of candidate merging node 508 is 25%, and the merging traffic flow ratio of candidate merging node 509 is 30%.

[0089] Through the above steps included in "determining the traffic flow merging node set upstream of the congested trunk line according to historical traffic flow information", in the embodiments of the present disclosure, the overall traffic volume of the congested trunk line during the target period and multiple candidate merging nodes upstream of the congested trunk line can be determined according to historical traffic flow information. Then, at least one target merging node with a merging traffic flow ratio greater than or equal to the preset merging ratio is selected from the multiple candidate merging nodes to form a traffic flow merging node set. And the traffic flow merging node set is used for subsequent planning of detour paths. Therefore, the upstream diversion nodes can be clarified, making the traffic guidance method more targeted, thereby further improving the congestion relief effect for the congested trunk line. At the same time, since the merging traffic flow ratio of the target merging node is greater than or equal to the preset merging ratio, small-flow candidate merging nodes that are not necessary for diversion in this province can also be excluded, thereby improving the congestion relief efficiency.

[0090] In some alternative embodiments, the set of vehicle flow merging nodes includes multiple target merging nodes. Based on this, "planning at least one detour route based on the set of vehicle flow merging nodes" may include the following steps:

[0091] Select the node to be processed from the multiple target merging nodes in sequence according to the selection order from far to near relative to the congested arterial road;

[0092] For each selected node to be processed, plan a detour route related to the node to be processed;

[0093] Determine the path diversion flow of the detour route, so as to perform diversion update processing on the flow to be diverted on the congested arterial road according to the path diversion flow;

[0094] In the case that the flow to be diverted after the diversion update processing is greater than zero and there are still unselected target merging nodes among the multiple target merging nodes, continue to plan the next detour route until the updated flow to be diverted is equal to zero or there are no unselected target merging nodes among the multiple target merging nodes.

[0095] In a specific example, the set of vehicle flow merging nodes includes 2 target merging nodes belonging to the first-level traffic intersections, 3 target merging nodes belonging to the second-level traffic intersections, and 1 target merging node belonging to the third-level traffic intersections. Therefore, according to the selection order from far to near relative to the congested arterial road, the target merging node belonging to the third-level traffic intersection can be selected first from these 6 target merging nodes as the node to be processed. In addition, it should be noted that if there are multiple target merging nodes belonging to the third-level traffic intersection, the nodes to be processed can be selected in sequence according to the descending order of the proportion of the incoming vehicle flow.

[0096] For each selected node to be processed, plan a detour route related to the node to be processed. For example, plan a detour route with this node to be processed as the starting point and any vehicle exit node downstream of the congested arterial road as the target point. Thereafter, determine the path diversion flow of the detour route, so as to perform diversion update processing on the flow to be diverted on the congested arterial road according to the path diversion flow. For example, obtain the flow difference between the flow to be diverted and the path diversion flow as the flow to be diverted after the diversion update processing. Here, it can be understood that the vehicle flow with the same flow as the path diversion flow is allocated from the flow to be diverted to the detour route to achieve the congestion relief of the congested arterial road. Finally, in the case that the flow to be diverted after the diversion update processing is greater than zero and there are still unselected target merging nodes among the multiple target merging nodes, the next detour route can be continued to be planned until the updated flow to be diverted is equal to zero or there are no unselected target merging nodes among the multiple target merging nodes.

[0097] Through the above steps included in "planning at least one detour route based on the set of vehicle flow merging nodes", in the embodiments of the present disclosure, the nodes to be processed can be selected from multiple target merging nodes in the order of from far to near relative to the congested main line. And for each selected node to be processed, a detour route related to the node to be processed is planned, and then the path diversion flow of the detour route is determined, so as to perform diversion update processing on the flow to be diverted of the congested main line, thereby realizing the diversion processing of the congested main line. Since when selecting the nodes to be processed, it is in the order of from far to near relative to the congested main line, therefore, the congestion situation of the congested main line can be dredged from the source, which can not only reduce the difficulty of congestion dredging, but also improve the congestion dredging efficiency. In addition, by using multiple target merging nodes to perform diversion processing on the congested main line, the maximization of the divertible flow can also be achieved, further enhancing the congestion dredging effect for the congested main line.

[0098] In some alternative embodiments, "planning a detour route related to the node to be processed" may include the following steps:

[0099] Determine a detour end point corresponding to the node to be processed from the downstream of the congested main line;

[0100] Plan multiple candidate routes with the node to be processed as the starting point, the detour end point as the target point, and not overlapping with the congested main line;

[0101] Select a preset number of primary selected routes with the shortest Estimated Time of Arrival (ETA) and less than the congested travel time from the multiple candidate routes. The congested travel time is the travel time required to start from the node to be processed and reach the detour end point via the congested main line;

[0102] Select a detour route from the preset number of primary selected routes.

[0103] Among them, the detour end point corresponding to the node to be processed can be any vehicle exit node downstream of the congested main line. The multiple candidate routes that do not overlap with the congested main line can be understood as: there is no overlapping part and no crossing part with the congested main line. The preset number can be numerical values such as 3, 4, 5, etc., and the embodiments of the present disclosure do not make specific limitations on this.

[0104] Please combine Figure 6 , for example, when selecting the target merging node 601 as the node to be processed, the detour route 602 can finally be selected to perform diversion processing on the congested main line (including the congested sections 603, 604, and 605).

[0105] Through the above steps included in "planning a detour route related to a to-be-processed node", in the embodiments of the present disclosure, a detour end point corresponding to the to-be-processed node can be determined from the downstream of the congested trunk line, and then multiple candidate routes starting from the to-be-processed node, targeting the detour end point, and not overlapping with the congested trunk line can be planned, and a preset number of primary selected routes with the shortest ETA and less than the congested travel time can be selected from the multiple candidate routes, so as to select a detour route from the preset number of primary selected routes. This can not only avoid the detour route overlapping with the congested trunk line, but also ensure that the ETA of the detour route is less than the congested travel time. Therefore, the congestion relief effect for the congested trunk line can be further improved, and the detour time of users can be reduced, so as to improve the effectiveness of the traffic guidance method.

[0106] In some alternative embodiments, "determining a detour end point corresponding to the to-be-processed node from the downstream of the congested trunk line" may include the following steps:

[0107] According to the historical traffic flow information, determine the single-node traffic volume that enters the congested trunk line from the to-be-processed node during the target time period, and multiple candidate exit nodes downstream of the congested trunk line;

[0108] Select, from the multiple candidate exit nodes, a candidate exit node with an exit traffic flow ratio greater than or equal to a preset exit ratio and the farthest distance from the congested trunk line as the detour end point, where the exit traffic flow ratio is the ratio of the traffic volume of the single-node traffic volume that exits the congested trunk line via the current candidate exit node.

[0109] As described above, in the embodiments of the present disclosure, the driving trajectories of all historical vehicles that entered the congested trunk line during the second number of historical time periods closest to the current time and corresponding to the target time period can be identified and completed according to the historical traffic flow information. On this premise, in the embodiments of the present disclosure, the single-node traffic volume that enters the congested trunk line from the to-be-processed node during the target time period and multiple candidate exit nodes downstream of the congested trunk line can also be determined according to the historical traffic flow information, and then a candidate exit node with an exit traffic flow ratio greater than or equal to a preset exit ratio and the farthest distance from the congested trunk line can be selected from the multiple candidate exit nodes as the detour end point. Among them, the preset exit ratio can be values such as 40%, 50%, 60%, etc., and the embodiments of the present disclosure do not make specific limitations on this.

[0110] Please combine Figure 7, Exemplarily, when selecting the target inflow node 701 as the node to be processed, the single-node traffic flow that enters the congested arterial road (including congested section 702, congested section 703, and congested section 704) and is inflowed by the target inflow node 701 within the target time period is 30 vehicles. After these 30 vehicles drive out of the congested arterial road, 5 vehicles drive away via the unobstructed section 705 and the candidate exit node 706, and 25 vehicles drive away via the unobstructed section 707 and the candidate exit node 708. Among these 25 vehicles, 5 vehicles drive away via the unobstructed section 709 and the candidate exit node 710, and 20 vehicles drive away via the unobstructed section 711 and the candidate exit node 712. Among these 20 vehicles, 8 vehicles drive away via the unobstructed section 713 and the candidate exit node 714, and 12 vehicles drive away via the unobstructed section 715 and the candidate exit node 716. Assuming that the preset exit ratio is 50%, the candidate exit node 712 (the ratio of its outgoing traffic flow is 20 / 30), which has an outgoing traffic flow ratio greater than or equal to 50% and is the farthest from the congested arterial road, can be selected from multiple candidate exit nodes as the detour end point.

[0111] Through the above steps included in "determining the detour end point corresponding to the node to be processed from the downstream of the congested arterial road", in the embodiments of the present disclosure, according to the historical traffic flow information, the single-node traffic flow that enters the congested arterial road and is inflowed by the node to be processed within the target time period, and multiple candidate exit nodes downstream of the congested arterial road can be determined, and then the candidate exit node with an outgoing traffic flow ratio greater than or equal to the preset exit ratio and the farthest from the congested arterial road can be selected from multiple candidate exit nodes as the detour end point. On the one hand, since the outgoing traffic flow ratio of the detour end point is greater than or equal to the preset exit ratio, it can be ensured that there is a large traffic flow correlation between the detour end point and the congested arterial road, thereby reducing the detour time of users and further improving the effectiveness of the traffic guidance method. On the other hand, since the candidate exit node with an outgoing traffic flow ratio greater than or equal to the preset exit ratio and the farthest from the congested arterial road is selected from multiple candidate exit nodes as the detour end point, the distance between the detour end point and the congested arterial road can be increased, thereby avoiding causing new congestion near the exit of the congested arterial road and further improving the congestion guidance effect for the congested arterial road.

[0112] In some alternative embodiments, "selecting a detour path from a preset number of primary selected paths" may include the following steps:

[0113] Obtain the remaining path capacity of each primary selected path within the target time period;

[0114] Select the primary selected path with the largest remaining path capacity from the preset number of primary selected paths as the detour path.

[0115] Among them, the remaining path capacity of the primary selected path within the target time period is the remaining bearable capacity of the primary selected path within the target time period. Based on this, it can be understood that in the embodiments of the present disclosure, when the newly added traffic volume incorporated into the primary selected path is greater than the remaining path capacity, new congestion will be caused on the primary selected path.

[0116] Through the above steps included in "selecting a detour path from a preset number of primary selected paths", in the embodiments of the present disclosure, the remaining path capacity of each primary selected path within the target time period can be obtained, and the primary selected path with the largest remaining path capacity can be selected from the preset number of primary selected paths as the detour path. Then, the detour path planned each time can carry a relatively large amount of diverted traffic, so that the traffic volume to be diverted on the congested trunk line can be distributed as soon as possible from the source relatively far from the congested trunk line. This can not only reduce the difficulty of congestion relief but also improve the efficiency of congestion relief.

[0117] In some alternative embodiments, "obtaining the remaining path capacity of each primary selected path within the target time period" may include the following steps:

[0118] For each primary selected path, obtain the remaining section capacity of each detour section included in the primary selected path within the target time period;

[0119] Select the target detour section with the smallest remaining section capacity from the multiple detour sections;

[0120] Take the remaining section capacity of the target detour section as the remaining path capacity of the primary selected path.

[0121] Among them, the detour section belongs to an unobstructed section, and the remaining section capacity of the detour section within the target time period can be obtained in the following manner: obtain the flow difference between the maximum bearing flow and the actual predicted flow of the detour section within the target time period as the remaining section capacity of the detour section within the target time period.

[0122] Exemplarily, the remaining path capacity of the primary selected path within the target time period can be obtained through the following calculation logic:

[0123] q n =min{(α L,1 *Q1′ i,绕行 -Q1 i,绕行 )}

[0124] Among them, q n is the remaining path capacity of the nth primary selected path among the preset number of primary selected paths, α L,1 is the upper saturation degree of the detour section, which can be specifically numerical values such as 0.7, 0.75, 0.8, etc. The embodiments of the present disclosure do not make specific limitations on this, Q1′ i,绕行is the saturated flow of the i-th detour section in the primary path during the target period, α L,1 *Q1′ i,绕行 is the maximum carrying capacity of the i-th detour section in the primary path during the target period, Q1 i,绕行 is the actual predicted flow of the i-th detour section in the primary path during the target period. It should be noted that in the embodiments of the present disclosure, for the i-th detour section in the primary path, if its (α L,1 *Q1′ i,绕行 -Q1 i,绕行 ) < 0, the remaining capacity of the section during the target period can be directly set to 0.

[0125] In addition, it should be noted that in the embodiments of the present disclosure, the actual predicted flow of the detour section during the target period can be the average traffic flow of the detour section in the second number of historical periods closest to the current moment and corresponding to the target period, which will not be elaborated here.

[0126] Through the above steps included in "obtaining the remaining path capacity of each primary path during the target period", in the embodiments of the present disclosure, for each primary path, the remaining capacity of each detour section included in the primary path during the target period can be obtained, and then the target detour section with the smallest remaining capacity is selected from the multiple detour sections, and the remaining capacity of the target detour section is used as the remaining path capacity of the primary path. That is, in the embodiments of the present disclosure, the remaining path capacity of the primary path is determined based on the short-board principle. Therefore, it can be ensured that after the traffic flow to be diverted from the congested trunk line is allocated to the primary path, no new congestion will be caused, so as to further improve the congestion relief effect for the congested trunk line.

[0127] In some alternative embodiments, "determining the path diversion flow of the detour path to perform diversion update processing on the traffic flow to be diverted from the congested trunk line" may include the following steps:

[0128] Based on the remaining path capacity of the detour path during the target period, obtain the expected carrying capacity of the detour path;

[0129] When the traffic flow to be diverted from the congested trunk line is less than or equal to the expected carrying capacity, use the traffic flow to be diverted as the path diversion flow;

[0130] When the traffic flow to be diverted is greater than the expected carrying capacity, allocate a traffic flow equal to the expected carrying capacity from the traffic flow to be diverted as the path diversion flow;

[0131] Obtain the flow difference between the traffic flow to be diverted and the path diversion flow, and use it as the traffic flow to be diverted after the diversion update processing.

[0132] In the embodiments of the present disclosure, after successively selecting a node to be processed from multiple target merging nodes in the order of from far to near relative to the congested trunk line, and planning a detour path related to the node to be processed for each selected node to be processed, when performing the above steps included in "determining the path diversion flow of the detour path to perform diversion update processing on the flow to be diverted of the congested trunk line according to the path diversion flow", the total traffic volume of the congested trunk line in the target period and the proportion of the incoming traffic of the node to be processed can be obtained. Thereafter, the expected carrying flow of the detour path can be obtained by combining the total traffic volume of the congested trunk line in the target period, the proportion of the incoming traffic of the node to be processed, and the remaining path capacity of the detour path in the target period.

[0133] Exemplarily, the expected carrying flow of the detour path can be obtained through the following calculation logic:

[0134] q′ n =min{q*λ, q n}

[0135] where q′ n is the expected carrying flow of the detour path, q is the total traffic volume of the congested trunk line in the target period, λ is the proportion of the incoming traffic of the node to be processed, and q n is the remaining path capacity of the detour path in the target period.

[0136] Thereafter, in the case where the flow to be diverted of the congested trunk line is less than or equal to the expected carrying flow, the flow to be diverted is used as the path diversion flow. In the case where the flow to be diverted is greater than the expected carrying flow, a traffic flow equal to the expected carrying flow is allocated from the flow to be diverted as the path diversion flow. That is, if q0 ≤ q′ n , then q″ = q0; if q0 > q′ n , then q″ = q′ n , where q0 is the flow to be diverted of the congested trunk line and q″ is the path diversion flow of the detour path. Finally, the flow difference between the flow to be diverted and the path diversion flow is obtained as the flow to be diverted after the diversion update processing.

[0137] By the above steps included in "determining the path diversion flow of the detour path to perform diversion update processing on the flow to be diverted of the congested arterial road according to the path diversion flow", in the embodiments of the present disclosure, the estimated carrying flow of the detour path can be obtained based on the remaining path capacity of the detour path during the target period. Thereafter, when the flow to be diverted of the congested arterial road is less than or equal to the estimated carrying flow, the flow to be diverted is used as the path diversion flow to improve the congestion relief efficiency for the congested arterial road. When the flow to be diverted is greater than the estimated carrying flow, a vehicle flow with the same amount as the estimated carrying flow is allocated from the flow to be diverted as the path diversion flow, which can avoid causing new congestion and further improve the congestion relief effect for the congested arterial road, thereby achieving a balance between the congestion relief efficiency and the congestion relief effect.

[0138] Further, the traffic guidance method provided by the embodiments of the present disclosure may further include the following steps to obtain the flow to be diverted of the congested arterial road:

[0139] Obtain the section overflow capacity of each congested section included in the congested arterial road during the target period;

[0140] Select the target congested section with the largest section overflow capacity from the multiple congested sections;

[0141] Select the minimum value from the section overflow capacity of the target congested section and the overall traffic flow of the congested arterial road during the target period as the flow to be diverted of the congested arterial road.

[0142] Among them, the section overflow capacity of the congested section during the target period can be obtained in the following way: Obtain the flow difference between the actual predicted flow and the maximum carrying flow of the congested section during the target period as the section overflow capacity of the congested section during the target period.

[0143] Exemplarily, the section overflow capacity of the congested section during the target period can be obtained through the following calculation logic:

[0144] q0 = min{max{(Q2 i,拥堵 - α L,2 * Q2′ i,拥堵 )}, q}

[0145] Among them, q0 is the flow to be diverted of the congested arterial road, Q2 i,拥堵 is the actual predicted flow of the i-th congested section among the multiple congested sections during the target period, α L,2 is the upper saturation degree of the congested section, which can be specifically values such as 0.85, 0.9, 0.95, etc. The embodiments of the present disclosure do not make specific limitations on this, Q2′ i,拥堵 is the saturated flow of the i-th congested section among the multiple congested sections during the target period, α L,2*Q2′ i,拥堵 is the maximum carrying capacity of the i-th congested road section among multiple congested road sections during the target period, and q is the overall traffic flow of the congested trunk line during the target period.

[0146] In addition, it should be noted that in the embodiment of the present disclosure, the actual predicted traffic flow of the congested section within the target time period can be the average traffic flow of the congested section in the second number of historical time periods closest to the current moment and corresponding to the target time period, which will not be elaborated here.

[0147] In the disclosed embodiment, the above steps included in the congestion relief method can obtain the overflow capacity of each congested section in the target time period of the multiple congested sections included in the congested trunk line, and then select the target congested section with the largest overflow capacity from the multiple congested sections, and select the minimum value from the overflow capacity of the target congested section and the overall traffic flow of the congested trunk line in the target time period as the traffic flow to be diverted from the congested trunk line. In this way, the traffic flow of the section of the most seriously congested congested section in the congested trunk line after the diversion process can be adjusted to within its maximum carrying capacity as much as possible, thereby further improving the congestion relief effect on the congested trunk line.

[0148] In the embodiment of the present disclosure, after planning a detour path for each detour path and determining the path diversion flow of the detour path, and performing diversion update processing on the to-be-diverted flow of the congested trunk line according to the path diversion flow, the proportion of the incoming traffic of the remaining nodes can also be updated according to the path diversion flow, so as to ensure that when the detour path is subsequently planned, only the target inlet nodes whose inlet traffic proportion is greater than or equal to the preset inlet proportion can be selected as the nodes to be processed. Among them, the remaining nodes are the target inlet nodes that are not selected from the multiple target inlet nodes included in the vehicle flow inlet node set.

[0149] Exemplarily, the proportion of incoming traffic at the remaining nodes may be updated by the following calculation logic:

[0150]

[0151] Among them, Q3′ m,剩余 is the proportion of incoming traffic after the remaining nodes are updated. The remaining nodes are the target incoming nodes belonging to the m-th level traffic intersection among the multiple target incoming nodes included in the set of traffic incoming nodes. Q3 m,剩余 Update the previous proportion of incoming traffic for the remaining node, q′ m ' +1 is the proportion of path diversion flow of the target confluence node that is upstream of the remaining node and belongs to the m+1th level traffic intersection, and j represents: the total proportion of path diversion flow of the target confluence node that is upstream of all the remaining nodes and belongs to the m+1th level traffic intersection needs to be subtracted.

[0152] Please combine with Figure 8 , for example, when selecting the target merging node 801 belonging to the third-level traffic intersection as the node to be processed, a detour path 802 related to the target merging node 801 is planned to perform a diversion process on the congested trunk line (including congested sections 803, 804, and 805). Among them, the single-node traffic flow of the target merging node 801 before update is 30%, the single-node traffic flow of the target merging node 806 before update is 35%, and the single-node traffic flow of the target merging node 807 before update is 60%. Assume that the proportion of the path diversion flow of the detour path 802 is 28%. Then, after updating the proportion of the incoming traffic flow of the remaining node - the target merging node 806 belonging to the second-level traffic intersection according to the path diversion flow, the proportion of the incoming traffic flow of the target merging node 806 is 7%. Similarly, the proportion of the incoming traffic flow of the remaining node - the target merging node 807 belonging to the first-level traffic intersection can be updated, and after the update, the proportion of the incoming traffic flow of the target merging node 807 is 32%. Therefore, when planning the detour path subsequently, for the target merging node 806 and the target merging node 807, only the target merging node 807 can be selected as the node to be processed, and a detour path related to it can be planned, instead of planning a detour path related to the target merging node 806, thereby improving the congestion relief efficiency.

[0153] Similarly, after each detour path is planned and the path diversion flow of this detour path is determined to perform a diversion update process on the flow to be diverted of the congested trunk line according to the path diversion flow, the actual predicted flow of each detour section covered by the detour path within the target time period can also be updated according to the path diversion flow.

[0154] For example, the actual predicted flow of the detour section can be updated through the following calculation logic:

[0155]

[0156] Among them, Q4′ i,剩余 is the actual predicted flow after updating the i-th detour section in the detour path, Q3 i,剩余 is the original actual predicted flow of the i-th detour section in the detour path, q′ m ′ +1 is the path diversion flow of the detour path where the upper-level detour node that is only separated from this detour section by one detour section is located, and k represents: the total path diversion flow of all detour paths where the upper-level detour nodes that are only separated from this detour section by one detour section are located needs to be added.

[0157] Please combine with Figure 9, Exemplarily, when selecting the target merging node 901 belonging to the third-level traffic intersection as the node to be processed, a detour path 902 related to the target merging node 901 is planned to divert the congested arterial line (including congested sections 903, 904, and 905). Then, when selecting the target merging node 906 belonging to the second-level traffic intersection as the node to be processed, a detour path 907 related to the target merging node 906 is planned. The detour path 907 and the detour path 902 converge at the detour node 908 and then overlap continuously. Assume that the path diversion flow of the detour path 902 is 20, the path diversion flow of the detour path 907 is 30, and the original actual predicted flow of the detour section 909 is 30. Then, after updating the actual predicted flow of the detour section 909, the updated actual predicted flow of 70 can be obtained.

[0158] In some alternative embodiments, "generating traffic guidance information based on at least one detour path to conduct traffic guidance through the traffic guidance information" may include the following steps:

[0159] Obtain the path diversion flow of the detour path to generate traffic guidance information including the detour path and the path diversion flow;

[0160] Send the traffic guidance information to an indication output device to be displayed through the indication output device, and the indication output device is set at the location of the node to be processed.

[0161] As mentioned above, in the embodiments of the present disclosure, the indication output device may be at least one of an intersection information board, an induction screen, and a light strip screen.

[0162] Please combine Figure 10 , When selecting the target merging node 1001 as the node to be processed, a detour path 1002 related to the target merging node 1001 is planned. At this time, the traffic guidance information can be sent to the first indication output device 1003 set at the first position to be displayed through the indication output device 1003 for inducing left-turn vehicles, or the traffic guidance information can be sent to the second indication output device 1004 set at the second position to be displayed through the indication output device 1004 for inducing straight-ahead vehicles, or the traffic guidance information can be sent to the third indication output device 1005 set at the third position to be displayed through the indication output device 1005 for inducing right-turn vehicles.

[0163] Through the above steps included in "generating traffic guidance information based on at least one detour route to conduct traffic guidance through the traffic guidance information", in the embodiments of the present disclosure, the traffic diversion flow of the detour route can be obtained to generate traffic guidance information including the detour route and the traffic diversion flow, and the traffic guidance information is sent to the indication output device for display through the indication output device, so as to improve the comprehensiveness of the traffic guidance information, enabling the driver to reasonably choose whether to take a detour according to the traffic guidance information, thereby improving the effectiveness of the traffic guidance method.

[0164] Next, in conjunction with Figure 11 , the complete process of a traffic guidance method provided by the embodiments of the present disclosure will be described.

[0165] Step S1101, at preset time intervals, according to historical traffic flow information, determine multiple congested road sections in the target time period that are in a congested state from the area to be guided.

[0166] In the embodiments of the present disclosure, for each road section in the area to be guided, the average congestion index of the road section in the 5 historical time periods closest to the current moment and corresponding to the target time period can be obtained according to historical traffic flow information. Then, in the case where the average congestion index is greater than or equal to the preset index threshold of 1.8, it is determined that the road section is a congested road section during the target time period. Specifically, the 5 historical time periods can be divided according to a granularity of 5 minutes to obtain 60 5-minute time periods, and then the average congestion index of the road section in these 60 5-minute time periods is obtained.

[0167] Step S1102, form a congested main line by at least two congested road sections that have spatial continuity and traffic flow correlation during the target time period among the multiple congested road sections.

[0168] Step S1103, according to historical traffic flow information, determine the total traffic volume of the congested main line during the target time period, and multiple candidate merging nodes upstream of the congested main line, and select multi-target merging nodes with an incoming traffic flow ratio greater than or equal to the preset incoming ratio from the multiple candidate merging nodes to form a set of traffic flow merging nodes. The incoming traffic flow ratio is the ratio of the traffic volume flowing into the congested main line through the current candidate merging node in the total traffic volume.

[0169] Among them, the preset incoming ratio can be 10%.

[0170] Step S1104, obtain the road section overflow capacity of each congested road section included in the congested main line during the target time period, then select the target congested road section with the largest road section overflow capacity from the multiple congested road sections, and select the minimum value from the road section overflow capacity of the target congested road section and the overall traffic volume of the congested main line during the target time period as the traffic volume to be diverted of the congested main line.

[0171] Step S1105: Select the to-be-processed node from multiple target merging nodes in sequence according to the selection order from far to near relative to the congested trunk line.

[0172] Step S1106: For each selected to-be-processed node, determine the single-node traffic volume that enters the congested trunk line from the to-be-processed node during the target time period based on historical traffic flow information, as well as multiple candidate departure nodes downstream of the congested trunk line. Then select, as the detour end point, the candidate departure node with the departure traffic flow ratio greater than or equal to the preset departure ratio and the farthest distance from the congested trunk line. The departure traffic flow ratio is the ratio of the traffic volume that departs from the congested trunk line via the current candidate departure node in the single-node traffic volume.

[0173] Among them, the preset departure ratio can be 50%.

[0174] Step S1107: Plan multiple candidate paths with the to-be-processed node as the starting point, the detour end point as the target point, and not overlapping with the congested trunk line. Then select, from the multiple candidate paths, the preset number of primary selection paths with the shortest ETA and less than the congested travel time. The congested travel time is the travel time required to start from the to-be-processed node and reach the detour end point via the congested trunk line.

[0175] Among them, the preset number of paths can be 3.

[0176] Step S1108: Obtain the remaining capacity of each primary selection path during the target time period, and select, from the preset number of primary selection paths, the primary selection path with the largest remaining capacity as the detour path.

[0177] Step S1109: Based on the remaining capacity of the detour path during the target time period, obtain the expected carrying traffic volume of the detour path. Then, when the traffic volume to be diverted on the congested trunk line is less than or equal to the expected carrying traffic volume, use the traffic volume to be diverted as the path diversion traffic volume. When the traffic volume to be diverted is greater than the expected carrying traffic volume, allocate a traffic volume equal to the expected carrying traffic volume from the traffic volume to be diverted as the path diversion traffic volume. Finally, obtain the traffic volume difference between the traffic volume to be diverted and the path diversion traffic volume as the traffic volume to be diverted after the diversion update process.

[0178] Step S1110: When the traffic volume to be diverted after the diversion update process is greater than zero and there are still unselected target merging nodes among the multiple target merging nodes, continue to plan the next detour path until the updated traffic volume to be diverted is equal to zero or there are no unselected target merging nodes among the multiple target merging nodes.

[0179] Please refer to Figure 12 , which is a schematic diagram of an application scenario of a traffic guidance method provided by an embodiment of the present disclosure.

[0180] As described above, the traffic guidance method provided by the embodiments of the present disclosure is applied to an electronic device. Among them, the electronic device is intended to represent various forms of digital computers, such as desktop computers, workstations, servers, blade servers, mainframe computers, and other suitable computers.

[0181] In the embodiments of the present disclosure, the electronic device can be used to execute the traffic guidance method:

[0182] Obtain historical traffic flow information of the congested trunk line;

[0183] Determine the set of traffic flow merging nodes upstream of the congested trunk line according to the historical traffic flow information;

[0184] Based on the set of traffic flow merging nodes, plan at least one detour route;

[0185] Generate guidance indication information based on at least one detour route to conduct traffic guidance through the guidance indication information.

[0186] As described above, in the embodiments of the present disclosure, the historical traffic flow information may be traffic video information collected by a plurality of video monitoring devices arranged upstream of the congested trunk line, on the congested trunk line, and downstream of the congested trunk line. In addition, in the embodiments of the present disclosure, after generating the guidance indication information, the guidance indication information may be sent to an indication output device for display through the indication output device.

[0187] It should be noted that in the embodiments of the present disclosure, Figure 12 The shown scenario schematic diagram is only illustrative and not restrictive. Those skilled in the art can make various obvious changes and / or substitutions based on Figure 12 the examples, and the obtained technical solutions still fall within the scope of the disclosure of the embodiments of the present disclosure.

[0188] To better implement the above traffic guidance method, the embodiments of the present disclosure also provide a traffic guidance device 1300, and the traffic guidance device 1300 may be integrated in an electronic device. Hereinafter, a traffic guidance device 1300 provided by the embodiments of the disclosure will be described with reference to Figure 13 the shown structural schematic diagram.

[0189] The traffic guidance device 1300 includes:

[0190] An information acquisition unit 1301, configured to obtain historical traffic flow information of the congested trunk line;

[0191] A set determination unit 1302, configured to determine the set of traffic flow merging nodes upstream of the congested trunk line according to the historical traffic flow information;

[0192] A path planning unit 1303, configured to plan at least one detour path based on a set of vehicle flow merging nodes;

[0193] A traffic guidance unit 1304, configured to generate guidance indication information based on at least one detour path, so as to conduct traffic guidance through the guidance indication information.

[0194] In some alternative embodiments, the set of vehicle flow merging nodes includes a plurality of target merging nodes, and the path planning unit 1303 is configured to:

[0195] Select nodes to be processed from the plurality of target merging nodes in sequence according to a selection order from far to near relative to the congested main line;

[0196] For each selected node to be processed, plan a detour path related to the node to be processed;

[0197] Determine the path diversion flow of the detour path, so as to perform diversion update processing on the flow to be diverted of the congested main line according to the path diversion flow;

[0198] In the case that the flow to be diverted after the diversion update processing is greater than zero and there are still unselected target merging nodes among the plurality of target merging nodes, continue to plan the next detour path until the updated flow to be diverted is equal to zero or there are no unselected target merging nodes among the plurality of target merging nodes.

[0199] In some alternative embodiments, the path planning unit 1303 is configured to:

[0200] Determine a detour end point corresponding to the node to be processed from the downstream of the congested main line;

[0201] Plan a plurality of candidate paths starting from the node to be processed, targeting the detour end point, and not overlapping with the congested main line;

[0202] Select a preset number of primary selected paths with the shortest estimated arrival time and less than the congested travel time from the plurality of candidate paths, where the congested travel time is the travel time required to start from the node to be processed and reach the detour end point via the congested main line;

[0203] Select a detour path from the preset number of primary selected paths.

[0204] In some alternative embodiments, the path planning unit 1303 is configured to:

[0205] According to historical vehicle flow information, determine the single-node vehicle flow that enters the congested main line from the node to be processed during the target time period, and a plurality of candidate exit nodes downstream of the congested main line;

[0206] Select a candidate departure node with a departure traffic flow ratio greater than or equal to a preset departure ratio and the farthest from the congested arterial road from multiple candidate departure nodes as the detour end point. The departure traffic flow ratio is the ratio of the traffic flow departing from the congested arterial road via the current candidate departure node in the single-node traffic volume.

[0207] In some alternative embodiments, the path planning unit 1303 is configured to:

[0208] Obtain the remaining path capacity of each primary selected path during the target time period;

[0209] Select the primary selected path with the largest remaining path capacity from a preset number of primary selected paths as the detour path.

[0210] In some alternative embodiments, the path planning unit 1303 is configured to:

[0211] For each primary selected path, obtain the remaining section capacity of each detour section included in the primary selected path during the target time period;

[0212] Select the target detour section with the smallest remaining section capacity from multiple detour sections;

[0213] Use the remaining section capacity of the target detour section as the remaining path capacity of the primary selected path.

[0214] In some alternative embodiments, the path planning unit 1303 is configured to:

[0215] Based on the remaining path capacity of the detour path during the target time period, obtain the estimated carrying flow of the detour path;

[0216] In the case where the traffic flow to be diverted on the congested arterial road is less than or equal to the estimated carrying flow, use the traffic flow to be diverted as the path diversion flow;

[0217] In the case where the traffic flow to be diverted is greater than the estimated carrying flow, allocate a traffic flow equal to the estimated carrying flow from the traffic flow to be diverted as the path diversion flow;

[0218] Obtain the flow difference between the traffic flow to be diverted and the path diversion flow as the traffic flow to be diverted after the diversion update process.

[0219] In some alternative embodiments, the traffic guidance device 1300 further includes a flow acquisition unit for:

[0220] Obtain the overflow capacity of each congested section included in the congested arterial road during the target time period;

[0221] Select the target congested section with the largest overflow capacity from multiple congested sections;

[0222] Select the minimum value from the section spillover capacity of the target congested section and the overall traffic flow of the congested arterial road during the target time period as the traffic flow to be diverted of the congested arterial road.

[0223] In some alternative embodiments, the traffic guidance unit 1304 is configured to:

[0224] Obtain the traffic flow diverted by the detour route to generate guidance indication information including the detour route and the traffic flow diverted by the route;

[0225] Send the guidance indication information to the indication output device for display through the indication output device, and the indication output device is arranged at the location of the node to be processed.

[0226] In some alternative embodiments, the set determination unit 1302 is configured to:

[0227] Determine the overall traffic flow of the congested arterial road during the target time period and multiple candidate merging nodes upstream of the congested arterial road according to the historical traffic flow information;

[0228] Select at least one target merging node with the proportion of the incoming traffic flow greater than or equal to the preset incoming proportion from the multiple candidate merging nodes to form a traffic flow merging node set, where the proportion of the incoming traffic flow is the proportion of the traffic flow that merges into the congested arterial road via the current candidate merging node in the overall traffic flow.

[0229] In some alternative embodiments, the traffic guidance device 1300 further includes a congestion determination unit, configured to:

[0230] Determine multiple congested sections in the area to be guided that are in a congested state during the target time period according to the historical traffic flow information;

[0231] Form a congested arterial road by at least two congested sections that have spatial continuity and traffic flow correlation during the target time period among the multiple congested sections.

[0232] In some alternative embodiments, the congestion determination unit is configured to:

[0233] Determine multiple congested sections in the area to be guided that are in a congested state during the target time period according to the historical traffic flow information at preset time intervals.

[0234] In specific implementation, each of the above modules can be implemented as an independent entity, or can be combined arbitrarily to be implemented as the same or several entities. For the specific implementation of each of the above modules, reference can be made to the embodiments of the traffic guidance method described above, which will not be elaborated here.

[0235] By using the traffic guidance device 1300 provided in the embodiments of the present disclosure, historical traffic flow information of a congested arterial road can be obtained; according to the historical traffic flow information, a set of traffic flow merging nodes upstream of the congested arterial road can be determined; based on the set of traffic flow merging nodes, at least one detour path can be planned; and based on the at least one detour path, guidance indication information can be generated to conduct traffic guidance through the guidance indication information. Since in the embodiments of the present disclosure, the set of traffic flow merging nodes is upstream of the congested arterial road, therefore, based on the set of traffic flow merging nodes, at least one detour path planned can start from the traffic demand side and reduce the traffic demand on the congested arterial road, which can fundamentally solve the problem that the traffic demand on the congested arterial road is much greater than the traffic supply. Compared with the prior art solution of using signal control to conduct traffic guidance, there is a greater improvement in both the adjustment space and the adjustment ability. Therefore, the congestion relief effect for the congested arterial road can be improved, thereby effectively solving the congestion problem on the congested arterial road.

[0236] In the technical solution of the present disclosure, the acquisition, storage, and application of the user's personal information involved all comply with the provisions of relevant laws and regulations and do not violate public order and good customs.

[0237] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a storage medium, and a computer program product.

[0238] Figure 14 The schematic block diagram of an exemplary electronic device 1400 that can be used to implement the embodiments of the present disclosure is shown.

[0239] As described above, in the embodiments of the present disclosure, the electronic device is intended to represent various forms of digital computers, such as, a laptop computer, a desktop computer, a workbench, a personal digital assistant, a server, a blade server, a mainframe computer, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as, a personal digital assistant, a cellular phone, a smart phone, a wearable device, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are only examples and are not intended to limit the implementation of the present disclosure described and / or claimed herein.

[0240] As Figure 14As shown, the electronic device 1400 includes a computing unit 1401, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 1402 or a computer program loaded from a storage unit 1408 into a random access memory (RAM) 1403. In the RAM 1403, various programs and data required for the operation of the electronic device 1400 can also be stored. The computing unit 1401, the ROM 1402, and the RAM 1403 are connected to each other through a bus 1404. An input / output (I / O) interface 1405 is also connected to the bus 1404.

[0241] A plurality of components in the electronic device 1400 are connected to the I / O interface 1405, including: an input unit 1406, such as a keyboard, a mouse, etc.; an output unit 1407, such as various types of displays, speakers, etc.; a storage unit 1408, such as a magnetic disk, an optical disc, etc.; and a communication unit 1409, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 1409 allows the electronic device 1400 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0242] The computing unit 1401 can be various general-purpose and / or special-purpose processing components with processing and computing capabilities. Some examples of the computing unit 1401 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 1401 executes the various methods and processes described above, such as the traffic guidance method. For example, in some alternative embodiments, the traffic guidance method can be respectively implemented as a computer software program, which is tangibly included in a non-transitory computer-readable storage medium, such as the storage unit 1408. In some alternative embodiments, part or all of the computer program can be loaded and / or installed onto the electronic device 1400 via the ROM 1402 and / or the communication unit 1409. When the computer program is loaded into the RAM 1403 and executed by the computing unit 1401, one or more steps of the traffic guidance method described above can be executed. Alternatively, in other embodiments, the computing unit 1401 can be configured to execute the traffic guidance method by any other suitable means (such as by means of firmware).

[0243] Various embodiments of the systems and techniques described above in this document can be implemented in digital electronic circuit systems, integrated circuit systems, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), System On Chip (SOC) systems, Complex Programmable Logic Devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special-purpose or general-purpose programmable processor, and can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit the data and instructions to the storage system, the at least one input device, and the at least one output device.

[0244] The program code for implementing the methods of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing devices, such that when the program codes are executed by the processor or controller, the functions / operations specified in the flowcharts and / or block diagrams are implemented. The program codes can be executed entirely on the machine, partially on the machine, executed partially on the machine and partially on a remote machine as an independent software package, or executed entirely on a remote machine or server.

[0245] In the context of the present disclosure, a non-transitory computer-readable storage medium can be a tangible medium that can contain or store a program for use by or in connection with an instruction execution system, apparatus, or device. A non-transitory computer-readable storage medium can be a machine-readable signal medium or a machine-readable storage medium. A non-transitory computer-readable storage medium can include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. More specific examples of non-transitory computer-readable storage media would include electrical connections based on one or more wires, portable computer disks, hard disks, RAM, ROM, erasable programmable read-only memory (EPROM) or flash memory, optical fibers, portable compact disc read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0246] In order to provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device for displaying information to the user (e.g., a cathode ray tube (CRT) display or a liquid crystal display (LCD)); and a keyboard and a pointing device (e.g., a mouse or a trackball), through which the user can provide input to the computer. Other kinds of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0247] The systems and techniques described herein can be implemented in a computing system that includes backend components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes frontend components (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described herein), or a computing system that includes any combination of such backend components, middleware components, or frontend components. The components of the system can be interconnected with each other by digital data communication in any form or medium (e.g., a communication network). Examples of communication networks include: Local Area Network (LAN), Wide Area Network (WAN), and the Internet.

[0248] A computer system can include a client and a server. The client and the server are generally far from each other and usually interact through a communication network. The client-server relationship is created by computer programs running on the respective computers and having a client-server relationship with each other. The server can be a cloud server, or a server of a distributed system, or a server combined with a blockchain.

[0249] Embodiments of the present disclosure also provide a non-transitory computer-readable storage medium storing computer instructions, where the computer instructions are used to cause the computer to execute the foregoing traffic guidance method.

[0250] Embodiments of the present disclosure also provide a computer program product, including a computer program, which implements the foregoing traffic guidance method when executed by a processor.

[0251] By using the electronic device, storage medium, and computer program product provided by the embodiments of the present disclosure, historical traffic flow information of a congested trunk line can be obtained; according to the historical traffic flow information, a set of traffic flow merging nodes upstream of the congested trunk line can be determined; based on the set of traffic flow merging nodes, at least one detour path can be planned; and based on the at least one detour path, guidance indication information can be generated to conduct traffic guidance through the guidance indication information. Since in the embodiments of the present disclosure, the set of traffic flow merging nodes is upstream of the congested trunk line, therefore, based on the set of traffic flow merging nodes, the at least one detour path planned can start from the traffic demand side and reduce the traffic demand on the congested trunk line, which can fundamentally solve the problem that the traffic demand on the congested trunk line is much greater than the traffic supply. Compared with the prior art solution of using signal control to conduct traffic guidance, there is a greater improvement in the adjustment space and adjustment ability. Therefore, the congestion relief effect for the congested trunk line can be improved, and thus the congestion problem of the congested trunk line can be effectively solved.

[0252] It should be understood that the various forms of processes shown above can be used, with steps reordered, added, or deleted. For example, the steps described in this disclosure can be executed in parallel, sequentially, or in a different order, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and no limitations are imposed herein. In addition, in this disclosure, relational terms such as "first", "second", "third", etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, "a plurality of" in this disclosure can be understood to mean at least two.

[0253] The foregoing specific embodiments do not constitute a limitation on the scope of protection of this disclosure. Those skilled in the art should understand that various modifications, combinations, sub-combinations, and substitutions can be made according to design requirements and other factors. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of this disclosure shall be included within the scope of protection of this disclosure.

Claims

1. A traffic guidance method, comprising: Obtaining historical traffic flow information of congested arterial roads; wherein, the congested arterial roads include at least two congested road sections with spatial continuity and traffic flow correlation during a target time period among a plurality of congested road sections; the congested road sections are road sections determined from a to-be-guided area as being in a congested state during the target time period according to the historical traffic flow information; Determining a set of traffic flow merging nodes upstream of the congested arterial road according to the historical traffic flow information; Planning at least one detour route based on the set of traffic flow merging nodes; Generating guidance indication information based on the at least one detour route to conduct traffic guidance through the guidance indication information; Wherein, the set of traffic flow merging nodes includes a plurality of target merging nodes, and the planning of at least one detour route based on the set of traffic flow merging nodes includes: Sequentially selecting a node to be processed from the plurality of target merging nodes in the order of from far to near relative to the congested arterial road; For each selected node to be processed, planning a detour route related to the node to be processed; Determining the path diversion flow of the detour route to perform a diversion update process on the to-be-diverted flow of the congested arterial road according to the path diversion flow; In the case that the to-be-diverted flow after the diversion update process is greater than zero and there are still unselected target merging nodes among the plurality of target merging nodes, continue to plan the next detour route until the to-be-diverted flow after the update is equal to zero or there are no unselected target merging nodes among the plurality of target merging nodes.

2. The method according to claim 1, wherein The planning of a detour route related to the node to be processed includes: Determining a detour end point corresponding to the node to be processed from the downstream of the congested arterial road; Planning a plurality of candidate paths with the node to be processed as the starting point, the detour end point as the target point, and not overlapping with the congested arterial road; Selecting a preset number of primary selected paths with the shortest expected arrival time and less than the congested travel time from the plurality of candidate paths, where the congested travel time is the travel time required to reach the detour end point with the node to be processed as the starting point and via the congested arterial road; Selecting the detour route from the preset number of primary selected paths.

3. The method according to claim 2, wherein, The determining of a detour end point corresponding to the node to be processed from the downstream of the congested arterial road includes: According to the historical traffic flow information, determining the single-node traffic flow that is merged from the node to be processed and enters the congested arterial road during the target time period, and a plurality of candidate exit nodes downstream of the congested arterial road; Selecting, from the plurality of candidate exit nodes, a candidate exit node with an exit traffic flow ratio greater than or equal to a preset exit ratio and the farthest from the congested arterial road as the detour end point, where the exit traffic flow ratio is the ratio of the traffic flow exiting the congested arterial road via the current candidate exit node in the single-node traffic flow.

4. The method according to claim 2, wherein, The selecting of the detour route from the preset number of primary selected paths includes: Obtaining the path remaining capacity of each primary selected path during the target time period; Selecting the primary selected path with the largest path remaining capacity from the preset number of primary selected paths as the detour route.

5. The method according to claim 4, wherein Obtaining the remaining path capacity of each initially selected path within the target time period includes: For each initially selected path, obtaining the remaining section capacity of each detour section included in the initially selected path within the target time period; Selecting a target detour section with the minimum remaining section capacity from the multiple detour sections; Taking the remaining section capacity of the target detour section as the remaining path capacity of the initially selected path.

6. The method according to claim 1, wherein, Determining the path diversion flow of the detour path to perform a diversion update process on the flow to be diverted of the congested trunk line according to the path diversion flow, includes: Based on the remaining path capacity of the detour path within the target time period, obtaining the expected carrying flow of the detour path; When the flow to be diverted of the congested trunk line is less than or equal to the expected carrying flow, taking the flow to be diverted as the path diversion flow; When the flow to be diverted is greater than the expected carrying flow, allocating a vehicle flow equal to the expected carrying flow from the flow to be diverted as the path diversion flow; Obtaining the flow difference between the flow to be diverted and the path diversion flow as the flow to be diverted after the diversion update process.

7. The method according to claim 1 or 6, further includes: Obtaining the section overflow capacity of each congested section included in the congested trunk line within the target time period; Selecting a target congested section with the maximum section overflow capacity from the multiple congested sections; Selecting the minimum value from the section overflow capacity of the target congested section and the overall vehicle flow of the congested trunk line within the target time period as the flow to be diverted of the congested trunk line.

8. The method according to claim 1, wherein Generating a guidance instruction message based on the at least one detour path to perform traffic guidance through the guidance instruction message, includes: Obtaining the path diversion flow of the detour path to generate a guidance instruction message including the detour path and the path diversion flow; Sending the guidance instruction message to an instruction output device to be displayed through the instruction output device, and the instruction output device is set at the location of the node to be processed.

9. The method according to claim 1, wherein Determining the set of vehicle flow merging nodes upstream of the congested trunk line according to the historical vehicle flow information, includes: According to the historical vehicle flow information, determining the overall vehicle flow of the congested trunk line within the target time period and multiple candidate merging nodes upstream of the congested trunk line; Selecting at least one target merging node with an incoming vehicle flow ratio greater than or equal to a preset incoming ratio from the multiple candidate merging nodes to form the set of vehicle flow merging nodes, and the incoming vehicle flow ratio is the ratio of the vehicle flow entering the congested trunk line through the current candidate merging node in the overall vehicle flow.

10. The method according to claim 1, further includes: According to the historical vehicle flow information, determining the multiple congested sections in the to-be-diverted area that are in a congested state within the target time period; Forming the congested trunk line by the at least two congested sections with spatial continuity and vehicle flow correlation within the target time period among the multiple congested sections.

11. The method according to claim 10, wherein, Determining, according to the historical traffic flow information, multiple congested road sections in a congested state within a target time period from the area to be dredged, including: Determining, according to the historical traffic flow information at a preset time interval, multiple congested road sections in a congested state within a target time period from the area to be dredged.

12. A traffic dredging device, comprising: An information acquisition unit, configured to acquire historical traffic flow information of a congested arterial road; wherein, the congested arterial road includes at least two congested road sections that have spatial continuity and traffic flow correlation within a target time period among the multiple congested road sections; the congested road section is a road section determined to be in a congested state within a target time period from the area to be dredged according to the historical traffic flow information; A set determination unit, configured to determine a traffic flow convergence node set upstream of the congested arterial road according to the historical traffic flow information; A path planning unit, configured to plan at least one detour path based on the traffic flow convergence node set; A traffic dredging unit, configured to generate dredging instruction information based on the at least one detour path to perform traffic dredging through the dredging instruction information; wherein, the traffic flow convergence node set includes multiple target convergence nodes, and the path planning unit is configured to: Select a node to be processed from the multiple target convergence nodes in sequence according to a selection order from far to near relative to the congested arterial road; For each selected node to be processed, plan a detour path related to the node to be processed; Determine the path diversion flow of the detour path to perform a diversion update process on the flow to be diverted of the congested arterial road according to the path diversion flow; In the case that the flow to be diverted after the diversion update process is greater than zero and there are still unselected target convergence nodes among the multiple target convergence nodes, continue to plan the next detour path until the updated flow to be diverted is equal to zero or there are no unselected target convergence nodes among the multiple target convergence nodes.

13. The device according to claim 12, wherein The path planning unit is configured to: Determine a detour end point corresponding to the node to be processed from the downstream of the congested arterial road; Plan multiple candidate paths that start from the node to be processed, target at the detour end point, and do not overlap with the congested arterial road; Select a preset number of primary selected paths with the shortest estimated arrival time and less than the congested travel time from the multiple candidate paths, where the congested travel time is the travel time required to start from the node to be processed and reach the detour end point via the congested arterial road; Select the detour path from the preset number of primary selected paths.

14. The device according to claim 13, wherein, The path planning unit is configured to: Determine, according to the historical traffic flow information, the single-node traffic flow that converges from the node to be processed and enters the congested arterial road within a target time period, and multiple candidate exit nodes downstream of the congested arterial road; Select, from the multiple candidate exit nodes, a candidate exit node with an exit traffic flow ratio greater than or equal to a preset exit ratio and the farthest from the congested arterial road as the detour end point, where the exit traffic flow ratio is the ratio of the traffic flow that exits the congested arterial road via the current candidate exit node in the single-node traffic flow.

15. The apparatus according to claim 13, wherein, The path planning unit is configured to: Obtain the remaining path capacity of each initially selected path within the target time period; Select the initially selected path with the largest remaining path capacity from the preset number of initially selected paths as the detour path.

16. The device according to claim 15, wherein, The path planning unit is used for: For each initially selected path, obtain the remaining section capacity of each detour section included in the initially selected path within the target time period; Select the target detour section with the smallest remaining section capacity from the multiple detour sections; Use the remaining section capacity of the target detour section as the remaining path capacity of the initially selected path.

17. The device according to claim 12, wherein The path planning unit is used for: Based on the remaining path capacity of the detour path within the target time period, obtain the expected traffic load of the detour path; In the case where the traffic flow to be diverted on the congested trunk line is less than or equal to the expected traffic load, use the traffic flow to be diverted as the path diversion traffic flow; In the case where the traffic flow to be diverted is greater than the expected traffic load, allocate a traffic flow equal to the expected traffic load from the traffic flow to be diverted as the path diversion traffic flow; Obtain the traffic flow difference between the traffic flow to be diverted and the path diversion traffic flow as the traffic flow to be diverted after the diversion update process.

18. The device according to claim 12 or 17, further comprising a traffic flow acquisition unit, configured to: Obtain the section overflow capacity of each congested section included in the congested trunk line within the target time period; Select the target congested section with the largest section overflow capacity from the multiple congested sections; Select the minimum value from the section overflow capacity of the target congested section and the overall traffic volume of the congested trunk line within the target time period as the traffic flow to be diverted on the congested trunk line.

19. The apparatus according to claim 12, wherein, The traffic guidance unit is used for: Obtain the path diversion traffic flow of the detour path to generate guidance indication information including the detour path and the path diversion traffic flow; Send the guidance indication information to an indication output device for display through the indication output device, and the indication output device is arranged at the location of the node to be processed.

20. The apparatus according to claim 12, wherein, The set determination unit is used for: According to the historical traffic flow information, determine the overall traffic volume of the congested trunk line within the target time period and multiple candidate merging nodes upstream of the congested trunk line; Select at least one target merging node with an incoming traffic flow ratio greater than or equal to a preset incoming ratio from the multiple candidate merging nodes to form the traffic flow merging node set, where the incoming traffic flow ratio is the ratio of the traffic flow entering the congested trunk line through the current candidate merging node in the overall traffic volume.

21. The device according to claim 12, further comprising a congestion determination unit, configured to: According to the historical traffic flow information, determine multiple congested sections in a congested state within the target time period from the area to be guided; Form the congested trunk line by at least two congested sections that have spatial continuity and traffic flow correlation among the multiple congested sections.

22. The device according to claim 21, wherein, The congestion determination unit is used for: At preset time intervals, according to the historical traffic flow information, determine multiple congested sections in a congested state within the target time period from the area to be guided.

23. An electronic device, comprising: at least one processor; a memory communicatively connected to the at least one processor; the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the method according to any one of claims 1 to 11.

24. A non-transitory computer-readable storage medium storing computer instructions, wherein, The computer instructions are used to cause the computer to execute the method according to any one of claims 1 to 11.

25. A computer program product, comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1 to 11.

Images