Traffic control method and device, electronic equipment and storage medium

Abstract

The invention provides a traffic control method and apparatus, an electronic device and a storage medium. The method comprises the steps of calculating a first convenience coefficient between a current location of a target vehicle and each to-be-selected current limiting node of a current current limiting station adjacent to a driving direction; wherein the current place comprises a target starting point and a to-be-selected current limiting node; calculating a second convenience coefficient between each to-be-selected current-limiting node of a to-be-driven current-limiting station of the target vehicle and each to-be-selected current-limiting node of an adjacent current-limiting station in the driving direction / the target end point; and according to the first convenience coefficient and the second convenience coefficient, determining a to-be-passed current limiting node from each to-be-selected current limiting node of the current current limiting station. According to the embodiment of the invention, each current limiting node through which the target vehicle passes is determined based on a real-time dynamic adjustment mode, so that each current limiting node can be effectively used, and the transportation efficiency is improved.

Description

Technical Field

[0001] The present application relates to the technical field of traffic control, and in particular to a method, device, electronic device and storage medium for traffic control. Background Art

[0002] In certain scenarios, vehicles may need to pass through restricted flow stations to ensure safety or efficiency. For example, when loading and unloading at a port, unmanned vehicles carrying containers must pass through approach bridges and lock stations as they approach or depart from gantry cranes on the dock. These approach bridges and lock stations are known as restricted flow stations. These restricted flow stations may consist of multiple restricted flow nodes (an approach bridge station may include multiple approach bridges, and a lock station station may include multiple lock stations).

[0003] In the existing technology, the flow-limiting node that a vehicle chooses to pass through is manually pre-set. This method cannot take into account the real-time situation of each flow-limiting node, which can easily cause queues or congestion, resulting in low transportation efficiency and other problems. Summary of the Invention

[0004] In view of this, the purpose of this application is to provide a traffic control method, device, electronic device and storage medium to overcome the problems in the prior art.

[0005] In a first aspect, an embodiment of the present application provides a traffic control method for any target vehicle, wherein the target vehicle starts from a target starting point and passes through at least one flow-limiting station to reach a target end point, each of the flow-limiting stations including a plurality of selectable flow-limiting nodes; the method comprises: Calculating a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction; wherein the current location includes the target starting point and the candidate flow-limiting node; Calculating a second convenience coefficient between each candidate flow limiting node of the flow limiting station to be traveled by the target vehicle and each candidate flow limiting node of the adjacent flow limiting station in the travel direction / the target end point; A current limiting node to be passed through is determined from each of the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient.

[0006] In some technical solutions of the present application, the flow-limiting station to be traveled includes a first flow-limiting station, and the flow-limiting station adjacent to the first flow-limiting station in the travel direction is a second flow-limiting station; the first flow-limiting station includes a first target flow-limiting node, and the second flow-limiting station includes a second target flow-limiting node; The method calculates the second convenience coefficient of the first target current limiting node and the second target current limiting node in the following manner: Calculating the congestion coefficients of the first target flow-limiting node and the second target flow-limiting node based on the first processing capacity and the first current number; wherein the first processing capacity represents the relative number of vehicles that can be processed between the first target flow-limiting node and the second target flow-limiting node, and the first current number is the number of vehicles currently accommodated between the first target flow-limiting node and the second target flow-limiting node; According to the congestion coefficients of the first target current limiting node and the second target current limiting node, a second convenience coefficient of the first target current limiting node and the second target current limiting node is calculated.

[0007] In some technical solutions of the present application, the above-mentioned calculation of the congestion coefficient of the first target current-limiting node and the second target current-limiting node based on the first processing capacity and the first current quantity includes: The proportion of the first current number in the first processing capacity is used as the congestion coefficient of the first target current-limiting node and the second target current-limiting node.

[0008] In some technical solutions of the present application, the second current limiting site includes a plurality of second to-be-selected current limiting nodes, wherein the second target current limiting node is any one of the second to-be-selected current limiting nodes; The method determines the first processing capacity by: determining a reference current limiting node for the first target current limiting node from the second current limiting nodes to be selected according to a positional correspondence between the first target current limiting node and each of the second current limiting nodes to be selected; The first processing capacity is determined by taking the maximum number of vehicles that can be processed between the first target current limiting node and the reference current limiting node as the reference capacity and combining the positional relationship between the second target current limiting node and the reference current limiting node.

