Graphic: Christine Daniloff

In 2008, according to the National Highway Traffic Safety Administration, 2.3 million automobile crashes occurred at intersections across the United States, resulting in some 7,000 deaths. More than 700 of those fatalities were due to drivers running red lights. But, according to the Insurance Institute for Highway Safety, half of the people killed in such accidents are not the drivers who ran the light, but other drivers, passengers and pedestrians.

In order to reduce the number of accidents at intersections, researchers at MIT have devised an that predicts when an oncoming car is likely to run a red light. Based on parameters such as the vehicle鈥檚 deceleration and its distance from a light, the group was able to determine which cars were potential 鈥渧iolators鈥 鈥 those likely to cross into an intersection after a light has turned red 鈥 and which were 鈥渃ompliant.鈥

The researchers tested the algorithm on data collected from an intersection in Virginia, finding that it accurately identified potential violators within a couple of seconds of reaching a red light 鈥 enough time, according to the researchers, for other drivers at an intersection to be able to react to the threat if alerted. Compared to other efforts to model driving behavior, the MIT algorithm generated fewer false alarms, an important advantage for systems providing guidance to human drivers. The researchers report their findings in a paper that will appear in the journal IEEE Transactions on Intelligent Transportation Systems.

Jonathan How, the Richard Cockburn Maclaurin Professor of Aeronautics and Astronautics at MIT, says 鈥渟mart鈥 cars of the future may use such algorithms to help drivers anticipate and avoid potential .

鈥淚f you had some type of heads-up display for the driver, it might be something where the algorithms are analyzing and saying, 鈥榃e鈥檙e concerned,鈥欌 says How, who is one of the paper鈥檚 authors. 鈥淓ven though your light might be green, it may recommend you not go, because there are people behaving badly that you may not be aware of.鈥

How says that in order to implement such warning systems, vehicles would need to be able to 鈥渢alk鈥 with each other, wirelessly sending and receiving information such as a car鈥檚 speed and position data. Such vehicle-to-vehicle (V2V) communication, he says, can potentially improve safety and avoid traffic congestion. Today, the U.S. Department of Transportation (DOT) is exploring V2V technology, along with several major car manufacturers 鈥 including Ford Motor Company, which this year has been road-testing prototypes with advanced Wi-Fi and collision-avoidance systems.  

Video: See the team鈥檚 algorithm in action as robots are able to negotiate a busy intersection and avoid potential accidents.

鈥淵ou might have a situation where you get a snowball effect where, much more rapidly than people envisioned, this [V2V] technology may be accepted,鈥 How says.

In the meantime, researchers including How are developing algorithms to analyze vehicle data that would be broadcast via such V2V systems. Georges Aoude SM 鈥07, PhD 鈥11, a former student of How鈥檚, designed an algorithm based on a technique that has been successfully applied in many artificial intelligence domains, but is relatively new to the transportation field. This algorithm is able to capture a vehicle鈥檚 motion in multiple dimensions using a highly accurate and efficient classifier that can be executed in less than five milliseconds.

Along with colleagues Vishnu Desaraju SM 鈥10 and Lauren Stephens, an MIT undergraduate, How and Aoude tested the algorithm using an extensive set of traffic data collected at a busy intersection in Christianburg, Va. The intersection was heavily monitored as part of a safety-prediction project sponsored by the DOT. The DOT outfitted the intersection with a number of instruments that tracked vehicle speed and location, as well as when lights turned red.

Aoude and colleagues applied their algorithm to data from more than 15,000 approaching vehicles at the intersection, and found that it was able to correctly identify red-light violators 85 percent of the time 鈥 an improvement of 15 to 20 percent over existing algorithms.  

The researchers were able to predict, within a couple of seconds, whether a car would run a . The researchers actually found a 鈥渟weet spot鈥 鈥 one to two seconds in advance of a potential collision 鈥 when the algorithm has the highest accuracy and when a driver may still have enough time to react.

Compared to similar safety-prediction technologies, the group found that its algorithm generated fewer false positives. How says this may be due to the algorithm鈥檚 ability to analyze multiple parameters. He adds that other algorithms tend to be 鈥渟kittish,鈥 erring on the side of caution in flagging potential problems, which may itself be a problem when cars are outfitted with such technology.

鈥淭he challenge is, you don鈥檛 want to be overly pessimistic,鈥 How says. 鈥淚f you鈥檙e too pessimistic, you start reporting there鈥檚 a problem when there really isn鈥檛, and then very rapidly, the human鈥檚 going to push a button that turns this thing off.鈥

John Dolan, a principal systems scientist at Carnegie Mellon University鈥檚 Robotics Institute, points out that such algorithms will ultimately need to evaluate a wide variety of intersections. While the MIT team looked at just one intersection, Dolan says its results are encouraging.  

鈥淸They] use real driving data 鈥 to make more nuanced judgments about whether an approaching vehicle will comply with the intersection rules,鈥 says Dolan, who develops algorithms to aid defensive driving. 鈥淭hese methods are more computationally expensive, but give more accurate results.鈥

The researchers are now investigating ways to design a closed-loop system 鈥 to give drivers a recommendation of what to do in response to a potential accident 鈥 and are also planning to adapt the existing algorithm to air traffic control, to predict the behavior of aircraft.


This story is republished courtesy of MIT News (), a popular site that covers news about MIT research, innovation and teaching.