An Eco-Routing Algorithm for HEVs Under Traffic Conditions

International audienceIn a previous work, a bi-level optimization approach was presented for the energy management of Hybrid Electric Vehicles (HEVs), using a statistical model for traffic conditions. The present work is an extension of this framework to the eco-routing problem. The optimal trajectory is computed as the shortest path on a weighted graph whose nodes are (position, state of charge) pairs for the vehicle. The edge costs are provided by cost maps from an offline optimization at the lower level of small road segments. The error due to the discretization of the state of charge is proven to be linear if the cost maps are Lipschitz. The classical A * algorithm is used to solve the problem, with a heuristic based on a lower bound of the energy needed to complete the travel. The eco-routing method is compared to the fastest-path strategy by numerical simulations on a simple synthetic road network