[0009] In some technical solutions of the present application, the first processing capacity is determined by taking the maximum number of vehicles that can be processed between the first target current-limiting node and the reference current-limiting node as the reference capacity, and combining the positional relationship between the second target current-limiting node and the reference current-limiting node, including: The first processing capacity is calculated according to a position deviation coefficient between the second target current limiting node and the reference current limiting node, a preset penalty factor, and the reference capacity.

[0010] In some technical solutions of the present application, the first current limiting site includes a first number of first candidate current limiting nodes, and the second current limiting site includes a second number of second candidate current limiting nodes. The position correspondence between the first target current limiting node and each of the second candidate current limiting nodes is determined by the following method: Numbering the first candidate current limiting nodes according to a preset numbering rule to obtain a first number of the first candidate current limiting node, and numbering the second candidate current limiting node using the numbering rule to obtain a second number of the second candidate current limiting node; If the first number is equal to the second number, the first candidate current limiting node and the second candidate current limiting node with the same number have corresponding positions; If the first number is not equal to the second number, a second number having a positional correspondence with the first number is calculated based on the first number, the first number, and the second number.

[0011] In some technical solutions of the present application, the above-mentioned determining the current limiting node to be passed from each of the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient includes: Based on a preset calculation method, a screening parameter is calculated according to the first convenience coefficient and the second convenience coefficient; Based on the size of the screening parameter, a current limiting node to be passed is determined from each of the candidate current limiting nodes of the current current limiting site.

[0012] In a second aspect, an embodiment of the present application provides a traffic control device that acts on any target vehicle, wherein the target vehicle starts from a target starting point and passes through at least one flow-limiting station to reach a target end point, each of the flow-limiting stations including a plurality of selectable flow-limiting nodes; the device includes: A first calculation module is configured to calculate a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction; wherein the current location includes the target starting point and the candidate flow-limiting node; A second calculation module is used to calculate a second convenience coefficient between each candidate flow limiting node of the flow limiting site to be traveled by the target vehicle and each candidate flow limiting node of the adjacent flow limiting site in the travel direction / the target end point; A determination module is configured to determine a to-be-passed current limiting node from among the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient.

[0013] In a third aspect, an embodiment of the present application provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned traffic control method when executing the computer program.

[0014] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the steps of the above-mentioned traffic control method are executed.

[0015] The technical solutions provided by the embodiments of the present application may have the following beneficial effects: The method of the present application includes calculating a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction for the purpose of avoiding vehicle intersection; wherein the current location includes the target starting point and the candidate flow-limiting node; calculating a second convenience coefficient between each candidate flow-limiting node of the flow-limiting station to be traveled by the target vehicle and each candidate flow-limiting node of the flow-limiting station adjacent to the driving direction / the target end point; and determining the flow-limiting node to be passed from each candidate flow-limiting node of the current flow-limiting station based on the first convenience coefficient and the second convenience coefficient.

[0016] The embodiment of the present application determines each flow-limiting node that the target vehicle passes through based on a real-time dynamic adjustment method, thereby ensuring that each flow-limiting node can be effectively used and improving transportation efficiency.

[0017] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, preferred embodiments are given below and described in detail with reference to the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the following is a brief introduction to the drawings required for use in the embodiments. It should be understood that the following drawings only show certain embodiments of the present application and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other relevant drawings can be obtained based on these drawings without creative work.

[0019] Figure 1 A flow chart of a traffic control method provided in an embodiment of the present application is shown; Figure 2 A schematic diagram showing a same starting point provided in an embodiment of the present application is shown; Figure 3 A schematic diagram of a traffic control device provided in an embodiment of the present application is shown; Figure 4 A schematic diagram of the structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0020] In order to make the purpose, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. It should be understood that the drawings in the present application only serve the purpose of illustration and description and are not used to limit the scope of protection of the present application. In addition, it should be understood that the schematic drawings are not drawn to scale. The flowcharts used in this application illustrate the operations implemented according to some embodiments of the present application. It should be understood that the operations of the flowcharts can be implemented out of sequence, and steps without logical context can be reversed or implemented simultaneously. In addition, those skilled in the art, under the guidance of the contents of this application, can add one or more other operations to the flowchart, or remove one or more operations from the flowchart.

