Traffic shunting method, device, equipment, storage medium and computer program product

Abstract

The invention provides a traffic diversion method, device and equipment, a storage medium and a computer program product, and relates to the field of artificial intelligence, in particular to the field of intelligent traffic. According to the specific implementation scheme, the method comprises the steps of obtaining a target congested road section with congestion in a first road; determining a first target path passing through the target congested road section in the first road; for the first target path, based on a second road connected with the first road ramp, querying a first alternative path bypassing the target congested road section through the second road; and carrying out traffic diversion on the target congested road section based on the first alternative path.

Description

Technical Field

[0001] The present disclosure relates to the field of artificial intelligence technology, specifically to the field of intelligent transportation and other technical fields, and in particular to a traffic diversion method, device, equipment, storage medium and computer program product. Background Art

[0002] In order to ensure smooth traffic, many vehicles choose roads that are isolated from ground roads, such as elevated roads. However, roads isolated from ground roads may also be congested due to various factors such as traffic accidents and construction occupation. In this case, how to alleviate road congestion is a technical problem that needs to be solved urgently. Summary of the invention

[0003] The present disclosure provides a traffic diversion method, device, equipment, storage medium and computer program product.

[0004] According to a first aspect of the present disclosure, a traffic diversion method is provided, comprising:

[0005] Obtain a target congested road section where congestion exists in the first road;

[0006] Determine a first target path on the first road passing through the target congested road section;

[0007] For the first target path, based on a second road connected to the first road ramp, query a first alternative path that bypasses the target congested road section via the second road;

[0008] Based on the first alternative path, traffic is diverted to the target congested road section.

[0009] According to a second aspect of the present disclosure, there is provided a traffic diversion device, comprising:

[0010] An acquisition module, used for acquiring a target congested road section in the first road;

[0011] A determination module, configured to determine a first target path on the first road passing through the target congested road section;

[0012] A first query module is used for querying, for the first target path, a first alternative path that bypasses the target congested road section through a second road connected to the first road ramp;

[0013] The first diversion module is used to divert traffic to the target congested road section based on the first alternative path.

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

[0015] at least one processor; and

[0016] a memory communicatively connected to the at least one processor; wherein,

[0017] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the traffic diversion method as described in the first aspect.

[0018] According to a fourth aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute the traffic diversion method as described in the first aspect.

[0019] According to a fifth aspect of the present disclosure, a computer program product is provided, comprising computer instructions, which, when executed by a processor, implement the steps of the traffic diversion method as described in the first aspect.

[0020] The present disclosure provides a traffic diversion method, device, equipment, storage medium and computer program product, which have the following beneficial effects:

[0021] Obtain a target congested section of the first road where congestion exists; determine a first target path on the first road that passes through the target congested section; for the first target path, based on a second road connected to a ramp of the first road, query a first alternative path that bypasses the target congested section through the second road; and perform traffic diversion on the target congested section based on the first alternative path. By using the first alternative path that can bypass the target congested section, traffic diversion on the target congested section can be achieved, thereby alleviating traffic congestion on the target congested section on the first road.

[0022] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0024] Figure 1 is a flow chart of a traffic diversion method provided according to an embodiment of the present disclosure;

[0025] Figure 2 is a schematic diagram of a congested road section provided according to an embodiment of the present disclosure;

[0026] Figure 3 is a schematic diagram of an alternative path provided according to an embodiment of the present disclosure;

[0027] Figure 4is a flow chart of a traffic diversion method provided according to another embodiment of the present disclosure;

[0028] Figure 5 is a schematic diagram of a congested road section provided according to another embodiment of the present disclosure;

[0029] Figure 6 is a flow chart of a traffic diversion method provided according to another embodiment of the present disclosure;

[0030] Figure 7 A schematic diagram of the structure of a traffic diversion device provided according to an embodiment of the present disclosure;

[0031] Figure 8 It is a block diagram of an electronic device used to implement the traffic diversion method of the disclosed embodiment. DETAILED DESCRIPTION

[0032] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.

[0033] In the technical solution of the present disclosure, the collection, storage, use, processing, transmission, provision and disclosure of user personal information are all carried out with the user's consent, comply with the relevant laws and regulations, and do not violate public order and good morals.

[0034] The following describes the traffic diversion method, device, equipment, storage medium and computer program product of the embodiments of the present disclosure with reference to the accompanying drawings.

[0035] It should be noted that the execution subject of the traffic diversion method of this embodiment is a traffic diversion device, and the traffic diversion device can be implemented by software and / or hardware and can be configured in an electronic device.

[0036] Figure 1 It is a flow chart of a traffic diversion method provided according to an embodiment of the present disclosure.

