Vehicle platoon formation using interpolating control: A laboratory experimental analysis

This work addresses the formation phase of automatic platooning. The objective is to optimally control the throttle of vehicles, with a given arbitrary initial condition, such that desired ground speed and inter-vehicular spacings are reached. The steering of the vehicles is also controlled, because the vehicles should track a desired path while forming the platoon. In order to address the platoon formation problem, a cooperative strategy is formed by constructing a discrete state space model which represents the dynamics of a set of n vehicles. Once this model is set, a control method known as Interpolating Control, which aims at regulating to the origin an uncertain and/or time-varying linear discrete-time system with state and control constraints, is utilized. The performance of this control method is evaluated and compared with other approaches such as Model Predictive Control (MPC).Simulations are conducted which suggest that the Interpolating Control approach can be seen as an alternative to optimization-based control schemes such as Model Predictive Control, especially for problems for which finding the optimal solution requires calculations, where the Interpolating Control approach can provide a straightforward sub-optimal solution.In the experimental part of this work, the control algorithms for the platoon formation and path tracking problems are combined, and tested in a laboratory environment, using three mobile robots equipped with wireless routers. Validation of the proposed models and control algorithms is achieved by successful experiments.     

Length-based vehicle classification using event-based loop detector data

Length-based vehicle classification is an important topic in traffic engineering, because estimation of traffic speed from single loop detectors usually requires the knowledge of vehicle length. In this paper, we present an algorithm that can classify vehicles passing by a loop detector into two categories: long vehicles and regular cars. The proposed algorithm takes advantage of event-based loop detector data that contains every vehicle detector actuation and de-actuation “event”, therefore time gaps between consecutive vehicles and detector occupation time for each vehicle can be easily derived. The proposed algorithm is based on an intuitive observation that, for a vehicle platoon, longer vehicles in the platoon will have relatively longer detector occupation time. Therefore, we can identify longer vehicles by examining the changes of occupation time in a vehicle platoon. The method was tested using the event-based data collected from Trunk Highway 55 in Minnesota, which is a high speed arterial corridor controlled by semi-actuated coordinated traffic signals. The result shows that the proposed method can correctly classify most of the vehicles passing by a single loop detector.     

Characterising Green Light Optimal Speed Advisory trajectories for platoon-based optimisation

Conceptually, a Green Light Optimal Speed Advisory (GLOSA) system suggests speeds to vehicles, allowing them to pass through an intersection during the green interval. In previous papers, a single speed is computed for each vehicle in a range between acceptable minimum and maximum values (for example between standstill and the speed limit). This speed is assumed to be constant until the beginning of the green interval, and sent as advice to the vehicle. The goal is to optimise for a particular objective, whether it be minimisation of emissions (for environmental reasons), fuel usage or delay. This paper generalises the advice given to a vehicle, by optimising for delay over the entire trajectory instead of suggesting an individual speed, regardless of initial conditions – time until green, distance to intersection and initial speed. This may require multiple acceleration manoeuvres, so the advice is sent as a suggested acceleration at each time step. Such advice also takes into account a suitable safety constraint, ensuring that vehicles are always able to stop before the intersection during a red interval, thus safeguarding against last-minute signal control schedule changes. While the algorithms developed primarily minimise delay, they also help to reduce fuel usage and emissions by conserving kinetic energy. Since vehicles travel in platoons, the effectiveness of a GLOSA system is heavily reliant on correctly identifying the leading vehicle that is the first to be given trajectory advice for each cycle. Vehicles naturally form a platoon behind this leading vehicle. A time loop technique is proposed which allows accurate identification of the leader even when there are complex interactions between preceding vehicles. The developed algorithms are ideal for connected autonomous vehicle environments, because computer control allows vehicles’ trajectories to be managed with greater accuracy and ease. However, the advice algorithms can also be used in conjunction with manual control provided Vehicle-to-Infrastructure (V2I) communication is available.     

Eco-driving advisory strategies for a platoon of mixed gasoline and electric vehicles in a connected vehicle system