[0021] In addition, the described embodiments are only a part of the embodiments of the present application, rather than all of the embodiments. The components of the embodiments of the present application generally described and shown in the drawings here can be arranged and designed in various configurations. Therefore, the following detailed description of the embodiments of the present application provided in the drawings is not intended to limit the scope of the claimed application, but merely represents selected embodiments of the present application. Based on the embodiments of the present application, all other embodiments obtained by those skilled in the art without making creative work are within the scope of protection of the present application.

[0022] It should be noted that the term "comprising" will be used in the embodiments of the present application to indicate the existence of the features declared thereafter, but does not exclude the addition of other features.

[0023] In certain scenarios, vehicles may need to pass through restricted flow stations to ensure safety or efficiency. For example, when loading and unloading at a port, unmanned vehicles carrying containers must pass through approach bridges and lock stations as they approach or depart from gantry cranes on the dock. These approach bridges and lock stations are known as restricted flow stations. These restricted flow stations may consist of multiple restricted flow nodes (an approach bridge station may include multiple approach bridges, and a lock station station may include multiple lock stations).

[0024] During loading and unloading operations at the port, unmanned vehicles (UDVs) carry loaded containers toward and away from the gantry cranes on the dock. For example, loading operations involve driving from the starting point to the approach bridge station, then to the lock station (for installation), and finally to the quay crane. The approach bridge and lock station are manually configured by the port operator, typically with multiple approach bridges and lock stations located in various locations. When delivering containers to the quay crane, the UDV must determine which approach bridge and lock station to proceed to before reaching the quay crane. Only after determining the approach bridge and lock station can the UDV successfully reach the quay crane.

[0025] Manually specifying approach bridges and lock stations, or hard-coding the corresponding approach bridges and lock stations for the target quay cranes in the program, pre-defined binding relationships fail to dynamically perceive real-time changes in actual conditions on site. If a specific approach bridge or lock station is overused, congestion or queues may occur at that bridge or lock station, while some approach bridges and lock stations are idle. By the time the problem is recognized and the binding relationship needs to be adjusted, queues or congestion have already occurred. Even after the binding relationship is adjusted, manual intervention is required to resolve the ongoing queues and congestion.

[0026] Based on this, embodiments of the present application provide a method, device, electronic device, and storage medium for traffic control, which are described below through embodiments.

[0027] Figure 1 A flow chart of a traffic control method provided in an embodiment of the present application is shown, which acts on any target vehicle. The target vehicle starts from a target starting point and passes through at least one flow-limiting station to reach a target destination. Each flow-limiting station includes multiple flow-limiting nodes to be selected. The method includes steps S101-S103; specifically: S101, calculating a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction; wherein the current location includes the target starting point and the candidate flow-limiting node; S102, calculating a second convenience coefficient between each candidate flow limiting node of the flow limiting station to be traveled by the target vehicle and each candidate flow limiting node of the adjacent flow limiting station in the travel direction / the target destination; S103: Determine a current limiting node to be passed from the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient.

[0028] The embodiment of the present application determines each flow-limiting node that the target vehicle passes through based on a real-time dynamic adjustment method, thereby ensuring that each flow-limiting node can be effectively used and improving transportation efficiency.

[0029] The following describes some embodiments of the present application in detail. In the absence of conflict, the following embodiments and features in the embodiments may be combined with each other.

[0030] The embodiment of the present application discloses a method for traffic control, which acts on any target vehicle. Here, the target vehicle needs to start from the target starting point and pass through at least one flow-limiting station before reaching the target end point. Each of the flow-limiting stations includes multiple flow-limiting nodes to be selected. The control of traffic in the embodiment of the present application is the process of selecting a flow-limiting node to be passed by the target vehicle from the flow-limiting nodes to be selected at each flow-limiting station. Figure 2As shown, for the scenario where an unmanned vehicle transports cargo to a ship at a port, the unmanned vehicle needs to start from the starting point, pass through the approach bridge station and the lock station station, and then reach the quay crane. The approach bridge station includes multiple approach bridges, and the lock station station includes multiple lock stations.