[0037] like Figure 1 As shown, the traffic diversion method includes:

[0038] Step 101: Obtain a target congested road section in a first road.

[0039] The first road may refer to a road isolated from the second road, and the first road and the second road are connected by a ramp; the first road includes a plurality of road sections divided according to ramp entrances (ramp entrances and ramp exits). For example, the first road includes an elevated road, a highway, etc., and the second road includes a ground road, etc.

[0040] There is at least one congested section in the first road, and the target congested section may refer to any section in the at least one congested section. Figure 2 As shown, Figure 2 The present embodiment provides a schematic diagram of a congested road section, in which a1, a2 and a3 are ramp entrances of a first road, b1 and b2 are ramp exits of the first road, and there is a congested road section b1→b2 in the first road, and b1→b2 is the target congested road section.

[0041] Step 102, determining a first target path on a first road passing through a target congested section.

[0042] The first target path may refer to any path on the first road that passes through the target congested section.

[0043] by Figure 2 Taking the target congested road section b1→b2 in as an example, the paths passing through b1→b2 include a1→b2 and a2→b2, then the first target path may refer to any one of the paths a1→b2 and a2→b2.

[0044] Step 103 : for the first target path, based on a second road connected to the first road ramp, query a first alternative path that bypasses the target congested road section via the second road.

[0045] The first alternative path is used to replace the first target path, and the first alternative path does not pass through the target congested road section.

[0046] like Figure 3 As shown, Figure 3 Schematic diagram of alternative paths. Taking the first target path a1→b2 (black solid line in the figure) as an example, the first alternative path is the path indicated by the gray solid line below the black solid line in the figure.

[0047] Step 104: Divert traffic to the target congested road section based on the first alternative path.

[0048] As an example, diversion guidance information can be sent to the guidance screen located upstream of the target congested section according to the first alternative path, so that vehicles passing through the first target path on the first road bypass the target congested section to achieve traffic diversion.

[0049] As another example, diversion induction information can be sent to the navigation application based on the first alternative path, so that the navigation application plans a navigation route for vehicles passing through the first target path based on the first alternative path, thereby allowing the vehicle to bypass the target congested section and achieve traffic diversion.

[0050] In the disclosed embodiment, a target congested road section with congestion in a first road is obtained; a first target path passing through the target congested road section in the first road is determined; for the first target path, based on a second road connected to a ramp of the first road, a first alternative path bypassing the target congested road section through the second road is queried; based on the first alternative path, traffic is diverted to the target congested road section. By using the first alternative path that can bypass the target congested road section, traffic diversion to the target congested road section can be achieved, thereby alleviating traffic congestion on the target congested road section on the first road.

[0051] Figure 4 It is a flow chart of a traffic diversion method provided according to another embodiment of the present disclosure.

[0052] like Figure 4 As shown, the traffic diversion method includes:

[0053] Step 401: Obtain a target congested road section in a first road.

[0054] As an example, when there is a congested section in the first road, the congested section is used as the target congested section.

[0055] As another example, when there are multiple congested sections in the first road, the last congested section passed through among the multiple congested sections is used as the target congested section according to the driving direction corresponding to the first road.

[0056] like Figure 5 As shown, Figure 5 A schematic diagram of a congested road section provided for this embodiment includes two congested road sections, a2→b1 and b1→b2. According to the driving direction of the first road, b1→b2 is the downstream section of a2→b1, that is, it first passes through a2→b1 and then passes through b1→b2. Therefore, b1→b2 is taken as the target congested road section.

[0057] According to the order of selecting congested sections from downstream to upstream, the last congested section among multiple congested sections is selected as the target congested section, which can provide more adjustment space for traffic diversion and is conducive to the redistribution of traffic flow.

[0058] It should be noted that when there are multiple congested sections in the first road, a target congested section can be selected from the multiple congested sections first, and congestion can be identified on the first road after traffic is diverted for the target congested section. The target congested section can be reselected based on the identified congested section to divert traffic for the new target congested section.

[0059] Step 402, determining a first target path on a first road passing through a target congested section.

[0060] As an example, for the target congested road section, a driving path on the first road passing through the target congested road section is determined as an associated path; and a first target path is determined from the associated paths according to the path length of the associated path.

[0061] The associated path refers to a path on the first road that passes through the target congested road section, and the number of the associated paths is one or more.

[0062] By obtaining the associated paths, we can have a more comprehensive understanding of the information of all paths passing through the target congested section, and then further screen out the key paths (first target paths) with significant diversion potential from the associated paths based on the path length, ensuring that subsequent traffic diversion is more accurate and effective.

