A dynamic automated lane change maneuver based on vehicle-to-vehicle communication

Automated driving is gaining increasing amounts of attention from both industry and academic communities because it is regarded as the most promising technology for improving road safety in the future. The ability to make an automated lane change is one of the most important parts of automated driving. However, there has been little research into automated lane change maneuvers, and current research has not identified a way to avoid potential collisions during lane changes, which result from the state variations of the other vehicles. One important reason is that the lane change vehicle cannot acquire accurate information regarding the other vehicles, especially the vehicles in the adjacent lane. However, vehicle-to-vehicle communication has the advantage of providing more information, and this information is more accurate than that obtained from other sensors, such as radars and lasers. Therefore, we propose a dynamic automated lane change maneuver based on vehicle-to-vehicle communication to accomplish an automated lane change and eliminate potential collisions during the lane change process. The key technologies for this maneuver are trajectory planning and trajectory tracking. Trajectory planning calculates a reference trajectory satisfying the demands of safety, comfort and traffic efficiency and updates it to avoid potential collisions until the lane change is complete. The trajectory planning method converts the planning problem into a constrained optimization problem using the lane change time and distance. This method is capable of planning a reference trajectory for a normal lane change, an emergency lane change and a change back to the original lane. A trajectory-tracking controller based on sliding mode control calculates the control inputs to make the host vehicle travel along the reference trajectory. Finally, simulations and experiments using a driving simulator are conducted. They demonstrate that the proposed dynamic automated lane change maneuver can avoid potential collisions during the lane change process effectively.     

Connectivity-based optimization of vehicle route and speed for improved fuel economy

Traditionally, vehicle route planning problem focuses on route optimization based on traffic data and surrounding environment. This paper proposes a novel extended vehicle route planning problem, called vehicle macroscopic motion planning (VMMP) problem, to optimize vehicle route and speed simultaneously using both traffic data and vehicle characteristics to improve fuel economy for a given expected trip time. The required traffic data and neighbouring vehicle dynamic parameters can be collected through the vehicle connectivity (e.g. vehicle-to-vehicle, vehicle-to-infrastructure, vehicle-to-cloud, etc.) developed rapidly in recent years. A genetic algorithm based co-optimization method, along with an adaptive real-time optimization strategy, is proposed to solve the proposed VMMP problem. It is able to provide the fuel economic route and reference speed for drivers or automated vehicles to improve the vehicle fuel economy. A co-simulation model, combining a traffic model based on SUMO (Simulation of Urban MObility) with a Simulink powertrain model, is developed to validate the proposed VMMP method. Four simulation studies, based on a real traffic network, are conducted for validating the proposed VMMP: (1) ideal traffic environment without traffic light and jam for studying the fuel economy improvement, (2) traffic environment with traffic light for validating the proposed traffic light penalty model, (3) traffic environment with traffic light and jam for validating the proposed adaptive real-time optimization strategy, and (4) investigating the effect of different powertrain platforms to fuel economy using two different vehicle platforms. Simulation results show that the proposed VMMP method is able to improve vehicle fuel economy significantly. For instance, comparing with the fastest route, the fuel economy using the proposed VMMP method is improved by up to 15%.     

Modeling lane-changing behavior in a connected environment: A game theory approach

Vehicle-to-Vehicle communications provide the opportunity to create an internet of cars through the recent advances in communication technologies, processing power, and sensing technologies. A connected vehicle receives real-time information from surrounding vehicles; such information can improve drivers’ awareness about their surrounding traffic condition and lead to safer and more efficient driving maneuvers. Lane-changing behavior, as one of the most challenging driving maneuvers to understand and to predict, and a major source of congestion and collisions, can benefit from this additional information. This paper presents a lane-changing model based on a game-theoretical approach that endogenously accounts for the flow of information in a connected vehicular environment. A calibration approach based on the method of simulated moments is presented and a simplified version of the proposed framework is calibrated against NGSIM data. The prediction capability of the simplified model is validated. It is concluded the presented framework is capable of predicting lane-changing behavior with limitations that still need to be addressed. Finally, a simulation framework based on the fictitious play is proposed. The simulation results revealed that the presented lane-changing model provides a greater level of realism than a basic gap-acceptance model.     