[0031] When selecting the flow limiting nodes to be passed through each flow limiting station for the target vehicle, the inventive concept of the embodiment of the present application is to avoid congestion at all flow limiting stations to be traveled by the target vehicle. Figure 2 In the scenario shown, when the target vehicle is in the determination area, it is considered to avoid congestion between the determination area and the approach bridge, congestion between the approach bridge and the lock station, and congestion between the lock station and the quay crane. That is to say, when the embodiment of the present application selects the current limiting node to be passed by the target vehicle from the current current limiting station, it is necessary to consider not only the congestion between the current location of the target vehicle and the current current limiting station, but also the congestion between each current limiting station to be traveled after the current location. It should be noted that the current current limiting station here is the adjacent station in the direction of travel of the target vehicle. Figure 2 As shown, when the target vehicle is in the determination area, its current flow restriction station is the approach bridge station. If the target vehicle is at any approach bridge, its current flow restriction station is the station station, not the determination area. Another point worth noting is that the target location here includes the target starting point and any candidate flow restriction node. In other words, the target location here is not based on the station, but on the node.

[0032] When considering the congestion situation, the embodiment of the present application is expressed in terms of a convenience coefficient. By calculating the first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting site adjacent to the driving direction, and the second convenience coefficient between each candidate flow-limiting node of the flow-limiting site to be traveled by the target vehicle and each candidate flow-limiting node of the flow-limiting site adjacent to the driving direction / the target end point; then, based on the first convenience coefficient and the second convenience coefficient, the flow-limiting node to be passed is determined from each of the candidate flow-limiting nodes of the current flow-limiting site. The process of calculating the first convenience coefficient and the second convenience coefficient here is the same, and the following is explained using the process of calculating the second convenience coefficient as an example.

[0033] For ease of description, in the embodiment of the present application, any station among the flow-limiting stations to be traveled is referred to as the first flow-limiting station, and the flow-limiting station adjacent to the driving direction of the first flow-limiting station is referred to as the second flow-limiting station. The first flow-limiting station includes a first number of first flow-limiting nodes to be selected, and the second flow-limiting station includes a second number of second flow-limiting nodes to be selected. Any one of the first flow-limiting nodes to be selected is used as the first target flow-limiting node, and any one of the second flow-limiting nodes to be selected is used as the second target flow-limiting node, and the second convenience coefficient of the first target flow-limiting node and the second target flow-limiting node is calculated in the following manner: according to the first processing capacity and the first current number, the congestion coefficient of the first target flow-limiting node and the second target flow-limiting node is calculated; wherein, the first processing capacity represents the relative number of vehicles that can be processed between the first target flow-limiting node and the second target flow-limiting node, and the first current number is the number of vehicles currently accommodated between the first target flow-limiting node and the second target flow-limiting node; according to the congestion coefficient of the first target flow-limiting node and the second target flow-limiting node, the second convenience coefficient of the first target flow-limiting node and the second target flow-limiting node is calculated.

[0034] To avoid path intersections, complete paths that do not intersect with other vehicles and can pass through each node are selected for the vehicle as much as possible. When calculating the congestion coefficient between the first and second target flow-limiting nodes, this embodiment of the present application uses the maximum number of vehicles that can be handled between the first and second target flow-limiting nodes and the first current number, which is the number of vehicles currently accommodated between the first and second target flow-limiting nodes. If this calculation method were used for both the first target flow-limiting node and each of the second candidate flow-limiting nodes, it would take a considerable amount of time to calculate the maximum number of vehicles that can be handled between the first target flow-limiting node and each of the second candidate flow-limiting nodes. To improve computational efficiency, this embodiment of the present application does not sequentially determine the maximum number of vehicles that can be handled between the first target flow-limiting node and each of the second candidate flow-limiting nodes. Instead, it uses the relative number of vehicles that can be handled between the first and second target flow-limiting nodes (the first processing capacity) to calculate the congestion coefficient. The first processing capacity here is calculated based on the reference capacity, which is the maximum number of vehicles that can be handled between the first target flow-limiting node and the reference flow-limiting node. The reference flow-limiting node is the second candidate flow-limiting node corresponding to the first target flow-limiting node.

