Assembly Graph Tuple Repair via Identifier Chain Mapping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

The existing design systems for assemblies, such as PLM/CAD systems, face challenges in efficiently managing and persistently storing relations between objects in reuse graphs, leading to broken tuples when the graph is edited, which requires manual reconnection by designers, making the design process tedious and prone to errors.

Innovation Solution

A computer-implemented method that determines mappings between identifier chains in a directed acyclic modeling graph, allowing for automatic substitution and repair of broken tuples during editing, thereby facilitating the design process by maintaining consistent relations and reducing manual intervention.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If the reuse graph is edited to improve design flexibility, then design adaptability is improved, but tuples become broken requiring manual reconnection

Engineering Contradiction:
Improvedesign flexibilityVSAvoidtuple consistency
Core Design Contradiction:
Adaptability or versatilityVSReliability

Solution Approach 1:

The system performs preliminary actions by maintaining a mapping between old and new identifier chains before and during the editing process. When an arc is modified, the system proactively updates all affected tuples using the stored mapping, preventing broken references rather than detecting and fixing them afterward.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The system implements feedback mechanisms by continuously tracking changes to the reuse graph and automatically propagating these changes to all related tuples. The mapping system provides real-time feedback about which tuples are affected by graph edits, enabling automatic correction without manual intervention.

Inventive Principle:
Principle #23Feedback

2Reliability

If manual reconnection of broken tuples is performed to maintain tuple consistency, then reliability is improved, but design time and productivity deteriorate

Engineering Contradiction:
Improvetuple consistencyVSAvoiddesign time
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The system enables self-service by automatically maintaining tuple consistency through the mapping mechanism. When graph edits occur, the system autonomously updates all affected tuples using the stored mapping between identifier chains, eliminating the need for designer intervention and freeing them to focus on creative design work.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The mapping between old and new identifier chains acts as an intermediary that mediates between graph edits and tuple updates. This intermediary layer translates structural changes in the reuse graph into corresponding updates in the tuple data, automating the consistency maintenance process.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Productivity

If the mapping between identifier chains is maintained to automate tuple repair, then productivity is improved, but system complexity increases

Engineering Contradiction:
Improvedesign efficiencyVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The system uses copying by creating and maintaining a mapping (a data structure storing relationships) between old and new identifier chains. This copied relational information enables automatic tuple updates without fundamentally changing the core system architecture, adding functionality through data rather than complex structural modifications.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS8798975B2Computer method and system providing design of an assembly modeled by a graph
Publication Date: 2014.08.05 DASSAULT SYSTEMES SA
  • US8798975B2 patent drawing
  • US8798975B2 patent drawing
  • US8798975B2 patent drawing

AI summary

The invention provides a computer-implemented method and system intended for designing an assembly of a plurality of objects. The assembly is modeled by a directed acyclic modeling graph having nodes and arcs. Each node represents an object of the assembly. Each arc represents the use of an end node by an origin node. At least one arc is uniquely identified by an identifier. The assembly is further modeled by at least one relation having at least one tuple containing a first chain of at least one identifier. The method comprises determining at least one mapping between the first chain and a second chain of at least one identifier as well as substituting at least one occurrence of the first chain in the tuple of the relation with the second chain. The invention provides a means to repair broken tuples automatically and thus to facilitate design.