Parallel Disassembly by Onion Peeling-Reference-Cited by-同舟云学术

Parallel Disassembly by Onion Peeling

Published:1997-06-01 Issue:2 Volume:119 Page:267-274
ISSN:1050-0472
Container-title:Journal of Mechanical Design
language:en
Short-container-title:

Author:

Chen Shiang-Fong¹,Oliver J. H.¹,Chou Shuo-Yan²,Chen Lin-Lin³

Affiliation:

1. Department of Mechanical Engineering, Iowa Center for Emerging Manufacturing Technology, Iowa State University, Ames, IA

2. Department of Industrial Management, Graduate School of Engineering Technology, National Taiwan Institute of Technology, Taipei, Taiwan

3. Graduate School of Engineering Technology, National Taiwan Institute of Technology, Taipei, Taiwan

Abstract

For some assembly structures, parallel disassembly of components is necessary in order to reach a particular internal component. Due to the large number of possible combinations, the parallel disassembly problem is not easily solved in a general form. In order to reduce the time complexity of finding a disassembly sequence, this paper introduces a simplified mating graph and develops a data structure to facilitate an efficient parallel disassembly algorithm. This algorithm takes Max {O(N3), O(E)} time to find an efficient sequence to reach a particular component, where N is the number of components and E is the number of mating faces. Separability testing is incorporated to determine whether the query component can be disassembled and moved to infinity without obstruction.

Publisher

ASME International

Subject

Computer Graphics and Computer-Aided Design,Computer Science Applications,Mechanical Engineering,Mechanics of Materials

Link

http://asmedigitalcollection.asme.org/mechanicaldesign/article-pdf/119/2/267/5920387/267_1.pdf

Reference10 articles.

1. Baumgart, B. G., 1972, “Winged Edge Polyhedron Representation,” Stanford University Department of Computer Science, Stanford Technical Report No. CS-72-320.

2. De Floriani, L., and Nagy, G., 1989, “A Graph Model for Face-to-Face Assembly,” Proc. of IEEE Conference on Robotics and Automation, Vol. 1, pp. 75–78.

3. Dehne P. , and SackJ. R., 1987, “Translation Separability of Sets of Polygons,” The Visual Computer, Vol. 3, pp. 227–235.

4. Dutta, D., and Woo, Anthony C., 1992, “Algorithms for Multiple Disassembly and Parallel Assemblies,” ASME Concurrent Engineering, PED-Vol. 59, pp. 257–266.

5. Homen de Mello L. S. , and SandersonA. C., 1990, “And/Or Graph Representation of Assembly Plans,” IEEE Transactions on Robotics and Automation, Vol. 6, No. 2, pp. 188–199.

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Efficient Disassembly Sequencing Scheme Using the Shell Structure;Computer-Aided Design;2023-01

2. Parallel disassembly sequence planning using improved ant colony algorithm;The International Journal of Advanced Manufacturing Technology;2021-02-21

3. Product cooperative disassembly sequence and task planning based on genetic algorithm;The International Journal of Advanced Manufacturing Technology;2019-10-10

4. An asynchronous parallel disassembly planning based on genetic algorithm;European Journal of Operational Research;2018-09

5. Assembly precedence diagram generation through assembly tiers determination;International Journal of Computer Integrated Manufacturing;2016-02-19