Deadlock Detection in Vehicle Network Graphs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for determining deadlock-critical relations in vehicle systems are inefficient, leading to unacceptably long run times and the potential for critical cycles to be overlooked, as they require checking all paths in a graph, which is impractical due to the large number of connections.
Innovation Solution
The method involves classifying edges and nodes based on criticality stages, prioritizing edges, and using a finite state machine to reduce the search to shortest cycles, ensuring that the most critical cycles are discovered efficiently by traversing prioritized paths.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all paths in the graph are checked to discover deadlock-critical cycles, then completeness of cycle detection is improved, but run time becomes unacceptably long
Solution Approach 1:
The patent segments the graph search process by dividing edges into different levels based on their criticality. Level 0 edges are those that are part of deadlock-critical cycles, while level 1 edges are non-critical. This segmentation allows the algorithm to prioritize searching through level 0 edges first, finding critical cycles without needing to exhaustively search all possible paths, thus reducing run time while maintaining detection completeness for critical cases.
Solution Approach 2:
The patent changes the parameter representation by assigning level values (0 or 1) to edges based on their classification. This parameter change enables the use of level-based search strategies where the algorithm can focus computational resources on edges with level 0, effectively changing the search space parameters to prioritize critical path detection over exhaustive enumeration.
2Loss of time
If only the shortest paths in the graph are checked, then run time is reduced, but critical longer cycles may be overlooked
Solution Approach 1:
The patent changes the search parameter from path length to edge level. Instead of prioritizing shortest paths based on number of edges, the algorithm prioritizes paths based on the levels of their constituent edges. This allows longer paths composed primarily of level 0 edges to be detected before shorter paths containing level 1 edges, ensuring critical cycles are found regardless of their length.
Solution Approach 2:
The patent applies local quality by treating different edges differently based on their level classification. Level 0 edges receive prioritized processing in the search algorithm, while level 1 edges are processed with lower priority or excluded from intensive searching. This local differentiation ensures that the search focus remains on critical paths even when those paths are longer than non-critical alternatives.
Data Source
AI summary
In a method for determining deadlock-critical relations between networked components of a vehicle system, a graph, which at least partially represents the inhibit relations defined in the vehicle system and which has nodes and edges, is used, in which a classification takes place of at least a portion of the edges on the basis of the properties of the edges and the nodes connected by the edges, a prioritization of the edges on the basis of the classification takes place, and a determination of shortest deadlock-critical cycles for all nodes and at least some of the edges on the basis of the prioritization is implemented.