Affiliation:
1. Harbin Engineering University
Abstract
Disassembly Sequence planning is the important module of virtual maintenance. Its foundational task is to test the disassemblability of parts, find out all the feasible disassembly sequences of targeted parts and search for the near-optimal disassembly sequence. In the paper, the spherical algorithm is used to test the disassemblability of parts. And then the disassembly direction of parts is determined by rules which are the simplified version of Gaussian map approach. Thus the near-optimal disassembly sequence is found out by optimizing all feasible disassembly sequences of targeted parts by ant colony algorithm. The simulation result of the sequence optimization proves to be the same with manual calculation considering comprehensive cost of the change of disassembly tools and disassembly directions. The set of approaches can be reference for disassembly sequence planning of large-scale mechanical products.
Publisher
Trans Tech Publications, Ltd.
Subject
Mechanical Engineering,Mechanics of Materials,General Materials Science
Reference5 articles.
1. Adam S. Coutee. Ph.D. thesis, Georgia Institute of Technology (2004), p.23.
2. Ding Yufeng, Xiao Hao, Sheng Buyun, in: World Congress on Computer Science and Information Engineering. edited by M. Burgin. Publications/IEEE Computer Society, Los Angles (2009).
3. R. H. Wilson: International Journal of Robotics Research. Vol. 14 (1994), p.335.
4. Hao Jianping: Virtual Maintenance Simulation and Technology (National Defense Industrial Press, 2008), p.322.
5. Huang Jing, Wang Junfeng: Journal of Wuhan University of Technology. Vol. 27 (2003), p.306.