[0063] As an example, any ramp entrance in the first road is taken as the starting point, and any ramp exit in the first road is taken as the end point to obtain a corresponding origin-destination (OD) point pair; the target ramp entrances located at both ends of the target congested road section are obtained; from the ramp entrances of the first road, a set of ramp entrances passed by the driving path corresponding to the OD point pair is obtained; in response to the target ramp entrance being included in the ramp entrance set, the driving path corresponding to the OD point pair is determined as an associated path.

[0064] Among them, the OD point pair is represented by {a i ,b j}, a i represents the i-th ramp entrance among the m ramp entrances of the first road, i∈[1,m], b j represents the j-th ramp exit among the n ramp exits of the first road, j∈[1,n].

[0065] The target ramp entrance includes two ramp entrances, and the ramp entrance may refer to a ramp entrance or a ramp exit. Taking the target congested road section b1→b2 as an example, the target ramp entrances at both ends of the target congested road section include b1 and b2.

[0066] Each OD point pair corresponds to a ramp set, and the ramp set includes the ramps that the driving path corresponding to the OD point pair passes through. Figure 5, taking the OD point pair {a1, b2} as an example, the ramp set includes a1, a2, b1 and b2.

[0067] By comparing the ramp entrances, it is determined whether the driving path corresponding to the OD point pair is an associated path. The calculation is simple and can quickly lock the associated path passing through the target congested section, shorten the path screening time, and thus improve the traffic diversion efficiency.

[0068] As a possible implementation manner, the path length of any associated path is obtained; and the path lengths are compared to take the associated path corresponding to the maximum path length as the first target path.

[0069] The longer the path length is, the larger the adjustment space for diversion is. Therefore, taking the associated path with the longest path length as the first target path can provide as much adjustment space as possible for traffic diversion.

[0070] As another possible implementation method, the estimated flow and path length of any associated path are obtained; based on the estimated flow and path length, a path score of the associated path is determined, and the path score is used to indicate the diversion priority of the associated path, wherein the larger the estimated flow and the longer the path length, the higher the path score, and the smaller the estimated flow and the shorter the path length, the lower the path score; the associated path corresponding to the maximum path score is used as the first target path.

[0071] Step 403 : for the first target path, based on a second road connected to the ramp of the first road, query a first alternative path that bypasses the target congested road section via the second road.

[0072] After the first alternative path is queried, the diversion induction information can be issued based on the first alternative path to determine the induction compliance rate. It should be noted that the induction compliance rate is used to indicate the proportion of vehicles that comply with the diversion induction information to change the path to the vehicles that receive the diversion induction information. For example, the induction compliance rate = (the number of vehicles that comply with the diversion induction information to change the path) / (the total number of vehicles that receive the diversion induction information) × 100%.

[0073] As an example, based on the second road, query candidate alternative paths that bypass the target congested road section through the second road; obtain the estimated time of arrival (ETA) corresponding to the candidate alternative paths; based on the estimated time of arrival, select a first alternative path from the candidate alternative paths. The number of candidate alternative paths is multiple.

[0074] ETA reflects the travel time of candidate alternative routes. Based on the estimated arrival time, the most smooth and efficient detour plan can be screened out from the candidate alternative routes to achieve traffic diversion while ensuring the user's travel experience.

[0075] As a possible implementation manner, a candidate alternative path corresponding to the minimum ETA value is selected as the first alternative path.

[0076] As another possible implementation manner, the ETA of the candidate replacement paths is compared with the ETA of the first target path, and the first replacement path is selected from the candidate replacement paths whose ETA is smaller than the ETA of the first target path.

[0077] It should be noted that if the ETA of each candidate alternative path is greater than the ETA of the first target path, traffic diversion may not be performed.

[0078] Step 404, obtaining the to-be-diverted flow corresponding to the target congested road section, and obtaining the estimated diverted flow corresponding to the first alternative path.

[0079] The flow to be diverted refers to the flow that needs to be diverted from the target congested road section, and the estimated diverted flow refers to the expected flow diverted from the first road to the first alternative path.

[0080] As an example, the flow to be diverted is determined according to the estimated flow and expected flow of the target congested section. For example, the flow to be diverted can be determined by the formula Δq=q-q0·α, where Δq is the flow to be diverted, q is the estimated flow of the target congested section, q0·α is the expected flow, q0 is the saturated flow of the target congested section, α is the set saturation coefficient, and the value range of α is [0,1].

[0081] The estimated flow rate of the target congested road section may be predicted based on the historical flow rate of the target congested road section, or the flow rate of the target congested road section may be detected in real time to obtain the estimated flow rate of the target congested road section.