[0035] After determining the reference capacity, the first processing capacity is determined based on the positional relationship between the second target current-limiting node and the reference current-limiting node. In a specific implementation, a position deviation coefficient can be calculated based on the positional relationship between the second target current-limiting node and the reference current-limiting node, and the first processing capacity can be calculated based on a preset penalty factor and the reference capacity.

[0036] After the first processing capacity is obtained, the proportion of the first current number in the first processing capacity is used as the congestion coefficient of the first target current limiting node and the second target current limiting node.

[0037] For example, the handling capacity (from lock station to quay crane) can also be expressed using distance, and the current number can be expressed using the minimum queue distance. The congestion coefficient then equals the distance (from lock station to quay crane) / the minimum queue distance. To ensure data accuracy, manual adjustments can be made to determine the handling capacity of each (from lock station to quay crane). The handling capacity of the quay crane in the same lane as the lock station is used as the reference capacity. The capacity is halved for each lane further away.

[0038] Figure 2 In the scenario shown, the capacity calculation (lock station → quay crane) according to the rules is as follows:

[0039] In an optional embodiment, when selecting a reference current limiting node, the basis for selection is a position correspondence. The position correspondence here can be determined using the numbers of the first candidate current limiting node and the second candidate current limiting node. Use the same numbering rule to number the first candidate current limiting node and the second candidate current limiting node respectively, and obtain the first number of the first candidate current limiting node and the second number of the second candidate current limiting node. For example, according to the position relationship from left to right and from top to bottom, number them in the form of 1, 2, 3, 4... If the first number is equal to the second number, the first candidate current limiting node and the second candidate current limiting node with the same number correspond to each other in position, and in specific implementation, they can also be represented by the same lane. If the first number is not equal to the second number, a second number with a position correspondence with the first number is calculated based on the first number, the first number and the second number.

[0040] like Figure 2 As shown in the figure, the rule for determining the processing capacity of (approach bridge → lock station) is: if the number of approach bridges and lock stations is different, the corresponding position relationship between the approach bridges and lock stations is determined based on the approach bridge number, the total number of approach bridges, and the number of lock stations. Specifically, the lock station number = (current approach bridge number / total number of approach bridges) * number of lock stations, rounded up. For example: the lock station number corresponding to approach bridge 1 = (1 / 9) * 5 = 1, that is, Figure 2 The middle approach bridge 1 corresponds to the lock station a. The lock station number of the approach bridge 4 is (4 / 9)*5=3, that is, Figure 2 The middle approach bridge 4 and the lock station c are located correspondingly.

[0041] If a lock station corresponds to an approach bridge, the processing capacity between the lock station and the approach bridge is used as the reference capacity to determine the processing capacity between the approach bridge and other lock stations. For example, the capacity of the line extending to both sides is halved and rounded up.

[0042] like Figure 2 In the scenario shown, the capacity calculation (approach bridge → lock station) according to the rules is as follows:

[0043] After the first convenience coefficient and the second convenience coefficient are calculated, the embodiment of the present application determines the current limiting node to be passed from each of the candidate current limiting nodes of the current limiting site according to the first convenience coefficient and the second convenience coefficient. Specifically, based on a preset calculation method, a screening parameter is calculated according to the first convenience coefficient and the second convenience coefficient; based on the size of the screening parameter, the current limiting node to be passed from each of the candidate current limiting nodes of the current limiting site is determined. For example, the first convenience coefficient and the second convenience coefficient are multiplied as the screening parameter, or the first convenience coefficient and the second convenience coefficient are weighted respectively and then added as the screening parameter, etc. Then the candidate current limiting node corresponding to the maximum screening parameter is selected as the current limiting node to be passed.

[0044] In an optional embodiment, as Figure 2 In the scenario shown, the decision process for the upper pier [approach bridge + lock station] is as follows: When a vehicle wants to enter the terminal to deliver containers, after entering the judgment area, the program is triggered to automatically determine which approach bridge + locking station it needs to take to reach the target quay crane.