A multi-commodity Lighthill–Whitham–Richards model of lane-changing traffic flow

Systematic lane changes can seriously deteriorate traffic safety and efficiency inside lane-drop, merge, and other bottleneck areas. In our previous studies (Jin, 2010a, Jin, 2010b), a phenomenological model of lane-changing traffic flow was proposed, calibrated, and analyzed based on a new concept of lane-changing intensity. In this study, we further consider weaving and non-weaving vehicles as two commodities and develop a multi-commodity, behavioral Lighthill–Whitham–Richards (LWR) model of lane-changing traffic flow. Based on a macroscopic model of lane-changing behaviors, we derive a fundamental diagram with parameters determined by car-following and lane-changing characteristics as well as road geometry and traffic composition. We further calibrate and validate fundamental diagrams corresponding to a triangular car-following fundamental diagram with NGSIM data. We introduce an entropy condition for the multi-commodity LWR model and solve the Riemann problem inside a homogeneous lane-changing area. From the Riemann solutions, we derive a flux function in terms of traffic demand and supply. Then we apply the model to study lane-changing traffic dynamics inside a lane-drop area and show that the smoothing effect of HOV lanes is consistent with observations in existing studies. The new theory of lane-changing traffic flow can be readily incorporated into Cell Transmission Model, and this study could lead to better strategies for mitigating bottleneck effects of lane-changing traffic flow.     

A lane-change trajectory model from drivers’ vision view

Car-following and Lane-changing are two fundamental tasks during driving. While many car-following models can be applied, relatively, only a few lane-changing models have been developed. Classical lane-changing models mainly focus on drivers’ lane selection and gap acceptance behaviors, but very limited research has paid attention to formulating detailed lane-changing trajectories. This research aims to fill the gap by proposing a lane-changing trajectory model, which is built directly from drivers’ vision view, to model detailed lane-changing trajectories. A large amount of data of reference angles, defined as the angle changes between the drivers’ vision angle and left or right lane line, were first extracted from the videos recorded by the vehicle traveling data recorders (VTDRs) installed in 11 taxies. A comprehensive data analysis indicates that same drivers show similarity of their daily lane-changing habit but with variety, and different drivers’ lane-change trajectory data show different lane-change “personality” including aggressive or non-aggressive behaviors. Based on these findings, this paper then proposed a hyperbolic tangent lane-change trajectory model to describe drivers’ detailed lane-change trajectories. The model is verified using both real data and simulation. The results show the proposed lane-change trajectory model can successfully describe drivers’ lane-changing trajectories. More importantly, some parameters in the model are directly associated to drivers’ driving characteristics during lane-change. With this unique feature, the proposed model can generate driver-specific lane-change trajectories. Such improvement could contribute to the future development of Advanced Driver Assistance Systems (ADAS).     

Dissipation of stop-and-go waves via control of autonomous vehicles: Field experiments

Traffic waves are phenomena that emerge when the vehicular density exceeds a critical threshold. Considering the presence of increasingly automated vehicles in the traffic stream, a number of research activities have focused on the influence of automated vehicles on the bulk traffic flow. In the present article, we demonstrate experimentally that intelligent control of an autonomous vehicle is able to dampen stop-and-go waves that can arise even in the absence of geometric or lane changing triggers. Precisely, our experiments on a circular track with more than 20 vehicles show that traffic waves emerge consistently, and that they can be dampened by controlling the velocity of a single vehicle in the flow. We compare metrics for velocity, braking events, and fuel economy across experiments. These experimental findings suggest a paradigm shift in traffic management: flow control will be possible via a few mobile actuators (less than 5%) long before a majority of vehicles have autonomous capabilities.     

A platoon based cooperative eco-driving model for mixed automated and human-driven vehicles at a signalised intersection

