Volume 26, Issue 6 pp. 1307-1324
Recent Trends in Traffic Modelling and Control

Eco-driving in urban traffic networks using traffic signals information

Giovanni De Nunzio

Corresponding Author

Giovanni De Nunzio

Department of Control Signal and Systems, IFP Energies Nouvelles, 1&4 avenue de Bois-Préau, Rueil-Malmaison, 92852 France

Correspondence to: Giovanni De Nunzio, IFPen, 1&4, avenue de Bois-Préau, 92852, Rueil-Malmaison, France.

E-mail: [email protected]

Search for more papers by this author
Carlos Canudas de Wit

Carlos Canudas de Wit

NeCS team, Inria Grenoble Rhône-Alpes, 655 Avenue de l'Europe, Montbonnot Saint-Martin, 38334 France

Search for more papers by this author
Philippe Moulin

Philippe Moulin

Department of Control Signal and Systems, IFP Energies Nouvelles, 1&4 avenue de Bois-Préau, Rueil-Malmaison, 92852 France

Search for more papers by this author
Domenico Di Domenico

Domenico Di Domenico

Department of Control Signal and Systems, IFP Energies Nouvelles, 1&4 avenue de Bois-Préau, Rueil-Malmaison, 92852 France

Search for more papers by this author
First published: 28 October 2015
Citations: 115

Summary

The problem of eco-driving is analyzed for an urban traffic network in presence of signalized intersections. It is assumed that the traffic light timings are known and available to the vehicles via infrastructure-to-vehicle communication. This work provides a solution to the energy consumption minimization while traveling through a sequence of signalized intersections and always catching a green light. The optimal- control problem is non-convex because of the constraints coming from the traffic lights; therefore, a sub-optimal strategy to restore the convexity and solve the problem is proposed. Firstly, a pruning algorithm aims at reducing the optimization domain by considering only the portions of the traffic light's green phases that allow to drive in compliance with the city speed limits. Then, a graph is created in the feasible region in order to approximate the energy consumption associated with each available path in the driving horizon. Lastly, after the problem convexity is recovered, a simple optimization problem is solved on the selected path to calculate the optimal crossing times at each intersection. The optimal speeds are then suggested to the driver. The proposed sub-optimal strategy is compared with the optimal solution provided by dynamic programming for validation purposes. It is also shown that the low computational load of the presented approach enables robustness properties and results very appealing for online use. Copyright © 2015 John Wiley & Sons, Ltd.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.