[0082] It should be noted that if Δq>0, it is determined that traffic diversion is required for the target congested road section, and if Δq≤0, it is determined that traffic diversion is not required for the target congested road section. The flow to be diverted can be obtained at set intervals to determine whether traffic diversion is required for the target congested road section.

[0083] As an example, an induced compliance rate for traffic diversion based on a first alternative path is obtained; an estimated flow rate corresponding to a first target path is obtained; and an estimated diversion flow rate is determined based on the induced compliance rate and the estimated flow rate.

[0084] The induced compliance rate may be a default value or an actual compliance rate determined after the diversion induced information is released.

[0085] As an example, the induced compliance rate and the estimated flow corresponding to the first target path are multiplied to obtain the estimated diverted flow.

[0086] The estimated flow of the first target path may be predicted based on the historical flow of the first target path, or the flow of the first target path may be detected in real time to obtain the estimated flow of the first target path.

[0087] The induced compliance rate reflects the driver's acceptance of the diversion induced information. Based on the induced compliance rate, the estimated diversion flow can be accurately determined, and then it can be accurately determined whether it is necessary to query other alternative routes.

[0088] As an example, any ramp entrance in the first road is taken as the starting point, and any ramp exit in the first road is taken as the end point to obtain the corresponding starting point and end point OD point pairs; an OD matrix is ​​constructed based on the OD point pairs; historical flow data of each element in the OD matrix within a set historical period (such as a historical week) is obtained, and the historical flow data is smoothed to obtain a predicted OD matrix; the predicted OD matrix includes the estimated flow of the corresponding driving path of each OD point pair.

[0089] The historical traffic data corresponding to any OD point pair may be obtained by collecting statistics on the license plate data of the ramp corresponding to the OD point pair.

[0090] By way of example and not limitation, the OD matrix is ​​as follows:

[0091]

[0092] in, Represents OD point pair {a i ,b j}The estimated traffic flow of the corresponding driving path.

[0093] Step 405 : When the estimated diverted flow is not less than the flow to be diverted, traffic is diverted to the target congested road section based on the first alternative path.

[0094] Among them, the estimated diverted traffic and the traffic to be diverted are used to determine whether it is necessary to query other alternative paths; if the estimated diverted traffic and the traffic to be diverted indicate that it is not necessary to query other alternative paths, traffic diversion can continue to be performed on the target congested section based on the first alternative path.

[0095] In order to avoid congestion on the second road due to diversion, it is also possible to determine whether the estimated diverted flow is greater than the remaining carrying capacity of the target section in the second road; if the estimated diverted flow is not less than the flow to be diverted, and the estimated diverted flow is not greater than the remaining carrying capacity of the target section, traffic is diverted to the target congested section based on the first alternative path; otherwise, other alternative paths that bypass the target congested section are queried, and traffic is diverted to the target congested section based on the first alternative path and other alternative paths. The target section refers to a section included in the first alternative path and not included in the first target path.

[0096] It should be noted that the explanation of step 402 can be found in the relevant description of any embodiment of the present disclosure and will not be repeated here.

[0097] In the disclosed embodiment, a target congested section of a first road where congestion exists is obtained; a first target path passing through the target congested section of the first road is determined; for the first target path, based on a second road connected to the ramp of the first road, a first alternative path that bypasses the target congested section through the second road is queried; the to-be-diverted flow corresponding to the target congested section is obtained, and the estimated diverted flow corresponding to the first alternative path is obtained; when the estimated diverted flow is not less than the to-be-diverted flow, traffic is diverted to the target congested section based on the first alternative path. When the estimated diverted flow of the first alternative path meets or exceeds the to-be-diverted flow of the target congested section, traffic diversion is performed directly through the first alternative path, which can significantly reduce the traffic burden of the target congested section, and the diversion effect is good.

[0098] Figure 6 It is a flow chart of a traffic diversion method provided according to another embodiment of the present disclosure.

[0099] like Figure 6 As shown, the traffic diversion method includes:

[0100] Step 601: Obtain a target congested road section in a first road.

[0101] Step 602, determining a first target path on a first road passing through a target congested section.

[0102] Step 603 : for the first target path, based on a second road connected to the ramp of the first road, query a first alternative path that bypasses the target congested road section via the second road.

[0103] Step 604, obtaining the to-be-diverted flow corresponding to the target congested road section, and obtaining the estimated diverted flow corresponding to the first alternative path.

[0104] Step 605, when the estimated diverted flow is less than the to-be-diverted flow, for a second target path passing through a target congested section in the first road, a second alternative path bypassing the target congested section through the second road is queried based on the second road; wherein the second target path is different from the first target path.

[0105] Among them, the estimated diverted flow is less than the flow to be diverted, which means that the congestion of the target congested section cannot be completely alleviated based on the first alternative path alone, and other alternative paths need to be queried.