[0045] The route from approach bridge to lock station to quay crane is defined as a route. Since the target quay crane of the vehicle is fixed, the capacity of the lock station corresponding to the destination quay crane can be obtained from the above two tables. For example, if it is a container delivery task to quay crane A, the lock station capacity vector is: [1, 2, 1, 0, 0].

[0046] The score of each candidate route = (1-approach bridge congestion) * (1-lock station congestion) = (1-(approach bridge number of allocated vehicles / approach bridge capacity)) * (1-(lock station number of allocated vehicles / lock station capacity)).

[0047] The candidate route with the highest score (approach bridge + lock station combination) is selected as the result and sent to the vehicle, becoming the actual path that the vehicle needs to travel.

[0048] Record the selection results, update the number of vehicles allocated to the approach bridge, and update the number of vehicles allocated to the lock station for subsequent decision-making.

[0049] When a vehicle responds to the travel of the road section, the allocation record is updated and the occupancy is released.

[0050] Figure 3A schematic diagram of the structure of a traffic control device provided in an embodiment of the present application is shown. The device acts on any target vehicle. The target vehicle starts from a target starting point and passes through at least one flow-limiting station to reach a target destination. Each flow-limiting station includes multiple flow-limiting nodes to be selected. The device includes: A first calculation module is configured to calculate a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction; wherein the current location includes the target starting point and the candidate flow-limiting node; A second calculation module is used to calculate a second convenience coefficient between each candidate flow limiting node of the flow limiting site to be traveled by the target vehicle and each candidate flow limiting node of the adjacent flow limiting site in the travel direction / the target end point; A determination module is configured to determine a to-be-passed current limiting node from among the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient.

[0051] The flow-limiting station to be traveled includes a first flow-limiting station, and the flow-limiting station adjacent to the first flow-limiting station in the travel direction is a second flow-limiting station; the first flow-limiting station includes a first target flow-limiting node, and the second flow-limiting station includes a second target flow-limiting node; The second convenience coefficient of the first target current limiting node and the second target current limiting node is calculated by: Calculating the congestion coefficients of the first target flow-limiting node and the second target flow-limiting node based on the first processing capacity and the first current number; wherein the first processing capacity represents the relative number of vehicles that can be processed between the first target flow-limiting node and the second target flow-limiting node, and the first current number is the number of vehicles currently accommodated between the first target flow-limiting node and the second target flow-limiting node; According to the congestion coefficients of the first target current limiting node and the second target current limiting node, a second convenience coefficient of the first target current limiting node and the second target current limiting node is calculated.

[0052] The calculating, according to the first processing capacity and the first current quantity, the congestion coefficients of the first target current-limiting node and the second target current-limiting node includes: The proportion of the first current number in the first processing capacity is used as the congestion coefficient of the first target current-limiting node and the second target current-limiting node.

[0053] The second current limiting site includes a plurality of second candidate current limiting nodes, wherein the second target current limiting node is any one of the second candidate current limiting nodes; The first processing capacity is determined by: determining a reference current limiting node for the first target current limiting node from the second current limiting nodes to be selected according to a positional correspondence between the first target current limiting node and each of the second current limiting nodes to be selected; The first processing capacity is determined by taking the maximum number of vehicles that can be processed between the first target current limiting node and the reference current limiting node as the reference capacity and combining the positional relationship between the second target current limiting node and the reference current limiting node.

[0054] The determining the first processing capacity by taking the maximum number of vehicles that can be processed between the first target current-limiting node and the reference current-limiting node as a reference capacity and combining the positional relationship between the second target current-limiting node and the reference current-limiting node includes: The first processing capacity is calculated according to a position deviation coefficient between the second target current limiting node and the reference current limiting node, a preset penalty factor, and the reference capacity.

