Dynamic traffic signal optimization using received vehicle information
A dynamic traffic signal optimization system addresses static timing issues by calculating lane waiting times and adjusting signal timing based on real-time vehicle data, reducing delays and congestion.
Patent Information
- Application Number
- JP2024531646
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2021-12-05
- Filing Date
- 2022-10-09
- Publication Date
- 2024-11-06
AI Technical Summary
Traffic signals operate using static timing programs that fail to respond dynamically to changing traffic conditions, leading to poorly optimized traffic flows and unnecessary delays.
A computer-implemented process that detects vehicles within a predetermined vicinity of a traffic signal, calculates preferred waiting times for each lane, selects lanes for a proceed signal based on waiting times and vehicle type, and adjusts signal timing to optimize traffic flow.
Improves traffic flow by reducing waiting times and congestion by dynamically responding to changing traffic conditions, prioritizing emergency vehicles, and optimizing signal timing based on real-time vehicle data.
Smart Images

Figure 2024541106000001_ABST
Abstract
Description
[Technical field]
[0001] The present invention relates to vehicular traffic management, and more particularly to dynamic control of traffic signal devices (i.e., traffic signals) based on information received from and about vehicles within a given vicinity of the traffic signal. [Background technology]
[0002] Management of vehicular traffic flow in areas where roadways intersect often relies on stop signs when traffic volumes are low, in which case one or both roadways must come to a complete halt and proceed according to established road traffic control priorities. In other cases, intersections and multi-lane roadways with higher traffic volumes utilize signals that indicate when a "stop signal" is received and lanes must stop or a "go signal" is received and lanes must proceed. Traffic flows can change and be affected by population growth in an area over time, increased vehicle numbers due to weather conditions, detours, accidents, local events, time of day, and day of the week.
[0003] Traffic signals operate according to a static program, sometimes based on a statistical analysis of past traffic flows, which maintains a consistent operating timing. In some cases, traffic signal timing may be programmed differently at different times of the day, but lacks responsiveness to dynamic changes. Summary of the Invention
[0004] A computer-implemented process for dynamically optimizing traffic flow. The method provides one or more processors to detect vehicles within a predetermined vicinity of a traffic signal. The one or more processors identify a set of oncoming lanes as candidate lanes to receive a go signal from the traffic signal. The one or more processors calculate a preferred overall lane wait time for each oncoming lane associated with the traffic signal. The one or more processors select lanes to receive a go signal in a current iteration based on the preferred overall lane wait time and the candidate lanes. The one or more processors calculate an amount of time to allocate to the go signal based on a number of vehicles to exit the selected lanes. The one or more processors present the go signal and the allocated time to the selected lanes, including lanes that are not in conflict with the selected lanes. The one or more processors collect a set of metrics based on monitoring the throughput of vehicles exiting the predetermined vicinity of the traffic signal. The one or more processors determine a time to allocate to the go signal in a next iteration of the traffic signal based on the collection of metrics, update a parameter associated with the preferred overall lane wait time, and the one or more processors initiate the next iteration of the traffic signal. [Brief description of the drawings]
[0005] [Figure 1] 1 is a functional block diagram illustrating a distributed data processing environment in accordance with one embodiment of the present invention. [Diagram 2] 4 is a flow chart depicting the operational steps of a traffic optimization program in accordance with one embodiment of the present invention. [Diagram 3] 3 is a block diagram depicting components of a computing system including a computing device configured to operatively execute the traffic optimization program of FIG. 2 in accordance with one embodiment of the present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0006] Embodiments of the present invention recognize many scenarios in which traffic signals utilize static timing to manage traffic, resulting in suboptimal traffic flow, unnecessary delays, and driver and passenger disappointment. A relevant example includes a situation in which a vehicle waits at a traffic signal while no vehicles currently occupy or approach the lanes of the traffic signal that have a go ahead signal. The waiting vehicle waits until the static timing presents a go ahead signal for the waiting vehicle's lane. Embodiments recognize that current traffic signal settings may lack the ability to respond to dynamically changing conditions. Embodiments further recognize that highly congested traffic in all lane directions cannot rely on current traffic signals to focus relief on one lane that is significantly more congested than other lanes. Embodiments recognize that providing priority and extended go ahead signal times to lanes with more traffic congestion reduces overall wait times for vehicles, reduces congestion, and balances traffic flow over time.
[0007] An embodiment of the present invention recognizes that a traffic flow management marking for an intersection includes an area or zone within a predetermined vicinity of a traffic signal. An embodiment provides a method for optimizing the overall waiting time of vehicles within the vicinity of the traffic signal depending on the dynamic responsiveness of the traffic signal. An embodiment of the present invention improves traffic flow within the predetermined vicinity of the traffic signal based on optimizing a target function associated with the vehicles and lanes within the zone.
[0008] An embodiment of the present invention refers to a predefined area in the vicinity of a traffic signal as an optimization zone. The embodiment further refers to a lane within the optimization zone leading towards the traffic signal as an oncoming lane, and a lane away from the traffic signal as an offgoing lane. The embodiment considers all vehicles within the optimization zone to be destined to pass through the traffic signal associated with the optimization zone, and corresponds to a vehicle proceeding from the oncoming lane to the offgoing lane while a go signal is provided to the oncoming lane. A vehicle that responds to the go signal, proceeds through an intersection associated with the traffic signal, and exits the optimization zone via an offgoing lane is referred to as "passing the traffic signal." Vehicles expected or monitored to pass through a traffic signal (or optimization zone) are referred to herein as "flowing out," "flowing vehicles," "vehicles to be flowed out," or "flowed vehicles."
[0009] The embodiments recognize that a traffic signal directs a go signal to a designated lane for an allocated period during a traffic signal iteration. For each iteration, the embodiments of the present invention determine one or more incoming lanes selected to receive a go signal, and the embodiments calculate the allocated time for the go signal. The embodiments calculate the preferred overall lane wait time for the incoming lanes of the optimization zone based on the preferred wait time of the vehicles in the respective lanes and the lane preference percentage of all lanes. The embodiments select the lanes to receive the go signal in the current iteration based on the preferred overall wait time of the incoming lanes. Additionally, the embodiments calculate the allocated time to provide the go signal based on the number of vehicles expected to be spilled out of one or more selected lanes in the current iteration. In some embodiments, the go signal time function determines the allocated go signal time by receiving as input the number of vehicles (to be spilled out of the lane) and returning the time allocated for the go signal. The go signal time function uses a predetermined time required for a vehicle type to pass through the traffic signal. Examples of vehicle types include, but are not limited to, passenger vehicles (i.e., cars, SUVs, pickup trucks), public transportation vehicles (i.e., buses, taxis, coach vehicles, larger capacity vehicles), special purpose vehicles (i.e., electric utility, water utility, and gas utility trucks and vehicles serving roadways) and emergency vehicles (fire engines, police vehicles, ambulances, and rescue vehicles).
[0010] Embodiments apply a go ahead signal to the selected lane(s) and may include additional lanes consistent with traffic flow rates of the selected lane(s). After completion of the go ahead signal timing allocation, embodiments collect metrics and update parameters and functions for the next iteration of the traffic signal. Embodiments include detection of and responses to emergency vehicles in the entry lanes of the optimization zone, prioritizing the exit of emergency vehicles from their respective lanes.
[0011] The present invention will now be described in detail with reference to the drawings. Figure 1 is a functional block diagram illustrating a distributed data processing environment in accordance with one embodiment of the present invention. Figure 1 is provided only as an illustration of one embodiment and is not intended to imply any limitations with respect to the environments in which different embodiments may be implemented. One of ordinary skill in the art may make numerous modifications to the depicted environment without departing from the scope of the present invention as set forth in the claims.
[0012] The description of various embodiments of the present invention is provided for illustrative purposes and is not intended to be exhaustive or limiting of the disclosed embodiments. Many modifications and variations will be apparent to those skilled in the art without departing from the scope and spirit of the described embodiments. The terms used in this specification are selected to best explain the principles of the embodiments, practical applications, or technical improvements over the technology found in the market, or to enable those skilled in the art to understand the embodiments disclosed in this specification.
[0013] 1 includes computing device 110, passenger vehicles 120, 121, 130 and 131, public transit vehicles 122 and 132, emergency vehicles 124 and 134, exiting vehicles 129 and 139, vehicle information 140 and traffic signals 180, all connected via network 150. FIG. 1 also includes lanes 160, 162, 165, 167, 170, 172, 175 and 177 and optimization zone 185.
[0014] The computing device 110 includes a user interface 115 and a traffic optimization program 200. In some embodiments, the computing device 110 can be a blade server, a web server, a laptop computer, a desktop computer, a standalone mobile computing device, a smartphone, a tablet computer, or other electronic device or computing system capable of receiving, transmitting, and processing data. In other embodiments, the computing device 110 can be a wearable item or can be included in a wearable item of a user. In still other embodiments, the computing device 110 can be a computing device that interacts with applications and services hosted and operated within a cloud computing environment. In other embodiments, the computing device 110 can be a netbook computer, a personal digital assistant (PDA), or other programmable electronic device capable of receiving data from and communicating with the vehicle information 140, the traffic signal 180, the passenger vehicles 120, 121, 130 and 131, the public transportation vehicles 122 and 132, and the emergency vehicles 124 and 134. Computing device 110 includes the capability to communicate with other devices (not shown) of distributed computing environment 100 via network 150 as well as the capability to host the operation of traffic optimization program 200. Alternatively, in some embodiments, computing device 110 may be communicatively coupled to a traffic optimization program 200 operating remotely. Computing device 110 may include internal and external hardware components, which are depicted in further detail in FIG.
[0015] User interface 115 provides an interface for accessing features and functionality of computing device 110. In some embodiments of the invention, user interface 115 provides access for operating and selecting options for traffic optimization program 200. User interface 115 may provide a display of output for the functions and applications of computing device 110. User interface 115 of computing device 110 may allow a user of computing device 110 to access additional features and functionality of computing device 110 (not shown).
[0016] The user interface 115 supports access to alerts, notifications, and provides access to forms of communication. In one embodiment, the user interface 115 may be a graphical user interface (GUI) or web user interface (WUI) and may receive user input and display text, documents, web browser screens, user options, application interfaces, and instructions for operation, including information (e.g., graphics, text, and sound) that a program presents to a user and control sequences that a user uses to control a program. In other embodiments, the user interface 115 may include mobile application software that provides a respective interface to the features and functionality of the computing device 110. The user interface 115 enables each user of the computing device 110 to receive, view, and respond to input, access applications, view the content of online conversational exchanges, and perform available functions.
[0017] Optimization zone 185 includes passenger vehicles 120, 121, 130, and 131, public transit vehicles 122 and 132, and emergency vehicles 124 and 134 that are located in the incoming lanes and waiting for a signal to proceed from traffic signal 180. Passenger vehicles 120, 121, 130, and 131, public transit vehicles 122 and 132, and emergency vehicles 124 and 134 include configurations that wirelessly transmit data (not shown in the vehicle representations) over network 150 to traffic optimization program 200 running on computing device 110.
[0018] The vehicle data transmitted to the traffic optimization program 200 includes, but is not limited to, vehicle identification, information regarding the type of vehicle, the speed and direction of travel of the vehicle, the location of the vehicle within the optimization zone, the proximity of the vehicle to the traffic signal 180, the number of occupants in the vehicle, the time of entering the optimization zone, the location within the optimization zone, the direction of travel, the speed, and the priority weight that the vehicle may have. Each vehicle's information received by the traffic optimization program 200 results from data transmissions from one or more of camera sensors, infrared sensors, radar detection sensors, an application (app) running on the vehicle's computer, and user input from an app on a user's mobile device or other detection sources. Vehicles may include transponders that wirelessly transmit each vehicle's data when entering the optimization zone, and the traffic optimization program 200 receives the transmitted data online. Online reception means "no delays" and includes staging or storage between transmissions, providing real-time dynamic calculations and decisions to optimize the overall waiting time of the vehicles within the optimization zone.
[0019] The vehicle receives a waiting time while in the entry lane of the optimization zone 185, including a priority percentage based on the vehicle type, the number of occupants of the vehicle, an optional payment made by the owner or occupant of the vehicle to receive an elevated priority status, and any combination of these aspects. The priority percentage for the vehicle provides a weighting factor and ranges from zero (0) to one (1). The priority percentage can be determined in part or in whole based on the vehicle type. For example, passenger cars may have a priority percentage of 0.1, municipal, government and security vehicles may have a priority percentage of 0.3, public transportation vehicles 122 and 132 may have a priority percentage of 0.6, and emergency vehicles 124 and 134 may have a priority percentage of 0.8. In addition, the number of occupants in the vehicle may determine the priority percentage in part or in whole. An example of an occupant priority percentage calculation may be [number of occupants in the vehicle] / [number of people in the lane] (or the divisor may be "number of people in the optimization zone"). In some embodiments, the vehicle priority percentage may be further modified by the vehicle's occupant (or owner) paying an amount that increases the vehicle's priority percentage within an acceptable range. In some embodiments, certain vehicle types, such as municipal vehicles, special purpose vehicles, and emergency vehicles, are assigned pre-set values for priority percentages regardless of the number of occupants.
[0020] Lanes 160 and 162 provide north-to-south approach lanes for optimized zone 185 and traffic signal 180. Lane 160 depicts passenger vehicle 120 and public transit vehicle 122 waiting to proceed south on lane 160. Lanes 165 and 167 provide south-to-north approach lanes for optimized zone 185 and traffic signal 180. Lane 165 depicts emergency vehicle 124 and lane 167 depicts passenger vehicle 121 waiting to proceed north. Lanes 170 and 172 provide west-to-east approach lanes for optimized zone 185 and traffic signal 180. Lanes 175 and 177 provide east-to-west approach lanes for optimized zone 185 and traffic signal 180. Lane 170 depicts passenger vehicle 130, and lane 172 depicts passenger vehicle 131, both waiting to proceed eastward. Lane 170 also depicts an exiting vehicle 139 that has passed (i.e., left) the optimization zone 185. Lane 175 depicts emergency vehicle 134, and lane 177 depicts public transit vehicle 132, both waiting to proceed westward on their respective lanes.
[0021] The exiting vehicles 129, 139 are vehicles that passed through the optimization zone 185 after receiving a go signal in their respective lanes 167 and 170 in a previous iteration of the traffic signal 180 that selected and presented a go signal.
[0022] Vehicle information 140 receives copies of transmitted vehicle data as well as calculations and decisions by traffic optimization program 200, which acts as a historical record, allowing reference and learning to continually improve lane selection, improve accuracy in determining the number of flow-out vehicles, and improve assigned proceed signal time determination. In some embodiments, traffic signal 180 includes vehicle information 140 as a component, while in other embodiments, computing device 110 includes vehicle information 140 as a computing component. In still other embodiments, vehicle information 140 communicates with computing device 110 and traffic optimization program 200 as a remote repository over network 150. Vehicle information 140 includes data from and about vehicles in each lane of optimization zone 185 as well as the collection and determination of calculations, selections, metrics, and decisions performed by traffic optimization program 200 for each iteration of traffic signal 180.
[0023] Network 150 may be, for example, a local area network (LAN), a wide area network (WAN), such as the Internet, a virtual local area network (VLAN), or any combination that may include wired, wireless, or other connections. In general, network 150 may be any combination of connections and protocols that support communication and data transmission between passenger vehicles 120, 121, 130, 131, public transportation vehicles 122, 132, emergency vehicles 124 and 134, exiting vehicles 129 and 139, computing device 110, vehicle information 140, and traffic signal 180, as well as other devices and elements of distributed computing environment 100 (not shown).
[0024] Traffic signal 180 receives lane selection and go signal durations from traffic optimization program 200. Traffic signal 180 provides go signal to the approach lanes of optimization zone 185. In some embodiments, traffic signal 180 includes computing device 110 on which traffic optimization program 200 operates. In other embodiments, traffic signal 180 communicates remotely with traffic optimization program 200 and computing device 110 and receives lane selection and go signal time assignments via network 150. In some embodiments, configuration of traffic signal 180 includes enabling go signal transmission for lanes 160, 162, 165, 167, 170, 172, 175, and 177, independently or in combination with preventing go signal transmission conflicts, to optimize traffic flow within optimization zone 185.
[0025] The optimization zone 185 includes an area in a given vicinity of the traffic signal 180. Although FIG. 1 depicts the optimization zone 185 as having a circular shape, embodiments do not limit the shape or extent of the optimization zone 185. In some embodiments, the optimization zone 185 extends to a point coincident with an outflowing vehicle lane supported by a maximum advance signal allocation time. Embodiments may limit the extent and shape of the optimization zone 185 based on wireless communication range and sensor detection capabilities of vehicle information, such as vehicle type, number of occupants, and priority earned by each vehicle, such as payment of priority tolls.
[0026] 1 depicts a traffic optimization program 200 operating on a computing device 110. In some embodiments, the traffic optimization program 200 may operate remotely and be communicatively coupled to the computing device 110. In some embodiments, the traffic optimization program 200 and the computing device 110 may be components of a traffic signal 180. The traffic optimization program 200 selects one or more entry lanes of the optimization zone 185 that receive a go ahead signal in a current iteration of the traffic signal 180 and determines the time allocated for the go ahead signal.
[0027] The traffic optimization program 200 determines the wait times for all vehicles in all lanes in the optimization zone 185. The traffic optimization program 200 determines an overall lane wait time for each of the entry lanes of the optimization zone 185 by calculating a preferred vehicle wait time for each vehicle in the lane, which includes the product of the vehicle wait time and the priority percentage, and aggregating the preferred vehicle wait times of the vehicles in the lane. The traffic optimization program 200 further determines a preferred overall lane wait time for each of the entry lanes of the optimization zone 185 by combining the lane's overall lane wait time with the lane's priority percentage. The traffic optimization program 200 selects the lane with the highest value of preferred overall lane wait time to receive a proceed signal.
[0028] The traffic optimization program 200 determines a duration for presenting a go ahead signal to the selected lane. The traffic optimization program 200 determines a number of vehicles to exit the selected lane, and in some embodiments, the determined number of vehicles to exit the selected lane can be used to determine the duration of the go ahead signal. The traffic optimization program 200 provides a go ahead signal to the selected lane, performs observations of the number of vehicles passing through the traffic signal 180 toward the exiting lane, collects metrics, and updates parameters for the next iteration of the traffic signal 180.
[0029] 2 depicts a flow chart of operational steps of a traffic optimization program 200 in accordance with one embodiment of the present invention. The traffic optimization program 200 operates in conjunction with a traffic signal device (e.g., traffic signal 180 of FIG. 1) to manage traffic flow within a given vicinity area of the traffic signal. In an embodiment of the present invention, the traffic optimization program 200 receives data associated with vehicles within the oncoming and outgoing lanes of an optimization zone in real time, performs dynamic evaluation of waiting and allocation times where a proceed signal is provided to a selected lane or lanes, and optimizes vehicle waiting times (i.e., minimizes overall waiting times) within the optimization zone, e.g., optimization zone 185 (FIG. 1).
[0030] The traffic optimization program 200 detects vehicles within a predefined vicinity of the traffic signal (step 210). The traffic optimization program 200 begins iterating through the traffic signal and receives inputs of vehicles entering or already within the optimization zone, which includes the area defined by the predefined vicinity of the traffic signal. In some embodiments, the traffic optimization program 200 receives input data from individual vehicles, for example, from data transponders within each vehicle, which identify the vehicle and provide information regarding the type of vehicle, the location of the vehicle within the optimization zone, and the lane associated with the vehicle's location, among other data items.
[0031] For example, vehicle 121 enters optimization zone 185 for traffic signal 180 and transmits information to traffic optimization program 200 running on computing device 110 that identifies vehicle 121, indicates the location of vehicle 121 within lane 167 relative to traffic signal 180, reports that there are three occupants in vehicle 121, and provides a code indicating that the occupants of vehicle 121 have made a payment to receive higher priority.
[0032] The traffic optimization program 200 identifies as candidate lanes those incoming lanes that are expected to receive a go ahead signal (step 220). The traffic optimization program 200, in one embodiment, determines candidate lanes within the optimization zone that exclude lanes that receive a go ahead signal from a previous iteration of the traffic signal. For example, if a previous iteration did not provide a go ahead signal due to congestion in all exit lanes, the traffic optimization program 200 considers providing a go ahead signal to all incoming lanes for the current iteration.
[0033] For example, traffic optimization program 200 identifies lanes 160, 162, 165, 167, 170, 172, 175, and 177 as entry lanes for optimization zone 185. Traffic optimization program 200 determines that lanes 160 and 162 were provided with a go-ahead signal for a previous iteration of traffic signal 180, excludes lanes 160 and 162, and considers lanes 165, 167, 170, 172, 175, and 177 as candidate lanes for selection to receive a go-ahead signal in the current iteration.
[0034] The traffic optimization program 200 calculates the preferred overall lane waiting time for the entry lanes (step 230). The traffic optimization program 200 calculates the preferred waiting time for each vehicle in each lane of the optimization zone 185, which is involved in determining the overall lane waiting time for each entry lane of the optimization zone 185. In an embodiment of the invention, the traffic optimization program 200 determines the waiting time for each vehicle in the entry lane for all entry lanes of the optimization zone 185. In some embodiments, the traffic optimization program 200 determines the vehicle waiting time by the difference between the current time and the time assigned to each vehicle's information when the vehicle enters the optimization zone 185. In an alternative embodiment, the traffic optimization program 200 can determine the vehicle waiting time from the time the vehicle enters the optimization zone 185 to the time the vehicle exits the zone and use it to calculate the target function optimization value.
[0035] The traffic optimization program 200 determines, for all incoming lanes of the optimization zone 185, a priority percentage for each vehicle in the lane. In some embodiments, the vehicles receive a value ranging from 0 to 1 as the priority percentage, which may be preset based on the vehicle type. Other ranges of values for the priority percentage may be used if consistently applied. Calculating the product of each vehicle's waiting time and each vehicle's priority percentage results in the individual vehicle's priority waiting time.
[0036] For example, to illustrate the above concepts, emergency vehicles 124 and 134 have a priority percentage of 0.8, municipal, utility and government vehicles have a priority percentage of 0.6, public transportation vehicles 122 and 132 have a priority percentage of 0.3, commercial transportation vehicles (not shown in FIG. 1 ) have a priority percentage of 0.2, and passenger cars 120, 121, 130 and 131 have a priority percentage value of 0.1. A possible priority wait time for passenger car 120 may be [90 second wait time]×[0.1 priority percentage]=9.0 priority wait time for passenger car 120.
[0037] The traffic optimization program 200 determines the number of occupants in the vehicle, which may determine the vehicle's preference percentage in part or in whole, or may be combined with the type of vehicle to determine the preference percentage for each vehicle. For example, if the vehicle type precludes consideration of the number of occupants, each vehicle depends on a pre-set preference percentage value for the vehicle type. In another example, if the vehicle type does not preclude consideration of the number of occupants, the number of occupants of the vehicle determines the vehicle's preference percentage. In some embodiments, the traffic optimization program 200 recognizes any conditions associated with the vehicle, and obtaining an increase in the vehicle's preference percentage may depend on the amount of payment by the vehicle's owner or occupant, or may be based on a reward, or may be incentive-based.
[0038] The traffic optimization program 200 calculates an overall lane preemption wait time for each entry lane in the optimization zone 185, which combines the overall lane wait time with the lane preemption percentage. The traffic optimization program 200 sums the preemption vehicle wait times of all vehicles in each lane to calculate the overall lane wait time. The determination of the lane preemption percentage involves consideration of multiple factors. The lane preemption percentage takes into account the time that has accrued since each lane last received a go-ahead signal, takes into account the amount of congestion in the exit lanes from the optimization zone 185, and also takes into account the speed of vehicles entering the entry lanes of the optimization zone 185, and may further take into account additional related aspects that affect traffic flow in the optimization zone 185. The traffic optimization program 200 determines the lane preemption percentage by, for example, calculating [duration since lane received a go-ahead signal] / [maximum duration of all lanes since receiving a go-ahead signal]. Incoming vehicle speed information can be transmitted to the traffic optimization program 200 by vehicle transponders and detected by camera or radar detection devices on the periphery of the optimization zone 185. Traffic congestion in the exit lanes can be provided by other traffic signal control devices outside the optimization zone 185.
[0039] The traffic optimization program 200 may consider congestion in the exit lanes and increase the lane priority percentage of a vehicle exiting into an open exit lane, as opposed to adding to congestion problems detected in other exit lanes. Exemplary embodiments for determining the overall lane wait time to prioritize include, but are not limited to, [overall lane wait time] x [lane priority percentage], where the lane priority percentage includes the duration since the lane received a go signal, and may consider exit lane congestion as well as other available factors.
[0040] For example, the traffic optimization program 200 determines a wait time for each vehicle in each incoming lane of the optimization zone 185 and determines a priority percentage for each vehicle based on vehicle type and, in some examples, based on the occupants in each vehicle. The traffic optimization program 200 calculates the priority vehicle wait times for all vehicles and sums the priority vehicle wait times for all vehicles in a lane to obtain an overall lane wait time. The product of the overall lane wait time and the lane priority percentage results in an overall priority lane wait time, which provides the basis for the selection of a lane to receive a proceed signal.
[0041] The traffic optimization program 200 selects one or more lanes that will receive a go signal in the current iteration of the traffic signal (step 240). In some embodiments, only lanes that did not receive a go signal in the previous traffic signal iteration are considered. In one embodiment, the basis for the selection of lanes for the current iteration of the go signal from the traffic signal 180 includes the selection of the lane or lanes with the highest preferred overall lane latency. In some embodiments, the traffic optimization program 200 determines additional lanes in the optimization zone 185 that are not in conflict with the selected lane(s), and the additional non-conflicting lanes are included in the selection of lanes to receive a go signal. In some embodiments, where all egress lanes of the optimization zone 185 are determined to be fully congested, the traffic optimization program 200 may maintain stop signals for all lanes for a short period of time, allowing for a reduction in congestion in the egress lanes, and provide an all-way go signal for pedestrians for crosswalks during the all-way stop signal period for vehicles. In some embodiments, the traffic optimization program 200 begins a new iteration after an all-way stop signal period for vehicles, which may coincide with the detection of movement within the egress lanes of the optimization zone 185.
[0042] The traffic optimization program 200 determines an amount of time allocated to providing a go ahead signal to one or more selected lanes (hereinafter referred to as singular "lanes") (step 250). In one embodiment, the traffic optimization program 200 calculates the number of vehicles in the selected lane that should be spilled out of the lane during the go ahead signal period. The traffic optimization program 200 calculates an average priority signal wait time that averages priority vehicle wait times across all vehicles in the optimization zone 185. The traffic optimization program 200 determines the number of vehicles that should be spilled out of the selected lane by determining the number of vehicles in the selected lane that have an actual wait time that is longer than the average priority signal wait time. If there are no vehicles in the selected lane that have an actual wait time that is longer than the average priority signal wait time, the traffic optimization program 200 determines the number of vehicles that should be spilled out of the selected lane by determining the number of vehicles that can fit into the available space in the exit lane that corresponds to the selected lane.
[0043] In some embodiments, the traffic optimization program 200 returns a period of time to provide a go signal to the selected lane for the current iteration of the traffic signal 180 using a go signal time function that receives as an input the number of vehicles that should exit the selected lane. The go signal time function can be learned from historical vehicle throughput that captures the number of vehicles observed passing through the lane per time unit. The historical data learning can be further improved with additional consideration of weather factors, the amount of congestion in the exiting lanes, information from other traffic signals, and the location and physical topography of the optimization zone 185. In some embodiments, the traffic optimization program 200 adjusts the go signal time function to account for the additional time it takes larger and longer vehicle types to pass through the optimization zone 185.
[0044] In some embodiments, the go ahead signal time function includes setting a time function with constants that represent various per vehicle times passing through the optimization zone 185. The constants can be set based on vehicle type as well as based on the number of vehicles positioned ahead of each vehicle in the lane, for example, the number of each vehicle positioned ahead of a particular vehicle in a selected lane that affects and adds a time delay when that particular vehicle crosses the traffic signal position. The constants can be adjusted based on ongoing feedback measurements. In some embodiments, the go ahead signal time function includes minimum and maximum durations set for the go ahead signal. The traffic optimization program 200 determines the allocated time for providing a go ahead signal to a selected lane by inputting the number of vehicles to be cleared from the selected lane into the go ahead signal time function.
[0045] The traffic optimization program 200 provides the determined allocated go ahead signal time to the selected lane and to any non-conflicting lanes (step 260). In some embodiments, the traffic optimization program 200 provides the determined allocated go ahead signal time to any additional lanes that do not conflict with the go ahead signal provided to the selected lane. The traffic optimization program 200 determines an end point for the go ahead signal allocation time and ends the go ahead signal.
[0046] The traffic optimization program 200 collects measurements of the metrics and updates parameters and functions for the next iteration of the traffic signal (step 270). The traffic optimization program 200 collects information associated with vehicles that have flowed out of selected lanes of the optimization zone 185. The traffic optimization program 200 measures the actual vehicle throughput passing through the traffic signal 180 and heading into the exit lanes of the optimization zone 185, and compares the actual vehicle throughput to a target number of vehicles intended to flow out of the optimization zone 185. In some embodiments, the traffic optimization program 200 updates an advance signal time function that adjusts as needed based on the comparison to the target. For example, the traffic optimization program 200 may determine that some vehicle types are passing through the traffic signal 180 faster or slower in certain conditions (i.e., poor weather conditions).
[0047] The traffic optimization program 200 performs measurements, collects metrics, records data, and updates preferred vehicle waiting times for all vehicles within the optimization zone 185 before initiating the next iteration of the traffic signal 180. In some embodiments, the traffic optimization program 200 modifies configuration parameters before initiating the next iteration based on environmental conditions, e.g., weather, congestion, detected or received input of accidents, and discrepancies between the number of expected and actual spillover vehicles, or the parameters can be manually adjusted, e.g., due to scheduled construction near the optimization zone 185. In some embodiments, the traffic optimization program 200 modifies vehicle priority percentages per vehicle type based on environmental conditions. For example, infrastructure outages may lead to an increase in priority for special purpose vehicles, and attendance at a local public event can increase priority for public transportation vehicles.
[0048] The traffic optimization program 200 begins a new iteration of the traffic signal 180, in which a lane other than the lane selected in the previous iteration is selected, and the new calculated allocation time is assigned to the go signal for the selected lane.
[0049] An embodiment of the invention includes, in emergency mode, detecting an emergency vehicle entering the optimized zone at any point during the above-mentioned steps of the traffic optimization program 200. The traffic optimization program 200 initiates an emergency condition associated with the optimized zone and adjusts traffic signal operation to provide highest priority to the lane in which the emergency vehicle is located. The traffic optimization program 200 allows the emergency vehicle to exit the lane containing the emergency vehicle until it passes the traffic signal and enters an exit lane of the optimized zone. In some embodiments, the traffic optimization program 200 maintains an additional time interval of the emergency condition after the emergency vehicle exits the entry lane and passes the traffic signal. The additional emergency condition interval anticipates situations in which an additional emergency vehicle may soon enter the optimized zone. The traffic optimization program 200 initiates the emergency condition as a temporary state that lasts until the emergency vehicle exits, passes the traffic signal, and any additional time interval of the emergency condition ends.
[0050] FIG. 3 illustrates a block diagram of components of a computing system 300 including a computing device 305 configured to include or operatively connect to the components depicted in FIG. 1 and capable of operatively executing the traffic optimization program 200 of FIG. 2 in accordance with one embodiment of the present invention.
[0051] Computing device 305 includes components and functional capabilities similar to those of computing device 110 (FIG. 1) in accordance with an embodiment of the present invention. It is to be understood that FIG. 3 provides only an illustrative example of one implementation and is not intended to imply any limitation with respect to the environments in which different embodiments may be implemented. Many modifications to the depicted environments may be made.
[0052] Computing device 305 includes a communications fabric 302 that provides communications between one or more computer processors 304, memory 306, persistent storage 308, communications units 310, and one or more input / output (I / O) interfaces 312. Communications fabric 302 may be implemented by any architecture designed to convey data and / or control information between processors (e.g., microprocessors, communications and network processors, etc.), system memory, peripherals, and any other hardware components in a system. For example, communications fabric 302 may be implemented by one or more buses.
[0053] The memory 306, the cache memory 316 and the persistent storage 308 are computer-readable storage media. In this embodiment, the memory 306 includes random access memory (RAM) 314. In general, the memory 306 may include any suitable volatile or non-volatile computer-readable storage medium.
[0054] In one embodiment, the traffic optimization program 200 is stored in persistent storage 308 for execution by one or more of the respective computer processors 304 via one or more memories of memory 306. In this embodiment, persistent storage 308 includes a magnetic hard disk drive. Instead of or in addition to a magnetic hard disk drive, persistent storage 308 may include a solid state hard drive, a semiconductor memory device, a read only memory (ROM), an erasable programmable read only memory (EPROM), a flash memory, or any other computer readable storage medium capable of storing program instructions or digital information.
[0055] The media used by persistent storage 308 may be removable. For example, a removable hard drive may be used for persistent storage 308. Other examples include optical and magnetic disks, thumb drives, and smart cards that are inserted into a drive to transfer onto other computer readable storage media that are also part of persistent storage 308.
[0056] In these examples, the communication unit 310 provides communication with other data processing systems or devices that comprise resources of the distributed computing environment 100. In these examples, the communication device 310 includes one or more network interface cards. The communication unit 310 may provide communication by using one or both of physical and wireless communication links. The traffic optimization program 200 may be downloaded to the persistent storage 308 through the communication device 310.
[0057] The one or more I / O interfaces 312 allow for input and output of data to and from other devices that may be connected to the computing system 300. For example, the I / O interface 312 may provide a connection to an external device 318, such as a keyboard, a keypad, a touch screen, or some other suitable input device or combination. The external device 318 may also include portable computer-readable storage media, such as thumb drives, portable optical or magnetic disks, and memory cards. Software and data used to practice embodiments of the present invention, such as the traffic optimization program 200, may be stored on such portable computer-readable storage media and loaded onto the persistent storage 308 via the one or more I / O interfaces 312. The one or more I / O interfaces 312 also connect to a display 320.
[0058] Display 320 provides a mechanism for displaying data to a user and may be, for example, a computer monitor.
[0059] The programs described herein are identified based on the applications in which they are implemented in specific embodiments of the invention, however, it will be understood that any particular program nomenclature herein is used merely as a matter of convenience, and thus the invention should not be limited to use in only any particular application identified or implied or identified and implied by such nomenclature.
[0060] The invention may be a system, method, or computer program product, or combination thereof, at any possible level of technical detail of integration. The computer program product may include a computer-readable storage medium (or media) having computer-readable program instructions thereon for causing a processor to perform aspects of the invention.
[0061] A computer readable storage medium may be a tangible device that can hold and store instructions for use by an instruction execution device. A computer readable storage medium may be, for example, but not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the above. A non-exhaustive list of more specific examples of computer readable storage media includes portable computer diskettes, hard disks, random access memory (RAM), read only memory (ROM), erasable programmable read only memory (EPROM or flash memory), static random access memory (SRAM), portable compact disk read only memory (CD-ROM), digital versatile disk (DVD), memory sticks, floppy disks, mechanically encoded devices such as punch cards or ridge structures in grooves that allow instructions to be recorded thereon, and any suitable combination of the above. As used herein, a computer-readable storage medium should not be construed as a transitory signal per se, such as an electric wave or other freely propagating electromagnetic wave, an electromagnetic wave propagating through a waveguide or other transmission medium (e.g., light pulses passing through a fiber optic cable), or an electrical signal transmitted through an electrical wire.
[0062] The computer readable program instructions described herein may be downloaded from a computer readable storage medium to each computing / processing device or to an external computer or storage device via a network, such as the Internet, a local area network, a wide area network, or a wireless network, or a combination thereof. The network may include copper transmission cables, optical transmission fiber, wireless transmission, routers, firewalls, switches, gateway computers, or edge servers, or a combination thereof. A network adapter card or network interface in each computing / processing device receives the computer readable program instructions from the network and transfers the computer readable program instructions for storage in a computer readable storage medium in the respective computing / processing device.
[0063] The computer readable program instructions for carrying out the operations of the present invention may be either source code or object code written in any combination of one or more programming languages, including assembler instructions, instruction set architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state setting data, configuration data for an integrated circuit, or object oriented programming languages such as Smalltalk®, C++, and procedural programming languages such as the "C" programming language or similar programming languages. The computer readable program instructions may execute completely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or completely on a remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (e.g., through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), may execute computer readable program instructions by individualizing the electronic circuitry with state information of the computer readable program instructions to perform aspects of the invention.
[0064] Aspects of the present invention are described herein with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer readable program instructions.
[0065] These computer readable program instructions may be provided to a processor of a computer or other programmable data processing apparatus to manufacture a machine, such that the instructions, executed by the processor of the computer or other programmable data processing apparatus, create means for performing the functions / operations specified in one or more blocks of the flowcharts and / or block diagrams. These computer readable program instructions may also be stored on a computer readable storage medium that may direct a computer, programmable data processing apparatus, or other device, or combination thereof, to function in a particular manner, such that the computer readable storage medium having instructions stored therein includes an article of manufacture including instructions for performing aspects of the functions / operations specified in one or more blocks of the flowcharts and / or block diagrams.
[0066] Computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be executed on the computer, other programmable apparatus, or other device to generate a computer-implemented process, such that the instructions executing on the computer, other programmable apparatus, or other device perform the functions / operations specified in one or more blocks of the flowcharts and / or block diagrams.
[0067] The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowcharts or block diagrams may represent a module, segment, or part of an instruction, including one or more executable instructions for implementing a specified logical function. In some alternative implementations, the functions described in the blocks may occur out of the order described in the figures. For example, two blocks shown in succession may in fact be implemented as one step, executed simultaneously, substantially simultaneously, partially or fully overlapping in time, or the blocks may be executed in the reverse order depending on the functionality involved. It should also be noted that each block in the block diagrams and / or flowchart illustrations, and combinations of blocks in the block diagrams and / or flowchart illustrations, may be implemented by a dedicated hardware-based system that performs the specified functions or operations or executes a combination of dedicated hardware and computer instructions.
Claims
1. 1. A computer-implemented method for dynamically managing traffic signals for traffic flow optimization, the method comprising: Detecting, by one or more processors, a vehicle that is within a predetermined vicinity of a traffic signal; identifying, by the one or more processors, an incoming lane for the given vicinity of the traffic signal as a candidate lane for receiving a proceed signal from the traffic signal; calculating, by the one or more processors, a set of metrics for each candidate lane associated with the traffic signal, the set of metrics including an overall lane waiting time preferred for the candidate lane; selecting, by the one or more processors, a lane from the candidate lanes that receives the go ahead signal based on the set of metrics; calculating, by the one or more processors, an amount of time allotted for presenting the go ahead signal based on a number of vehicles to exit the selected lane; initiating, by the one or more processors, the go signal for the selected lane for the allocated time period; updating the set of metrics.
2. Calculating the amount of time to allocate to the advance signal comprises: calculating, by the one or more processors, the amount of time that the number of vehicles will be out of the selected lane based on a time function of historical vehicle throughput per time unit; The method of claim 1 , further comprising: including, by the one or more processors, additional consideration of weather factors, congestion in exit lanes, and physical topography in the given vicinity of the traffic signal.
3. Calculating the number of vehicles to exit the selected lane includes: determining, by the one or more processors, an average preferred signal waiting time for all vehicles within the given vicinity of the traffic signal; 2. The method of claim 1, further comprising: determining, by the one or more processors, as the number of vehicles to be diverted, a number of vehicles in the selected lane that have an actual waiting time that is greater than the average preferred signal waiting time.
4. Presenting the go signal and assigned time for the selected lane includes: The method of claim 1 , further comprising presenting, by the one or more processors, the go ahead signal and assigned time to lanes that do not conflict with the selected lane.
5. 2. The method of claim 1, wherein the preferred overall lane waiting time is based on preferred vehicle waiting times of vehicles in a lane and a priority percentage for the lane, the priority associated with each vehicle is based on the type of the respective vehicle, the number of occupants in the respective vehicle, and actions taken by occupants in the respective vehicle to warrant additional priority, and the waiting time per vehicle is measured from the time the respective vehicle enters the predetermined vicinity of the traffic signal to a current time.
6. The method of claim 1 , wherein the candidate lanes selected to receive the go-ahead signal include lanes that did not receive a go-ahead signal in a previous iteration and have uncongested exit lanes.
7. Updating the set of metrics includes: determining, by the one or more processors, candidate lanes for a next iteration to initiate the go signal for a next set of selected lanes; identifying, by the one or more processors, additional vehicles within the predetermined vicinity of the traffic signal after the vehicle clears the selected lane; determining, by the one or more processors, the wait time and priority percentage for the vehicle within the predetermined vicinity of the traffic signal after the vehicle exits the selected lane; 2. The method of claim 1, further comprising: determining, by the one or more processors, an overall lane waiting time and a lane priority percentage for a next candidate lane for a next iteration of presenting the proceed signal from the traffic signal.
8. Collecting the set of metrics includes: comparing, by the one or more processors, an actual throughput of vehicles during the allocation time of the proceed signal to a target number of vehicles to be cleared from the selected lane; 8. The method of claim 7, further comprising: updating, by the one or more processors, an estimated per-vehicle time metric used to calculate the allocation time of the proceeding signal.
9. The method of claim 1 , wherein selecting a lane from the candidate lanes is based on optimizing a target function that minimizes the overall waiting time of vehicles in an approach lane near the traffic signal.
10. The method of claim 1 , wherein the selection and allocation time period of a lane for the proceed signal is dynamically determined for each iteration of the traffic signal.
11. The method comprises: determining, by the one or more processors, an emergency vehicle in an emergency mode within an approach lane of the vicinity of the traffic signal; initiating, by the one or more processors, an emergency condition for the traffic signal; assigning, by the one or more processors, a high priority to a lane containing the emergency vehicle and disabling go signals in other lanes; 2. The method of claim 1, further comprising: in response to detecting that the emergency vehicle in the emergency mode is not within the vicinity of the traffic signal and that the traffic signal is still in an emergency state, resetting, by the one or more processors, a normal state for the traffic signal and initiating a next iteration.
12. Calculating the time allocated to the advance signal comprises: determining, by the one or more processors, a time for vehicles of the vehicle type receiving the proceed signal to pass through the traffic signal based on historical vehicle throughput data; determining, by the one or more processors, a vehicle type for each vehicle in the selected lane to be flushed in a current iteration; determining, by the one or more processors, a number of vehicles to exit the selected lane; and 2. The method of claim 1, further comprising: for each vehicle of the number of vehicles to exit the selected lane in a current iteration of the traffic signal, transmitting, by the one or more processors, a go signal to the selected lane that corresponds to the time determined for the vehicle type to pass through the traffic signal.
13. 2. The method of claim 1, wherein the allocated time for the go ahead signal includes considering one or a combination selected from the group consisting of conditions at the location of the traffic signal, topography in the vicinity of the traffic signal, an amount of congestion in the lanes exiting the vicinity of the traffic signal, and establishing minimum and maximum allocations of time for a period for presenting the go ahead signal.
14. The overall priority lane waiting time is: determining, by the one or more processors, a waiting time for each vehicle within the predetermined vicinity of the traffic signal and a priority percentage for each vehicle; calculating, by the one or more processors, a preferred waiting time for each of the vehicles in lanes within the predetermined vicinity of the traffic signal; 2. The method of claim 1, further comprising: generating, by the one or more processors, the preferred overall lane waiting time by summing the preferred vehicle waiting times for the vehicles in each lane within the vicinity of the traffic signal.
15. The method comprises:
2. The method of claim 1, further comprising determining, by the one or more processors, information regarding the vehicles within the predetermined vicinity of the traffic signal using one or a combination selected from the group consisting of sensors, cameras, radar, sonar, and wireless communications from the vehicles.
16. 1. A computer system for dynamically managing traffic signals for traffic flow optimization, the computer system comprising: one or more computer processors; and one or more computer readable storage media having program instructions stored thereon, the program instructions comprising: program instructions for detecting a vehicle within a predetermined vicinity of a traffic signal; program instructions for identifying an incoming lane for the given vicinity of the traffic signal as a candidate lane for receiving a proceed signal from the traffic signal; program instructions for calculating a set of metrics for each candidate lane associated with the traffic signal, the set of metrics including a preferred overall lane waiting time for the candidate lane; program instructions for selecting a lane from the candidate lanes that receives the go ahead signal based on the set of metrics; program instructions for calculating an amount of time allotted for presenting the go ahead signal based on a number of vehicles to exit the selected lane; program instructions for initiating the go signal for the selected lane for the allotted time period; and program instructions for updating the set of metrics.
17. Updating the set of metrics includes: program instructions for comparing an actual throughput of vehicles during the allocation time of the proceed signal with a target number of the vehicles to be cleared from the selected lane; determining candidate lanes for a next iteration to initiate the go signal for a next set of selected lanes; program instructions for identifying additional vehicles within the predetermined vicinity of the traffic signal after vehicles clear the selected lane; program instructions for determining the wait time and priority percentage for the vehicle within the predetermined vicinity of the traffic signal after the vehicle clears the selected lane; 20. The computer system of claim 16, further comprising program instructions for determining an overall lane waiting time and a lane priority percentage for a next candidate lane for a next iteration of presenting the proceed signal from the traffic signal.
18. 17. The computer system of claim 16, wherein the program instructions for calculating the preferred overall lane wait time are based on preferred vehicle wait times of vehicles in a lane and a priority percentage for the lane, the priority associated with each vehicle is based on the type of each vehicle, the number of occupants in each vehicle, and actions taken by the occupants of each vehicle to warrant additional priority, and the wait time per vehicle is measured from the time each vehicle enters the predetermined vicinity of the traffic signal to a current time.
19. Calculating the preferred overall lane waiting time comprises: determining, by the one or more processors, a waiting time for each vehicle within the predetermined vicinity of the traffic signal and a priority percentage for each vehicle; calculating, by the one or more processors, a preferred waiting time for each of the vehicles in lanes within the predetermined vicinity of the traffic signal; 17. The method of claim 16, further comprising: generating, by the one or more processors, the preferred overall lane waiting time by summing the preferred vehicle waiting times for the vehicles in each lane within the vicinity of the traffic signal.
20. The program instructions for calculating the time allocated to the advance signal include: program instructions for determining, based on historical vehicle throughput data, a time for vehicles of a vehicle type receiving the proceed signal to pass through the traffic signal; program instructions for determining a vehicle type for each vehicle in the selected lane to be flushed in a current iteration; program instructions for determining a number of vehicles to exit the selected lane; 17. The computer system of claim 16, further comprising: program instructions for transmitting a go signal to the selected lane corresponding to the determined time for the vehicle type to pass through the traffic signal for each vehicle of the number of vehicles to exit the selected lane in a current iteration of the traffic signal.
21. 16. A computer program product comprising a computer readable storage medium having instructions embodied therein, the instructions being executable by a processor to cause the processor to perform a method according to any one of claims 1 to 15.
Citation Information
Patent Citations
Traffic signal control method
JP2003331385A
Signal control determination device, computer program and signal control propriety determination method
JP2012178033A
Traffic light control system and traffic light control method
JP2017016554A
Traffic signal control device and traffic signal
JP2020161186A
Traffic monitoring device, traffic monitoring system, traffic monitoring method, and non-transitory computer-readable medium with program stored thereon
WO2019189218A1
