Computer Aided Assembly Process Planning

Henrioud, Jean-Michel; Bourjault, A.

doi:10.1243/pime_proc_1992_206_056_02

Cited by 26 publications

(11 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Then, choose the one which has a smaller volume from axis system T j for each j. This step could be expressed as equation (7) in which f min_volume is a function comparing the volume of the cuboid computed with equation (6) data…”

Section: Fast Algorithms For Gb and Rb Solvingmentioning

confidence: 99%

An intelligent method to generate liaison graphs for truss structures

Cao

Wan

et al. 2016

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

Liaison graph is a necessary prerequisite of assembly sequence planning for mechanical products. Traditionally, it is generated via shape matching of joints among parts, but this strategy is invalid to truss structures because they lack patterns for shape matching. In this context, this article presents an intelligent method based on support vector machine to obtain liaison graphs of truss products automatically. This method defined three kinds of oriented bounding boxes to embody the relationships of the joints in truss structures. Based on them, a series of factors are deduced as training data for support vector machine. Furthermore, two algorithms are introduced to calculate oriented bounding boxes to facilitate the data extraction. By these processes, this method established the knowledge of joints and realized the intelligent construction of liaison graph without shape matching reasoning. To verify the effect of the method, an experimental implementation is presented. The results suggest that the proposed method could recognize most joint types and construct liaison graph automatically with sufficient sample training. The correct recognition rate is more than 85%. Comparing with back-propagation neural network, support vector machine is more accurate and stable in this case. As an alternative method, it could help the engineers to arrange the assembly plan for truss structures and other similar assemblies.

show abstract

Section: Fast Algorithms For Gb and Rb Solvingmentioning

confidence: 99%

An intelligent method to generate liaison graphs for truss structures

Cao

Wan

et al. 2016

Proceedings of the Institution of Mechanical Engineers, Part B:

View full text Add to dashboard Cite

show abstract

“…In this respect, several approaches had been proposed. Henrioud and Bourjault used a so-called liaison diagram representation to denote the components of a system and the liaisons among them [3]. Here, liaisons refer to the physical relations that can be used to represent disassembly tasks.…”

Section: Introductionmentioning

confidence: 99%

An object-oriented intelligent disassembly sequence planner for maintenance

Li¹,

Khoo

Tor

2005

Computers in Industry

View full text Add to dashboard Cite

“…More information on the modeling and reasoning issues in assembly planning can be found in literature. [1][2][3][4][5][6][7][8][9][10][11] An insight gained from our research is that planning in the assembly domain is best served by considering many of the constraints at the local level before the global level. That is, combinations of locally feasible solutions are combined to give globally feasible solutions.…”

Section: Introductionmentioning

confidence: 99%

Design of an experience-based assembly sequence planner for mechanical assemblies

1998

View full text Add to dashboard Cite

This paper presents a design of an assembly sequence planner based on a “plan reuse” philosophy. Most of assembly planning research in the past has attempted to completely plan each problem from scratch. This research shows that stored cases of basic assembly configurations can be applied to a given assembly problem. It is observed that the number of such basic assembly configurations is quite small. The planner divides the assembly into a number of constituent configurations, which are called “loops”. These act as subgoals in its search for solutions. Plans retrieved for all subgoals are fused into a set of plans that are consistent with the constraints implied by each plan. Application specific constraints on the assembly are explicitly handled in the second phase of planning. Mechanisms for assembly representation and implementation details of the planner are also presented.

show abstract

Computer Aided Assembly Process Planning

Cited by 26 publications

References 7 publications

An intelligent method to generate liaison graphs for truss structures

An intelligent method to generate liaison graphs for truss structures

An object-oriented intelligent disassembly sequence planner for maintenance

Design of an experience-based assembly sequence planner for mechanical assemblies

Contact Info

Product

Resources

About