The advancements in communication and sensing technologies can be exploited to assist the drivers in making better decisions. In this paper, we consider the design of a real-time cooperative eco-driving strategy for a group of vehicles with mixed automated vehicles (AVs) and human-driven vehicles (HVs). The lead vehicles in the platoon can receive the signal phase and timing information via vehicle-to-infrastructure (V2I) communication and the traffic states of both the preceding vehicle and current platoon via vehicle-to-vehicle (V2V) communication. We propose a receding horizon model predictive control (MPC) method to minimise the fuel consumption for platoons and drive the platoons to pass the intersection on a green phase. The method is then extended to dynamic platoon splitting and merging rules for cooperation among AVs and HVs in response to the high variation in urban traffic flow. Extensive simulation tests are also conducted to demonstrate the performance of the model in various conditions in the mixed traffic flow and different penetration rates of AVs. Our model shows that the cooperation between AVs and HVs can further smooth out the trajectory of the latter and reduce the fuel consumption of the entire traffic system, especially for the low penetration of AVs. It is noteworthy that the proposed model does not compromise the traffic efficiency and the driving comfort while achieving the eco-driving strategy.     

Spatial and temporal characterization of travel patterns in a traffic network using vehicle trajectories

This paper presents a trajectory clustering method to discover spatial and temporal travel patterns in a traffic network. The study focuses on identifying spatially distinct traffic flow groups using trajectory clustering and investigating temporal traffic patterns of each spatial group. The main contribution of this paper is the development of a systematic framework for clustering and classifying vehicle trajectory data, which does not require a pre-processing step known as map-matching and directly applies to trajectory data without requiring the information on the underlying road network. The framework consists of four steps: similarity measurement, trajectory clustering, generation of cluster representative subsequences, and trajectory classification. First, we propose the use of the Longest Common Subsequence (LCS) between two vehicle trajectories as their similarity measure, assuming that the extent to which vehicles’ routes overlap indicates the level of closeness and relatedness as well as potential interactions between these vehicles. We then extend a density-based clustering algorithm, DBSCAN, to incorporate the LCS-based distance in our trajectory clustering problem. The output of the proposed clustering approach is a few spatially distinct traffic stream clusters, which together provide an informative and succinct representation of major network traffic streams. Next, we introduce the notion of Cluster Representative Subsequence (CRS), which reflects dense road segments shared by trajectories belonging to a given traffic stream cluster, and present the procedure of generating a set of CRSs by merging the pairwise LCSs via hierarchical agglomerative clustering. The CRSs are then used in the trajectory classification step to measure the similarity between a new trajectory and a cluster. The proposed framework is demonstrated using actual vehicle trajectory data collected from New York City, USA. A simple experiment was performed to illustrate the use of the proposed spatial traffic stream clustering in application areas such as network-level traffic flow pattern analysis and travel time reliability analysis.     

Stochastic eco-routing in a signalized traffic network

In this paper, an eco-routing algorithm is developed for vehicles in a signalized traffic network. The proposed method incorporates a microscopic vehicle emission model into a Markov decision process (MDP). Instead of using GPS-based vehicle trajectory data, which are used by many existing eco-routing algorithm, high resolution traffic data including vehicle arrival and signal status information are used as primary inputs. The proposed method can work with any microscopic vehicle model that uses vehicle trajectories as inputs and gives related emission rates as outputs. Furthermore, a constrained eco-routing problem is proposed to deal with the situation where multiple costs present. This is done by transferring the original MDP based formulation to a linear programming formulation. Besides the primary cost, additional costs are considered as constraints. Two numerical examples are given using the field data obtained from City of Pasadena, California, USA. The eco-routing algorithm for single objective is compared against the traditional shortest path algorithm, Dijkstra’s algorithm. Average reductions of CO emission around 20% are observed.     

A virtual vehicle probe model for time-dependent travel time estimation on signalized arterials

Estimation of time-dependent arterial travel time is a challenging task because of the interrupted nature of urban traffic flows. Many research efforts have been devoted to this topic, but their successes are limited and most of them can only be used for offline purposes due to the limited availability of traffic data from signalized intersections. In this paper, we describe a real-time arterial data collection and archival system developed at the University of Minnesota, followed by an innovative algorithm for time-dependent arterial travel time estimation using the archived traffic data. The data collection system simultaneously collects high-resolution “event-based” traffic data including every vehicle actuations over loop detector and every signal phase changes from multiple intersections. Using the “event-based” data, we estimate time-dependent travel time along an arterial by tracing a virtual probe vehicle. At each time step, the virtual probe has three possible maneuvers: acceleration, deceleration and no-speed-change. The maneuver decision is determined by its own status and surrounding traffic conditions, which can be estimated based on the availability of traffic data at intersections. An interesting property of the proposed model is that travel time estimation errors can be self-corrected, because the trajectory differences between a virtual probe vehicle and a real one can be reduced when both vehicles meet a red signal phase and/or a vehicle queue. Field studies at a 11-intersection arterial corridor along France Avenue in Minneapolis, MN, demonstrate that the proposed model can generate accurate time-dependent travel times under various traffic conditions.     

