Hierarchical Pipe System Disassembly Sequence Planning by Dynamic Self-Adaptive Tree Based Motion Planning

Article Preview

Abstract:

This paper represents a hierarchical pipe system disassembly method by using dynamic self-adaptive tree (DSAT) based motion planning to perform disassembly for a complex pipe system. A pipe system CAD model is prepared initially to indicate the environment of the disassembly procedure. The improved motion planning method provides basic algorithm support for indicating the feasible escape path of a single part. Our technic gradually reduces the complexity of the pipe system to generate a hierarchical structure which takes all geometric information of the system. The hierarchical structure is preserved and used for the generation of a disassembly relationship graph which indicates the feasible disassembly sequences.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

36-42

Citation:

Online since:

February 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] B. O'Shea, S.S. Grewal, H. Kaebernick, State of the Art Literature Survey on Disassembly Planning, Concurrent Engineering December. 6 (1998) 345-357.

DOI: 10.1177/1063293x9800600407

Google Scholar

[2] Lambert, A. J. D., Disassembly Sequencing: A Survey, International Journal Production Research. 41 (2003) 3721–3759.

Google Scholar

[3] Lambert, A. J. D., Linear Programming in Disassembly clustering Sequence Generation, Computers and Industrial Engineering. 36 (1999) 723-738.

DOI: 10.1016/s0360-8352(99)00162-x

Google Scholar

[4] Hui W., Dong X., Guanghong D., A Genetic Algorithm for Product Disassembly Sequence Planning, Neurocomputing. 71 (2008) 2720-2726.

DOI: 10.1016/j.neucom.2007.11.042

Google Scholar

[5] Duflou, J. R., Seliger, G., Kara, S., Umeda, Y., Ometto, A., Willems, B., Efficiency and feasibility of product disassembly: a case based study, CIRP Ann Manuf Technol. 57 (2008) 583-600.

DOI: 10.1016/j.cirp.2008.09.009

Google Scholar

[6] Scholz-Reiter B., Scharke H., Implementation and testing of a reactive disassembly planner, Proceedings of 4th CIRP International Seminar on Life Cycle Engineering. (1997) 379-387.

DOI: 10.1007/978-1-4615-6381-5_32

Google Scholar

[7] Xiao J., Ji, X., A divide-and-merge approach to automatic generation of contact states and planning of contact motion, In Proceedings of the IEEE International Conference on Robotics and Automation. 1 (2000) 750-756.

DOI: 10.1109/robot.2000.844141

Google Scholar

[8] Cortes, J., Jaillet, L., Simeon T., Disassembly Path Planning for Complex Articulated Objects, IEEE Transactions on Robotics and Automation. 24 (2008) 475-481.

DOI: 10.1109/tro.2008.915464

Google Scholar

[9] Aguinaga I., Borro D., Matey L., Parallel RRT-based Path Planning for Selective Disassembly Planning, International Journal of Advanced Manufacture Technology. 36 (2008) 1221-1233.

DOI: 10.1007/s00170-007-0930-2

Google Scholar

[10] S. M. LaValle, J. J. Kuffner., Rapidly-exploring random trees: Progress and prospects, Algorithmic and Computational Robotics: New Directions, 2001, pp.293-308.

DOI: 10.1201/9781439864135-43

Google Scholar

[11] C. Morato, K. Kaipa, S.K. Gupta, Assembly sequence planning by using dynamic multi-random trees based motion planning, ASME Computers and Information in Engineering Conference, Chicago, IL, August (2012).

DOI: 10.1115/detc2012-71243

Google Scholar