[0106] The second target path may refer to any path other than the first target path in the associated paths passing through the target congested section of the first road. Figure 3 As shown, b1→b2 is the target congested road section, the first target path is a1→b2, and the second target path may refer to a2→b2.

[0107] As an example, when the estimated diverted flow is less than the flow to be diverted, a second target path other than the first target path is selected from the associated paths passing through the target congested section of the first road based on the path length; for the second target path, a second alternative path is queried based on the second road.

[0108] As a possible implementation manner, an associated path corresponding to a maximum path length is selected from associated paths other than the first target path as the second target path.

[0109] The longer the path length is, the larger the adjustment space for diversion is. Therefore, a second target path with a larger adjustment space can be selected from associated paths other than the first target path according to the path length.

[0110] Step 606: Divert traffic on the target congested road section based on the first alternative path and the second alternative path.

[0111] Among them, when the diversion induction information is not released based on the first alternative path, the diversion induction information can be generated and released directly based on the first alternative path and the second alternative path; when the diversion induction information is already released based on the first alternative path, the diversion induction information can be updated based on the first alternative path and the second alternative path.

[0112] When the estimated diverted flow of the first alternative path does not meet or exceed the to-be-diverted flow of the target congested road section, querying alternative paths for the first target path and the second target path respectively can improve the diversion efficiency and achieve a better diversion effect.

[0113] Step 607 : When the estimated diverted flow is less than the to-be-diverted flow, a third alternative path that bypasses the target congested section via the second road is queried based on the second road for the first target path.

[0114] The first alternative path and the third alternative path are detour paths of the first target path, and the third alternative path is different from the first alternative path.

[0115] Step 608: Divert traffic on the target congested road section based on the first alternative path and the third alternative path.

[0116] Among them, when the diversion induction information is not released based on the first alternative path, the diversion induction information can be directly generated and released based on the first alternative path and the third alternative path; when the diversion induction information has been released based on the first alternative path, the diversion induction information can be updated based on the first alternative path and the third alternative path.

[0117] When the estimated diverted flow of the first alternative path does not meet or exceed the to-be-diverted flow of the target congested road section, querying multiple different alternative paths for the first target path can improve the diversion efficiency and achieve a better diversion effect.

[0118] It should be noted that, in order to avoid congestion on the alternative paths, when the estimated diverted flow is less than the flow to be diverted, the flow to be diverted may be distributed to each alternative path according to the remaining carrying flow of each alternative path.

[0119] It should be noted that the explanation of steps 601 to 604 can be found in the relevant description in any embodiment of the present disclosure and will not be repeated here.

[0120] In the disclosed embodiment, when the estimated diverted flow is less than the flow to be diverted, for the second target path passing through the target congested section in the first road, a second alternative path that bypasses the target congested section through the second road is queried based on the second road; wherein the second target path is different from the first target path; based on the first alternative path and the second alternative path, traffic is diverted to the target congested section; when the estimated diverted flow is less than the flow to be diverted, for the first target path, a third alternative path that bypasses the target congested section through the second road is queried based on the second road; and traffic is diverted to the target congested section based on the first alternative path and the third alternative path. When the estimated diverted flow of the first alternative path does not meet or exceed the flow to be diverted of the target congested section, querying the second alternative path for the second target path or querying the third alternative path that is different from the first alternative path for the first target path can improve the diversion efficiency and achieve a better diversion effect.

[0121] Figure 7 It is a structural schematic diagram of a traffic diversion device provided according to an embodiment of the present disclosure.

[0122] like Figure 7 As shown, the traffic diversion device comprises:

[0123] An acquisition module 701 is used to acquire a target congested road section in a first road;

[0124] A determination module 702, configured to determine a first target path on a first road passing through a target congested section;

[0125] A first query module 703 is used to query, for the first target path, a first alternative path that bypasses the target congested road section through the second road based on the second road connected to the first road ramp;

[0126] The first traffic diversion module 704 is used to divert traffic to the target congested road section based on the first alternative path.

[0127] As a possible implementation of the embodiment of the present disclosure, the first flow distribution module 704 is used to:

[0128] Obtaining the to-be-diverted flow corresponding to the target congested road section, and obtaining the estimated diverted flow corresponding to the first alternative path;

[0129] When the estimated diverted flow is not less than the flow to be diverted, traffic is diverted to the target congested road section based on the first alternative path.

[0130] As a possible implementation of the embodiment of the present disclosure, the device further includes:

[0131] A second query module is used to query, for a second target path passing through a target congested section on the first road, a second alternative path bypassing the target congested section through a second road based on the second road when the estimated diverted flow is less than the to-be-diverted flow; wherein the second target path is different from the first target path;