Automated cars: Queue discharge at signalized intersections with ‘Assured-Clear-Distance-Ahead’ driving strategies

This study addresses the impacts of automated cars on traffic flow at signalized intersections. We develop and subsequently employ a deterministic simulation model of the kinematics of automated cars at a signalized intersection approach, when proceeding forward from a stationary queue at the beginning of a signal phase. In the discrete-time simulation, each vehicle pursues an operational strategy that is consistent with the ‘Assured Clear Distance Ahead’ criterion: each vehicle limits its speed and spacing from the vehicle ahead of it by its objective of not striking it, regardless of whether or not the future behavior of the vehicle ahead is cooperative. The simulation incorporates a set of assumptions regarding the values of operational parameters that will govern automated cars’ kinematics in the immediate future, which are sourced from the relevant literature.We report several findings of note. First, under a set of assumed ‘central’ (i.e. most plausible) parameter values, the time requirement to process a standing queue of ten vehicles is decreased by 25% relative to human driven vehicles. Second, it was found that the standard queue discharge model for human–driven cars does not directly transfer to queue discharge of automated vehicles. Third, a wet roadway surface may result in an increase in capacity at signalized intersections. Fourth, a specific form of vehicle-to-vehicle (V2V) communications that allows all automated vehicles in the stationary queue to begin moving simultaneously at the beginning of a signal phase provides relatively minor increases in capacity in this analysis. Fifth, in recognition of uncertainty regarding the value of each operational parameter, we identify (via scenario analysis, calculation of arc elasticities, and Monte-Carlo methods) the relative sensitivity of overall traffic flow efficiency to the value of each operational parameter.This study comprises an incremental step towards the broader objective of adapting standard techniques for analyzing traffic operations to account for the capabilities of automated vehicles.     

Isolated intersection control for various levels of vehicle technology: Conventional,connected, and automated vehicles

Connected vehicle technology can be beneficial for traffic operations at intersections. The information provided by cars equipped with this technology can be used to design a more efficient signal control strategy. Moreover, it can be possible to control the trajectory of automated vehicles with a centralized controller. This paper builds on a previous signal control algorithm developed for connected vehicles in a simple, single intersection. It improves the previous work by (1) integrating three different stages of technology development; (2) developing a heuristics to switch the signal controls depending on the stage of technology; (3) increasing the computational efficiency with a branch and bound solution method; (4) incorporating trajectory design for automated vehicles; (5) using a Kalman filter to reduce the impact of measurement errors on the final solution. Three categories of vehicles are considered in this paper to represent different stages of this technology: conventional vehicles, connected but non-automated vehicles (connected vehicles), and automated vehicles. The proposed algorithm finds the optimal departure sequence to minimize the total delay based on position information. Within each departure sequence, the algorithm finds the optimal trajectory of automated vehicles that reduces total delay. The optimal departure sequence and trajectories are obtained by a branch and bound method, which shows the potential of generalizing this algorithm to a complex intersection.Simulations are conducted for different total flows, demand ratios and penetration rates of each technology stage (i.e. proportion of each category of vehicles). This algorithm is compared to an actuated signal control algorithm to evaluate its performance. The simulation results show an evident decrease in the total number of stops and delay when using the connected vehicle algorithm for the tested scenarios with information level of as low as 50%. Robustness of this algorithm to different input parameters and measurement noises are also evaluated. Results show that the algorithm is more sensitive to the arrival pattern in high flow scenarios. Results also show that the algorithm works well with the measurement noises. Finally, the results are used to develop a heuristic to switch between the different control algorithms, according to the total demand and penetration rate of each technology.     

A kinematic wave theory of lane-changing traffic flow

