Ancestry Tree for Real-Time Sub-Assembly Identification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current manufacturing systems perform post-production analysis to identify higher-level sub-assemblies containing specific parts, which is inefficient and requires more effort to replace defective parts since the analysis is done after parts have been incorporated into finished products, rather than in real-time.
Innovation Solution
A computer-implemented method for managing an ancestry tree, where each node represents a part, and an ancestor pointer is used to identify the highest-level sub-assembly containing a specific part, allowing for real-time tracking and replacement of defective parts by updating the ancestry tree dynamically.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If post-production analysis is used to identify higher-level sub-assemblies containing specific parts, then the analysis can be performed after parts are assembled into finished products, but the time and effort required to replace defective parts increases significantly
Solution Approach 1:
The patent applies preliminary action by creating and maintaining an ancestry tree data structure during the assembly process itself, rather than performing analysis after production. Each part is assigned an ancestor pointer that pre-identifies all higher-level sub-assemblies containing that part, enabling immediate identification of defective parts without time-consuming post-production analysis
Solution Approach 2:
The patent replaces the mechanical/recursive analysis system with a data structure-based system. Instead of recursively traversing sub-assemblies to find containing structures, the system uses pre-computed ancestor pointers stored in memory, transforming a complex computational problem into a simple data lookup operation
2Ease of operation
If post-production analysis is performed to locate defective parts in nested sub-assemblies, then the analysis can be done after assembly, but the complexity of recursively analyzing sub-assemblies increases
Solution Approach 1:
The patent applies segmentation by breaking down the complex problem of sub-assembly tracking into individual part-level data structures. Each part has its own node in the ancestry tree with pre-computed ancestor pointers, dividing the global tracking problem into independent, manageable units that can be processed and stored separately
Solution Approach 2:
The patent uses copying by creating a data structure representation (ancestry tree) that mirrors the physical assembly hierarchy. Instead of analyzing the actual physical nested sub-assemblies, the system works with copied information in the form of ancestor pointers that represent the hierarchical relationships, simplifying the analysis operation
Data Source
AI summary
A computer implemented method, apparatus, and computer program product for managing an ancestry tree. An order to build a product is received. The ancestry tree is created. The ancestry tree comprises a set of nodes, where each node represents a part of the product. A request to determine a higher level sub-assembly containing a specific part is received. The node of the specific part is located in the ancestry tree. An ancestor pointer in the node of the specific part is returned. The ancestor pointer indicates a higher level sub-assembly containing the part.