Author: Larry Hardesty | MIT News Office<\/p>\n
In the field of self-driving cars, algorithms for controlling lane changes are an important topic of study. But most existing lane-change algorithms have one of two drawbacks: Either they rely on detailed statistical models of the driving environment, which are difficult to assemble and too complex to analyze on the fly; or they\u2019re so simple that they can lead to impractically conservative decisions, such as never changing lanes at all.<\/p>\n
At the International Conference on Robotics and Automation tomorrow, researchers from MIT\u2019s Computer Science and Artificial Intelligence Laboratory (CSAIL) will present a new lane-change algorithm that splits the difference. It allows for more aggressive lane changes than the simple models do but relies only on immediate information about other vehicles\u2019 directions and velocities to make decisions.<\/p>\n
\u201cThe motivation is, \u2018What can we do with as little information as possible?\u2019\u201d says Alyssa Pierson, a postdoc at CSAIL and first author on the new paper. \u201cHow can we have an autonomous vehicle behave as a human driver might behave? What is the minimum amount of information the car needs to elicit that human-like behavior?\u201d<\/p>\n
Pierson is joined on the paper by Daniela Rus, the Viterbi Professor of Electrical Engineering and Computer Science; Sertac Karaman, associate professor of aeronautics and astronautics; and Wilko Schwarting, a graduate student in electrical engineering and computer science.<\/p>\n
\u201cThe optimization solution will ensure navigation with lane changes that can model an entire range of driving styles, from conservative to aggressive, with safety guarantees,\u201d says Rus, who is the director of CSAIL.<\/p>\n
One standard way for autonomous vehicles to avoid collisions is to calculate buffer zones around the other vehicles in the environment. The buffer zones describe not only the vehicles\u2019 current positions but their likely future positions within some time frame. Planning lane changes then becomes a matter of simply staying out of other vehicles\u2019 buffer zones.<\/p>\n
For any given method of computing buffer zones, algorithm designers must prove that it guarantees collision avoidance, within the context of the mathematical model used to describe traffic patterns. That proof can be complex, so the optimal buffer zones are usually computed in advance. During operation, the autonomous vehicle then calls up the precomputed buffer zones that correspond to its situation.<\/p>\n
The problem is that if traffic is fast enough and dense enough, precomputed buffer zones may be too restrictive. An autonomous vehicle will fail to change lanes at all, whereas a human driver would cheerfully zip around the roadway.<\/p>\n
With the MIT researchers\u2019 system, if the default buffer zones are leading to performance that\u2019s far worse than a human driver\u2019s, the system will compute new buffer zones on the fly \u2014 complete with proof of collision avoidance.<\/p>\n
That approach depends on a mathematically efficient method of describing buffer zones, so that the collision-avoidance proof can be executed quickly. And that\u2019s what the MIT researchers developed.<\/p>\n
They begin with a so-called Gaussian distribution \u2014 the familiar bell-curve probability distribution. That distribution represents the current position of the car, factoring in both its length and the uncertainty of its location estimation.<\/p>\n
Then, based on estimates of the car\u2019s direction and velocity, the researchers\u2019 system constructs a so-called logistic function. Multiplying the logistic function by the Gaussian distribution skews the distribution in the direction of the car\u2019s movement, with higher speeds increasing the skew.<\/p>\n
The skewed distribution defines the vehicle\u2019s new buffer zone. But its mathematical description is so simple \u2014 using only a few equation variables \u2014 that the system can evaluate it on the fly.<\/p>\n
The researchers tested their algorithm in a simulation including up to 16 autonomous cars driving in an environment with several hundred other vehicles.<\/p>\n
\u201cThe autonomous vehicles were not in direct communication but ran the proposed algorithm in parallel without conflict or collisions,\u201d explains Pierson.\u00a0\u201cEach car used a different risk threshold that produced a different driving style, allowing us to create conservative and aggressive drivers. Using the static, precomputed buffer zones would only allow for conservative driving, whereas our dynamic algorithm allows for a broader range of driving styles.\u201d<\/p>\n
This project was supported, in part, by the Toyota Research Institute and the Office of Naval Research.<\/p>\n<\/div>\n
Go to Source<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"