Frequent lane-changes in highway merging, diverging, and weaving areas could disrupt traffic flow and, even worse, lead to accidents. In this paper, we propose a simple model for studying bottleneck effects of lane-changing traffic and aggregate traffic dynamics of a roadway with lane-changing areas. Based on the observation that, when changing its lane, a vehicle affects traffic on both its current and target lanes, we propose to capture such lateral interactions by introducing a new lane-changing intensity variable. With a modified fundamental diagram, we are able to study the impacts of lane-changing traffic on overall traffic flow. In addition, the corresponding traffic dynamics can be described with a simple kinematic wave model. For a location-dependent lane-changing intensity variable, we discuss kinematic wave solutions of the Riemann problem of the new model and introduce a supply–demand method for its numerical solutions. With both theoretical and empirical analysis, we demonstrate that lane-changes could have significant bottleneck effects on overall traffic flow. In the future, we will be interested in studying lane-changing intensities for different road geometries, locations, on-ramp/off-ramp flows, as well as traffic conditions. The new modeling framework could be helpful for developing ramp-metering and other lane management strategies to mitigate the bottleneck effects of lane-changes.     

Impact of heavy vehicles on surrounding traffic characteristics

This work examines the impact of heavy vehicle movements on measured traffic characteristics in detail. Although the number of heavy vehicles within the traffic stream is only a small percentage, their impact is prominent. Heavy vehicles impose physical and psychological effects on surrounding traffic flow because of their length and size (physical) and acceleration/deceleration (operational) characteristics. The objective of this work is to investigate the differences in traffic characteristics in the vicinity of heavy vehicles and passenger cars. The analysis focuses on heavy traffic conditions (level of service E) using a trajectory data of highway I‐80 in California. The results show that larger front and rear space gaps exist for heavy vehicles compared with passenger cars. This may be because of the limitations in manoeuvrability of heavy vehicles and the safety concerns of the rear vehicle drivers, respectively. In addition, heavy vehicle drivers mainly keep a constant speed and do not change their speed frequently. This work also examines the impact of heavy vehicles on their surrounding traffic in terms of average travel time and number of lane changing manoeuvres using Advanced Interactive Microscopic Simulator for Urban and Non‐Urban Networks (AIMSUN) microscopic traffic simulation package. According to the results, the average travel time increases when proportion of heavy vehicles rises in each lane. To reflect the impact of heavy vehicles on average travel time, a term related to heavy vehicle percentage is introduced into two different travel time equations, Bureau of Public Roads and Akçelik's travel time equations. The results show that using an exclusive term for heavy vehicles can better estimate the travel times for more than 10%. Finally, number of passenger car lane changing manoeuvres per lane will be more frequent when more heavy vehicles exist in that lane. The influence of heavy vehicles on the number of passenger car lane changing is intensified in higher traffic densities and higher percentage of heavy vehicles. Large numbers of lane changing manoeuvres can increase the number of traffic accidents and potentially reduce traffic safety. The results show an increase of 5% in the likelihood of accidents, when percentage of heavy vehicles increases to 30% of total traffic. Copyright © 2014 John Wiley & Sons, Ltd.     

Spatiotemporal intersection control in a connected and automated vehicle environment

Current research on traffic control has focused on the optimization of either traffic signals or vehicle trajectories. With the rapid development of connected and automated vehicle (CAV) technologies, vehicles equipped with dedicated short-range communications (DSRC) can communicate not only with other CAVs but also with infrastructure. Joint control of vehicle trajectories and traffic signals becomes feasible and may achieve greater benefits regarding system efficiency and environmental sustainability. Traffic control framework is expected to be extended from one dimension (either spatial or temporal) to two dimensions (spatiotemporal). This paper investigates a joint control framework for isolated intersections. The control framework is modeled as a two-stage optimization problem with signal optimization at the first stage and vehicle trajectory control at the second stage. The signal optimization is modeled as a dynamic programming (DP) problem with the objective to minimize vehicle delay. Optimal control theory is applied to the vehicle trajectory control problem with the objective to minimize fuel consumption and emissions. A simplified objective function is adopted to get analytical solutions to the optimal control problem so that the two-stage model is solved efficiently. Simulation results show that the proposed joint control framework is able to reduce both vehicle delay and emissions under a variety of demand levels compared to fixed-time and adaptive signal control when vehicle trajectories are not optimized. The reduced vehicle delay and CO₂ emissions can be as much as 24.0% and 13.8%, respectively for a simple two-phase intersection. Sensitivity analysis suggests that maximum acceleration and deceleration rates have a significant impact on the performance regarding both vehicle delay and emission reduction. Further extension to a full eight-phase intersection shows a similar pattern of delay and emission reduction by the joint control framework.     