[0055] The first current limiting site includes a first number of first candidate current limiting nodes, the second current limiting site includes a second number of second candidate current limiting nodes, and the position correspondence between the first target current limiting node and each of the second candidate current limiting nodes is determined in the following manner: Numbering the first candidate current limiting nodes according to a preset numbering rule to obtain a first number of the first candidate current limiting node, and numbering the second candidate current limiting node using the numbering rule to obtain a second number of the second candidate current limiting node; If the first number is equal to the second number, the first candidate current limiting node and the second candidate current limiting node with the same number have corresponding positions; If the first number is not equal to the second number, a second number having a positional correspondence with the first number is calculated based on the first number, the first number, and the second number.

[0056] The determining, according to the first convenience coefficient and the second convenience coefficient, a current limiting node to be passed from each of the candidate current limiting nodes of the current current limiting site includes: Based on a preset calculation method, a screening parameter is calculated according to the first convenience coefficient and the second convenience coefficient; Based on the size of the screening parameter, a current limiting node to be passed is determined from each of the candidate current limiting nodes of the current current limiting site.

[0057] like Figure 4As shown, an embodiment of the present application provides an electronic device for executing the traffic control method in the present application, the device including a memory, a processor, a bus, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the traffic control method when executing the computer program.

[0058] Specifically, the above-mentioned memory and processor may be general-purpose memory and processor, which are not specifically limited here. When the processor runs the computer program stored in the memory, the above-mentioned traffic control method can be executed.

[0059] Corresponding to the traffic control method in the present application, an embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the computer program is run by a processor, the steps of the above-mentioned traffic control method are executed.

[0060] Specifically, the storage medium can be a general storage medium, such as a mobile disk, a hard disk, etc. When the computer program on the storage medium is run, the above-mentioned traffic control method can be executed.

[0061] In the embodiments provided in this application, it should be understood that the disclosed systems and methods can be implemented in other ways. The system embodiments described above are merely schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some communication interface, indirect coupling or communication connection of the system or unit, which can be electrical, mechanical or other forms.

[0062] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, and may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment as needed.

[0063] In addition, each functional unit in the embodiments provided in the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.

[0064] If the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or the part of the technical solution, can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, read-only memory (ROM), random access memory (RAM), disk or optical disk, and other media that can store program code.

[0065] It should be noted that similar numbers and letters represent similar items in the following figures. Therefore, once an item is defined in one figure, it does not need to be further defined and explained in subsequent figures. In addition, the terms "first", "second", "third", etc. are only used to distinguish the description and are not to be understood as indicating or implying relative importance.

[0066] Finally, it should be noted that the above-described embodiments are only specific implementation methods of the present application, which are used to illustrate the technical solutions of the present application, rather than to limit them. The scope of protection of the present application is not limited thereto. Although the present application has been described in detail with reference to the above-described embodiments, those skilled in the art should understand that any person skilled in the art can modify or easily conceive of changes to the technical solutions described in the above-described embodiments within the technical scope disclosed in the present application, or perform equivalent replacements for some of the technical features thereof. However, these modifications, changes, or replacements do not deviate from the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application. They should all be included in the scope of protection of the present application. Therefore, the scope of protection of the present application shall be subject to the scope of protection of the claims.

Claims

1. A traffic control method, characterized in that: Acting on any target vehicle, the target vehicle starts from a target starting point and passes through at least one flow-limiting station to reach a target end point, each of the flow-limiting stations including a plurality of flow-limiting nodes to be selected; the method includes: Calculating a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction; wherein the current location includes the target starting point and the candidate flow-limiting node; Calculating a second convenience coefficient between each candidate flow limiting node of the flow limiting station to be traveled by the target vehicle and each candidate flow limiting node of the adjacent flow limiting station in the travel direction / the target end point; A current limiting node to be passed through is determined from each of the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient.

2. The method according to claim 1, characterized in that The flow-limiting station to be traveled includes a first flow-limiting station, and the flow-limiting station adjacent to the first flow-limiting station in the travel direction is a second flow-limiting station; the first flow-limiting station includes a first target flow-limiting node, and the second flow-limiting station includes a second target flow-limiting node; The method calculates the second convenience coefficient of the first target current limiting node and the second target current limiting node in the following manner: Calculating the congestion coefficients of the first target flow-limiting node and the second target flow-limiting node based on the first processing capacity and the first current number; wherein the first processing capacity represents the relative number of vehicles that can be processed between the first target flow-limiting node and the second target flow-limiting node, and the first current number is the number of vehicles currently accommodated between the first target flow-limiting node and the second target flow-limiting node; According to the congestion coefficients of the first target current limiting node and the second target current limiting node, a second convenience coefficient of the first target current limiting node and the second target current limiting node is calculated.

