Graph Path Finding via Node Evaluation Values
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing path finding techniques in graph networks are inefficient due to varying node connections, making parallel processing suboptimal, especially as the number of nodes increases and path weights change over time.
Innovation Solution
An information processing apparatus and method that assigns evaluation values to nodes based on a reference node, updates these values, and determines path establishment criteria, allowing for repeated evaluation and efficient parallel processing by managing threads and updating root and cost values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If path finding is performed by sequentially tracing connected nodes from the source node, then the path finding algorithm is simple to implement, but the processing time increases significantly as the number of nodes increases
Solution Approach 1:
The path finding problem is segmented by introducing evaluation values that divide the graph into regions based on distance from the target node. This segmentation allows parallel processing of multiple nodes simultaneously, reducing the sequential tracing time while maintaining algorithmic simplicity through the use of evaluation criteria.
Solution Approach 2:
Evaluation values are calculated in advance for all nodes based on their distance to the target node. This preliminary action enables the algorithm to quickly determine path directions without sequential exploration, significantly reducing path finding time while keeping the overall algorithm structure simple.
2Productivity
If parallel processing is used to reduce path finding time, then processing speed improves, but efficiency decreases when nodes have varying numbers of connections
Solution Approach 1:
The patent applies local quality by assigning different evaluation values to nodes based on their specific characteristics (number of connections, distance to target). This allows the parallel processing system to efficiently handle nodes with varying connection degrees, as each node is processed according to its own evaluation criteria rather than a uniform approach, improving overall parallel processing efficiency.
Solution Approach 2:
The patent changes the parameter of node evaluation from uniform treatment to differentiated treatment based on connection degree and distance metrics. This parameter change enables parallel processing to adapt to varying node characteristics, maintaining high efficiency across nodes with different numbers of connections while preserving fast processing speeds.
3Adaptability or versatility
If the path graph structure changes over time, then the system adapts to dynamic environments, but the path finding burden increases due to frequent re-calculation
Solution Approach 1:
The patent calculates evaluation values in advance for all nodes and stores them, enabling quick path determination when the graph structure changes. This preliminary calculation reduces the re-calculation burden during dynamic updates, as only affected nodes need re-evaluation rather than the entire graph, thus maintaining adaptability while reducing re-calculation time.
Solution Approach 2:
The patent implements a feedback mechanism where evaluation values are updated based on changes in the path graph structure. When edges or nodes are added or removed, the system uses the existing evaluation framework to efficiently update only the affected nodes, adapting to dynamic environments while minimizing re-calculation time through intelligent feedback-driven updates.
Data Source
AI summary
An information processing apparatus includes: a path information acquiring part acquiring path information formed by information indicating connection relationship set between multiple nodes and indicating cost of the connection relationship; an evaluation value giving part giving to the respective nodes included in the path information an evaluation value indicating cost between the node and a reference node; a determining part determining whether to establish as a path the interval between any two of the nodes, on the basis of the connection relationship and a magnitude relation between the evaluation values given to the nodes; and an evaluation value updating part updating the evaluation value of the respective nodes, on the basis of value indicating cost between the respective nodes and a node connected by the established path. Following the determination made by the determining part, the evaluation value updating part executes an evaluation value updating process repeatedly.