Eco-routing Algorithm Using Dynamic Vehicle Model and Line Graph

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing eco-routing methods fail to accurately determine energy-efficient routes for all types of vehicles, particularly electric vehicles, as they do not account for negative energy consumption and vehicle acceleration, leading to imprecise energy consumption calculations and lack of adaptability.

Innovation Solution

A method using a dynamic vehicle model that relates energy consumption to speed and acceleration, combined with a line graph and a shortest path algorithm suited for negative energies, allowing for precise energy consumption calculations and adaptability to any vehicle type, including electric vehicles.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If Dijkstra's shortest path algorithm is used for eco-routing, then the route minimizing energy consumption can be determined, but the method cannot handle negative energy consumption values and is therefore not adaptable to electric vehicles with regenerative braking

Engineering Contradiction:

Improveadaptability to different vehicle typesVSAvoidaccuracy of energy consumption calculation

Core Design Contradiction:

Adaptability or versatilityVSReliability

Solution Approach 1:

The patent changes the algorithmic parameter from Dijkstra's algorithm (which cannot handle negative weights) to Bellman-Ford algorithm (which can handle negative weights). This parameter change enables the system to process negative energy consumption values from regenerative braking while maintaining calculation accuracy, thus resolving the contradiction between adaptability and reliability.

Inventive Principle:

Principle #35Parameter changes

2Measurement precision

If a static energy consumption model is used, then the calculation is simpler, but the precision of energy consumption calculation is lower because vehicle acceleration is not accounted for

Engineering Contradiction:

Improveprecision of energy consumption calculationVSAvoidcomplexity of energy consumption model

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The patent applies a dynamic energy consumption model that incorporates vehicle acceleration and uses a line graph representation where nodes represent vehicle states (position, speed, acceleration) rather than simple geographic locations. This dynamic approach captures the actual energy consumption more precisely by accounting for acceleration events, resolving the contradiction between measurement precision and device complexity.

Inventive Principle:

Principle #15Dynamics

3Measurement precision

If traditional graph representation is used for the road network, then the structure is simpler, but the energy consumption precision is lower because acceleration between road segments is not captured

Engineering Contradiction:

Improveprecision of energy consumption calculationVSAvoidcomplexity of graph structure

Core Design Contradiction:

Measurement precisionVSDevice complexity

Solution Approach 1:

The patent segments the traditional road network graph into a line graph structure where each road segment is divided into multiple nodes representing different vehicle states (positions along the segment, speeds, accelerations). This segmentation allows the system to capture acceleration events between segments and calculate energy consumption more precisely, while the modular nature of the line graph keeps the complexity manageable.

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS11215469B2Method of determining a route minimizing the energy consumption of a vehicle using a line graph

Publication Date: 2022.01.04 IFP ENERGIES NOUVELLES

AI summary

The present invention relates to a method of determining a route (ITI) minimizing the energy consumption of a vehicle, based on the use of a dynamic model (MOD) of the vehicle depending on the vehicle speed and acceleration, the construction of a line graph (GA) and a shortest path algorithm (ALG) suited for negative energies.