A signal light coordination method, computing device and storage medium
By obtaining the weight factor of the target path and optimizing the signal light configuration plan, the problem that the existing technology is difficult to meet the special traffic management needs is solved, and the traffic efficiency of key road paths and the use efficiency of traffic management resources are improved.
Patent Information
- Application Number
- CN201910464668.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2019-05-30
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2039-05-30
AI Technical Summary
Existing signal light control is difficult to meet the special traffic management needs such as large-scale events, large traffic flows and key intersection guarantees, resulting in waste of traffic management resources and inefficient traffic efficiency.
By obtaining the weight factor of the target path, the configuration can continuously pass through multiple intersections and optimize the configuration scheme of the signal light to ensure smooth key paths and global optimization decisions.
It improves the traffic efficiency of key road paths, reduces vehicle congestion, optimizes the use of traffic management resources, and meets special traffic management needs.
Smart Images

Figure CN112017453B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of traffic control, and in particular to a signal light coordination method, a computing device and a storage medium. Background Art
[0002] With the large-scale development of the highway network and the rapid increase in the rate of road traffic accidents, trunk roads across the country have begun to use traffic lights to control the passage of vehicles at some major intersections. At the same time, traffic lights can also alleviate urban traffic congestion and improve traffic efficiency. However, with the substantial increase in the number of vehicles, road congestion has intensified, making it impossible to solve the congestion problem simply by setting traffic lights for a single intersection. Especially on some roads with special traffic management needs, such as large-scale events, large traffic flows, and key intersection security needs, the control of traffic lights is often difficult to meet management needs. A large number of traffic management personnel are still required to carry out traffic management on the road, resulting in a large amount of traffic management resources being consumed and traffic management costs being increased. Summary of the invention
[0003] In view of the above problems, the present invention proposes a traffic light coordination method, a computing device and a storage medium, the main purpose of which is to coordinate the traffic light configuration scheme in key road paths to improve the traffic efficiency of vehicles in key road paths.
[0004] In order to achieve the above object, the present invention mainly provides the following technical solutions:
[0005] In one aspect, the present invention provides a signal light coordination method, which specifically includes:
[0006] Obtaining a weight factor of at least one target path;
[0007] Using the weight factor, configuring a first duration for continuously passing through a plurality of intersections;
[0008] According to the configured first duration, a configuration scheme of the traffic lights at the plurality of intersections is determined.
[0009] In another aspect, the present invention provides another signal light coordination method, which specifically includes:
[0010] Obtaining a weight factor of at least one target path;
[0011] Using the weight factor, configuring a second duration for continuously passing through two adjacent intersections, the adjacent intersections corresponding to at least one target path;
[0012] According to the configured second duration, a configuration scheme of the traffic lights at the two adjacent intersections is determined.
[0013] In another aspect, the present invention provides a method for configuring a traffic facility, the method comprising:
[0014] Obtaining a weight factor of at least one target path;
[0015] Using the weight factor, configuring a first duration for continuously passing through a plurality of intersections, the plurality of intersections corresponding to at least one target path;
[0016] According to the configured first duration, a configuration scheme of the traffic facilities at the plurality of intersections is determined.
[0017] In another aspect, the present invention provides a computing device, comprising a memory and a processor;
[0018] The memory is used to store computer programs;
[0019] The processor is used to execute the computer program to implement the steps in the above-mentioned signal light coordination method.
[0020] On the other hand, the present invention provides a computer-readable storage medium storing a computer program. When the computer program is executed by one or more processors, the one or more processors are caused to implement the steps in the above-mentioned signal light coordination method.
[0021] By means of the above technical solution, the present invention provides a traffic light coordination method, computing device and storage medium, which can determine the importance of different target paths to the smooth flow guarantee demand by obtaining the weight factor of the target path, and configure a first duration for continuously passing through multiple intersections for at least one target path according to the weight factor, and then determine the configuration scheme of each traffic light in the target path according to the first duration. Since the first duration is the time for continuously passing through multiple intersections, by configuring the first duration, the target path with a higher weight can obtain more continuous passing time to ensure the smooth flow of the target path. At the same time, since the configuration scheme can make global optimization decisions for multiple target paths, the embodiment of the present invention also focuses on optimizing the target paths with high weights on the premise of ensuring that vehicles in multiple target paths can pass quickly, so that vehicles can pass through the target path quickly and smoothly, thereby improving the traffic efficiency of key target paths.
[0022] The above description is only an overview of the technical solution of the present invention. In order to more clearly understand the technical means of the present invention, it can be implemented according to the contents of the specification. In order to make the above and other purposes, features and advantages of the present invention more obvious and easy to understand, the specific implementation methods of the present invention are listed below. BRIEF DESCRIPTION OF THE DRAWINGS
[0023] Various other advantages and benefits will become apparent to those of ordinary skill in the art by reading the detailed description of the preferred embodiments below. The accompanying drawings are only for the purpose of illustrating the preferred embodiments and are not to be considered as limiting the present invention. Moreover, the same reference symbols are used throughout the accompanying drawings to represent the same components. In the accompanying drawings:
[0024] Figure 1 A schematic diagram of the structure of a coordination system of a signal light according to an exemplary embodiment of the present invention;
[0025] Figure 2 A schematic flow chart of a signal light coordination method according to an exemplary embodiment of the present invention;
[0026] Figure 3 A schematic flow chart of a signal light coordination method provided by another exemplary embodiment of the present invention;
[0027] Figure 4A A schematic diagram of a vehicle driving road according to an exemplary embodiment of the present invention;
[0028] Figure 4B A schematic diagram of a vehicle driving road according to an exemplary embodiment of the present invention;
[0029] Figure 5 A schematic diagram of the structure of a coordination device for a signal light provided by an exemplary embodiment of the present invention;
[0030] Figure 6 A schematic structural diagram of a signal light coordination device provided by another exemplary embodiment of the present invention;
[0031] Figure 7 A schematic structural diagram of a signal light coordination device provided by another exemplary embodiment of the present invention;
[0032] Figure 8 A schematic diagram of the structure of a computing device provided for an exemplary embodiment of the present invention. DETAILED DESCRIPTION
[0033] The exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. Although the exemplary embodiments of the present invention are shown in the accompanying drawings, it should be understood that the present invention can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided in order to enable a more thorough understanding of the present invention and to enable the scope of the present invention to be fully communicated to those skilled in the art.
[0034] In industry practice, due to the limitations of perception, understanding of traffic patterns, and the level of artificial intelligence optimization application, green wave coordination is still at the level of main road traffic guarantee and one-way or two-way linear green waves. In addition, when conducting green wave coordination, practical factors are not taken into consideration.
[0035] In industry practice, the main consideration is the traffic efficiency of the main roads, and the green wave bandwidth of the entire path is determined to control the traffic lights. However, the traffic direction of the main roads is usually derived based on manual experience, and the structure is too simple. Especially when facing some special management needs in actual applications, such as large-scale events, large traffic flows, road maintenance, or key intersection security, etc., the traffic capacity of key roads needs to be guaranteed. In the process of implementing traffic light management, in order to ensure the traffic capacity of key roads, the traffic capacity in other directions cannot be taken into account, resulting in congestion in other directions.
[0036] The embodiment of the present application provides a coordination method for traffic lights. By comprehensively optimizing parameters such as the traffic light cycle, green-to-signal ratio, and phase difference between traffic lights according to the demand for traffic security level of the road path, on the basis of ensuring the global road capacity, the traffic capacity of roads with high traffic security requirements is improved, and the overall optimization of the traffic light timing plan at road intersections is achieved, taking into account the road capacity of key directions and other directions.
[0037] In an embodiment of the present invention, a weight factor of at least one target path is obtained, and the weight factor is used to measure the importance of ensuring the smooth flow of the target path; the first duration that can continuously pass through multiple intersections in the target path is configured using the weight factor; and the configuration scheme of each signal light in the target path is determined according to the configured first duration. Since the first duration is the time that can continuously pass through multiple intersections, by optimizing the first duration, the optimization effect of the final optimization scheme is better, and the management needs of key paths are taken into account while making global optimization decisions, which ensures that vehicles in key paths can quickly pass through the target path with greater efficiency, thereby improving the traffic efficiency in the area.
[0038] The technical solutions provided by various embodiments of the present invention are described in detail below in conjunction with the accompanying drawings.
[0039] Figure 1 The following is a schematic diagram of a signal light coordination system provided by an exemplary embodiment of the present invention. Figure 1 As shown, the coordination system 100 may include: a computing device 101 , a control device 102 , and a signal light 103 .
[0040] Among them, the computing device 101 can be any computing device with a certain computing capability. The basic structure of the computing device 101 can include: at least one processor. The number of processors depends on the configuration and type of the computing device 101. The computing device 101 can also include a memory, which can be volatile, such as RAM, or non-volatile, such as read-only memory (ROM), flash memory, etc., or can also include both types. The computing device 101 can refer to a device that provides computing processing services in a network virtual environment, usually referring to a server that uses the network to coordinate traffic lights. In physical implementation, the computing device 101 can be any device that can provide computing services, respond to service requests, and perform processing, such as a conventional server, a cloud server, a cloud host, a virtual center, etc. The composition of the computing device 101 mainly includes a processor, a hard disk, a memory, a system bus, etc., which is similar to a general computer architecture.
[0041] The control device 102 may be any computing device with a certain computing capability. The basic structure of the control device 102 may include: at least one processor. The number of processors depends on the configuration and type of the control device 102. The control device 102 may also include a memory, which may be volatile, such as RAM, or non-volatile, such as read-only memory (ROM), flash memory, etc., or may include both types. The control device 102 may refer to a traffic signal, and the control device 102 may be composed of a main LCD display, a CPU board, a control board, a light group driver board with optical coupling isolation, a switching power supply, a button board, etc., a total of 6 functional module plug-in boards, as well as a distribution board, a terminal block, etc.
[0042] The signal light 103 refers to a signal light used to direct traffic operations, and may include a controller, an LED display component, and a power supply, etc. The LED display component is generally composed of a red light, a green light, and a yellow light. A red light indicates that passage is prohibited, a green light indicates that passage is permitted, and a yellow light indicates a warning. The controller may be connected to the control device 102 to receive a signal sent by the control device 102. The controller may be a single chip microcomputer.
[0043] In an example of the present invention, the computing device 101 obtains a weight factor of at least one target path, where the weight factor is used to measure the importance of ensuring smooth flow of the target path; uses the weight factor to configure a first duration in which the target path can continuously pass through multiple intersections; and determines a configuration scheme for each traffic light in the target path based on the configured first duration.
[0044] In some examples, the computing device 101 sends the optimization parameters in the optimization configuration scheme, such as control parameters, which may include the common period of the signal light, the absolute phase difference of the phase, and the green-to-signal ratio of the phase, to the control device 102. After receiving these control parameters, the control device 102 sends a control signal to the signal light 103 according to these control parameters. After receiving the control signal, the signal light 103 controls the display of the signal light according to the control signal.
[0045] It should be noted that the embodiments of the present invention can be applied to the coordination of traffic lights on roads. After determining the optimization plan, the computing device 101 sends the control parameters in the optimization plan to the control device 102 that controls the traffic lights on each road. The control device 102 sends a control signal to the corresponding traffic light based on the received control parameters, so that after receiving the control signal, the traffic light changes the LED light of the traffic light according to the control signal, so that vehicles on the road can pass through each road at a faster speed, thereby reducing vehicle congestion on the road.
[0046] In the above embodiment, the computing device 101 can be connected to the control device 102 through a network, and the signal light 103 can be connected to the control device 102 through a network, and the network connection can be a wireless or wired network connection. If the computing device 101 and the control device 102 are connected in communication, the network standard of the mobile network can be any one of 2G (GSM), 2.5G (GPRS), 3G (WCDMA, TD-SCDMA, CDMA2000, UTMS), 4G (LTE), 4G+ (LTE+), WiMax, etc. If the signal light 103 can be connected in communication with the control device 102, the network standard of the mobile network can be any one of 2G (GSM), 2.5G (GPRS), 3G (WCDMA, TD-SCDMA, CDMA2000, UTMS), 4G (LTE), 4G+ (LTE+), WiMax, etc.
[0047] The following is a detailed description of the process of the computing device 101 coordinating the traffic lights in conjunction with the method embodiment.
[0048] Figure 2 The flowchart of the signal light coordination method of an exemplary embodiment of the present invention is shown in FIG. The method 200 provided in the embodiment of the present application is executed by a computing device, for example, a server; the method 200 includes the following steps:
[0049] 201: Obtain a weight factor of at least one target path.
[0050] 202: Using the weight factor, configure a first duration for continuously passing through multiple intersections in the target path.
[0051] 203: Determine a configuration scheme for each traffic light in the target path according to the configured first duration.
[0052] The following is a detailed description of the above steps:
[0053] Step 201: Obtain a weight factor of at least one target path.
[0054] The target path, also called the main traffic path, refers to the road to be configured in an area.
[0055] The weight factor is used to measure the importance of the target path. In the present embodiment, it is particularly used to measure the importance of ensuring the smooth flow of the target path. The weight factor is a weight value set for different road paths according to the traffic management needs in actual applications. It is generally a manually set value. The value of the weight factor is greater than or equal to 1. When the weight factor is 1, it indicates that the target path is a non-key path, and when the weight factor is greater than 1, it indicates that the target path is a key path. In addition, the higher the importance of the target path, the larger the value of the weight factor.
[0056] Step 202: Using the weight factor, configure a first duration for continuously passing through multiple intersections.
[0057] Wherein, a plurality of intersections correspond to at least one target path. Specifically, when configuring the first duration for continuously passing through a plurality of intersections, it may be configured to continuously pass through a plurality of intersections in a target path; it may also be configured for a plurality of groups of intersections, to continuously pass through a plurality of intersections in each group of intersections, wherein each group of intersections in the plurality of groups of intersections is a plurality of intersections in a target path; it may also be configured for a plurality of target paths, to continuously pass through a plurality of intersections, wherein the plurality of intersections are intersections in a plurality of target paths. That is to say, in the present invention, a plurality of intersections may be in a path or in a plurality of paths.
[0058] Among them, the first duration, which can also be called multi-step green wave bandwidth or N-step green wave bandwidth, the green wave bandwidth of multiple intersections refers to the time difference between the earliest time when a vehicle is allowed to pass through each intersection after being allowed to pass from the first intersection, and the latest time when a vehicle is allowed to pass through each intersection after being allowed to pass from the first intersection, and the latest time when the vehicle is allowed to pass through each intersection after being allowed to pass from the first intersection, and the latest time when the vehicle arrives at the last intersection among the multiple intersections. It should be understood that in this step, it is for multiple intersections in each target path. For example, when there are 10 intersections in the target path, there are 9 groups of multiple intersections, such as a one-step green wave bandwidth from the first intersection to the second intersection, a two-step green wave bandwidth from the first intersection to the third intersection, a three-step green wave bandwidth from the first intersection to the fourth intersection, and up to a nine-step green wave bandwidth from the first intersection to the tenth intersection. Figure 4B A vehicle driving road diagram 400B is shown, in which multiple intersections 404 (three intersections framed by dotted lines) existing in a target path 401 are shown. The arrows shown in the target path 401 in the diagram 400B indicate the driving direction of the vehicle on the target path 401. Among the multiple intersections in the diagram 400B, the rightmost intersection is the first intersection, and the leftmost intersection is the last intersection.
[0059] In some examples, the method 200 further includes: obtaining a plurality of traffic paths in a preset area; and obtaining at least one target path from the plurality of traffic paths according to the traffic flow in the plurality of traffic paths.
[0060] The preset area may refer to a city, a district, a section consisting of several roads, etc. The preset area should include multiple traffic paths, and a traffic path to be configured, ie, a target path, is selected from these traffic paths.
[0061] For example, when it is necessary to obtain the target path of the XX area, the vehicles traveling in the XX area can be determined from the driving data uploaded by the vehicle-mounted GPS (Global Positioning System) installed in the moving vehicles or the GPS device, and the corresponding driving data can be obtained from these vehicles. Based on these driving data, the traffic paths with higher frequency of use at different time points in the XX area can be determined, and these traffic paths with higher frequency of use can be used as the target paths.
[0062] In some instances, the method 200 further includes: establishing a first model for configuring a first duration for continuously passing through a plurality of intersections; configuring the first duration for continuously passing through a plurality of intersections includes: configuring the first duration for continuously passing through a plurality of intersections using the first model.
[0063] In some examples, the method 200 further includes: establishing a second model for at least one target path, the second model being used to configure a second duration for continuously passing through two adjacent intersections; and configuring the first duration based on the configured second duration and the first model.
[0064] The second duration, which can also be called the one-step green wave bandwidth, represents the green wave bandwidth of two adjacent intersections, and refers to the time difference between the earliest time when a vehicle is allowed to pass from the first intersection (under the green light condition) to the second intersection and the latest time when a vehicle is allowed to pass from the first intersection to the second intersection. It should be understood that in this step, it is for any two adjacent intersections in each target path. For example, when there are 10 intersections in the target path, there are 9 groups of adjacent intersections, i.e., 9 one-step green wave bandwidths.
[0065] In some examples, establishing the second model includes: maximizing the second duration as a second configuration target of the second model; and establishing the second model of at least one target path according to a weight factor of the at least one target path, a traffic flow, and the second configuration target.
[0066] Among them, traffic flow refers to the number of vehicles in the traffic path.
[0067] For example, according to the above, the second model is established as shown in the following formula 1):
[0068] max(∑ rt γ*f rt *∑ i,pinrt / lasthop b i,p→j,q ) 1)
[0069] Among them, γ represents the weight factor of the target path, b i,p→j,q Refers to the second configuration target, that is, the one-step green wave bandwidth, which here refers to the second duration of two adjacent intersections. i and j are both intersections, i can be the first intersection, j is the next intersection after i, that is, the second intersection, p is the phase of intersection i, and q is the phase of intersection j. rt is at least one target path, f rt is the traffic flow of a target path. i,pinrt / lasthop is i, pinrt / last hop represents i, p is any intersection except the last intersection in the target path and the phase of any intersection. Taking the target path with 10 intersections as an example, i,pinrt / lasthop is the first intersection and the phase of the first intersection, the second intersection and the phase of the second intersection, ... the ninth intersection and the phase of the ninth intersection.
[0070] Among them, phase refers to a group of traffic flows that obtain the right of way at the same time during a traffic light cycle. The phase is determined by calculating the traffic flow at each intersection. Therefore, the phase of each intersection is different. For example, the time and process used to complete the straight and left turns in both directions of an intersection is called the phase.
[0071] It should be noted that for the target path, the target path can be a straight path, that is, multiple intersections form a straight path, or a non-straight path. Taking a straight path as an example, a vehicle traveling on the straight path needs to travel straight at each intersection. At this time, the phase of each intersection is determined, that is, when the target path is determined, the phase of each intersection in the target path is also determined. Figure 4AAs shown, the target path 401 in Figure 400A is a straight path, and according to the arrow displayed in each target path 401, the driving direction of the vehicle on the target path 401 is indicated. Among the two adjacent intersections 402 in Figure 400A, the right intersection is the first intersection, and the left intersection is the second intersection.
[0072] In some examples, the method 200 further includes: establishing a second model of the at least one target path based on a weight factor of the at least one target path, a traffic flow, a second configuration target, and an identification parameter corresponding to whether two adjacent intersections can be passed continuously.
[0073] The identification parameter corresponding to whether two adjacent intersections can be passed continuously can also be referred to as whether there is a green wave at the two adjacent intersections. When there is a green wave, the identification parameter can be 1, and when there is no green wave, the identification parameter can be 0. The green wave refers to the situation that when a vehicle is allowed to pass at an intersection (i.e., the green light is on), the vehicle still has a green light when it arrives at the next intersection. It should be understood that for a one-step green wave, when there are two adjacent intersections, the vehicle still has a green light when it arrives at the next intersection.
[0074] For example, according to the above, the second model is established as shown in the following formula 2):
[0075] max(∑ rt γ*f rt *∑ i,pinrt / lasthop (b i,p→j,q +α*δ i,p→j,q )) 2)
[0076] Among them, α is a preset coefficient, which can be a weight coefficient and is between 0 and 1; δ i,p→j,q is an identification parameter, indicating whether there is a green wave at adjacent intersections i and j. At the same time, the corresponding intersections have corresponding phases p and q.
[0077] It should be noted that when the second model takes into account the one-step green wave parameters, the one-step green wave bandwidth can be further optimized, so that the optimization scheme (also called configuration scheme) corresponding to the one-step green wave bandwidth is more conducive to efficient vehicle traffic.
[0078] In some instances, the method 200 further includes: establishing a second model of at least one target path based on a weight factor of the at least one target path, traffic flow, a second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, and corresponding phases of the two adjacent intersections.
[0079] Among them, for the target path, the corresponding phases of two adjacent intersections are determined for each intersection. Taking a straight path as an example, the corresponding phases of two adjacent intersections can be two straight phases. The straight phase can also include the right-bound traffic flow of the intersection.
[0080] For example, according to the above, the second model is established as shown in the following formula 3):
[0081] max((∑ rt γ*f rt *∑ i,pinrt / lasthop (b i,p→j,q +α*δ i,p→j,q ))-β*∑ c o c ) 3)
[0082] Wherein, β is a preset coefficient, which can be a weight coefficient, and is between 0 and 1. The weight represented by β is used to measure the importance of the phase difference between adjacent intersections; c is an intersection, which has the same meaning as i and j. The intersection c can include intersections i and j; o c is the absolute phase difference of the intersection, that is, the difference between the phase determined at each intersection and the standard phase, and the standard phase can be set manually and can be set to 0s. When the standard phase is 0 and the phase of an intersection is 30s, the absolute phase difference of the phase is 30-0=30s.
[0083] It should be noted that, when the second model takes the absolute phase difference into consideration, redundant one-step green wave bandwidths can be eliminated from multiple solved one-step green wave bandwidths, so that the optimization scheme corresponding to the obtained one-step green wave bandwidth is more conducive to efficient vehicle traffic.
[0084] In some instances, the method 200 further includes: establishing a second model of at least one target path based on a weight factor of at least one target path, traffic flow, the second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, corresponding phases of two adjacent intersections, and travel time of the intersection phase entering the target path.
[0085] Among them, the travel time of the intersection phase entering the target path refers to the travel time of the intersection phase corresponding to the vehicle entering the target path between two adjacent intersections. The length of the travel time will affect the traffic flow in the target path. Therefore, the second model established by adding the travel time can optimize the traffic flow entering the target path from other directions of the intersection. By controlling the increase in the traffic flow in the target path, the purpose of ensuring smooth traffic on the target path can be achieved. Generally speaking, the shorter the travel time, the fewer vehicles entering, and the lower the traffic flow on the target path.
[0086] For example, according to the above, the second model is established as shown in the following formula 4):
[0087] max((∑ rt γ*f rt *∑ i,pinrt / lasthop (b i,p→j,q +α*δ i,p→j,q ))-β*∑ c o c -ε*∑ (i,p) t i,p ) 4)
[0088] Among them, ε is a preset coefficient, which can be a weight coefficient, and is between 0 and 1. The weight represented by ε is used to measure the importance of the travel time of the intersection phase entering the target path; t i,p It is the travel time of the intersection phase entering the target path.
[0089] It should be noted that when the second model takes into account the travel time of the intersection phase entering the target path, the traffic flow in the target path can be reduced by reducing the travel time, thereby ensuring that vehicles traveling in the target path can travel more smoothly.
[0090] In some instances, the method 200 further includes: establishing a second model of at least one target path based on a weight factor of at least one target path, traffic flow, the second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, corresponding phases of two adjacent intersections, travel time of the intersection phase entering the target path, and travel time of the intersection phase exiting the target path.
[0091] Among them, the travel time of the intersection phase of the target path refers to the travel time of the intersection phase corresponding to the vehicle exiting the target path at two adjacent intersections. The length of the travel time will also affect the traffic flow in the target path. Therefore, the second model established by adding the travel time can optimize the traffic flow of the target path in other directions of the intersection. By controlling the reduction of the traffic flow in the target path, the purpose of ensuring smooth traffic on the target path can be achieved. Generally speaking, the longer the travel time, the more vehicles will exit, and the lower the traffic flow of the target path will be.
[0092] For example, according to the above, the second model is established as shown in the following formula 4):
[0093] max((∑ rt γ*f rt *∑ i,pinrt / lasthop (b i,p→j,q +α*δ i,p→j,q ))-β*∑ c o c -ε*∑(i,p) t i,p +∈*∑ (j,q) t j,q ) 5)
[0094] Among them, ∈ is a preset coefficient, which can be a weight coefficient, and is between 0 and 1. Similar to ε, the weight represented by ∈ is used to measure the importance of the travel time of the intersection phase of the target path; t j,q It is the travel time of the intersection phase entering the target path.
[0095] It should be noted that when the second model takes into account the travel time of the intersection phase of exiting the target path, the traffic flow in the target path can be reduced by increasing the travel time, thereby ensuring that vehicles traveling in the target path can travel more smoothly.
[0096] In some examples, the method 200 further includes: determining the signal light timing parameters of each intersection in the plurality of traffic flow paths; and establishing the constraint equations of the second model according to the signal light timing parameters.
[0097] The constraint equation refers to the equation used to define the second configuration target, and can also be used to define the equation of the decision variable. The decision variable can also be used to define the second configuration target (also called the optimization target). For example, the absolute phase difference o of the intersection c And identification parameters, etc.
[0098] The signal light time parameters may include, but are not limited to: the common cycle of the signal light, the green light time of each phase of the signal light (also referred to as the green light time of each phase of the intersection or the green-to-signal ratio). The signal light time parameters may be decision variables.
[0099] For example, according to the foregoing, the constraint equations may include the following equations 6)-9):
[0100] π MIN ≤π≤π MAX 6)
[0101] ∑ s t c,s =π 7)
[0102]
[0103] -π≤o i -o j ≤π 9)
[0104] Among them, π is the common cycle of the traffic light, that is, the common cycle of each phase of an intersection; π MIN is the minimum value of the common period; π MAX is the maximum value of the common cycle; t c,sis the green-to-signal ratio of each phase of the intersection, where s is the phase of the intersection and c is the intersection; is the minimum value of green-to-letter ratio; is the maximum value of green-to-letter ratio; o i -o j is the relative phase difference, which varies within a positive or negative common period.
[0105] It should be noted that, for a target path, the common cycle of the traffic lights at each intersection is the same. At the same time, for each intersection, the sum of the green-to-signal ratios of each phase of the intersection is the common cycle.
[0106] In some instances, the constraint equations of the second model are established, including: determining the second earliest time and the second latest time for continuously passing through two adjacent intersections based on the phase duration of two adjacent intersections and the corresponding phase difference of the two adjacent intersections; determining the second passage start time and the second passage end time of the later intersection based on the phase duration of the two adjacent intersections and the phase of the later intersection among the two adjacent intersections; and establishing the constraint equation of the second duration based on the second earliest time, the second latest time, the second passage start time and the second passage end time.
[0107] The phase duration refers to the time difference between the start time and the end time of a phase at an intersection.
[0108] The corresponding phase difference between two adjacent intersections refers to the relative phase difference of the phases determined by the two intersections, that is, the difference between the absolute phase differences of the two phases. For example, the absolute phase difference of the p phase at intersection i is 30s, and the absolute phase difference of the q phase at intersection j is 40s, then the relative phase difference between the p phase at intersection i and the q phase at intersection j is 40-30=10s.
[0109] The second earliest time, which may also be referred to as the earliest arrival time of two adjacent intersections, refers to the earliest time a vehicle arrives at the next intersection after being allowed to pass through the first intersection.
[0110] It can be determined by the following formula 10):
[0111]
[0112] in, is the second earliest time; m is the phase sequence position corresponding to the phase of p, then is the time that has passed when reaching phase p, that is, the sum of the green light times of each phase before phase p. For example, phase p is the third phase of the intersection, the green light time of the first phase of the intersection is 30s, and the green light time of the second phase of the intersection is 40s, then trv r It is the travel time of a vehicle between two adjacent intersections.
[0113] The second latest time, which may also be referred to as the latest arrival time between two adjacent intersections, refers to the latest arrival time of a vehicle at the next intersection after being allowed to pass through the first intersection.
[0114] It can be determined by the following formula 11):
[0115]
[0116] in, The second latest time.
[0117] The second passage start time, also known as the starting green light time for the traffic direction at the intersection, refers to the starting time when a vehicle is allowed to pass through the first intersection and can pass through the next intersection smoothly (that is, when the vehicle arrives at the intersection, there is no vehicle waiting to pass in front).
[0118] It can be determined by the following formula 11):
[0119]
[0120]
[0121] in, is the starting time of the second pass; t i,p is the green signal ratio of phase p at intersection i, and t c,s Same meaning, t c,s Included i,p ; It is the time to clear the waiting vehicles at the intersection after the vehicles at the intersection are allowed to pass. For example, when the vehicle arrives at the second intersection, the straight phase of the second intersection is allowed to pass, that is, after the green light is communicated, at this time, there are already 5 vehicles waiting for the green light at this phase at the intersection, then the time to clear the 5 vehicles is It is the starting time of passage after one public cycle.
[0122] The second end time of passage, also known as the end time of the green light for the traffic direction at the intersection, refers to the end time for a vehicle to reach and pass the next intersection after being allowed to pass at the first intersection.
[0123] It can be determined by the following formula 14):
[0124]
[0125]
[0126] in, The second pass end time; It is the end time of passage after one public cycle.
[0127] In some examples, establishing a constraint equation for the second duration includes establishing a constraint equation for the second duration according to the second earliest time, the second latest time, the second travel start time, the second travel end time, and an identification parameter.
[0128] For example, according to the foregoing, the constraint equation of the second duration may include the following equations 16)-21):
[0129]
[0130]
[0131]
[0132]
[0133]
[0134]
[0135] in, is the one-step green wave bandwidth in the current public cycle; M is a preset constant, which can be preset to 10 million; It is the identification parameter of the current public cycle; is the one-step green wave bandwidth in the next public cycle; It is the identification parameter of the next public cycle.
[0136] In addition, the one-step green wave bandwidth of the previous common cycle can also be considered. At this time, the starting time of passage one common cycle ago is determined according to the above method; and the constraint equation of the one-step green wave bandwidth of the previous common cycle is determined. Since the formula determination method has been described in detail in the previous article, it will not be repeated here.
[0137] It should be noted that the above formulas are all implemented under one target path. When the target path is determined, the phases of each intersection in the target path are also determined. When one of the intersections is allowed to pass, it means that the phase determined by the intersection is allowed to pass.
[0138] In some examples, the method 200 further includes: establishing a constraint equation for identification parameters corresponding to whether two adjacent intersections can be passed continuously based on the second earliest time, the second latest time, the second travel start time, and the second travel end time.
[0139] For example, according to the above, the constraint equation may also include the following equations 22)-25):
[0140]
[0141]
[0142]
[0143]
[0144] In addition, the identification parameters of the previous common cycle can also be considered. At this time, the start time of passage one common cycle ago and the end time of passage one common cycle ago are determined according to the above method; and the constraint equation of the identification parameters of the previous common cycle is determined. Since the formula determination method has been described in detail in the previous article, it will not be repeated here.
[0145] In some examples, the identification parameters may also be determined by the following formula 26 or 27:
[0146] or
[0147]
[0148] in, is the identification parameter of the previous common cycle. It should be understood that due to δ i,p→j,q can only be 0 or 1, so when δ i,p→j,q =1, for formula 26) or formula 27), only one identification parameter is 1. For example, taking formula 27) as an example, it can be or or
[0149] The one-step green wave bandwidth can also be determined by the following formula 28) or 29):
[0150]
[0151]
[0152] in, is the green wave bandwidth of one step in the previous public cycle.
[0153] In some instances, establishing a first model includes: maximizing a first duration as a first configuration target of the first model; and establishing a first model of at least one target path based on a weight factor of at least one target path, a traffic flow, and the first configuration target.
[0154] For example, according to the above, the first model is established as shown in the following formula 30):
[0155]
[0156] Among them, μ is N steps; residualhopsfromiinrt is the residual hops from i in rt, which is the number of intersections on the target path minus 1 step. is the N-step green wave bandwidth. At this time, it should be understood that intersections i and j are not necessarily adjacent intersections, but should be the first intersection and the last intersection in the N-step green wave bandwidth.
[0157] In some examples, the method 200 further includes: establishing a first model of at least one target path based on a weight factor of the at least one target path, a traffic flow, a first configuration target, and identification parameters corresponding to whether the at least one target path can be passed through multiple intersections continuously.
[0158] The identification parameter corresponding to whether a vehicle can continuously pass through multiple intersections can also be referred to as whether there are green waves at multiple intersections. When there is a green wave, the identification parameter can be 1, and when there is no green wave, the identification parameter can be 0. It should be understood that for a multi-step green wave, when there are multiple intersections, the vehicle still has a green light at each intersection when it arrives.
[0159] For example, according to the above, the first model is established as shown in the following formula 31):
[0160]
[0161] in, is an identification parameter, indicating whether there is a green wave at multiple intersections i and j.
[0162] In some instances, the method 200 further includes: establishing a first model of at least one target path based on a weight factor of the at least one target path, traffic flow, a first configuration target, identification parameters corresponding to whether the at least one target path can be passed continuously through multiple intersections, and corresponding phases of the multiple intersections.
[0163] Among them, for the target path, the corresponding phases of the multiple intersections have been determined. Taking a straight path as an example, the corresponding phases of the multiple intersections can be multiple straight-ahead phases.
[0164] For example, according to the above, the first model is established as shown in the following formula 32):
[0165]
[0166] In some instances, the method 200 further includes: establishing a first model of at least one target path based on a weight factor of the at least one target path, traffic flow, a first configuration target, identification parameters corresponding to whether multiple intersections can be passed continuously, corresponding phases of multiple intersections, and travel time of the intersection phase entering the target path.
[0167] Among them, the passing time of the intersection phase entering the target path is the green light time of the phase of each intersection entering the target path determined according to the target traffic path. The smaller the green light time, the fewer vehicles will enter the target path.
[0168] For example, according to the above, the first model is established as shown in the following formula 33):
[0169]
[0170] In some instances, the method 200 further includes: establishing a first model of at least one target path based on a weight factor of the at least one target path, traffic flow, a first configuration target, identification parameters corresponding to whether multiple intersections can be passed continuously, corresponding phases of multiple intersections, travel time of the intersection phase entering the target path, and travel time of the intersection phase exiting the target path.
[0171] Among them, the travel time of the intersection phase exiting the target path is determined by the green light time of the phase of each intersection exiting the target path according to the target traffic flow path. The longer the green light time is, the more vehicles will exit the target path.
[0172] For example, according to the above, the first model is established as shown in the following formula 34):
[0173]
[0174] Where A=∈*∑ (j,q) t j,q , that is, the travel time of the intersection phase exiting the target path.
[0175] In some examples, configuring the first duration includes: establishing a constraint equation for the first duration according to a second configuration target and a signal light time parameter in a second model; and configuring the first duration according to the constraint equation for the first duration and the first model.
[0176] In some instances, a constraint equation for a first duration is established, including: determining a first earliest time for continuously passing through multiple intersections based on the phase durations of multiple intersections and the corresponding phase differences of the multiple intersections; determining a first latest time for continuously passing through multiple intersections based on the first earliest time and the second configuration target; determining a first passing start time and a second passing end time of the last arriving intersection based on the phase durations of the multiple intersections and the phase of the last arriving intersection among the multiple intersections; and establishing a constraint equation for the first duration based on the first earliest time, the first latest time, the first passing start time, and the first passing end time.
[0177] It should be noted that the constraint equation for the first duration is similar to the constraint equation for the second duration, and will not be described in detail here. Only the second latest time with obvious changes and the added constraint equation are listed:
[0178]
[0179]
[0180] in, The first latest time, is the first earliest time; is the multi-step green wave bandwidth of at least two intersections before intersection j. For example, intersection j is the 9th intersection on the target path. is the 8-step green wave bandwidth of the first 9 intersections; where k is the intersection and w is the phase of the k intersection; To identify the parameters, whether there are green waves at multiple intersections j and k; To identify the parameters, whether there is a green wave at multiple intersections i and j. The order of the intersections is i, j and k.
[0181] Step 203: Determine a configuration scheme for traffic lights at multiple intersections according to the configured first duration.
[0182] For example, according to the foregoing, the first model and the second model are solved by the MILP model (mixed integer linear programming), and according to the above constraint equations, the maximization of the second configuration target is solved while the maximization of the first configuration target is solved. After obtaining the maximization of the first configuration target and the maximization of the second configuration target, the configuration scheme corresponding to each configuration target can be determined, such as the various control parameters in the configuration scheme, such as the common period of the traffic light, the green-to-signal ratio of each phase at each intersection, and the absolute phase difference of the intersection.
[0183] In this embodiment, the mesh path is split into main traffic paths by analyzing the traffic paths in the preset area, which avoids complex structures such as ring structures, reduces the complexity of the optimization model, and improves the flexibility of the optimization model; at the same time, the relative phase difference is limited to a positive or negative common cycle, which is more suitable for quickly obtaining the global optimal solution of the optimization model through the MILP model. And the maximization of the traffic-weighted green wave bandwidth is used as the optimization goal (also called the configuration goal), and the solution is from one-step green wave bandwidth to multi-step green wave bandwidth, so that the optimization effect of the optimization scheme is more complete, thereby realizing the global optimization decision of regional-level signal light coordination. At the same time, the weight factor of the path is used in the optimization scheme to make the optimization result of the control parameter more inclined to the traffic guarantee of key paths, so that the optimization configuration scheme is more targeted and can reflect the management intention of traffic managers.
[0184] Furthermore, Figure 3 A flowchart of another signal light coordination method provided by another exemplary embodiment of the present invention is provided. The method 300 provided by the embodiment of the present application is executed by a computing device, for example, a server, and the method 300 includes the following steps:
[0185] 301: Obtain a weight factor of at least one target path.
[0186] 302: Using the weight factor, configure a second duration for continuously passing through two adjacent intersections.
[0187] 303. Determine a configuration scheme of traffic lights at two adjacent intersections according to the configured second duration.
[0188] It should be noted that since steps 301-303 have been described in detail in the previous text, they will not be repeated here.
[0189] Furthermore, the signal light coordination method in the above embodiment can be applied not only to signal lights on the road, but also to other traffic facilities on the road, such as street lights, camera devices and other equipment. To this end, the embodiment of the present invention also provides a method for configuring traffic facilities, which specifically includes:
[0190] First, obtain the weight factor of at least one target path;
[0191] Secondly, using the weight factor, configuring a first duration for continuously passing through a plurality of intersections, the plurality of intersections corresponding to at least one target path;
[0192] Finally, according to the configured first duration, a configuration scheme of the traffic facilities at the plurality of intersections is determined.
[0193] It should be noted that the specific configuration process of the above-mentioned traffic facilities configuration method is the same as the above-mentioned Figure 2 The methods described in the illustrated embodiments are the same and therefore will not be described in detail.
[0194] Figure 5 A schematic diagram of the structure framework of a signal light coordination device provided by an exemplary embodiment of the present invention. The device 500 can be applied to a computing device, and the device 500 includes a first acquisition module 501, a first establishment module 502, and a determination module 503. The functions of each module are described in detail below:
[0195] The first acquisition module 501 is used to acquire a weight factor of at least one target path.
[0196] The first establishing module 502 is used to configure a first duration for continuously passing through a plurality of intersections by using a weight factor, wherein the plurality of intersections correspond to at least one target path.
[0197] The determination module 503 is used to determine the configuration scheme of the traffic lights at the plurality of intersections according to the configured first duration.
[0198] In some instances, the first establishing module 502 is also used to configure a first duration for continuously passing through multiple intersections in a target path; or, for multiple groups of intersections, configure a first duration for continuously passing through multiple intersections in each group of intersections, wherein each group of intersections in the multiple groups of intersections is a plurality of intersections in a target path; or, for multiple target paths, configure a first duration for continuously passing through multiple intersections, wherein the multiple intersections are intersections in the multiple target paths.
[0199] In some instances, the device 500 further includes: a first establishing module 502, further used to establish a first model and configure a first duration for continuously passing through multiple intersections in the target path, including: configuring the first duration for continuously passing through multiple intersections through the first model.
[0200] In some instances, such as Figure 6 The device 500 shown also includes: a second establishing module 504, which is used to establish a second model for at least one target path, and the second model is used to configure a second duration for continuously passing through two adjacent intersections; configure the first duration according to the configured second duration and the first model.
[0201] In some examples, the device 500 further includes: a second acquisition module 505, configured to acquire a plurality of traffic paths in a preset area; and acquire at least one target path from the plurality of traffic paths according to the traffic flow in the plurality of traffic paths.
[0202] In some examples, the first establishing module 502 is used to maximize the first duration as the first configuration target of the first model; and establish the first model of at least one target path according to the weight factor of at least one target path, the traffic flow and the first configuration target.
[0203] In some examples, the second establishing module 504 is used to maximize the second duration as a second configuration target of the second model; and establish a second model of at least one target path according to a weight factor of at least one target path, a traffic flow, and the second configuration target.
[0204] In some examples, the second establishing module 504 is further used to establish a second model of at least one target path based on a weight factor of at least one target path, traffic flow, a second configuration target, and identification parameters corresponding to whether two adjacent intersections can be passed continuously.
[0205] In some instances, the second establishment module 504 is used to establish a second model of at least one target path based on a weight factor of the at least one target path, traffic flow, a second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, and corresponding phases of the two adjacent intersections.
[0206] In some instances, the second establishing module 504 establishes a second model of at least one target path based on a weight factor of at least one target path, traffic flow, a second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, corresponding phases of two adjacent intersections, and travel time of the intersection phase entering the target path.
[0207] In some instances, the second establishing module 504 establishes a second model of at least one target path based on a weight factor of at least one target path, traffic flow, a second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, corresponding phases of two adjacent intersections, travel time of the intersection phase entering the target path, and travel time of the intersection phase exiting the target path.
[0208] In some examples, the second establishing module 504 is further used to determine the signal light time parameters of each intersection in the plurality of traffic paths; and to establish the constraint equations of the second model according to the signal light time parameters.
[0209] In some examples, the first establishing module 502 is further used to establish a constraint equation of the first duration according to the second configuration target and the signal light time parameter in the second model; and configure the first duration according to the constraint equation of the first duration and the first model.
[0210] In some instances, the first establishing module 502 includes: a first determining unit 5021, used to determine a first earliest time for continuously passing through multiple intersections based on the phase durations of the multiple intersections and the corresponding phase differences of the multiple intersections; determine a first latest time for continuously passing through multiple intersections based on the first earliest time and the second configuration target; determine a first passing start time and a first passing end time of the last intersection arrived at based on the phase durations of the multiple intersections and the phase of the last intersection arrived at among the multiple intersections; the first establishing unit 5022, used to establish a constraint equation for the first duration based on the first earliest time, the first latest time, the first passing start time and the first passing end time.
[0211] In some instances, the second establishing module 504 includes: a second determining unit 5041, used to determine the second earliest time and the second latest time for continuously passing through two adjacent intersections based on the phase duration of the two adjacent intersections and the corresponding phase difference of the two adjacent intersections; determine the second passage start time and the second passage end time of the later arrival intersection based on the phase duration of the two adjacent intersections and the phase of the later arrival intersection among the two adjacent intersections; a second establishing unit 5042, used to establish a constraint equation for the second duration based on the second earliest time, the second latest time, the second passage start time and the second passage end time.
[0212] In some examples, the second establishing module 504 is further used to establish a constraint equation for identification parameters corresponding to whether two adjacent intersections can be passed continuously based on the second earliest time, the second latest time, the second travel start time, and the second travel end time.
[0213] In some examples, the second establishing module 504 is further used to establish a constraint equation of the second duration according to the second earliest time, the second latest time, the second travel start time, the second travel end time and the identification parameter.
[0214] In some examples, the first establishing module 502 is further used to establish a first model of at least one target path based on a weight factor of the at least one target path, a traffic flow, a first configuration target, and identification parameters corresponding to whether the at least one target path can continuously pass through multiple intersections.
[0215] In some instances, the first establishment module 502 is further used to establish a first model of at least one target path based on a weight factor of the at least one target path, traffic flow, a first configuration target, identification parameters corresponding to whether the path can pass through multiple intersections continuously, and corresponding phases of multiple intersections.
[0216] In some instances, the first establishment module 502 is also used to establish a first model of at least one target path based on a weight factor of the at least one target path, traffic flow, a first configuration target, identification parameters corresponding to whether multiple intersections can be passed continuously, corresponding phases of multiple intersections, and travel time of the intersection phase entering the target path.
[0217] In some instances, the first establishment module 502 is further used to establish a first model of at least one target path based on a weight factor of at least one target path, traffic flow, a first configuration target, identification parameters corresponding to whether multiple intersections can be passed continuously, corresponding phases of multiple intersections, travel time of the intersection phase entering the target path, and travel time of the intersection phase exiting the target path.
[0218] Figure 7A schematic diagram of the structure framework of another signal light coordination device provided by another exemplary embodiment of the present invention. The device 600 can be applied to a computing device, such as a server, and includes: an acquisition module 601, an establishment module 602, and a determination module 603. The functions of each module are described in detail below:
[0219] The acquisition module 601 is used to acquire a weight factor of at least one target path.
[0220] The establishing module 602 is used to configure a second duration for continuously passing through two adjacent intersections by using a weight factor, wherein the adjacent intersections correspond to at least one target path.
[0221] The determination module 603 is used to determine the configuration scheme of the traffic lights at two adjacent intersections according to the configured second duration.
[0222] The above describes Figure 5 The internal functions and structure of the coordination device 500 shown in FIG. 5 are shown in FIG. 5 . In one possible design, Figure 5 The structure of the coordination device 500 shown can be implemented as a computing device, such as Figure 8 As shown, the computing device 700 may include: a memory 701 and a processor 702;
[0223] Memory 701, used for storing computer programs;
[0224] Processor 702, used to execute computer programs to perform the above Figure 2 or Figure 3 The steps of the signal light coordination method in the method embodiment.
[0225] In addition, an embodiment of the present invention further provides a computer storage medium, when the computer program is executed by one or more processors, causing the one or more processors to implement Figure 2 or Figure 3 The steps of the signal light coordination method in the method embodiment.
[0226] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0227] It is understandable that the related features in the above methods and devices can be referenced to each other. In addition, the "first", "second" and the like in the above embodiments are used to distinguish the embodiments, but do not represent the advantages and disadvantages of the embodiments.
[0228] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.
[0229] The algorithm and display provided herein are not inherently related to any particular computer, virtual system or other device. Various general purpose systems can also be used together with the teachings based on this. According to the above description, it is obvious that the structure required for constructing such systems. In addition, the present invention is not directed to any specific programming language either. It should be understood that various programming languages can be utilized to realize the content of the present invention described herein, and the description of the above specific languages is for disclosing the best mode of the present invention.
[0230] In addition, the memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM, and the memory includes at least one memory chip.
[0231] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.
[0232] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.
[0233] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.
[0234] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.
[0235] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.
[0236] The memory may include non-permanent memory in a computer-readable medium, random access memory (RAM) and / or non-volatile memory in the form of read-only memory (ROM) or flash RAM. The memory is an example of a computer-readable medium.
[0237] Computer readable media include permanent and non-permanent, removable and non-removable media that can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, program modules or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer readable media does not include temporary computer readable media (transitory media), such as modulated data signals and carrier waves.
[0238] It should also be noted that the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, commodity or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, commodity or device. In the absence of more restrictions, the elements defined by the sentence "comprises a ..." do not exclude the existence of other identical elements in the process, method, commodity or device including the elements.
[0239] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.
[0240] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.
Claims
1. A signal light coordination method, characterized in that: The method comprises: Obtaining a weight factor of at least one target path; Build the first model; The first model is used to configure a first duration for continuously passing through a plurality of intersections, wherein the plurality of intersections correspond to at least one target path; the first duration is an N-step green wave bandwidth; Determining a configuration scheme of the traffic lights at the plurality of intersections according to the configured first duration; The establishing of the first model comprises: maximizing the first duration as a first configuration objective of the first model; A first model of at least one of the target paths is established based on a weight factor of at least one of the target paths, traffic flow, the first configuration target, identification parameters corresponding to whether a plurality of intersections can be passed continuously, and corresponding phases of the plurality of intersections, wherein the weight factor is used to measure the importance of the target path.
2. The method according to claim 1, characterized in that: Utilizing the first model to configure a first duration for continuously passing through a plurality of intersections includes: Using the first model to configure a first duration for continuously passing through a plurality of intersections in a target path; or For multiple groups of intersections, using the first model to configure a first duration for continuously passing through multiple intersections in each group of intersections, wherein each group of intersections in the multiple groups of intersections is a plurality of intersections in a target path; or For multiple target paths, the first model is used to configure a first duration for continuously passing through multiple intersections, where the multiple intersections are intersections in the multiple target paths.
3. The method according to claim 1, characterized in that The method further comprises: For at least one of the target paths, a second model is established, wherein the second model is used to configure a second duration for continuously passing through two adjacent intersections; the second duration is a one-step green wave bandwidth; The first duration is configured according to the configured second duration and the first model.
4. The method according to claim 1, characterized in that: The method further comprises: Obtain multiple traffic paths in a preset area; At least one target path is determined from the multiple vehicle flow paths according to the vehicle flow rates in the multiple vehicle flow paths.
5. The method according to claim 3, characterized in that: The establishing of the second model comprises: maximizing the second duration as a second configuration objective of the second model; A second model of the at least one target path is established according to a weight factor of the at least one target path, a vehicle flow rate, and the second configuration target.
6. The method according to claim 5, characterized in that The method further comprises: A second model of the at least one target path is established based on a weight factor of the at least one target path, a traffic flow, the second configuration target, and an identification parameter corresponding to whether the at least one target path can pass through two adjacent intersections continuously.
7. The method according to claim 6, characterized in that The method further comprises: A second model of the at least one target path is established based on a weight factor of the at least one target path, traffic flow, the second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, and corresponding phases of the two adjacent intersections.
8. The method according to claim 7, characterized in that The method further comprises: A second model of at least one of the target paths is established based on a weight factor of at least one of the target paths, traffic flow, the second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, the corresponding phases of the two adjacent intersections, and the travel time of the intersection phase entering the target path.
9. The method according to claim 8, characterized in that The method further comprises: A second model of the at least one target path is established based on a weight factor of the at least one target path, traffic flow, the second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, the corresponding phases of the two adjacent intersections, the travel time of the intersection phase entering the target path, and the travel time of the intersection phase exiting the target path.
10. The method according to claim 1, characterized in that The method further comprises: A first model of at least one of the target paths is established based on a weight factor of at least one of the target paths, traffic flow, the first configuration target, identification parameters corresponding to whether multiple intersections can be passed continuously, corresponding phases of the multiple intersections, and travel time of the intersection phases entering the target path.
11. The method according to claim 10, characterized in that The method further comprises: A first model of the at least one target path is established based on a weight factor of the at least one target path, traffic flow, the first configuration target, identification parameters corresponding to whether multiple intersections can be passed continuously, corresponding phases of the multiple intersections, travel time of the intersection phase entering the target path, and travel time of the intersection phase exiting the target path.
12. A signal light coordination method, characterized in that: The method comprises: Obtaining a weight factor of at least one target path; Establishing a second model for at least one of the target paths; The second model is used to configure a second duration for continuously passing through two adjacent intersections, wherein the adjacent intersections correspond to at least one target path; the second duration is a one-step green wave bandwidth; Determining a configuration scheme of the traffic lights at the two adjacent intersections according to the configured second duration; The establishing of the second model comprises: maximizing the second duration as a second configuration objective of the second model; A second model of at least one of the target paths is established based on a weight factor of at least one of the target paths, traffic flow, the second configuration target, identification parameters corresponding to whether two adjacent intersections can be passed continuously, and corresponding phases of the two adjacent intersections, wherein the weight factor is used to measure the importance of the target path.
13. A method for configuring traffic facilities, characterized in that: The method comprises: Obtaining a weight factor of at least one target path; Build the first model; The first model is used to configure a first duration for continuously passing through a plurality of intersections, wherein the plurality of intersections correspond to at least one target path; the first duration is an N-step green wave bandwidth; Determining a configuration scheme of traffic facilities at the plurality of intersections according to the configured first duration; The establishing of the first model comprises: maximizing the first duration as a first configuration objective of the first model; A first model of at least one of the target paths is established based on a weight factor of at least one of the target paths, traffic flow, the first configuration target, identification parameters corresponding to whether a plurality of intersections can be passed continuously, and corresponding phases of the plurality of intersections, wherein the weight factor is used to measure the importance of the target path.
14. A computing device, characterized in that including a memory and a processor; The memory is used to store computer programs; The processor is used to execute the computer program to implement the steps in the method described in any one of claims 1 to 11 and / or claim 12 and / or claim 13.
15. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by one or more processors, the one or more processors are caused to implement the steps in the method described in any one of claims 1 to 11 and / or claim 12 and / or claim 13.