基于元胞自动机的双车道变道交通流特性研究

在庞杂的城市交通环境下,驾驶员为了寻求更快的速度,常常采用主动的换道行为。由于汽车使用量逐年增长,换道引起的交通事故经常发生。研究车辆变道行为,寻求有效措施减少交通事故的发生,对提高道路安全性具有积极的意义。本文以多车道系统中车辆变道行为为研究对象,以元胞自动机理论为基础,对比分析单向单车道、单向双车道换道行为,并运用MATLAB仿真软件进行分析,获得变道交通流的相关特性曲线。     

Optimal vehicle trajectory planning in the context of cooperative merging on highways

One of the main triggers of traffic congestion on highways is vehicle merging at on-ramps. The development of automated procedures for cooperative vehicle merging is aimed to ensure safety and alleviate congestion problems. In this work, a longitudinal trajectory planning methodology is presented, developed to assist the merging of vehicles on highways; it achieves safe and traffic-efficient merging, while minimizing the engine effort and passenger discomfort through the minimization of acceleration and its first and second derivatives during the merging maneuver. The problem is formulated as a finite-horizon optimal control problem and is solved analytically. This enables the solution to be stored on-board, saving computational time and rendering the methodology suitable for practical applications. The tunable weights, used for taking into account the different optimization criteria, may serve as parameters to match the individual driver’s preferences. The proposed methodology is first developed for a pair of cooperating vehicles, a merging one and its putative leader. Moreover, an alternative solution procedure via a time-variant Linear-Quadratic Regulator approach is also presented. A Model Predictive Control (MPC) scheme is utilized to compensate possible disturbances in the trajectories of the cooperating vehicles, whereby the analytical optimal solution is applied repeatedly in real time, using updated measurements, until the merging procedure is actually finalized. Subsequently, the methodology is generalized for a set of vehicles inside the merging area. Various numerical simulations illustrate the validity and applicability of the method.     

An evaluation framework for traffic calming measures in residential areas

The paper evaluates the effectiveness of various traffic calming measures from the perspectives of traffic performance and safety, and environmental and public health impacts. The proposed framework was applied to four calming measures – two types of speed humps, speed tables, and chicanes – to demonstrate its usefulness and applicability. A field experiment using probe vehicles equipped with global positioning system devices was conducted to obtain vehicle trajectory data for use in more realistic simulations. In addition, a recently developed vehicle emissions model was used for more accurate evaluation of environmental and public health impacts. The results show that chicane is better than the other types of traffic calming measures considered, except in terms of vehicle emissions.     

Experimental validation of connected automated vehicle design among human-driven vehicles

In this paper, we present results regarding the experimental validation of connected automated vehicle design. In order for a connected automated vehicle to integrate well with human-dominated traffic, we propose a class of connected cruise control algorithms with feedback structure originated from human driving behavior. We test the connected cruise controllers using real vehicles under several driving scenarios while utilizing beyond-line-of-sight motion information obtained from neighboring human-driven vehicles via vehicle-to-everything (V2X) communication. We experimentally show that the design is robust against variations in human behavior as well as changes in the topology of the communication network. We demonstrate that both safety and energy efficiency can be significantly improved for the connected automated vehicle as well as for the neighboring human-driven vehicles and that the connected automated vehicle may bring additional societal benefits by mitigating traffic waves.     

Connected cruise control among human-driven vehicles: Experiment-based parameter estimation and optimal control design

In this paper, we consider connected cruise control design in mixed traffic flow where most vehicles are human-driven. We first propose a sweeping least square method to estimate in real time feedback gains and driver reaction time of human-driven vehicles around the connected automated vehicle. Then we propose an optimal connected cruise controller based on the mean dynamics of human driving behavior. We test the performance of both the estimation algorithm and the connected cruise control algorithm using experimental data. We demonstrate that by combining the proposed estimation algorithm and the optimal controller, the connected automated vehicle has significantly improved performance compared to a human-driven vehicle.