3. The method according to claim 2, characterized in that The calculating, according to the first processing capacity and the first current quantity, the congestion coefficients of the first target current-limiting node and the second target current-limiting node includes: The proportion of the first current number in the first processing capacity is used as the congestion coefficient of the first target current-limiting node and the second target current-limiting node.

4. The method according to claim 2, characterized in that The second current limiting site includes a plurality of second candidate current limiting nodes, wherein the second target current limiting node is any one of the second candidate current limiting nodes; The method determines the first processing capacity by: determining a reference current limiting node for the first target current limiting node from the second current limiting nodes to be selected according to a positional correspondence between the first target current limiting node and each of the second current limiting nodes to be selected; The first processing capacity is determined by taking the maximum number of vehicles that can be processed between the first target current limiting node and the reference current limiting node as the reference capacity and combining the positional relationship between the second target current limiting node and the reference current limiting node.

5. The method according to claim 4, characterized in that The determining the first processing capacity by taking the maximum number of vehicles that can be processed between the first target current-limiting node and the reference current-limiting node as a reference capacity and combining the positional relationship between the second target current-limiting node and the reference current-limiting node includes: The first processing capacity is calculated according to a position deviation coefficient between the second target current limiting node and the reference current limiting node, a preset penalty factor, and the reference capacity.

6. The method according to claim 4, characterized in that The first current limiting site includes a first number of first candidate current limiting nodes, the second current limiting site includes a second number of second candidate current limiting nodes, and the position correspondence between the first target current limiting node and each of the second candidate current limiting nodes is determined in the following manner: Numbering the first candidate current limiting nodes according to a preset numbering rule to obtain a first number of the first candidate current limiting node, and numbering the second candidate current limiting node using the numbering rule to obtain a second number of the second candidate current limiting node; If the first number is equal to the second number, the first candidate current limiting node and the second candidate current limiting node with the same number have corresponding positions; If the first number is not equal to the second number, a second number having a positional correspondence with the first number is calculated based on the first number, the first number, and the second number.

7. The method according to claim 1, characterized in that The determining, according to the first convenience coefficient and the second convenience coefficient, a current limiting node to be passed from each of the candidate current limiting nodes of the current current limiting site includes: Based on a preset calculation method, a screening parameter is calculated according to the first convenience coefficient and the second convenience coefficient; Based on the size of the screening parameter, a current limiting node to be passed is determined from each of the candidate current limiting nodes of the current current limiting site.

8. A traffic control device, characterized in that: Acting on any target vehicle, the target vehicle starts from a target starting point and passes through at least one flow-limiting station to reach a target end point, each of the flow-limiting stations including a plurality of flow-limiting nodes to be selected; the device includes: A first calculation module is configured to calculate a first convenience coefficient between the current location of the target vehicle and each candidate flow-limiting node of the current flow-limiting station adjacent to the driving direction; wherein the current location includes the target starting point and the candidate flow-limiting node; A second calculation module is used to calculate a second convenience coefficient between each candidate flow limiting node of the flow limiting site to be traveled by the target vehicle and each candidate flow limiting node of the adjacent flow limiting site in the travel direction / the target end point; A determination module is configured to determine a to-be-passed current limiting node from among the candidate current limiting nodes of the current current limiting site according to the first convenience coefficient and the second convenience coefficient.

9. An electronic device, characterized in that: include: A processor, a memory and a bus, wherein the memory stores machine-readable instructions executable by the processor. When the electronic device is running, the processor and the memory communicate via the bus. When the machine-readable instructions are executed by the processor, the steps of the traffic control method as described in any one of claims 1 to 7 are performed.

10. A computer-readable storage medium, characterized in that The computer-readable storage medium stores a computer program, which, when executed by a processor, executes the steps of the traffic control method according to any one of claims 1 to 7.

Images