scholarly journals Assembly Problem Identified

2020 ◽  
Author(s):  
Keyword(s):  
Assembly Problem

Fixed-parameter tractability for the tree assembly problem

2021 ◽  
Author(s):  
Feng Shi ◽  
Jie You ◽  
Zhen Zhang ◽  
Jingyi Liu ◽  
Jianxin Wang
Keyword(s):  
Fixed Parameter Tractability ◽  
Fixed Parameter ◽  
Assembly Problem

Push-Pull Pair of Single Action Mechanisms to Preload Strut and Node Joints in the Robotic Assembly of Structures in Space

1992 ◽  
Author(s):  
W. V. Brewer
Keyword(s):  
Separation Distance ◽  
Variable Length ◽  
Superior Performance ◽  
Robotic Assembly ◽  
Design Specification ◽  
Single Action ◽  
Action Mechanisms ◽  
Reference Length ◽  
Crucial Problem ◽  
Assembly Problem

Abstract When strut and node components are used for truss construction or repair, an assembly problem occurs if a strut must fit between nodes whose separation distance is either more or less than the design specification. In such circumstances two actions would permit continued assembly: 1. Change strut length 2. Move the nodes. Variable length struts fit between nodes and (or) move them. They are preloaded at the joint against a reference length in an attempt to maintain the desired dimension. As a by-product they either pull the nodes together or push them apart. Most cannot do both, and are therefore characterized as “single action”; those that can do both are “double action”. Double action mechanisms are currently being used for robotic truss assembly because they solve the above stated crucial problem in both directions. Single action mechanisms tend to exhibit superior performance in all other categories. They benefit from the attributes that accompany their simplicity. The titled concept combines the major advantage of double action with the simplicity of single action. This is demonstrated with an example.

Assembly Planning: A Genetic Approach

1998 ◽  
Author(s):  
Shiang-Fong Chen
Keyword(s):  
Genetic Algorithms ◽  
Fitness Function ◽  
Assembly Planning ◽  
Genetic Approach ◽  
Genetic Operators ◽  
Complex Problems ◽  
All Solutions ◽  
Assembly Problem ◽  
Optimal Assembly

Abstract The difficulty of an assembly problem is the inherent complexity of possible solutions. If the most suitable plan is selected after all solutions are found, it will be very time consuming and unrealistic. Motivated by the success of genetic algorithms (GAs) in solving combinatorial and complex problems by examining a small number of possible candidate solutions, GAs are employed to find a near-optimal assembly plan for a general environment. Five genetic operators are used: tree crossover, tree mutation, cut-and-paste, break-and-joint, and reproduction. The fitness function can adapt to different criteria easily. This assembly planner can help an inexperienced technician to find a good solution efficiently. The algorithm has been fully implemented. One example product is given to show the applications and results.

scholarly journals Modified Classical Graph Algorithms for the DNA Fragment Assembly Problem

Algorithms ◽  
2015 ◽  
Vol 8 (3) ◽  
pp. 754-773 ◽  
Author(s):  
Guillermo Mallén-Fullerton ◽  
J. Quiroz-Ibarra ◽  
Antonio Miranda ◽  
Guillermo Fernández-Anaya
Keyword(s):  
Graph Algorithms ◽  
Fragment Assembly ◽  
Dna Fragment ◽  
Assembly Problem ◽  
Dna Fragment Assembly

The land assembly problem revisited

2004 ◽  
Vol 34 (2) ◽  
pp. 155-162 ◽  
Author(s):  
Flavio Menezes ◽  
Rohan Pitchford
Keyword(s):  
Assembly Problem ◽  
Land Assembly
Sign in / Sign up

Export Citation Format

Share Document