Route Search Method for Electric Vehicles Using Duplicate Network Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing route search methods for electric and hybrid electric vehicles do not adequately consider both electrical power consumption and regeneration, leading to potential routes that cannot reach the destination due to excessive power consumption.
Innovation Solution
A route search method that generates duplicate road networks with additional links to account for power consumption and regeneration, using Dijkstra's algorithm to find optimal routes while considering energy costs and regeneration, and adjusting link costs to ensure feasible routes are found.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If route searching is performed using only link costs based on regenerated power, then power regeneration is considered, but electrical power consumption is not adequately considered, leading to routes where consumption exceeds regeneration
Solution Approach 1:
The patent segments the road network into multiple duplicate graphs (first graph, second graph, third graph, etc.) where each graph represents a different power state scenario. This segmentation allows the route search to consider both power consumption and regeneration by evaluating multiple possible power states simultaneously, preventing selection of routes where consumption exceeds regeneration.
Solution Approach 2:
The patent adds a new dimension to the traditional single-graph road network by creating multiple duplicate graphs with different link cost configurations. This dimensional expansion from one graph to multiple graphs enables the system to evaluate routes based on both power consumption and regeneration capabilities, ensuring feasible routes are selected.
2Reliability
If multiple duplicate road networks are generated to consider both consumption and regeneration, then route feasibility is improved, but computational complexity increases
Solution Approach 1:
The patent divides the complex task of evaluating all possible power states into separate duplicate graphs. Each graph handles a specific power state scenario, allowing the system to manage complexity through segmentation rather than trying to process all possibilities simultaneously in a single graph.
Solution Approach 2:
The patent generates multiple duplicate graphs (more than strictly necessary) to ensure comprehensive coverage of power state scenarios. This excessive action ensures that even in edge cases where power consumption nearly equals regeneration, feasible routes are still identified, with the trade-off being manageable computational complexity.
Data Source
AI summary
A route search method includes: a step in which the computer generates a first network by, for each of nodes and each of links, generating a plurality of duplicates thereof; a step in which the computer generates a second network by adding first additional links to the first network; and a step in which the computer searches for a route from a duplicate of a node corresponding to the departure point to a duplicate of a node corresponding to the destination point, using the second network. The first additional links are links for which predetermined non negative link costs are set, and in each of which a node of an end point of a duplicate of each of the links is changed to a node of an end point of another duplicate of the each of the links.