Search Results

One of the ways to reduce city congestion is to balance the traffic flow on the road network and maximally utilize all road capacities. There are examples showing that, if the drivers are not competitive but cooperative, the road network usage efficiency and the traffic conditions can be improved. This motivates the idea of designing a cooperative routing algorithm to benefit most vehicles on the road. This paper presents a semi-cooperative social routing algorithm for large transportation network with predictive traffic density information. The goal is to integrate a cooperative scheme into the individual routing and achieve short traveling time not only for the traveler itself, but also for all vehicles in the road network. The most important concept of this algorithm is that the route is generated with the awareness of the total travel time added to all other vehicles on the road due to the increased congestion.

Increasing number of vehicles are equipped with telematics devices and are able to transmit vehicle CAN bus information remotely. This paper examines the possibility of identifying individual drivers from their driving signatures embedded in these telematics data. The vehicle telematics data used in this study were collected from a small fleet of 30 Ford Fiesta vehicles driven by 30 volunteer drivers over 15 days of real-world driving in London, UK. The collected CAN signals included vehicle speed, accelerator pedal position, brake pedal pressure, steering wheel angle, gear position, and engine RPM. These signals were collected at approximately 5Hz frequency and transmitted to the cloud for offline driver identification modeling. A list of driving metrics was developed to quantify driver behaviors, such as mean brake pedal pressure and longitudinal jerk. Random Forest (RF) was used to predict driver IDs based on the developed driving metrics.