[0132] The second diversion module is used to divert traffic to the target congested road section based on the first alternative path and the second alternative path.

[0133] As a possible implementation of the embodiment of the present disclosure, the second query module is used to:

[0134] When the estimated diverted flow is less than the to-be-diverted flow, a second target path other than the first target path is selected from associated paths passing through the target congested section of the first road according to the path length;

[0135] For the second target path, a second alternative path is searched based on the second road.

[0136] As a possible implementation of the embodiment of the present disclosure, the device further includes:

[0137] A third query module is used to query, for the first target path, a third alternative path that bypasses the target congested section through the second road based on the second road when the estimated diverted flow is less than the to-be-diverted flow;

[0138] The third diversion module is used to divert traffic to the target congested road section based on the first alternative path and the third alternative path.

[0139] As a possible implementation of the embodiment of the present disclosure, the first flow distribution module 704 is used to:

[0140] Obtaining the induced compliance rate of traffic diversion based on the first alternative path;

[0141] Obtaining an estimated flow rate corresponding to the first target path;

[0142] Based on the induced compliance rate and the estimated flow rate, an estimated diversion flow rate is determined.

[0143] As a possible implementation of the embodiment of the present disclosure, the first flow distribution module 704 is used to:

[0144] The induced compliance rate and the estimated flow are multiplied to obtain the estimated diversion flow.

[0145] As a possible implementation of the embodiment of the present disclosure, the determination module 702 is used to:

[0146] For the target congested road section, determining a driving path on the first road that passes through the target congested road section as an associated path;

[0147] A first target path is determined from the associated paths according to the path lengths of the associated paths.

[0148] As a possible implementation of the embodiment of the present disclosure, the determination module 702 is used to:

[0149] Taking any ramp entrance in the first road as the starting point and any ramp exit in the first road as the end point, obtaining a corresponding starting point and end point OD point pair;

[0150] Obtain target ramp entrances located at both ends of the target congested road section;

[0151] From the ramp entrances of the first road, a set of ramp entrances passed by the driving path corresponding to the OD point pair is obtained;

[0152] In response to the target ramp being included in the ramp set, the driving path corresponding to the OD point pair is determined as an associated path.

[0153] As a possible implementation of the embodiment of the present disclosure, the determination module 702 is used to:

[0154] Get the path length of any associated path;

[0155] The path lengths are compared to select the associated path corresponding to the maximum path length as the first target path.

[0156] As a possible implementation of the embodiment of the present disclosure, the first query module 703 is used to:

[0157] Based on the second road, querying a candidate alternative path that bypasses the target congested road section via the second road;

[0158] Get the estimated arrival time corresponding to the candidate alternative paths;

[0159] A first alternative path is selected from the candidate alternative paths based on the estimated arrival time.

[0160] As a possible implementation of the embodiment of the present disclosure, the acquisition module 701 is used to:

[0161] In the case where there are multiple congested sections on the first road, the last congested section passed through among the multiple congested sections is used as the target congested section according to the driving direction corresponding to the first road.

[0162] It should be noted that the above explanation of the traffic diversion method is also applicable to the traffic diversion device of this embodiment and will not be repeated here.

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

[0164] Figure 8 A schematic block diagram of an example electronic device 800 that can be used to implement an embodiment of the present disclosure is shown. The electronic device 800 is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0165] like Figure 8As shown, the electronic device 800 includes a computing unit 801, which can perform various appropriate actions and processes according to a computer program stored in a ROM (Read-Only Memory) 802 or a computer program loaded from a storage unit 808 to a RAM (Random Access Memory) 803. In RAM 803, various programs and data required for the operation of the electronic device 800 can also be stored. The computing unit 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An I / O (Input / Output) interface 805 is also connected to the bus 804.

[0166] Multiple components in the electronic device 800 are connected to the I / O interface 805, including: an input unit 806, such as a keyboard, a mouse, etc.; an output unit 807, such as various types of displays, speakers, etc.; a storage unit 808, such as a disk, an optical disk, etc.; and a communication unit 809, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 809 allows the electronic device 800 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0167] The computing unit 801 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 801 include, but are not limited to, a CPU (Central Processing Unit), a GPU (Graphic Processing Units), various dedicated AI (Artificial Intelligence) computing chips, various computing units running machine learning model algorithms, a DSP (Digital Signal Processor), and any appropriate processor, controller, microcontroller, etc. The computing unit 801 performs the various methods and processes described above, such as the traffic diversion method. For example, in some embodiments, the traffic diversion method may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 808. In some embodiments, part or all of the computer program may be loaded and / or installed on the electronic device 800 via the ROM 802 and / or the communication unit 809. When the computer program is loaded into the RAM 803 and executed by the computing unit 801, one or more steps of the traffic diversion method described above may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to execute the traffic diversion method in any other appropriate manner (eg, by means of firmware).

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