As electric vehicles (EVs) have gained an increasing market penetration rate, the traffic on urban roads will tend to be a mix of traditional gasoline vehicles (GVs) and EVs. These two types of vehicles have different energy consumption characteristics, especially the high energy efficiency and energy recuperation system of EVs. When GVs and EVs form a platoon that is recognized as an energy-friendly traffic pattern, it is critical to holistically consider the energy consumption characteristics of all vehicles to maximize the energy efficiency benefit of platooning. To tackle this issue, this paper develops an optimal control model as a foundation to provide eco-driving suggestions to the mixed-traffic platoon. The proposed model leverages the promising connected vehicle technology assuming that the speed advisory system can obtain the information on the characteristics of all platoon vehicles. To enhance the model applicability, the study proposes two eco-driving advisory strategies based on the developed optimal control model. One strategy provides the lead vehicle an acceleration profile, while the other provides a set of targeted cruising speeds. The acceleration-based eco-driving advisory strategy is suitable for platoons with an automated leader, and the speed-based advisory strategy is more friendly for platoons with a human-operated leader. Results of numerical experiments demonstrate the significance when the eco-driving advisory system holistically considers energy consumption characteristics of platoon vehicles.     

The Hybrid Vehicle Routing Problem

In this paper the Hybrid Vehicle Routing Problem (HVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles can work both electrically and with traditional fuel. The vehicle may change propulsion mode at any point of time. The unitary travel cost is much lower for distances covered in the electric mode. An electric battery has a limited capacity and may be recharged at a recharging station (RS). A limited number of RS are available. Once a battery has been completely discharged, the vehicle automatically shifts to traditional fuel propulsion mode. Furthermore, a maximum route duration is imposed according to contracts regulations established with the driver. In this paper, a Mixed Integer Linear Programming formulation is presented and a Large Neighborhood Search based Matheuristic is proposed. The algorithm starts from a feasible solution and consists into destroying, at each iteration, a small number of routes, letting unvaried the other ones, and reconstructing a new feasible solution running the model on only the subset of customers involved in the destroyed routes. This procedure allows to completely explore a large neighborhood within very short computational time. Computational tests that show the performance of the matheuristic are presented. The method has also been tested on a simplified version of the HVRP already presented in the literature, the Green Vehicle Routing Problem (GVRP), and competitive results have been obtained.     

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.     

Prediction of vehicle CO2 emission and its application to eco-routing navigation

Transportation sector accounts for a large proportion of global greenhouse gas and toxic pollutant emissions. Even though alternative fuel vehicles such as all-electric vehicles will be the best solution in the future, mitigating emissions by existing gasoline vehicles is an alternative countermeasure in the near term. The aim of this study is to predict the vehicle CO₂ emission per kilometer and determine an eco-friendly path that results in minimum CO₂ emissions while satisfying travel time budget. The vehicle CO₂ emission model is derived based on the theory of vehicle dynamics. Particularly, the difficult-to-measure variables are substituted by parameters to be estimated. The model parameters can be estimated by using the current probe vehicle systems. An eco-routing approach combining the weighting method and k-shortest path algorithm is developed to find the optimal path along the Pareto frontier. The vehicle CO₂ emission model and eco-routing approach are validated in a large-scale transportation network in Toyota city, Japan. The relative importance analysis indicates that the average speed has the largest impact on vehicle CO₂ emission. Specifically, the benefit trade-off between CO₂ emission reduction and the travel time buffer is discussed by carrying out sensitivity analysis in a network-wide scale. It is found that the average reduction in CO₂ emissions achieved by the eco-friendly path reaches a maximum of around 11% when the travel time buffer is set to around 10%.     

Development of a driving cycle for fuel economy in a developing country

A driving cycle corresponding to the driving conditions of a particular country is of decisive importance for fuel economy evaluation of vehicles and automobile engines. The driving pattern was studied in Delhi along four representative routes using a test car equipped with all the instruments required for recording modes of traffic and measuring fuel consumption. An analysis of the field trials results has shown that relative time spent under different modes (cruising, acceleration, etc.) does not practically depend upon a route and rush-or-non rush conditions. Fuel consumption is a function of the average speed and trip length. A four-mode driving cycle has been developed to simulate actual driving conditions with respect to fuel consumption. In comparison with driving cycles of developed countries, the driving cycle has significantly different average speed and relative time spent under acceleration and deceleration. The cycle may be used as a standardized method to evaluate fuel efficiency of vehicles and automobile engines and effect of various gadgets on its improvement.     

Vehicle sorting for platoon formation: Impacts on highway entry and throughput

Automated highway systems (AHS) are intended to increase the throughput and safety of roadways through computer control, communication and sensing. In the “platoon” concept for AHS, vehicles travel on highways in closely spaced groups. To maximize benefits, it is desirable to form platoons that are reasonably large (five or more vehicles), and it is also desirable to ensure that platoons remain intact for considerable distances. This paper develops and evaluates strategies for organizing vehicles into platoons at highway entrances, with the objective of maximizing the distance that platoons stay intact, so that they do not need to be regrouped into new platoons on the highway itself. Fundamentally, this entails grouping vehicles according to their destination. We evaluate various strategies in which vehicles are sorted on entrance ramps, with respect to platoon sizes, throughput and platoon formation time.     

Optimum routing of battery electric vehicles: Insights using empirical data and microsimulation

This study investigates the energy consumption impact of route selection on battery electric vehicles (BEVs) using empirical second-by-second Global Positioning System (GPS) commute data and traffic micro-simulation data. Drivers typically choose routes that reduce travel time and therefore travel cost. However, BEVs’ limited driving range makes energy efficient route selection of particular concern to BEV drivers. In addition, BEVs’ regenerative braking systems allow for the recovery of energy while braking, which is affected by route choices. State-of-the-art BEV energy consumption models consider a simplified constant regenerative braking energy efficiency or average speed dependent regenerative braking factors. To overcome these limitations, this study adopted a microscopic BEV energy consumption model, which captures the effect of transient behavior on BEV energy consumption and recovery while braking in a congested network. The study found that BEVs and conventional internal combustion engine vehicles (ICEVs) had different fuel/energy-optimized traffic assignments, suggesting that different routings be recommended for electric vehicles. For the specific case study, simulation results indicate that a faster route could actually increase BEV energy consumption, and that significant energy savings were observed when BEVs utilized a longer travel time route because energy is regenerated. Finally, the study found that regenerated energy was greatly affected by facility types and congestion levels and also BEVs’ energy efficiency could be significantly influenced by regenerated energy.     

Validation of a schedule‐based capacity restraint transit assignment model for a large‐scale network

This paper describes the application of a capacity restraint trip assignment algorithm to a real, large‐scale transit network and the validation of the results. Unlike the conventional frequency‐based approach, the network formulation of the proposed model is dynamic and schedule‐based. Transit vehicles are assumed to operate to a set of pre‐determined schedules. Passengers are assumed to select paths based on a generalized cost function including in‐vehicle and out‐of‐vehicle time and line change penalty. The time‐varying passenger demand is loaded onto the network by a time increment simulation method, which ensures that the capacity restraint of each vehicle during passenger boarding is strictly observed. The optimal‐path and path‐loading algorithms are applied iteratively by the method of successive averages until the network converges to the predictive dynamic user equilibrium. The Hong Kong Mass Transit Railway network is used to validate the model results. The potential applications of the model are also discussed.     

Decomposing travel times measured by probe-based traffic monitoring systems to individual road segments

In probe-based traffic monitoring systems, traffic conditions can be inferred based on the position data of a set of periodically polled probe vehicles. In such systems, the two consecutive polled positions do not necessarily correspond to the end points of individual links. Obtaining estimates of travel time at the individual link level requires the total traversal time (which is equal to the polling interval duration) be decomposed. This paper presents an algorithm for solving the problem of decomposing the traversal time to times taken to traverse individual road segments on the route. The proposed algorithm assumes minimal information about the network, namely network topography (i.e. links and nodes) and the free flow speed of each link. Unlike existing deterministic methods, the proposed solution algorithm defines a likelihood function that is maximized to solve for the most likely travel time for each road segment on the traversed route. The proposed scheme is evaluated using simulated data and compared to a benchmark deterministic method. The evaluation results suggest that the proposed method outperforms the bench mark method and on average improves the accuracy of the estimated link travel times by up to 90%.     

A practical model for transfer optimization in a transit network: Model formulations and solutions

This paper studies the transit network scheduling problem and aims to minimize the waiting time at transfer stations. First, the problem is formulated as a mixed integer programming model that gives the departure times of vehicles in lines so that passengers can transfer between lines at transfer stations with minimum waiting times. Then, the model is expanded to a second model by considering the extra stopping time of vehicles at transfer stations as a new variable set. By calculating the optimal values for these variables, transfers can be better performed. The sizes of the models, compared with the existing models, are small enough that the models can be solved for small- and medium-sized networks using regular MIP solvers, such as CPLEX. Moreover, a genetic algorithm approach is represented to more easily solve larger networks. A simple network is used to describe the models, and a medium-sized, real-life network is used to compare the proposed models with another existing model in the literature. The results demonstrate significant improvement. Finally, a large-scale, real-life network is used as a case study to evaluate the proposed models and the genetic algorithm approach.     

Routing aspects of electric vehicle drivers and their effects on network performance

This study investigates the routing aspects of battery electric vehicle (BEV) drivers and their effects on the overall traffic network performance. BEVs have unique characteristics such as range limitation, long battery recharging time, and recuperation of energy lost during the deceleration phase if equipped with regenerative braking system (RBS). In addition, the energy consumption rate per unit distance traveled is lower at moderate speed than at higher speed. This raises two interesting questions: (i) whether these characteristics of BEVs will lead to different route selection compared to conventional internal combustion engine vehicles (ICEVs), and (ii) whether such route selection implications of BEVs will affect the network performance. With the increasing market penetration of BEVs, these questions are becoming more important. This study formulates a multi-class dynamic user equilibrium (MCDUE) model to determine the equilibrium flows for mixed traffic consisting of BEVs and ICEVs. A simulation-based solution procedure is proposed for the MCDUE model. In the MCDUE model, BEVs select routes to minimize the generalized cost which includes route travel time, energy related costs and range anxiety cost, and ICEVs to minimize route travel time. Results from numerical experiments illustrate that BEV drivers select routes with lower speed to conserve and recuperate battery energy while ICEV drivers select shortest travel time routes. They also illustrate that the differences in route choice behavior of BEV and ICEV drivers can synergistically lead to reduction in total travel time and the network performance towards system optimum under certain conditions.     

Dispatching control at transfer stations in multi‐hub transit networks

Among dispatching control approaches, the holding option has attracted the most attention in bus control. However, holding a vehicle at a transfer station may exacerbate the delays because more passengers might accumulate at downstream stations and may also affect other connecting routes at other transfer stations. Our problem is to minimize the total costs of dispatching ready vehicles at each transfer station along coordinated routes in a multi‐hub transit network. The total costs include the waiting cost for on‐board passengers, the missed connection costs for late arrival passengers at the subject transfer station and possible transfer costs at downstream transfer stations. We develop a heuristic algorithm to optimize the holding times based on real time information about late vehicles. The results show that ready vehicles should be held longer when the arrival variances of late vehicles are small or when many late connecting passengers are expected.     

Optimizing route choice for lowest fuel consumption – Potential effects of a new driver support tool

Today, driver support tools intended to increase traffic safety, provide the driver with convenient information and guidance, or save time are becoming more common. However, few systems have the primary aim of reducing the environmental effects of driving. The aim of this project was to estimate the potential for reducing fuel consumption and thus the emission of CO₂ through a navigation system where optimization of route choice is based on the lowest total fuel consumption (instead of the traditional shortest time or distance), further the supplementary effect if such navigation support could take into account real-time information about traffic disturbance events from probe vehicles running in the street network. The analysis was based on a large database of real traffic driving patterns connected to the street network in the city of Lund, Sweden. Based on 15 437 cases, the fuel consumption factor for 22 street classes, at peak and off-peak hours, was estimated for three types of cars using two mechanistic emission models. Each segment in the street network was, on a digitized map, attributed an average fuel consumption for peak and off-peak hours based on its street class and traffic flow conditions. To evaluate the potential of a fuel-saving navigation system the routes of 109 real journeys longer than 5 min were extracted from the database. Using Esri’s external program ArcGIS, Arcview and the external module Network Analysis, the most fuel-economic route was extracted and compared with the original route, as well as routes extracted from criterions concerning shortest time and shortest distance. The potential for further benefit when the system employed real-time data concerning the traffic situation through 120 virtual probe vehicles running in the street network was also examined. It was found that for 46% of trips in Lund the drivers spontaneous choice of route was not the most fuel-efficient. These trips could save, on average, 8.2% fuel by using a fuel-optimized navigation system. This corresponds to a 4% fuel reduction for all journeys in Lund. Concerning the potential for real-time information from probe vehicles, it was found that the frequency of disturbed segments in Lund was very low, and thus so was the potential fuel-saving. However, a methodology is presented that structures the steps required in analyzing such a system. It is concluded that real-time traffic information has the potential for fuel-saving in more congested areas if a sufficiently large proportion of the disturbance events can be identified and reported in real-time.     

Mitigation of disruptions in public transit by Bee Colony Optimization

Dispatchers in many public transit companies face the daily problem of assigning available buses to bus routes under conditions of bus shortages. In addition to this, weather conditions, crew absenteeism, traffic accidents, traffic congestion and other factors lead to disturbances of the planned schedule. We propose the Bee Colony Optimization (BCO) algorithm for mitigation of bus schedule disturbances. The developed model takes care of interests of the transit operator and passengers. The model reassigns available buses to bus routes and, if it is allowed, the model simultaneously changes the transportation network topology (it shortens some of the planned bus routes) and reassigns available buses to a new set of bus routes. The model is tested on the network of Rivera (Uruguay). Results obtained show that the proposed algorithm can significantly mitigate disruptions.     

Platooning on two-lane two-way highways: An empirical investigation

This paper presents an empirical investigation into platooning on two-lane two-way highways. The main objective is to better understand this phenomenon that has important implications on traffic performance and safety. Field data from three study sites in the state of Montana were used in this study. Separate investigations were performed to examine the relationships among platoon-related variables, namely; time headway, travel speed, and platoon size. The study confirmed that interaction between successive vehicles in the traffic stream generally diminishes beyond a time headway threshold value that fell in the range of 5–7 seconds. Also, the study revealed that very short headways (less than one second) are more associated with aggressive driving and higher speeds than with slow-moving platoons due to lack of passing opportunities. Further, the study found that amount of impedance to traffic is proportional to the size of platoon as evidenced by the relative difference between mean speed of various size platoons and the mean speed of unimpeded vehicles. The study provided other valuable insights into the platooning phenomenon on two-lane highways that are essential in developing a better understanding of traffic operation on two-lane highways.     

Stop-and-go traffic analysis: Theoretical properties,environmental impacts and oscillation mitigation

This study aims (i) to analyze theoretical properties of a recently proposed describing-function (DF) based approach (Li and Ouyang, 2011; Li et al., 2012) for traffic oscillation quantification, (ii) to adapt it for estimating fuel consumption and emission from traffic oscillation and (iii) to explore vehicle control strategies of smoothing traffic with advanced technologies. The DF approach was developed to predict traffic oscillation propagation across a platoon of vehicles following each other by a nonlinear car-following law with only the leading vehicle’s input. We first simplify the DF approach and prove a set of properties (e.g., existence and uniqueness of its solution) that assure its prediction is always consistent with observed traffic oscillation patterns. Then we integrate the DF approach with existing estimation models of fuel consumption and emission to analytically predict environmental impacts (i.e., unit-distance fuel consumption and emission) from traffic oscillation. The prediction results by the DF approach are validated with both computer simulation and field measurements. Further, we explore how to utilize advantageous features of emerging sensing, communication and control technologies, such as fast response and information sharing, to smooth traffic oscillation and reduce its environmental impacts. We extend the studied car-following law to incorporate these features and apply the DF approach to demonstrate how these features can help dampen the growth of oscillation and environmental impact measurements. For information sharing, we convert the corresponding extended car-following law into a new fixed point problem and propose a simple bisecting based algorithm to efficiently solve it. Numerical experiments show that these new car-following control strategies can effectively suppress development of oscillation amplitude and consequently mitigate fuel consumption and emission.