[0169] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0170] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or any suitable combination of the foregoing. More specific examples of machine-readable storage media may include electrical connections based on one or more lines, portable computer disks, hard disks, RAM, ROM, EPROM (Electrically Programmable Read-Only-Memory) or flash memory, optical fiber, CD-ROM (Compact Disc Read-Only Memory), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0171] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: a display device (e.g., a CRT (Cathode-Ray Tube) or LCD (Liquid Crystal Display) monitor) for displaying information to the user; and a keyboard and pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types 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).

[0172] The systems and techniques described herein may 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 with a graphical user interface or a web browser through which a user can interact with implementations 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 may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: LAN (Local Area Network), WAN (Wide Area Network), the Internet, and blockchain networks.

[0173] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship between the client and the server is generated by computer programs running on the corresponding computers and having a client-server relationship with each other. The server may be a cloud server, also known as a cloud computing server or cloud host, which is a host product in the cloud computing service system to solve the defects of difficult management and weak business scalability in traditional physical hosts and VPS services ("Virtual Private Server", or "VPS" for short). The server may also be a server of a distributed system, or a server combined with a blockchain.

[0174] It should be noted that artificial intelligence is a discipline that studies how computers can simulate certain human thought processes and intelligent behaviors (such as learning, reasoning, thinking, planning, etc.), and includes both hardware-level and software-level technologies. Artificial intelligence hardware technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, and big data processing; artificial intelligence software technologies mainly include computer vision technology, speech recognition technology, natural language processing technology, as well as machine learning / deep learning, big data processing technology, knowledge graph technology, and other major directions.

[0175] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0176] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A traffic diversion method, comprising: Obtain a target congested road section where congestion exists in the first road; Determine a first target path on the first road passing through the target congested road section; For the first target path, based on a second road connected to the first road ramp, query a first alternative path that bypasses the target congested road section via the second road; Based on the first alternative path, traffic is diverted to the target congested road section.

2. The method according to claim 1, wherein: The step of performing traffic diversion on the target congested road section based on the first alternative path includes: Acquire the to-be-diverted flow corresponding to the target congested road section, and acquire the estimated diverted flow corresponding to the first alternative path; When the estimated diverted flow is not less than the to-be-diverted flow, traffic is diverted to the target congested road section based on the first alternative path.

3. The method according to claim 2, wherein: The method further comprises: When the estimated diverted flow is less than the to-be-diverted flow, for a second target path on the first road passing through the target congested section, querying a second alternative path that bypasses the target congested section through the second road based on the second road; wherein the second target path is different from the first target path; Traffic is diverted on the target congested road section based on the first alternative path and the second alternative path.

4. The method according to claim 3, wherein: When the estimated diverted flow is less than the to-be-diverted flow, for a second target path on the first road passing through the target congested section, querying a second alternative path that bypasses the target congested section through the second road based on the second road includes: When the estimated diverted flow is less than the to-be-diverted flow, selecting the second target path other than the first target path from associated paths on the first road passing through the target congested road section according to the path length; For the second target path, the second alternative path is searched based on the second road.

5. The method according to claim 2, wherein: The method further comprises: When the estimated diverted flow is less than the to-be-diverted flow, querying, for the first target path, based on the second road, a third alternative path that bypasses the target congested road section through the second road; Based on the first alternative path and the third alternative path, traffic is diverted to the target congested road section.

6. The method according to claim 2, wherein: The obtaining of the estimated diversion flow corresponding to the first alternative path includes: obtaining an induced compliance rate of traffic diversion based on the first alternative path; Obtaining an estimated flow rate corresponding to the first target path; The estimated diverted flow rate is determined based on the induced compliance rate and the estimated flow rate.

7. The method according to claim 6, wherein: The step of determining the estimated diversion flow rate based on the induced compliance rate and the estimated flow rate comprises: The induced compliance rate and the estimated flow are multiplied to obtain the estimated diverted flow.

8. The method according to claim 1, wherein: The determining a first target path on the first road passing through the target congested road section includes: For the target congested road section, determining a driving path on the first road passing through the target congested road section as an associated path; The first target path is determined from the associated path according to the path length of the associated path.

9. The method according to claim 8, wherein: The step of determining, for the target congested road section, a driving path on the first road passing through the target congested road section as an associated path includes: Taking any ramp entrance in the first road as the starting point and any ramp exit in the first road as the end point, to obtain a corresponding starting point and end point OD point pair; Acquire target ramp entrances located at both ends of the target congested road section; From the ramp entrances of the first road, obtain a set of ramp entrances passed by the driving path corresponding to the OD point pair; In response to the target ramp being included in the ramp set, the driving path corresponding to the OD point pair is determined as the associated path.

10. The method according to claim 8, wherein determining the first target path from the associated path according to the path length of the associated path comprises: Obtaining the path length of any of the associated paths; The path lengths are compared to take the associated path corresponding to the maximum path length as the first target path.

11. The method according to claim 1, wherein the querying, based on the second road connected to the first road ramp, of a first alternative path bypassing the target congested road section via the second road comprises: Based on the second road, querying a candidate alternative path that bypasses the target congested road section via the second road; Obtaining an estimated arrival time corresponding to the candidate alternative path; The first alternative path is selected from the candidate alternative paths based on the estimated arrival time.

12. The method according to claim 1, wherein obtaining a target congested road section in the first road comprises: In the case that there are multiple congested sections on the first road, the last congested section passed through among the multiple congested sections is used as the target congested section according to the driving direction corresponding to the first road.

13. A traffic diversion device, comprising: An acquisition module, used for acquiring a target congested road section in the first road; A determination module, configured to determine a first target path on the first road passing through the target congested road section; A first query module is used for querying, for the first target path, a first alternative path that bypasses the target congested road section through a second road connected to the first road ramp; The first diversion module is used to divert traffic to the target congested road section based on the first alternative path.

14. The device according to claim 13, wherein the first flow distribution module is used for: Acquire the to-be-diverted flow corresponding to the target congested road section, and acquire the estimated diverted flow corresponding to the first alternative path; When the estimated diverted flow is not less than the to-be-diverted flow, traffic is diverted to the target congested road section based on the first alternative path.

15. The device according to claim 14, further comprising: a second query module, configured to query, for a second target path passing through the target congested section on the first road, a second alternative path bypassing the target congested section through the second road based on the second road when the estimated diverted flow is less than the to-be-diverted flow; wherein the second target path is different from the first target path; The second diversion module is used to divert traffic to the target congested road section based on the first alternative path and the second alternative path.

16. The device according to claim 15, wherein the second query module is used for: When the estimated diverted flow is less than the to-be-diverted flow, selecting the second target path other than the first target path from associated paths on the first road passing through the target congested road section according to the path length; For the second target path, the second alternative path is searched based on the second road.

17. The apparatus according to claim 14, further comprising: A third query module, configured to query, for the first target path, a third alternative path that bypasses the target congested road section through the second road based on the second road when the estimated diverted flow is less than the to-be-diverted flow; The third diversion module is used to divert traffic to the target congested road section based on the first alternative path and the third alternative path.

18. The device according to claim 14, wherein the first flow distribution module is used for: obtaining an induced compliance rate of traffic diversion based on the first alternative path; Obtaining an estimated flow rate corresponding to the first target path; The estimated diverted flow rate is determined based on the induced compliance rate and the estimated flow rate.

19. The device according to claim 18, wherein the first flow distribution module is used for: The induced compliance rate and the estimated flow are multiplied to obtain the estimated diverted flow.

20. The apparatus according to claim 13, wherein the determining module is configured to: For the target congested road section, determining a driving path on the first road passing through the target congested road section as an associated path; The first target path is determined from the associated path according to the path length of the associated path.

21. The apparatus according to claim 20, wherein the determining module is configured to: Taking any ramp entrance in the first road as the starting point and any ramp exit in the first road as the end point, to obtain a corresponding starting point and end point OD point pair; Acquire target ramp entrances located at both ends of the target congested road section; From the ramp entrances of the first road, obtain a set of ramp entrances passed by the driving path corresponding to the OD point pair; In response to the target ramp being included in the ramp set, the driving path corresponding to the OD point pair is determined as the associated path.

22. The apparatus according to claim 20, wherein the determining module is configured to: Obtaining the path length of any of the associated paths; The path lengths are compared to take the associated path corresponding to the maximum path length as the first target path.

23. The apparatus according to claim 13, wherein the first query module is configured to: Based on the second road, querying a candidate alternative path that bypasses the target congested road section via the second road; Obtaining an estimated arrival time corresponding to the candidate alternative path; The first alternative path is selected from the candidate alternative paths based on the estimated arrival time.

24. The device according to claim 13, wherein the acquisition module is used for: In the case that there are multiple congested sections on the first road, the last congested section passed through among the multiple congested sections is used as the target congested section according to the driving direction corresponding to the first road.

25. An electronic device comprising: at least one processor; as well as a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed 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 perform the method according to any one of claims 1 to 12.

26. 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 12.

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

Images